Description
In this course, you will :
- A thorough understanding of data structures and algorithms.
- Working knowledge of array-based, linked list-based, and hybrid implementations.
- Practical practice with Java interfaces, classes, and templates.
- familiar with complexity analysis of data structures and related methods.
Syllabus :
- Array-Based Lists
- Linked Lists
- Skiplists
- Hash Tables
- Binary Trees
- Random Binary Search Trees
- Scapegoat Trees
- Red-Black Trees
- Heaps
- Sorting Algorithms
- Graphs
- Data Structures for Integers
- External Memory Searching