Algorithm Analysis and Design

Course Information
TitleΑΝΑΛΥΣΗ ΚΑΙ ΣΧΕΔΙΑΣΜΟΣ ΑΛΓΟΡΙΘΜΩΝ / Algorithm Analysis and Design
SchoolElectrical and Computer Engineering
Cycle / Level1st / Undergraduate
Teaching PeriodSpring
CoordinatorPanagiotis Petrantonakis
Course ID20000681

Class Information
Academic Year2015 – 2016
Class PeriodSpring
Faculty Instructors
Weekly Hours4
Class ID
Course Type 2016-2020
  • Background
  • Scientific Area
Course Type 2011-2015
Specific Foundation / Core
Mode of Delivery
  • Face to face
The course is also offered to exchange programme students.
Language of Instruction
  • Greek (Instruction, Examination)
  • English (Examination)
Required Courses
  • ΗΥ3602 Data Structures
  • ΜΑ0301 Probability and Statistics
  • ΜΑ0701 Discrete Mathematics
Learning Outcomes
Upon successful course completion the students are expected to: 1. Be familiar with the bascis concepts needed for the analysis of algorithms. 2. Be able to appply basic techniques for solving recursive relations that appear in the design of algorithms 3. Fully comprehend well-known algorithms and data structures 4. Understand the complexity of various approaches at various domains 5. Analyze the asymptotic performance of algorithms 6. Apply basic algorithm design principles
General Competences
  • Apply knowledge in practice
  • Work autonomously
  • Generate new research ideas
Course Content (Syllabus)
The course discusses the analysis and design of algorithms and data structures not from a programming, rather an analytic perspective. Topics discussed within the context of the course focus on the evaluation of performance of algorithms, as well as on the comparison of algorithms with respect to their time and space requirements. Identification and description of the theoretical, as well as practical boundaries of algorithms are discussed through an analytical methodology. Topics covered within the context of the course: concepts and tools for the analysis of algorithms, asymptotic order of function growth, recursive relations, probabilistic analysis and randomized algorithms, dynamic programming, greedy algorithms, amortized analysis, advanced topics in analysis and design of algorithms.
Algorithms, Analysis, Design, Complexity
Educational Material Types
  • Slide presentations
  • Book
  • Exercises + Solutions
Use of Information and Communication Technologies
Use of ICT
  • Use of ICT in Course Teaching
  • Use of ICT in Communication with Students
e-THMMY, a blackboard-like system has been developed by the ECE department and is customized to the needs of the ECE courses. e-THMMY allows instructors to post anouncements, communicate with students, upload lectures, exercises and their solutions, set up and run course projects, while it also offers self-assessment capabilities. e-THMMY also supports a Forum for coursework discussion.
Course Organization
Reading Assigment26
Student Assessment
Two midterms and written exams Midterm 1 - Lectures 1- 6 - 40% of the final midterm grade 1st Midterm date: Defined at the beginning of each semester. Midterm 2 - Lectures 7-13 - 60% of final midterm grade Written exams - Lectures 1-13 Final Grade Maximum of { {0.4* midterm 1 + 0.6 * midterm 2}, Written exams } Remarks: - Participation in Midterm exams is not obligatory - If the final midterm exam grade is above passing grade, participation in final exam is not obligatory
Student Assessment methods
  • Written Exam with Short Answer Questions (Formative)
  • Written Assignment (Summative)
  • Written Exam with Problem Solving (Summative)
Course Bibliography (Eudoxus)
Τίτλος Συγγράμματος:: «Εισαγωγή στους Αλγορίθμους, Τόμος Ι»(ελληνική μετάφραση) Συγγραφέας: T. Cormen, C. Leiserson, R. Rivest, and C. Stein Εκδόσεις: ΙΤΕ-Πανεπιστημιακές Εκδόσεις Κρήτης, Ηράκλειο, 2009 ISBN: 978-960-524-225-1 ΚΩΔ.ΕΥΔ.: 251
Additional bibliography for study
Τίτλος Συγγράμματος:: «Σχεδιασμός Αλγορίθμων»(ελληνική μετάφραση) Συγγραφέας: J. Kleinberg, E. Tardos Εκδόσεις: ΕΚΔΟΣΕΙΣ ΚΛΕΙΔΑΡΙΘΜΟΣ, ΘΕΣ/ΝΙΚΗ, 2009 ISBN: 978-960-461-207-9 ΚΩΔ.ΕΥΔ.: 13898
Last Update