Course Information
Cycle / Level1st / Undergraduate
Teaching PeriodSpring
CoordinatorGeorgios Christodoulou
Course ID40002939

Programme of Study: PPS-Tmīma Plīroforikīs (2019-sīmera)

Registered students: 366
OrientationAttendance TypeSemesterYearECTS
GENIKĪ KATEUTHYNSĪCompulsory Course427

Class Information
Academic Year2019 – 2020
Class PeriodSpring
Faculty Instructors
Weekly Hours6
Class ID
Course Type 2016-2020
  • Background
Course Type 2011-2015
General Foundation
Mode of Delivery
  • Face to face
The course is also offered to exchange programme students.
Language of Instruction
  • Greek (Instruction, Examination)
  • English (Examination)
General Prerequisites
Learning Outcomes
Knowledge acquired: Training on methodologies for algorithm design, familiarization with the main problem solving strategies and understanding of their core features and of basic features of algorithms’ analysis. Skills: Acquisition (a) of skills in applying algorithms to known types of problems, in designing algorithms and in solving new problems, and (b) of basic algorithm analysis knowledge.
General Competences
  • Apply knowledge in practice
  • Adapt to new situations
Course Content (Syllabus)
Introduction to the design and analysis of algorithms. Brute force methods. Divide and Conquer. Reduce and Conquer. Transform and Conquer. Time and Space Trade-offs. Dynamic programming. Greedy Algorithms. Iterative Improvement. Network Flows. Algorithmic Power Limitations and methods to overcome them. Investigation of a big variety of sorting, search, graph, string matching, combinatorial, geometrical and numerical problems.
algorithm design, algorithm analysis, divide-and-conquer, greedy algorithms, iterative improvement
Educational Material Types
  • Slide presentations
  • Book
Use of Information and Communication Technologies
Use of ICT
  • Use of ICT in Course Teaching
Course Organization
Literature study69
Student Assessment
Written exams, and projects. The exact procedure and weightning is announced on the course's website.
Student Assessment methods
  • Written Exam with Short Answer Questions (Formative, Summative)
  • Written Assignment (Formative, Summative)
  • Written Exam with Problem Solving (Formative, Summative)
Course Bibliography (Eudoxus)
Anany Levitin: "Introduction to the Design and Analysis of Algorithms", Addison Wesley, 2012 - 3rd edition (μετάφραση από τις Εκδόσεις Τζιόλα, 2018)
Additional bibliography for study
• Παναγιώτης Μποζάνης: "Αλγόριθμοι - Σχεδιασμός και Ανάλυση", Εκδόσεις Τζιόλα, 2003. • Jon Kleinberg and Eva Tardos: "Algorithm Design", Addison Wesley, 2005 (μεταφρασμένο από τις Εκδόσεις Κλειδάριθμος). • Steven Skienna: "The Algorithm Design Manual" Springer, 2nd edition, 2007. • Thomas Cormen, Charles Leiserson and Ronald Rivest: "Introduction to Algorithms", 1st edition, MIT Press, 1990 (μεταφρασμένο από τις Πανεπιστημιακέρς Εκδόσεις Κρήτης). • Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani: Algorithms (μεταφρασμένο από τις Εκδόσεις Κλειδάριθμος) • Ιωάννης Μανωλόπουλος και Κωνσταντίνος Ζαχαρής: "Η Tέχνη της Αλγοριθμικής Επίλυσης Προβλημάτων", Εκδόσεις Σαββάλα, 2002. • Gregory Rawlings: "Αλγόριθμοι - Ανάλυση και Σύγκριση", Εκδόσεις Κριτική, 2004. • Gilles Brassard and Paul Bratley: "Algorithmics - Theory and practice", 1st edition, Prentice Hall, 1988. • Robert Sedgewick: "Algorithms in C, Part 5 - Graph Algorithms", 3rd edition, Addison Wesley, 2002. • Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran: "Computer Algorithms", Computer Science Press, 1998. • Robert Sedgewick and Philippe Flajolet: "An Introduction to the Analysis of Algorithms", Addisson Wesley, 1996. • Michael Goodrich and Roberto Tamassia: "Algorithm Design Foundations, Analysis, and Internet Examples" John Wiley, 2002.
Last Update