📝 DSA Practice Quiz

Q1: What is the time complexity of accessing an element in an array by index?

O(1) O(n) O(log n) O(n²)

Q2: Stack follows which principle?

FIFO LIFO Random access Priority-based

Q3: What data structure does BFS use?

Stack Queue Priority Queue Array

Q4: Binary Search Tree inorder traversal produces elements in:

Sorted order Reverse sorted order Random order Pre-order

Q5: What is the average search time in a hash table?

O(1) O(log n) O(n) O(n log n)

Q6: Which is NOT a self-balancing BST?

AVL Tree Red-Black Tree Simple BST Both AVL and Red-Black

Q7: Dijkstra's algorithm works with:

Non-negative weights only Negative weights Any weights Unweighted graphs only

Q8: DP requires which two properties?

Optimal Substructure + Overlapping Subproblems Greedy Choice + Divide & Conquer BFS + DFS Sorting + Searching

Q9: Merge Sort's time complexity is:

O(n) O(n²) O(n log n) O(log n)

Q10: N-Queens problem uses which technique?

Dynamic Programming Backtracking Greedy Algorithm Divide & Conquer