Faculty of Engineering and Natural Sciences · Computer Engineering · Undergraduate
ECTS: 6 T+P+L: 2+0+1 Compulsory
Coordinator: Dr. Öğr. Üyesi Rezzan Nisa ER
Instructors: Dr. Öğr. Üyesi Rezzan Nisa ER
Prerequisites: BIM 107 - Introduction to Algorithms and Programming, BIM 109 - Introduction to Algorithms and Programming
Course Objective
.The aim of this course is to teach students the properties and working principles of basic data structures; and to equip them with the ability to select, apply, and use the appropriate data structure for different types of problems. The course covers fundamental data structures such as arrays, linked lists, stacks, queues, trees, graphs, and hash tables, as well as their memory usage, access, and processing characteristics.
Course Content
Fundamental concepts related to data structures: Linked List, Stack, Queue, Tree, Graph Heap, Hash Tables.
Course Learning Outcomes
- Write computer programs using the linked list data structure.
- Write computer programs using the stack data structure.
- Write computer programs using the queue data structure.
- Design algorithms using tree data structure.
- Choose the most appropriate data structure required to solve a problem.
- It defines the graph data structure.
Core Area Distribution
(48) Computing%60 (52) Engineering and Engineering Trades%40
Teaching Methods
ExpressionQuestion-AnswerExercise and PracticeProblem Solving
Assessment & Evaluation
Testing (Essay / Tests: True-Falls, multiple-choice, short answer, matching)
ECTS / Workload
| Activity | Quantity | Duration (h) | Total Workload |
|---|---|---|---|
| Course Duration (Including Exam Week) | 0 | 0 | 0 |
| Out of Class Study Period | 0 | 0 | 0 |
| Midterm | 0 | 0 | 0 |
| Quiz | 0 | 0 | 0 |
| Assignment | 0 | 0 | 0 |
| Practice | 0 | 0 | 0 |
| Final | 0 | 0 | 0 |
Course Schedule
| Week | Subject | Preparation |
|---|---|---|
| 1 | ||
| 2 | ||
| 3 | Struct | |
| 4 | ||
| 5 | ||
| 6 | ||
| 7 | ||
| 8 | ||
| 9 | ||
| 10 | ||
| 11 | ||
| 12 | ||
| 13 | ||
| 14 | ||
| 15 | ||
| 16 |