Data Structures and Analysis of Algorithms

General

• Course Code: 1305
• Semester: 3rd
• Course Type: Scientific Area (SA)
• Course Category: Compulsory (CO)
• Scientific Field: Programming and Algorithms (PA)
• Lectures: 4 hours/week
• ECTS units: 6
• Course webpage: https://exams-iee.the.ihu.gr/course/view.php?id=81
• Teching and exams language: Greek
• Recommended prerequisite courses: (1102) Structured Programming, (1205) Object Oriented Programming
• Coordinator: Ougiaroglou Stefanos
• Instructors: Ougiaroglou Stefanos, Asdre Katerina

Educational goals

The course is a general introduction to data structures, the algorithms that handle them, and their complexity analysis. The topics covered relate to both static and dynamic data structures. The course places particular emphasis on techniques of data abstraction and object-based programming. Java is currently used as the implementation language. Upon completion of the course students:

• will have a very good knowledge of the underlying data structures
• will be able to use data structures to implement well designed and efficient programs.
• will have an understanding of the concepts of abstraction, abstract data types and object orientation and the role they play in the development of programming systems
• will be able to apply Recursion as a Programming Methodology
• will have substantive knowledge of Object Oriented Programming techniques using Java in developing Algorithms and Data Structures
• will be able to analyze the complexity of the programs they are developing

General Skills

• Search, analyze and synthesize data and information, using the necessary technologies
• Independent work
• Teamwork

Course Contents

Teaching Methods - Evaluation

Teaching Method

• Face to face theoretical teaching (lectures, discussion, problem solving, practice exercises).

Use of ICT means

• Use of slide show presentation software.
• Using an online learning platform (moodle).
• Use Object-oriented Java programming language
• Using an integrated software development environment (eg Netbeans)

Teaching Organization

Students evaluation

Final Written Examination (100% of the score) that includes:
- Short Answer Questions
- Multiple choice tests
- Problem solving

Recommended Bibliography

Recommended Bibliography through "Eudoxus"

1. (Ελληνικά) Michael Goodrich & Roberto Tamassia. “Data Structures and Algorithms in Java”, 4th Edition, Addison-Wesley (2006). Κυκλοφορεί μετάφρασή του στα Ελληνικά: Δομές Δεδομένων & Αλγόριθμοι σε JAVA (Κωδ στον «Εύδοξο» 32997672)
2. Robert Sedgewick. "Algorithms in Java, Parts 1-4 : Fundamentals, Data Structures, Sorting, Searching", 3rd Edition, Addison-Wesley (2003). Κυκλοφορεί μετάφρασή του στα Ελληνικά: Αλγόριθμοι σε JAVA (Κωδ. στον «Εύδοξο» 13586)

Complementary greek bibliography

1. (Ελληνικά) Λουκάς Γεωργιάδης, Σταύρος Νικολόπουλος και Λεωνίδας Παληός. «Δομές δεδομένων». Ηλεκτρονικό βιβλίο, ΕΛΛΗΝΙΚΑ ΑΚΑΔΗΜΑΪΚΑ ΣΥΓΓΡΑΜΜΑΤΑ https://repository.kallipos.gr/handle/11419/6217
2. Δομές Δεδομένων με Java, Σταμάτης Δημοσθένης, Σημειώσεις διαλέξεων του μαθήματος

Complementary international bibliography

1. “Data Structures and Algorithms in Java”, Michael Goodrich & Roberto Tamassia, 4th Edition, Addison-Wesley (2006)
2. "Algorithms in Java, Parts 1-4 : Fundamentals, Data Structures, Sorting, Searching", Robert Sedgewick, 3rd Edition, Addison-Wesley (2003)
3. “Data Structures and Algorithms in Java”, Robert Lafore, 2nd Edition, SAMS (200? )