OKSTEM College · AS Computer Science

CS 201 — Data Structures & Algorithms

Core data structures (arrays, linked lists, trees, heaps, hash tables, graphs) and algorithms (sorting, shortest paths, dynamic programming, greedy).

12 Lessons

Analyze time and space complexity using Big-O notation
Implement and choose between arrays, linked lists, stacks, queues, trees, and hash tables
Implement BFS, DFS, and Dijkstra's algorithm on graphs
Apply merge sort, quicksort, and heap sort
Solve problems using dynamic programming and greedy algorithms
Understand NP-completeness and its implications