Title  ΑΛΓΟΡΙΘΜΟΙ ΚΑΙ ΔΟΜΕΣ ΔΕΔΟΜΕΝΩΝ / File Structures 
Code  0464 
Faculty  Sciences 
School  Mathematics 
Cycle / Level  1st / Undergraduate 
Teaching Period  Winter 
Common  No 
Status  Active 
Course ID  40000488 
Programme of Study: UPS of School of Mathematics (2014today)
Registered students: 124
Orientation  Attendance Type  Semester  Year  ECTS 

Core  Elective Courses  Winter    5 
Academic Year  2019 – 2020 
Class Period  Winter 
Instructors from Other Categories 

Weekly Hours  3 
Class ID  600147610

Course Category
Knowledge Deepening / Consolidation
Mode of Delivery
 Face to face
Digital Course Content
 eStudy Guide https://qa.auth.gr/en/class/1/600147610
 eLearning (Moodle): https://elearning.auth.gr/course/view.php?id=10454
Erasmus
The course is also offered to exchange programme students.
Language of Instruction
 Greek (Instruction, Examination)
Prerequisites
Required Courses
 0401 Theoretical Informatics I
 0430 Introduction to Computer Programming
General Prerequisites
Understanding of introductory programming concepts. Understanding of the theoretical approach and description of phenomena and processes we encounter in Computer Science.
Learning Outcomes
Upon successful completion of the course, students will be able to:
1. Understand the concept of data structure as a model for capturing and managing information.
2. Understand the concept of the algorithm as a method for solving a problem and the features that an algorithm must have (finite number of steps, clearly formulated instructions at each step, existence of inputoutput data, uniqueness of results of each step).
3. Understand how the basic mathematical features of each structure relate to the design of algorithms that require their management.
4. Understand the concept of complexity analysis of algorithms and create an initial understanding of how to successfully determine the complexity of an algorithm in a theoretical way.
5. Understand the importance of data structures and algorithms.
General Competences
 Apply knowledge in practice
 Retrieve, analyse and synthesise data and information, with the use of necessary technologies
 Adapt to new situations
 Make decisions
 Work autonomously
 Work in teams
 Work in an international context
 Work in an interdisciplinary team
 Be critical and selfcritical
 Advance free, creative and causative thinking
Course Content (Syllabus)
Introduction to algorithms  Problem Complexity and its measures  Search algorithms  Selection algorithms  Sorting algorithms  Hashing  Data Structures and Operations  Arrays  Lists  Stacks  Queues  Trees  Heaps  Graphs
Keywords
Algorithms, Complexity, Data Structures
Educational Material Types
 Notes
 Book
Course Organization
Activities  Workload  ECTS  Individual  Teamwork  Erasmus 

Lectures  37  1.2  ✓  
Reading Assigment  110  3.7  ✓  
Exams  3  0.1  ✓  
Total  150  5 
Student Assessment
Description
Final written examination
Student Assessment methods
 Written Exam with Short Answer Questions (Formative)
 Written Exam with Problem Solving (Formative, Summative)
Bibliography
Course Bibliography (Eudoxus)
 Δομές Δεδομένων, Π. Μποζάνης.
 Δομές Δεδομένων, Αλγόριθμοι και Εφαρμογές στη C++, S. Sahni.
Additional bibliography for study
 Εισαγωγή στους Αλγόριθμους, T.H. Cormen, C.E. Leiserson, R.L. Rivest & C. Stein.
 Αλγόριθμοι – Ανάλυση και σύγκριση, G.J.E. Rawlins.
Last Update
15032020