Data Structures and Algorithms Quiz

What is the time complexity of finding the median in two sorted arrays of sizes m and n using the optimal binary search approach?

• O(m+n)

• O(log(min(m,n)))

• O(log(max(m,n)))

• O(1)

Which data structure is best suited for implementing Dijkstra's Algorithm efficiently?

• Stack

• Queue

• Priority Queue (Min-Heap)

• Linked List

What is the worst-case time complexity of QuickSort?

• O(n log n)

• O(n²)

• O(log n)

• O(n)

In the Knuth-Morris-Pratt (KMP) string matching algorithm, the LPS array stores:

• Longest prefix which is also suffix

• Longest palindrome substring

• Number of mismatches

• Hash value of substring

Which of the following problems cannot be solved using Dynamic Programming?

• Longest Common Subsequence

• N-Queens Problem

• Matrix Chain Multiplication

• Coin Change Problem

What is the space complexity of DFS in a graph using adjacency list (excluding recursion stack)?

• O(V)

• O(V+E)

• O(E)

• O(V*E)

Which traversal method can be used to check if a binary tree is a BST?

• Preorder

• Inorder

• Postorder

• Level Order

What is the time complexity of building a heap from an array of n elements?

• O(n log n)

• O(log n)

• O(n)

• O(n²)

Which algorithm is used to detect a cycle in a directed graph?

• BFS

• DFS with recursion stack

• Dijkstra's Algorithm

• Kruskal's Algorithm

Which of the following is an NP-Complete problem?

• Longest Common Subsequence

• Subset Sum

• BFS

• Merge Sort