DSA & Algorithms · Full Mock 1
36 questions across all twelve DSA topics – code output, traces on drawn arrays, trees and graphs, and complexity – with negative marking.
Technical tests
DSA & Algorithms Online Test
Trace arrays, trees and graphs, predict program output and complete missing lines – every program is compiled and run.
- Topics
- 12
- Practice sets
- 36
- Full mocks
- 2
- Questions
- 540
Data structures and algorithms decide the coding rounds of product companies and a large share of GATE CSE marks. These tests go beyond plain MCQs: you trace arrays with pointers, read binary trees and graphs drawn on screen, predict the output of short programs in C, C++, Java and Python, and pick the line that completes an algorithm. Every program shown was compiled and run to produce its answer, and every traced answer was computed by a checker program.
Full mocks
Test yourself like the real round
DSA & Algorithms · Full Mock 2
36 fresh questions – no overlap with Mock 1 – from all twelve topics, from C strings and heaps to grid BFS, tries and DP.
Topic-wise practice
Choose a topic and level
01Time and Space Complexity
Big-O of loops and recursion, counting operations, recurrences and the Master theorem, amortised cost and space used by the call stack.
02Arrays and Strings
Indexing and memory layout, prefix sums, two pointers, sliding window, Kadane, rotation, hashing tricks, KMP and the string pitfalls of C, C++, Java and Python.
03Linked Lists
Traversal, insertion and deletion, reversal, slow and fast pointers, cycle detection, merging, dummy nodes, k-group reversal and LRU caches.
04Stacks and Queues
LIFO and FIFO operations, balanced brackets, infix to postfix, monotonic stacks, deques and sliding windows, queues from stacks and circular buffers.
05Hashing
Hash functions, collisions, chaining and open addressing, load factor, hash maps and sets in Python, Java and C++, and hashing patterns such as prefix sums and rolling hashes.
06Recursion and Backtracking
Base cases and the call stack, tracing output order, Tower of Hanoi, memoisation, subsets, permutations, N-Queens, combination sum and pruning.
07Sorting and Searching
Bubble, selection, insertion, merge, quick, heap, counting and radix sort traced pass by pass, stability and in-place sorting, binary search and its variants, and library sorts.
08Trees and BST
Traversals, height and leaves, BST search, insert and delete, building trees from traversals, LCA, diameter, AVL rotations, tries and segment trees.
09Heaps and Priority Queues
Heap property and array layout, sift-up and sift-down, building a heap in O(n), heap sort, priority queues in Python, Java and C++, top-k, running median and merging.
10Graphs
Representations, BFS and DFS orders, connected components, cycle detection, topological sort, Dijkstra, Bellman–Ford, Floyd–Warshall, MSTs, union-find, bridges and articulation points.
11Dynamic Programming
Memoisation and tabulation, 1D problems (stairs, robber, coins, LIS), 2D tables (grid paths, LCS, edit distance, knapsack), interval DP and state design.
12Greedy and Bit Manipulation
Greedy choice and when it fails, activity selection, fractional knapsack, Huffman coding, intervals and scheduling; bitwise operators, masks, XOR tricks, counting bits and two's complement.
No sets match this filter.