Syllabus Application
Data Structures
CS 300
Faculty:
Faculty of Engineering and Natural Sciences
Semester:
Fall 2025-2026
Course:
Data Structures - CS 300
Classroom:
FMAN-G071,UC-G030
Level of course:
Undergraduate
Course Credits:
SU Credit:3.000, ECTS:6, Basic:1, Engineering:5
Prerequisites:
CS 204
Corequisites:
CS 300R
Course Type:
Lecture
Instructor(s) Information
Cemal Yılmaz
- Email: cyilmaz@sabanciuniv.edu
Course Information
Catalog Course Description
This course covers some of the fundamental data structures as well as the algorithms operating on them. Topics included are: Introduction to theoretical aspects of computing: modeling algorithms and their run times, computational complexity. Linear data structures (lists, stacks, queues), trees (binary search trees, AVL trees, tree traversals), hash tables, priority queues, disjoint sets, sorting algorithms, graphs and their representations, graph algorithms (depth first and breadth first search, single source shortest path algorithms), sorting algorithms, algorithmic paradigms (divide and conquer, greedy, dynamic programming).
Course Learning Outcomes:
| 1. | describe common data structures and associated algorithms |
|---|---|
| 2. | contrast the advantages and disadvantages of these data structures |
| 3. | apply these data structures to develop algorithmic solutions to practical problems |
| 4. | design new data structures and associated algorithms |
| 5. | analyze the computational complexity of simple algorithms and programs |
Course Objective
-
Course Materials
Resources:
-
Technology Requirements:
-