Public View

You are viewing the public version of the syllabus. If you have a SUNet account, you can view the richer version of the syllabus after logging in.

CS 300
Data Structures

Faculty Faculty of Engineering and Natural Sciences
Semester Spring 2025-2026
Course CS 300 - Data Structures
Time/Place
Time
Week Day
Place
Date
16:40-17:30
Mon
FASS-G062
Feb 16-May 22, 2026
12:40-14:30
Tue
UC-G030
Feb 16-May 22, 2026
Level of course Undergraduate
Course Credits SU Credit:3, ECTS:6, Basic:1, Engineering:5
Prerequisites CS 204
Corequisites CS 300R
Course Type Lecture

Instructor(s) Information

Saima Gül

Course TAs and LAs Office Hours:

OFFICE HOURS

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
To introduce fundamental techniques of algorithm analysis
To introduce common data structures, their properties and implementation
To apply C++ programming skills to implement solutions using common data structures to practical problems
-

Course Materials

Resources:
Data Structures & Algorithm Analysis in C++, (2nd, 3rd, or 4th edition), Mark Allen Weiss, Pearson, 2014, ISBN 0-273-76938-3 (4th edition).
Technology Requirements:

Policies