Calendar
September
| Monday | Tuesday | Wednesday | Tuesday | Friday |
|---|---|---|---|---|
| 22 | 23 | 24 1st Class: Syllabus.Introduction - Basic concepts on algorithms and data structures - Proof techniques (Use of example or counterexample, proof by contradiction, mathematical induction) - RAM model. | 25 2nd Class: Analysis of algorithms - Time complexity - Asymptotic analysis (in terms of Ο, Ω, Θ) - Standard complexity classes | 26 |
| 29 1st Assisting Class: Programming with pointers in C. 1st Assignment out. | 30 |
October
| Monday | Tuesday | Wednesday | Tuesday | Friday |
|---|---|---|---|---|
| 01 3rd Class: Mathematical background - recursive algorithms and their analysis - Recursive relations - Experimental analysis | 02 4th Class: Arrays | 03 | ||
| 06 2nd Assisting Class: Discussion of the 1st assignment - Solution of related exercises. | 07 | 08 5th Class: Stacks - Introduction to queues | 09 6th Class: Queues - Lists - Zig-Zag traversal | 101st assignment due. |
| 13 3rd Assisting Class: Solution of the 1st assignment. 2nd assignment out. | 14 | 15 7th Class: Double linked list - Amortized analysis | 16 8th Class: Trees | 17 |
| 20 4o Φροντιστήριο: Discussion of the 2nd assignment - Solution of related exercises. | 21 | 22 9th Class: Trees | 23 10th Class: Implementing Dictionaries | 24 |
| 27 5th Assisting Class: Discussion of the 1st part of the project. 2nd assignment due. | 28 | 29 11th Class: Sotred binary trees | 30 12th Class: Balanced Trees - AVL trees | 31 |
November
| Monday | Tuesday | Wednesday | Tuesday | Friday |
|---|---|---|---|---|
| 03 6th Assisting Class: Solution of the 2nd assignment. 3rd assignment out. | 04 | 05 13th Class: Balanced Trees - Red black trees | 06 14th Class: Balanced trees - (2,3)-TreesΔένδρα - (2,3)-Δένδρα | 07Due for the 1st part of the project. |
| 10 7th Assisting Class: Discussion of the 3rd assignment - Solution of related exercises. Examination of the 1st part of the project. | 11 | 12 15th Class: Hashing | 13 16th Class: Hashing | 143rd assignment due. |
| 17 8th Assisting Class: Solution of the 3rd assignment. 4th assignment out. | 18 | 19 17th Class: Hashing | 20 18th Class: Set with special operations - Priority queues | 21 |
| 24 9th Assisting Class: Discussion of the 4th assignment - Solution of related exercises. | 25 | 26 19th Class: Sorting | 27 20th Class: Sorting | 284th assignment due. |
December
| Monday | Tuesday | Wednesday | Tuesday | Friday |
|---|---|---|---|---|
| 01 10th Assisting Class: Discussion of the 2nd part of the project. | 02 | 03 21th Class: Soring | 04 22th Class: Graphs | 05 |
| 08 11th Assisting Class: Solution of the 4th assignment 5th assignment due. | 09 | 10 23th Class: Graphs | 11 24th Class: Graphs | 12Due for the 2nd part of the project. |
| 15 12th Assisting Class: Discussion of the 5th assignment - Solution of related exercises. Examination of the 2nd part of the project. | 16 | 17 25th Class: Techniques of algorithm design | 18 26th Class: Techniques of algorithm design | 195th assignment due. |
| 22 13th Assisting Class: Discussion of the last part of the project. | 23 | 24 | 25 | 26 |
January
| Monday | Tuesday | Wednesday | Tuesday | Friday |
|---|---|---|---|---|
| 05 14th Assisting Class: Solution of the 5th assignment | 06Project due | 07 | 08Deadline of delivery of 2nd part of project. The course did not take place because of G.S. of students | 09Deadline of delivery of 5th set of exercises. |
| 12Examination of second phase of project | 13 | 14Deadline of delivery of 3rd part of project Course Closure of matter - Discussion on the final test - Small Repetition - Evaluation of course (short open discussion with students) | 15 | 16 |