GENERAL INFORMATION:

Instructors: Efraimidis Pavlos
Semester: 3rd
CREDITS:

ECTS Units: 5
Teaching Units: 4
Theory Hours: 2
Exercises Hours: 1
Lab Hours: 2
COURSE PAGE: https://eclass.duth.gr/courses/TMA566/

Course Description

Models of Computation. Basic concepts of algorithms. Complexity of Algorithms. Computational complexity classes. Asymptotic approaches and symbolisms. Search and sort. Recursive algorithms. Data Structures. Stacks and Queues. Linked Lists. Basic tree concepts. Tree traversals. Binary Search Trees. Priority queues. Hashing. Graph algorithms. Greedy algorithms. Divide and conquer. Dynamic Programming. Design and implementation of algorithms and data structures in the Java programming environment.