Data Structures
| Title | Δομές Δεδομένων / Data Structures |
| Code | 017 |
| Faculty | Engineering |
| School | Electrical and Computer Engineering |
| Cycle / Level | 1st / Undergraduate |
| Teaching Period | Winter |
| Coordinator | Stavroula Siachalou |
| Common | Yes |
| Status | Active |
| Course ID | 600000965 |
Programme of Study: Electrical and Computer Engineering
Registered students: 468
| Orientation | Attendance Type | Semester | Year | ECTS |
|---|---|---|---|---|
| CORE | Compulsory Course | 3 | 2 | 5 |
| Academic Year | 2022 – 2023 |
| Class Period | Winter |
| Instructors from Other Categories | |
| Weekly Hours | 5 |
| Class ID | 600218020
|
Course Type 2016-2020
- Background
Course Type 2011-2015
General Foundation
Mode of Delivery
- Face to face
Digital Course Content
- e-Study Guide https://qa.auth.gr/en/class/1/600218020
- eLearning: https://elearning.auth.gr/course/view.php?id=10540
Language of Instruction
- Greek (Instruction, Examination)
- English (Examination)
Prerequisites
General Prerequisites
Students are encouraged to have completed the courses:
a. Structured Programming,
b. Programming Techniques, and
c. Computer Architecture
before they register for this class.
Learning Outcomes
Upon successful completion of the course, students must be able to:
a) Understand and use the concept of data structure as a building block of programming code
b) Choose the right data structure(s) for their application, use it, and analyze it appropriately.
c) Use and evaluate the basic algorithms for searching, hashing, and sorting.
d) Develop medium-size applications in Java.
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
- Be critical and self-critical
- Advance free, creative and causative thinking
Course Content (Syllabus)
Introductory course on Data Structures and on basic types of Algorithms. The course builds on earlier programming courses and aims to help the students strengthen their understanding of software development techniques and improve their programming skills.
Topics covered within the context of the course:
• Data and information. Data structure, algorithm and complexity.
• Introduction to Java.
• Arrays. Linked and sequential linear lists.
• Trees: Methods for storing, accessing, inserting and deleting elements in a tree. Balanced trees. B-trees. Applications.
• Heaps
• Searching Algorithms. Text search.
• Hashing Algorithms
• Sorting Algorithms
Keywords
Data structures, Algorithms, Algorithmic Complexity, Java programming, Tables, Lists, Trees, Heaps, Searching, Hashing, Sorting
Educational Material Types
- Notes
- Slide presentations
- Multimedia
- Interactive excersises
- 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
- Use of ICT in Student Assessment
Description
The course teaches the students software development techniques. Naturally, ICT is used widely and in every aspect of the course.
Course Organization
| Activities | Workload | ECTS | Individual | Teamwork | Erasmus |
|---|---|---|---|---|---|
| Lectures | 48 | 1.6 | ✓ | ||
| Laboratory Work | 18 | 0.6 | ✓ | ✓ | ✓ |
| Tutorial | 24 | 0.8 | ✓ | ✓ | ✓ |
| Project | 36 | 1.2 | ✓ | ✓ | |
| Exams | 24 | 0.8 | ✓ | ✓ | |
| Total | 150 | 5 |
Student Assessment
Description
Written or electronic final exam 80%
Programming Project in groups of 2 students 20%
(three assignments of increasing complexity)
Through the project, students are asked to develop a simple computer game and they can participate in a class tournament. Winners receive extra points.
Students are strongly encouraged to work in the course project in order to better comprehend the Data Structures concepts and improve their programming skills.
Student Assessment methods
- Written Exam with Multiple Choice Questions (Formative, Summative)
- Written Exam with Short Answer Questions (Formative, Summative)
- Written Exam with Extended Answer Questions (Formative, Summative)
- Written Assignment (Formative, Summative)
- Written Exam with Problem Solving (Formative, Summative)
- Report (Summative)
- Labortatory Assignment (Formative, Summative)
Bibliography
Course Bibliography (Eudoxus)
1. Δομές Δεδομένων & Αλγόριθμοι στη Java, 2η έκδοση, Robert Lafore, Εκδόσεις Γκιούρδας, 2005. ISBN: 960-512-452-1, ΚΩΔ.ΕΥΔ.: 12279 (ελληνική μετάφραση)
2. Δομές Δεδομένων, Π. Μποζάνης, 1η έκδοση, Εκδόσεις Τζιόλας, 2006.
ISBN : 960-418-084-3, ΚΩΔ.ΕΥΔ.: 9322
3. Δομές Δεδομένων: Έννοιες, Τεχνικές, Αλγόριθμοι, Γ.Φ. Γεωργακόπουλος, Πανεπιστημ. Εκδόσεις Κρήτης, 2011. ISBN : 978-960-524-125-4, ΚΩΔ.ΕΥΔ.: 260
Additional bibliography for study
Υπάρχει πληθώρα τίτλων στην αγγλική (Data Structures and Algorithms).
Last Update
15-01-2021
