| Code |
Course Name |
Language |
Type |
| MUH 212 |
Data Structures |
Turkish |
Compulsory /
Elective |
| Local Credits |
ECTS |
Theoretical |
Tutorial |
Laboratory |
| 3 |
4.5 |
3 |
0 |
0 |
| Course Prerequisites and Class Restriction |
| Prerequisites |
BIL 104E MIN DD
or BIL 110E MIN DD
or MAT 115E MIN DD
or BIL 100E MIN DD
or BIL 112E MIN DD
or BIL 113E MIN DD
|
| Class Restriction |
None |
| Course Description |
| Arrays: one and multi-dimensional arrays, basic searching and sorting algorithms. Lists: one and double linked lists, circular
linked lists. Stacks and queues, insert and delete operations. Trees: binary search trees, balanced binary tree (AVL and AA
trees), tree traversals, heap and heapsort. General trees, B-trees. Hash function and table. Graphs, representation, depth-first
search, breadth-first search, topological sorting |
|
