Data Structures and Algorithm
Information Systems Engineering
Faculty of Technology
First Cycle (Bachelor's Degree)
| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Data Structures and Algorithm | TBL224 | Compulsory | Bachelor's degree | 2 | Spring | 5 |
Name of Lecturer(s)
Associate Prof. Dr. Süleyman EKEN
Associate Prof. Dr. Zeynep Hilal KİLİMCİ
Associate Prof. Dr. Serdar SOLAK
Lecturer Yavuz Selim FATİHOĞLU
Learning Outcomes of the Course Unit
1) Knows the data concept and basic data types
2) Compares the iterative and recursive solutions
3) Determines the performanses of algorithms
4) Solves the problems by using list and linked list data structures
5) Writes programs efficiently with stacks and ques data structures
6) Analysis the performance of Heap tree
7) Benefits from the searching, sorting and special purpose tree structures.
8) Knows the different applications of binary trees
9) Knows the applications of Hash tables.
10) Learns graph data structure
Program Competencies-Learning Outcomes Relation
| Program Competencies | ||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | ||
| Learning Outcomes | ||||||||||||
| 1 | High | High | High | No relation | No relation | High | High | No relation | High | No relation | No relation | |
| 2 | High | High | High | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 3 | High | High | High | No relation | No relation | High | High | No relation | No relation | No relation | No relation | |
| 4 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 5 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 6 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 7 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 8 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 9 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
| 10 | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | No relation | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Algorithms and Programming I and II
Course Contents
Data concept and data types, lists, linked lists, ques, stacks, binary trees, sorting algorithms, searching algorithms, hash tables.
Weekly Schedule
1) Complexity of Algorithm2) Recursion
3) Linked Lists I
4) Linked Lists II
5) Stack
6) Queue
7) Demosntration of Stacks and Queues through Linked Lists
8) Trees
9) Trees: Binary Trees
10) Balanced and Unbalanced Trees, AVL Trees
11) Red-Black Trees
12) Heap Trees and others
13) Hashing
14) Introduction to Graphs
15) Graphs II
16) Graph Algorithms
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
Assessment Methods and Criteria
Contribution of Semester Studies to Course Grade |
65% |
||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
|||||||||||||||
Contribution of Final Examination to Course Grade |
35% |
||||||||||||||
Total | 100% | ||||||||||||||
Language of Instruction
Turkish
Work Placement(s)
Not Required