Course Information
Cycle / Level1st / Undergraduate
Teaching PeriodSpring
CoordinatorApostolos Papadopoulos
Course ID40002920

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

Registered students: 688
OrientationAttendance TypeSemesterYearECTS
GENIKĪ KATEUTHYNSĪCompulsory Course217

Class Information
Academic Year2019 – 2020
Class PeriodSpring
Faculty Instructors
Weekly Hours6
Class ID
Course Type 2016-2020
  • Background
  • Scientific Area
Course Type 2011-2015
Specific Foundation / Core
Mode of Delivery
  • Face to face
Language of Instruction
  • Greek (Instruction, Examination)
General Prerequisites
Basic C++ programming.
Learning Outcomes
Knowledge: After the completion of the course, students will be familiar with fundamental data structures for main memory and how these are used by algorithms to solve problems. Skills: Moreover, students have to implement some data structures and algorithms in the C++ programming language in order to solve specific problems. In addition, the lab exercises strengthen even more the abilities of students.
General Competences
  • Apply knowledge in practice
  • Retrieve, analyse and synthesise data and information, with the use of necessary technologies
  • Make decisions
  • Work autonomously
  • Work in teams
  • Advance free, creative and causative thinking
Course Content (Syllabus)
The basic target of this course is the study of fundamental data structures and algorithms. More specifically, this study contains some theoretical issues as well as their practical applications. In particular, we study arrays, lists, stacks, queues and priority queues, search trees, hashing, graphs as well as searching, sorting, shortest paths and many fundamental algorithms that are based on these data structures.
data structures, basic algorithms, C++
Educational Material Types
  • Slide presentations
  • Book
Use of Information and Communication Technologies
Use of ICT
  • Use of ICT in Course Teaching
  • Use of ICT in Laboratory Teaching
  • Use of ICT in Communication with Students
Course Organization
Written assigments30
Student Assessment
Student evaluation is based on both written exams, the assignment and the lab exercises. The assignment is usually undertaken by teams of 2 or 3 students and it involves the implementation in C++ of data structures and algorithms to solve specific practical problems.
Student Assessment methods
  • Written Exam with Short Answer Questions (Formative, Summative)
  • Written Assignment (Formative, Summative)
  • Report (Formative, Summative)
  • written examination (Formative, Summative)
Course Bibliography (Eudoxus)
"Δομές Δεδομένων, Αλγόριθμοι και Εφαρμογές στη C++", S. Sahni, Μετάφραση Ι. Μανωλόπουλος και Ι. Θεοδωρίδης, Εκδόσεις Τζιόλα, 2004. Στην ιστοσελίδα του μαθήματος δίνονται επίσης επιπλέον σημειώσεις και σύνδεσμοι για συγκεκριμένα θέματα, για την καλύτερη κατανόηση των εννοιών. Π. Μποζάνης. Αλγόριθμοι: Σχεδιασμός και Ανάλυση. Εκδόσεις Τζιόλα, Θεσσαλονίκη, 2003. Γ.Φ. Γεωργακόπουλος. Δομές Δεδομένων , Έννοιες, Τεχνικές και Αλγόριθμοι. Πανεπιστημιακές Εκδόσεις Κρήτης
Additional bibliography for study
Δομές Δεδομένων, T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to Algorithms (2nd Edition). The MIT Press, 2003. K. Mehlhorn. Data Structures and Algorithms. Springer Verlag, EATCS Monographs, 1984.
Last Update