Which of the following is not an operation on a list?

Which technique does Kadane's algorithm use?

Which one of the following algorithms is not a greedy algorithm?

In a depth-first traversal of a graph G with n vertices, k edges are marked as tree edges. The number of connected components in G is

What is the runtime of Dijkstra's algorithm when the implementation is based on a binary heap? (E = edges; V = vertices)

What is the average number of key comparisons required for a successful search using sequential search on a list of n items?

The number of comparisons required for an unsuccessful search of an element in a sequential search of a fixed-length, sorted symbol table of length L is:

Which of the following algorithms is not a divide and conquer algorithm?

Which of the following statements about Prim's algorithm is true?

Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. For x ∈ V, let d(x) denote the shortest distance in G from s to x. A breadth-first search (BFS) is performed starting at s. Let T be the resultant BFS tree. If (u, v) is an edge of G that is not in T, then which one of the following CANNOT be the value of d(u) - d(v)?