University Computer Science
Data Structures
The most fundamental course in computer science, examining how information is organized in memory and processed efficiently.
Curriculum / Syllabus
- Asymptotic Analysis (Big-O Notation)
- Arrays, Linked Lists, Stacks, and Queues
- Trees (Binary Trees, BST, AVL Trees, Red-Black Trees)
- Heaps and Priority Queues
- Hashing and Hash Tables
- Graphs and Graph Representation
Exam & Course Strategy
Tests the ability to select the most appropriate data structure for a given problem, analyze Time/Space Complexity, and implement it using C++/Java.