Presenting the conceptual framework of design and analysis of algorithms: discretization, proving the partial and total correctness of algorithms, analyzing the efficiency, problems of optimal algorithms. Selective analysis of fundamental algorithms from various application areas: Combinatorics (sorting, median element, knapsack, etc.). Computational geometry (convex boundary, intersection of straight line segments, point location, etc.). Algebra (Gaussian elimination, linear programming, etc.). Graph theory (spanning trees, shortest paths, maximum flow, bipartite matching, etc.). Basic theory of NP-completeness.
The courses of the Computer Science Department are designated with the letters "CS" followed by three decimal digits. The first digit denotes the year of study during which students are expected to enroll in the course.
First Digit
Advised Year of Enrollment
1,2,3,4
First, Second, Third and Fourth year
5,6
Graduate courses
7,8,9
Specialized topics
Code
Computer Science Area
A1
Computer architecture and microelectronics
A2
Computer systems, parallel and high performance computing
A3
Computer security and distributed systems
A4
Computer networks, mobile computing, and telecommunications
B1
Algorithms and systems analysis
B2
Databases, information and knowledge management
B3
Software engineering and programming languages
B4
Artificial Intelligence and machine learning
C1
Signal processing and analysis
C2
Computer vision and robotics
C3
Computer graphics and human-computer interaction
C4
Βioinformatics, medical informatics, and computational neuroscience
The following pages contain tables (one for each course category) summarizing courses offered by the undergraduate studies program of the Computer Science Department at the University of Crete. Courses with code-names beginning with "MATH" or "PHYS" are taught by the Mathematics Department and Physics Department respectively at the University of Crete.