25 questions
Advanced Topics MCQ Practice Test 1
A 25-question Advanced Topics in CS practice set covering recursion, efficiency, linked lists, stacks, queues, maps, trees, heaps, graphs, and computing in society.
Advanced Topics in CS Practice
Practice the major AT CS units with one-question-at-a-time review, immediate answer checks, and explanations that reinforce implementation and reasoning.
Practice Format
Practice only
Check answers as you go. No timed mode is used for AT CS practice.
All major units
Recursion, efficiency, linked structures, ADTs, maps, trees, heaps, graphs, and society.
Available Tests
Optional: type a topic name to narrow the AT CS practice sets.
25 questions
A 25-question Advanced Topics in CS practice set covering recursion, efficiency, linked lists, stacks, queues, maps, trees, heaps, graphs, and computing in society.
25 questions
A 25-question medium-to-hard tracing set on helpers, object state, array references, conditionals, and nested-loop reasoning.
25 questions
A 25-question medium-to-hard tracing set on recursive returns, stack unwinding, string recursion, array recursion, and include/exclude patterns.
25 questions
A 25-question medium-to-hard tracing set on binary search, partial sorting passes, merge steps, two pointers, and comparison counts.
25 questions
A 25-question medium-to-hard tracing set on node links, insertion, removal, prefix reversal, pointer movement, and mutation.
25 questions
A 25-question medium-to-hard tracing set on stack state, queue rotation, two-stack transfers, cancellation patterns, and mixed workflows.
25 questions
A 25-question medium-to-hard tracing set on frequency maps, sets, grouped totals, duplicate windows, and last-position updates.
25 questions
A 25-question medium-to-hard tracing set on tree recursion, BST insertion, inorder traversal, height, leaves, path sums, and mutation.
25 questions
A 25-question medium-to-hard tracing set on PriorityQueue ordering, custom comparators, repeated polling, merging costs, and reinsertion.
25 questions
A 25-question medium-to-hard tracing set on BFS, DFS, visited arrays, components, shortest distances, and directed-edge indegrees.
25 questions
A 25-question medium-to-hard code-tracing set on consent filters, access control, rate limiting, grouped metrics, and privacy thresholds.