Algorithms & Data Structures Quizzes

Test your knowledge after exploring our simulators and applications. Each quiz covers key concepts with multiple-choice questions.

Test your knowledge of the LIFO principle, push/pop operations, time complexity, and real-world use cases like undo systems and the recursion stack.

5 questions

Master the FIFO principle, enqueue/dequeue operations, the difference between queues and stacks, and applications like task scheduling and BFS.

5 questions

Cover tree traversal (inorder, preorder, postorder), binary search trees, tree height and depth, and time complexity of operations.

5 questions

Understand base case and recursive case, the recursion tree, stack frames, and classic examples like factorial and Fibonacci.

5 questions

Test knowledge of vertices and edges, BFS vs DFS, graph representations (adjacency list/matrix), and pathfinding basics.

5 questions

Cover hash functions, collision handling, average vs worst-case complexity, and real-world uses like caching and indexing.

5 questions

Understand search tree exploration, constraint solving, and applications like N-Queens and Sudoku, plus backtracking vs brute force.

5 questions

Cover overlapping subproblems, memoization, tabulation, and classic examples like Fibonacci DP and the Knapsack problem.

5 questions