Akademik Dersler - İçerik

0 : Does not support 1 : Low-level support 2 : Mid-level support 3 : Top level support

Learning Outcomes	1	2	3	4	5	7	8	9	12
Analyzes time and memory complexity of algorithms, applies defensive programming and memory optimization principles in problem solving.	3	1	2	3	2	2	1	2	1
Compares basic and advanced sorting and search algorithms and selects the most appropriate one for the structure and size of the available dataset.	2	2	2	3	3	0	2	1	0
Designs linked lists, stacks, queues, and hash structures and implements them in a way that ensures data integrity.	2	0	3	3	3	1	2	1	0
Minimizes the costs of search, insertion, and deletion operations using hierarchical data structures such as binary trees, AVL and B-trees.	3	1	3	3	3	1	3	2	0
Formulates complex system problems through graph data models and adjacency matrices and solves them with shortest path and traversal algorithms.	3	2	3	3	3	0	2	2	1