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
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 practice set on design habits, testing, abstraction, debugging, edge cases, and project readiness.
25 questions
A 25-question practice set on base cases, recursive cases, call stack tracing, recursion patterns, and backtracking.
25 questions
A 25-question practice set on searching, sorting, Big-O, benchmarks, and algorithm tradeoffs.
25 questions
A 25-question practice set on nodes, references, traversal, insertion, deletion, and linked-list edge cases.
25 questions
A 25-question practice set on LIFO/FIFO behavior, expression matching, simulations, and implementation tradeoffs.
25 questions
A 25-question practice set on uniqueness, key-value lookup, frequency maps, hashing, collisions, and load factor.
25 questions
A 25-question practice set on tree vocabulary, traversals, recursion, binary search trees, and balance.
25 questions
A 25-question practice set on heap invariants, priority queues, percolation, heapify, and heapsort.
25 questions
A 25-question practice set on vertices, edges, representations, BFS, DFS, paths, connectivity, and weighted graphs.
25 questions
A 25-question practice set on privacy, security, bias, accessibility, AI impacts, networking, and responsible design.
