Data Structures & Algorithms
Arrays, linked lists, trees, graphs, sorting, searching, recursion, and dynamic programming.
Timed Mock Exams in this Category
Full-length assessments with negative marking and instant scorecards.
Data Structures and Algorithms: Extended Practice - Hard Mixed Mock
Independent hard practice covering String Algorithms; Binary Search; Binary Search Trees; Topological Ordering; Dynamic Programming; Union-Find. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 100 single-best-answer MCQs at one mark each, 145 minutes and a practice pass target of 60/100. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Readiness Assessment - Medium Mixed Mock
Independent medium practice covering Sliding Windows; Hash Maps and Sets; Binary Trees; Depth-First Search; Backtracking; Algorithm Correctness and Analysis. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 75 single-best-answer MCQs at one mark each, 115 minutes and a practice pass target of 38/75. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Challenge Combination - Hard Mixed Mock
Independent hard practice covering Two-Pointer Techniques; Queues and Deques; Heaps and Priority Queues; Breadth-First Search; Dynamic Programming; Backtracking. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 60 single-best-answer MCQs at one mark each, 110 minutes and a practice pass target of 36/60. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Consolidation Review - Easy Mixed Mock
Independent easy practice covering Prefix and Suffix Aggregates; Stacks; Quick Sort; Graph Representation; Greedy Algorithms; Union-Find. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 50 single-best-answer MCQs at one mark each, 80 minutes and a practice pass target of 20/50. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Accuracy and Edge Cases - Hard Mixed Mock
Independent hard practice covering Array Traversal; Linked-List Cycle Detection; Merge Sort and Divide-and-Conquer; Tries and Prefix Search; Minimum Spanning Trees; Algorithm Correctness and Analysis. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 40 single-best-answer MCQs at one mark each, 80 minutes and a practice pass target of 28/40. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Speed and Selection Drill - Medium Mixed Mock
Independent medium practice covering String Algorithms; Hash Maps and Sets; Heaps and Priority Queues; Graph Representation; Minimum Spanning Trees; Algorithm Correctness and Analysis. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 25 single-best-answer MCQs at one mark each, 30 minutes and a practice pass target of 13/25. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Applied Reasoning Mix - Medium Mixed Mock
Independent medium practice covering Sliding Windows; Queues and Deques; Quick Sort; Tries and Prefix Search; Shortest-Path Algorithms; Union-Find. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 60 single-best-answer MCQs at one mark each, 90 minutes and a practice pass target of 30/60. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Core Skills Mix - Medium Mixed Mock
Independent medium practice covering Two-Pointer Techniques; Stacks; Merge Sort and Divide-and-Conquer; Balanced Search Structures; Topological Ordering; Backtracking. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 50 single-best-answer MCQs at one mark each, 75 minutes and a practice pass target of 25/50. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Foundation Revision - Easy Mixed Mock
Independent easy practice covering Prefix and Suffix Aggregates; Linked-List Cycle Detection; Elementary Sorting; Binary Search Trees; Depth-First Search; Dynamic Programming. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 40 single-best-answer MCQs at one mark each, 60 minutes and a practice pass target of 16/40. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Diagnostic Overview - Easy Mixed Mock
Independent easy practice covering Array Traversal; Linked Lists; Binary Search; Binary Trees; Breadth-First Search; Greedy Algorithms. Learning focus: move between the listed topic areas, identify the relevant method and maintain accuracy under a defined practice time budget. Blueprint: 30 single-best-answer MCQs at one mark each, 50 minutes and a practice pass target of 12/30. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Algorithm Correctness and Analysis - Challenge Mock
Independent hard practice covering loop invariants, counterexamples and time-space tradeoffs. Learning focus: resolve multi-step cases, evaluate competing explanations and handle stated edge conditions. Blueprint: 40 single-best-answer MCQs at one mark each, 60 minutes and a practice pass target of 24/40. Timings and thresholds are editorial practice settings, not an official examination scheme.
Data Structures and Algorithms: Algorithm Correctness and Analysis - Application Mock
Independent medium practice covering loop invariants, counterexamples and time-space tradeoffs. Learning focus: apply concepts to bounded scenarios, combine relevant facts and avoid common interpretation errors. Blueprint: 30 single-best-answer MCQs at one mark each, 45 minutes and a practice pass target of 15/30. Timings and thresholds are editorial practice settings, not an official examination scheme.