Chapter 6 · MCQ Read Mode

Analysis and Design of Algorithm, and Programming (System and Network)

Which property requires that an algorithm must terminate after a finite number of steps?

The RAM model of computation assumes each elementary operation takes:

Which case describes the maximum running time of an algorithm over all inputs of size n?

Which asymptotic notation represents an upper bound on an algorithm's growth rate?

Big-Theta notation is used when an algorithm's running time is:

A recurrence relation such as T(n) = 2T(n/2) + n typically describes the running time of which kind of algorithm?

Which method for solving recurrences involves guessing a solution and proving it by induction?

The Master Theorem applies to recurrences of the form:

In the recursion tree method, the total running time is obtained by:

Which of these best describes 'space complexity'?

Which of the following is NOT one of the three steps of divide and conquer?

Binary Search requires the input array to be:

The time complexity of Binary Search is:

Merge Sort's worst-case time complexity is:

Quick Sort's worst-case time complexity of O(n²) typically occurs when:

Randomized Quick Sort improves reliability mainly by:

In a Max-Heap, the relationship between a parent node and its children is:

Heap Sort's overall time complexity is:

Which algorithm guarantees finding the i-th order statistic in worst-case linear time?

What is the median of a set of numbers?

Dynamic Programming is applicable to a problem mainly when it exhibits:

Unlike Dynamic Programming, a Greedy algorithm:

The main advantage of Dynamic Programming over plain recursion is that DP:

The Matrix Chain Multiplication problem aims to:

The Edit Distance (String Editing) problem computes the minimum number of which operations to convert one string into another?

The time complexity of the 0/1 Knapsack DP solution, for n items and capacity W, is:

The Floyd-Warshall algorithm is used to find:

The time complexity of the Floyd-Warshall algorithm is:

Solving the Travelling Salesman Problem with DP (Held-Karp/bitmasking) has time complexity:

Memoization is best described as:

Which basic loader function adjusts address-dependent parts of a program so it can run at a different memory location than originally assumed?

An Absolute Loader loads a program:

A Bootstrap Loader is typically used to:

The External Symbol Table (ESTAB) used by a linking loader records:

Automatic Library Search is a feature that allows the loader to:

A Linkage Editor differs from a dynamic linker mainly because it:

Dynamic linking postpones linking of external references until:

A key advantage of dynamic linking over static linking (via a linkage editor) is that it:

Which linker combines .OBJ files into a .EXE file in the MS-DOS environment?

SunOS's dynamic linking mechanism relies on which file type?

A macro is best described as:

Which macro-processor table stores the actual text/body of each macro's definition?

The Argument List Array (ALA) is used to:

Generation of unique labels in macro expansion is needed mainly to:

Keyword macro parameters differ from positional parameters because they:

Conditional macro expansion allows a macro to:

A macro processor that can expand a macro which itself invokes another macro (or itself) supports:

A general-purpose macro processor is characterized by being:

Which software provides the macro processing used in ANSI C, via directives like #define?

MASM refers to:

Which protocol is connection-oriented and guarantees reliable, ordered delivery?

Which protocol offers low overhead but no guarantee of delivery or ordering?

SCTP is notable for supporting:

The TCP connection setup process is commonly known as the:

Which socket function marks a socket as ready to accept incoming connections?

Which function converts a 16-bit value from host byte order to network byte order?

A concurrent server typically handles multiple clients by:

Which I/O model uses select()/poll() to monitor multiple sockets from a single thread?

In which I/O model does the kernel perform the entire operation, including copying data, before notifying the process?

Winsock, the Windows Sockets API, is implemented as a:

The activation function used in a Hopfield Network is:

Machine learning using labelled training data (input-output pairs) is called:

In an AI agent, which component carries out actions on the environment?

Which UML diagram describes the vocabulary (classes and relationships) of a system?

To translate a circle to a new position in 2D graphics, what must be translated?

In 2D scaling, if both scale factors sx < 1 and sy < 1, the object:

How many distinct reflection planes exist in 3D space?

The complexity of an Artificial Neural Network primarily depends on:

A crossword-puzzle solving environment is best described as:

In an expert system, the component that stores all facts, rules, and domain knowledge is the:

MYCIN, the medical expert system, used how many rules and which reasoning strategy?

Which concept is central to Fuzzy Logic?

The A* search algorithm is NOT admissible when:

Greedy Best-First Search selects the next node to expand based on:

The key components of a search problem in AI are:

The transformation matrix [[1,0,0],[0,5,0],[0,0,2]] represents:

DDA stands for:

The OOAD methodology that features macro and micro development processes is:

The NLP processing pipeline in correct order is:

The Turing Test extension that requires a robot to interact physically with the world is: