Akademik Dersler - İçerik

Analyzes and designs advanced algorithms.
Defines iterative and recursive algorithms.
Calculates the running time of iterative algorithms.
Uses Big 'O' notation to express algorithmic running time.
Explains and analyzes advanced sorting algorithms such as MergeSort, QuickSort, HeapSort, CountingSort and RadixSort.
Restates the fundamentals of advanced data structures.
Explains Union/Find data structure and its applications.
Describes the graph data structure.
Explains graph traversal algorithms.
Explains different graph algorithms such as TopologicalSort, Minimum Spanning Trees and Shortest Paths
Develops skills in implementations and applications of advanced data structures.
Implements advanced algorithms for sorting and searching.
Implements advanced data structures such as heaps, Graphs.
Applies algorithms and data structures in various real-life software solutions.