Akademik Dersler - İçerik

Understands and applies fundamental data structures.
Implements basic operations such as insertion, deletion, and searching on linear array structures, stacks, queues, and singly/doubly linked lists.
Analyzes basic and advanced sorting/searching algorithms.
Explains the step-by-step working principles of Bubble, Selection, Insertion, and Shell sorting algorithms.
Designs Merge Sort and Quick Sort algorithms based on the “Divide and Conquer” strategy.
Implements the Binary Search algorithm on sorted arrays.
Organizes data using tree structures and hash tables.
Constructs Binary Search Trees (BST), performs node insertion/deletion, and executes in-order, pre-order, and post-order traversals.
Builds the Binary Heap data structure and applies Heap Sort.
Uses Hash Tables to enable fast data access via keys.
Analyzes graph problems.
Constructs Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms on directed graphs, and applies Topological Sorting and Dijkstra’s shortest path algorithm.
Models and solves computational problems such as Towers of Hanoi, Rat in a Maze, and Fibonacci using recursion.
Develops solutions to classical optimization and cyclic problems such as Knapsack and Josephus using Dynamic Programming.