Miscellaneous on Data Structures MCQ question and answer with solution

A. Merge sort

B. Quicksort

C. Selection sort

D. Counting sort

A. merge sort

B. shell sort

C. selection sort

D. quick sort

A. Depth-first search

B. Breadth-first search

C. Twice around the tree

D. Nearest neighbour first

A. O(N)

B. O(N log N)

C. O(N²)

D. O(log N)

A. greedy algorithm

B. exhaustive search

C. divide and conquer algorithm

D. brute force algorithm

A. O(n)

B. O(q)

C. O(n*q)

D. O(n+q)

A. Divide and conquer

B. Dynamic programming

C. Greedy algorithm

D. Backtracking

A. Traveling salesperson problem

B. Assignment problem

C. Activity selection problem

D. Knapsack problem

A. O(N)

B. O(N log M)

C. O(N log N)

D. O(log N +1)

A. NP

B. P

C. Hard

D. Complete