Course Information

Course Title	Code	Semester	L+U Hour	Credits	ECTS
DATA STRUCTURES	YMH218	4. Semester	3 + 0	3.0	4.0

Prerequisites

None

Language of Instruction	Turkish
Course Level	Bachelor's Degree
Course Type	Compulsory
Mode of delivery
Course Coordinator
Instructors
Assistants
Goals	The purpose of this course can be stated as follows; • To ensure that participants have knowledge of basic algorithms and problem-solving structures and the ability to design algorithms using these basic structures when faced with a problem and to implement these algorithms with a structured programming language. • Introduce algorithms by looking at real-life problems that motivate their use. Participants will learn a range of design and analysis techniques that will be used in computer applications. Data structures such as Linked List, Stack, Queue, Trees, Heap; Sorting, search, Hash Tables, Graph type algorithms will be discussed with different sample applications.
Course Content	This course will cover the following topics in content: • Algorithm Concept • Algorithm Analysis • Linked List, Stack, Queue data structures • Sorting and search algorithms • Hash tables • Graph algorithms
Learning Outcomes	1) Participants will be able to classify different types of algorithms and their intended uses. 2) Participants will be able to explain the time and space complexities of different types of advanced algorithms. 3) Participants will be able to use sorting algorithms to solve specific computational problems. 4) Participants will be able to code search-type algorithms to solve specific computational problems.

Week	Topics	Teaching and Learning Methods and Techniques	Study Materials
1. Week	Basic concepts	Lecture	Presentation (Including Preparation Time)
2. Week	Algorithm Concept	Lecture	Presentation (Including Preparation Time)
3. Week	Algorithm Analysis	Lecture	Presentation (Including Preparation Time)
4. Week	Algorithm Analysis	Lecture	Presentation (Including Preparation Time)
5. Week	Linked List	Lecture	Presentation (Including Preparation Time)
6. Week	Stack	Lecture	Presentation (Including Preparation Time)
7. Week	Queueu	Lecture	Presentation (Including Preparation Time)
8. Week	Sorting Algorithms	Lecture	Presentation (Including Preparation Time)
9. Week	Midterm Exam
10. Week	Sorting Algorithms	Lecture	Presentation (Including Preparation Time)
11. Week	Arama (Search) Algoritmaları	Lecture	Presentation (Including Preparation Time)
12. Week	Hash Tables	Lecture	Presentation (Including Preparation Time)
13. Week	Graph Algorithms	Lecture	Presentation (Including Preparation Time)
14. Week	Recap	Lecture	Presentation (Including Preparation Time)

Recommended Sources

Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. “Introduction to Algorithms”. 2nd ed. MIT Press.

Levitin, A. “Introduction to the Design and Analysis of Algorithms”. 3rd ed. Pearson International Edition

Toros Rıfat Çölkesen. “Veri Yapıları ve Algoritmalar” (12. Basım). Papatya Yayıncılık. ISBN: 978-9756797235

*DK = Course's Contrubution.

	0	1	2	3	4	5
Level of contribution	None	Very Low	Low	Fair	High	Very High

Event	Quantity	Duration (Hour)	Total Workload (Hour)
Course Duration (Total weeks*Hours per week)	14	3	42
Work Hour outside Classroom (Preparation, strengthening)	14	3	42
Midterm Exam	1	1	1
Time to prepare for Midterm Exam	1	15	15
Final Exam	1	2	2
Time to prepare for Final Exam	1	20	20
Total Workload
Total Workload / 30 (s)
ECTS Credit of the Course			30