Advanced Topics in CS

DSA Assignment Bank

Choose a topic, then jump to the matching Advanced CS unit page for algorithmic assignment prompts, edge-case practice, implementation planning, and runtime reasoning.

Algorithm code on a laptop for data structures practice

10

topics

300

assignment prompts

30

per topic

Pick a DSA topic

Assignment prompt cards by Advanced CS unit

Each card opens the matching unit section with the full 30-question assignment bank for that topic.

Schedule Free Consultation
030 prompts

Computer Science

A bridge from AP Computer Science A into advanced honors computer science habits: design, implementation, testing, abstraction, and clear technical communication.

Array traversal and helper methodsCounting and data validationDecompositionObjects and side effects
Open topic prompts
130 prompts

Recursion

Students learn to solve problems by defining smaller versions of the same problem, then reason about call stacks, base cases, and recursive correctness.

Recursive branchingBacktrackingRecursive searchInclude or exclude recursion
Open topic prompts
230 prompts

Sorting, Searching, and Algorithm Efficiency

Students compare algorithms by correctness, runtime, memory, and implementation complexity, with sorting and searching as the main laboratory.

Binary search on answerBinary search variantsBinary search with casesLower-bound search
Open topic prompts
330 prompts

Linked Lists

Students move beyond array-backed collections and learn how references can connect nodes into flexible linear structures.

Pointer reversalFast and slow pointersCycle entry logicTwo-list traversal
Open topic prompts
430 prompts

Stacks and Queues

Students study abstract data types that control access order: last-in-first-out stacks and first-in-first-out queues.

Stack matchingStack evaluationOperator precedence stackAuxiliary stack
Open topic prompts
530 prompts

Sets, Maps, and Hash Tables

Students learn fast lookup structures for uniqueness, counting, indexing, and key-value associations.

Hash lookupCanonical keysFrequency mapSliding window set
Open topic prompts
630 prompts

Trees

Students learn hierarchical data structures and the recursive algorithms that make trees powerful.

Recursive tree traversalBounds recursionRecursive searchPreorder with null markers
Open topic prompts
730 prompts

Heaps and Heap Sort

Students study priority queues and the heap structure that supports efficient access to the highest or lowest priority item.

Min-heap of fixed sizePriority queue mergeTwo heapsHeap plus queue
Open topic prompts
830 prompts

Graphs and Graph Theory

Students learn to model networks of relationships and solve problems involving paths, connectivity, and traversal.

DFS or BFSBFSDFS with parent trackingDFS recursion states
Open topic prompts
930 prompts

Computing and Society

Students connect advanced programming to the human impact of software systems, data, automation, networks, and AI.

Aggregation and privacyGraph reachabilityWindowed countingPriority scoring
Open topic prompts

Need help turning prompts into working code?

Code Scholars supports implementation, test design, edge cases, and complexity analysis for DSA assignments.

Schedule Free Consultation