ROUND - 2 CODE HACK

1. What is the time complexity of Bubble Sort?

• A) O(n log n)

• B) O(n^2)

• C) O(n)

• D) O(log n)

2. Which data structure follows the LIFO principle?

• A) Queue

• B) Stack

• C) Tree

• D) Graph

3. What is the purpose of the 'key' in a hash table?

• A) To store the value

• B) To store the index of the value

• C) To map the value to its location

• D) To sort the values

4. Which algorithm is used for finding the shortest path in a graph?

• A) Dijkstra's Algorithm

• B) Bellman-Ford Algorithm

• C) Kruskal's Algorithm

• D) All of the above

5. What is the time complexity of Binary Search?

• A) O(n)

• B) O(log n)

• C) O(n log n)

• D) O(n^2)