Abstract:

Issues of the course:

Analysis of Algorithms and Mathematical Foundations: Growth of f?unctions and Asymptotic notations, Master Methods. Searching for a term in a sorted and an unsorted list,merging sorted series, analyzing the complexity of their run times.

 Abstract Data Types, the Concept of Implementation, Data Types. Lists: Linked Lists, the Linked List as a Data Structure, Double Linked Lists. Stacks, Queues,

Trees: Binary Trees and Traversals, Binary Search Trees General Trees, Balanced Trees.

Heaps and Heapsort, analysis of Heapsort . Sorting and Searching:, Quicksort,