DATA STRUCTURES

Course Information
TitleΔΟΜΕΣ ΔΕΔΟΜΕΝΩΝ / DATA STRUCTURES
CodeNCO-02-03
FacultySciences
SchoolInformatics
Cycle / Level1st / Undergraduate
Teaching PeriodSpring
CoordinatorApostolos Papadopoulos
CommonYes
StatusActive
Course ID40002920

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

Registered students: 340
OrientationAttendance TypeSemesterYearECTS
Core CoursesCompulsory Course217

Class Information
Academic Year2015 – 2016
Class PeriodSpring
Faculty Instructors
Weekly Hours6
Class ID
600004957
Type of the Course
  • Background
  • Scientific Area
Course Category
Specific Foundation / Core
Mode of Delivery
  • Face to face
Digital Course Content
Language of Instruction
  • Greek (Instruction, Examination)
Prerequisites
General Prerequisites
Basic C++ programming.
Learning Outcomes
After the course, students will be familiar with fundamental data structures for main memory and how these are used by algorithms to solve problems. Moreover, students have to implement some data structures and algorithms in the C++ programming language in order to solve specific problems.
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.
Keywords
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
ActivitiesWorkloadECTSIndividualTeamworkErasmus
Lectures1204
Project602
Written assigments301
Total2107
Student Assessment
Description
Student evaluation is based on both written exams and the assignment usually using a 50%-50% rule, according to difficulty. 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 problems.
Student Assessment methods
  • Written Exam with Short Answer Questions (Formative, Summative)
  • Written Assignment (Formative, Summative)
  • Report (Formative, Summative)
  • written examination (Formative, Summative)
Bibliography
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
24-09-2015