Data Structures and Algorithms Objective Questions and Answers - Set 2

Test your data structures and algorithms skills with high-quality MCQs focused on problem-solving, complexity analysis, and real interview-level scenarios. Designed for developers and competitive programming practice. This is part 2 of the series.

Practice Data Structures and Algorithms MCQs with Detailed Explanations

Answer at least 12 questions to submit and verify answers.

16 What is the worst-case time complexity of inserting into a hash table with chaining? Hard

17 Which traversal technique is used in topological sorting? Hard

18 What is the main advantage of using adjacency lists over adjacency matrices? Medium

19 Which algorithm finds a minimum spanning tree? Medium

20 What is the output of pushing 1, 2, 3 into a stack and popping once? Medium

21 Which data structure supports insert, delete, and search in O(log n) time? Hard

22 What is the worst-case time complexity of BFS on a graph? Medium

23 Which algorithm technique is used in the Knapsack (0/1) problem? Hard

24 What is the worst-case time complexity of Binary Search? Medium

25 Which sorting algorithm is stable? Medium

26 What is the time complexity of building a heap from an array? Hard

27 Which problem is an example of backtracking? Hard

28 Which data structure is used to detect cycles in a graph using DFS? Hard

29 What is the space complexity of DFS using recursion? Medium

30 Which algorithm finds all-pairs shortest paths? Hard