| Code | Name of the Course Unit | Semester | In-Class Hours (T+P) | Credit | ECTS Credit |
|---|---|---|---|---|---|
| BIL202 | DATA STRUCTURE AND ALGORITHMS | 4 | 5 | 4 | 7 |
Objectives and Contents |
|
|---|---|
| Objectives: | The goal is to teach students to analyze the time and space requirements of essential algorithms and data structures, to examine various data structures such as stacks, queues, trees, and graphs, and to implement algorithms in Python. |
| Content: | Stacks, applications of stack structures, queues, enqueue and dequeue operations, priority queues, tree structures, tree applications, binary search trees, applications of heap structures, balanced search trees, graph structures, and applications of graph structures. |