Information Package / Course Catalogue
Data Structures
Course Code: CSE201
Course Type: Required
Couse Group: First Cycle (Bachelor's Degree)
Education Language: English
Work Placement: N/A
Theory: 2
Prt.: 2
Credit: 3
Lab: 0
ECTS: 4
Objectives of the Course

The main objective of this course is to help students to understand data structures and algorithms

Course Content

Asymptotic analysis of algorithms (Big-Oh and its relatives); recursion and iterative implementations of algorithms; popular but not limited to following data structures: arrays, lists, queues, stacks, trees, heaps, maps and dictionaries, search trees, and graphs

Name of Lecturer(s)
Lec. Gözde ALP
Learning Outcomes
1.To have knowledge about data and basic data structures
2.To be able to calculate the runtime of iterative and recursive algorithms
3.Understand linear data structures such as linked lists, stacks, queues
4.Understanding binary search trees, special trees, and balanced trees
5.Understand the working logic of hash table and heap data structures.
Recommended or Required Reading
1.Algorithms and Data Structures by Kurt Mehlhorn and Peter Sanders, Springer, 2008.
Weekly Detailed Course Contents
Week 1 - Theoretical
Introduction Pointers and Math Review
Week 2 - Theoretical
Algorithm Analysis
Week 3 - Theoretical
Runtime analysis of recursive functions
Week 4 - Theoretical
Lists and operations on lists
Week 5 - Theoretical
Stack data structure and stack operations
Week 6 - Theoretical
Queue data structure and operations on queues
Week 7 - Theoretical
Binary search trees
Week 8 - Theoretical
Special trees, expression trees, AVL trees
Week 9 - Theoretical
Splay tree and B-tree
Week 10 - Theoretical
Hashing and hash operations
Week 11 - Theoretical
Graphs and operations on graphs
Week 12 - Theoretical
Heaps and priority Queues
Week 13 - Theoretical
Binomial heaps
Week 14 - Theoretical
Sorting techniques
Assessment Methods and Criteria
Type of AssessmentCountPercent
Midterm Examination1%30
Final Examination1%40
Assignment2%30
Workload Calculation
ActivitiesCountPreparationTimeTotal Work Load (hours)
Lecture - Theory140228
Lecture - Practice140228
Assignment210020
Quiz1505
Midterm Examination1729
Final Examination110212
TOTAL WORKLOAD (hours)102
Contribution of Learning Outcomes to Programme Outcomes
PÇ-1
PÇ-2
PÇ-3
PÇ-4
PÇ-5
PÇ-6
PÇ-7
PÇ-8
PÇ-9
PÇ-10
PÇ-11
OÇ-1
5
4
3
5
3
2
2
3
2
2
3
OÇ-2
5
5
3
5
3
2
2
3
2
2
2
OÇ-3
5
5
3
5
3
2
2
3
2
2
2
OÇ-4
5
5
3
5
3
2
2
3
2
2
2
OÇ-5
5
4
3
5
3
2
2
3
2
2
2
Adnan Menderes University - Information Package / Course Catalogue
2026