Topic testComputer Science18 questions6 concepts

Algorithms and Search topic test

Use one bounded CS branch where visible list work grows into one coherent graph-traversal bench, so sorting, binary search, adjacency, BFS, DFS, and visited-state behavior stay on compact live surfaces.

What this run covers

This first-pass topic test reuses the shared quiz engine, but it balances question selection across the included concepts so the topic is assessed as a broader branch instead of a single concept replay.

Review topic Back to Test Hub

Saved result

Loading progress

Loading saved topic-test progress.

Saved result details will appear once local progress is ready.

Algorithms and Search topic test

Loading saved test state.

Included concepts

Review the concepts behind this topic test

Every topic test still points back to the published topic page and the included concept pages, so you can review the exact learning surfaces behind the questions.

Computer Science

Sorting and Algorithmic Trade-offs

Watch sorting as visible work on a live list so input order, comparisons, and writes stay concrete instead of collapsing into one final answer.

Open Sorting and Algorithmic Trade-offs Open concept test

Computer Science

Binary Search / Halving the Search Space

Keep an ordered list, the low-mid-high markers, and the shrinking interval visible together so binary search feels visual instead of procedural.

Open Binary Search / Halving the Search Space Open concept test

Computer Science

Graph Representation and Adjacency Intuition

Keep one live graph, one local neighborhood, and one frontier cue visible together so graph structure feels readable before traversal rules get formal.

Open Graph Representation and Adjacency Intuition Open concept test

Computer Science

Breadth-First Search and Layered Frontiers

Keep the queue frontier, visited count, and graph layers visible together so breadth-first search reads as a layered process instead of a procedure list.

Open Breadth-First Search and Layered Frontiers Open concept test

Computer Science

Depth-First Search and Backtracking Paths

Keep the stack frontier, current depth, and branch order visible together so depth-first search feels like disciplined backtracking instead of random wandering.

Open Depth-First Search and Backtracking Paths Open concept test

Computer Science

Frontier and Visited State on Graphs

Keep repeat skips, waiting frontier nodes, and already-expanded nodes visible together so cycle handling feels like honest bookkeeping on one graph bench.

Open Frontier and Visited State on Graphs Open concept test