Data Structures and Algorithms topics
10 short topics in Data Structures and Algorithms. Each one is a single focused exercise with a clear piece of evidence at the end.
10 topics, one exercise each.
Work through them in order, or jump to the one you need.
These are draft topic outlines (draft; instructor review pending). Full lessons follow after review; ask Ajay if you need a topic sooner.
- 01
Arrays and dynamic arrays
Implement a focused example of Arrays and dynamic arrays within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 02
Linked lists
Implement a focused example of Linked lists within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 03
Stacks and queues
Implement a focused example of Stacks and queues within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 04
Hash tables
Implement a focused example of Hash tables within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 05
Trees and traversal
Implement a focused example of Trees and traversal within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 06
Graph representations
Implement a focused example of Graph representations within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 07
Sorting strategies
Implement a focused example of Sorting strategies within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 08
Binary search
Implement a focused example of Binary search within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 09
Recursion and backtracking
Implement a focused example of Recursion and backtracking within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course → - 10
Time and space complexity
Implement a focused example of Time and space complexity within a small part of Searchable collection and graph traversal visualizer; demonstrate a normal and an edge or failure case.
Open micro-course →
More in Core IT concepts.
You have the curiosity.
Let’s turn it into capability.
Start with a practical workshop or bring a specific question to Ajay.