IBPS SO IT Officer Data Structures Quiz 2026, FREE PDF & Quiz

1. A database model represents records as nodes connected by multiple links, allowing one child record to have multiple parents. Which model is this?

2. A bank wants a report containing every customer, including customers who have never placed an order. Customers is the left table and Orders is the right table. Which join is most appropriate?

3. Which SQL clause filters individual rows before grouping?

4. Which SQL clause is used to filter groups produced by GROUP BY?

5. Which aggregate function counts only non-NULL values of a specified column?

6. A relation is in 2NF when it is in 1NF and every non-prime attribute is fully dependent on what?

7. Which normal form is primarily concerned with eliminating transitive dependency of non-key attributes on a key?

8. In BCNF, for every non-trivial functional dependency X −> Y, what must be true?

9. Which ACID property ensures that a committed transaction’s effects survive a system crash?

10. Which ACID property means a transaction executes completely or has no effect at all?

11. Which sorting algorithm is stable in its standard array implementation and performs especially well on small, nearly sorted data?

12. The average-case time complexity of quicksort with reasonably balanced partitions is:

13. The worst-case time complexity of standard quicksort is:

14. Which comparison sort guarantees O(n log n) worst-case time and is stable in its standard implementation?

15. Kruskal’s minimum-spanning-tree algorithm processes edges in:

16. Which data structure efficiently supports cycle detection in Kruskal’s algorithm?

17. Dijkstra’s shortest-path algorithm requires what assumption for its standard correctness?

18. Which shortest-path algorithm can handle negative edge weights and detect a reachable negative-weight cycle?

19. A collision in a hash table occurs when:

20. Which collision-resolution method stores multiple colliding keys in a bucket/list at the same index?