ALGORITHMS AND COMPLEXITY

Course Information
TitleΑΛΓΟΡΙΘΜΟΙ ΚΑΙ ΠΟΛΥΠΛΟΚΟΤΗΤΑ / ALGORITHMS AND COMPLEXITY
CodeNGE-07-01
FacultySciences
SchoolInformatics
Cycle / Level1st / Undergraduate
Teaching PeriodWinter
CoordinatorNantia Iakovidou
CommonYes
StatusActive
Course ID40002972

Programme of Study: Undergradute Studies - School of Informatics (2015-today)

Registered students: 21
OrientationAttendance TypeSemesterYearECTS
Information SystemsGeneral Electives745
Digital MediaGeneral Electives745
Communication, Networks And Systems ArchitectureGeneral Electives745
Information And Communication Technologies In EducationGeneral Electives745
General Common DirectionGeneral Electives745

Class Information
Academic Year2015 – 2016
Class PeriodWinter
Faculty Instructors
Weekly Hours4
Class ID
600004906
Type of the Course
  • Background
  • General Knowledge
  • Scientific Area
Course Category
Specific Foundation / Core
Mode of Delivery
  • Face to face
Digital Course Content
Erasmus
The course is also offered to exchange programme students.
Language of Instruction
  • Greek (Instruction, Examination)
  • English (Examination)
Prerequisites
Required Courses
  • NCO-01-04 DISCRETE MATHEMATICS
  • NCO-02-02 PROBABILITIES & STATISTICS
  • NCO-02-03 DATA STRUCTURES
  • NCO-04-03 ALGORITHMS
Learning Outcomes
Understand the mapping of problems to algorithmic solutions (e.g., as graph problems, linear programs. Use advanced algorithmic techniques (e.g., randomization, approximation) to solve problems. Apply advanced analysis techniques (e.g., probabilistic, etc.) to algorithms.
General Competences
  • Adapt to new situations
  • Make decisions
  • Work autonomously
  • Design and manage projects
  • Advance free, creative and causative thinking
Course Content (Syllabus)
Linear Programming (e.g., duality, simplex method, interior point algorithms). Number-theoretic algorithms (e.g., modular arithmetic, primality testing, integer factorization). Randomized algorithms. Approximation algorithms. Probabilistic analysis. Online algorithms and competitive analysis. Local Search.
Keywords
Complexity, Algorithms
Educational Material Types
  • Notes
  • Slide presentations
  • Book
Use of Information and Communication Technologies
Use of ICT
  • Use of ICT in Course Teaching
Course Organization
ActivitiesWorkloadECTSIndividualTeamworkErasmus
Lectures391.3
Reading Assigment481.6
Written assigments602
Exams30.1
Other / Others
Total1505
Student Assessment
Description
Written exams on the covered material (book, lecture notes, presentations, exercises). Comprehension theoretical/programming exercises whose grade is additive to the grade of the final exams.
Student Assessment methods
  • Written Exam with Short Answer Questions (Summative)
  • Written Exam with Extended Answer Questions (Summative)
  • Performance / Staging (Formative, Summative)
  • Written Exam with Problem Solving (Formative, Summative)
Bibliography
Course Bibliography (Eudoxus)
1. Michael Sipser. Εισαγωγή στην Θεωρία Υπολογισμού. Πανεπιστημιακές Εκδόσεις Κρήτης, 2007. 2. J. Kleinberg and E. Tardos. Algorithm Design. Addison-Wesley, 2005.
Additional bibliography for study
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein: Εισαγωγή στους Αλγόριθμους, Πανεπιστημιακές Εκδόσεις Κρήτης, 2012.
Last Update
08-06-2016