Design and Analysis of Algorithms (MAE581): Διαφορά μεταξύ των αναθεωρήσεων
Από Wiki Τμήματος Μαθηματικών
Γραμμή 48: | Γραμμή 48: | ||
|- | |- | ||
! Course Website (URL) | ! Course Website (URL) | ||
| | | See [https://ecourse.uoi.gr/ eCourse], the Learning Management System maintained by the University of Ioannina. | ||
|} | |} | ||
=== Learning Outcomes === | === Learning Outcomes === | ||
{| class="wikitable" | {| class="wikitable" |
Αναθεώρηση της 12:41, 13 Αυγούστου 2022
Undergraduate Courses Outlines - Department of Mathematics
General
School |
School of Science |
---|---|
Academic Unit |
Department of Mathematics |
Level of Studies |
Undergraduate |
Course Code |
MAE641 |
Semester |
6 |
Course Title |
Design and Analysis of Algorithms |
Independent Teaching Activities |
Lectures, laboratory exercises, tutorials, quiz (Weekly Teaching Hours: 3, Credits: 6) |
Course Type |
Special Background |
Prerequisite Courses | - |
Language of Instruction and Examinations |
Greek |
Is the Course Offered to Erasmus Students |
Yes |
Course Website (URL) | See eCourse, the Learning Management System maintained by the University of Ioannina. |
Learning Outcomes
Learning outcomes |
This course aims at introducing to students the philosophy of fundamental algorithmic background and techniques. After successfully passing this course the students will be able to:
|
---|---|
General Competences |
|
Syllabus
- Fundamental concepts of design and analysis of algorithms
- Analysis of algorithms, Asymptotical growing functions
- Typical running times and data structures (lists, arrays, queues, stacks)
- Stable matching, correctness, priority queue
- «Divide & Conquer» technique, sorting, recursive formulations
- Graph algorithms: BFS, DFS, connectedness, topological ordering
- Greedy algorithms: interval scheduling & shortest paths (Dijkstra)
- Minimum spanning trees(Prim & Kruskal algorithms), Huffman coding
- Dynamic programming: maximum flow, interval scheduling, and Knapsack
- Further Topics: computational complexity and ΝΡ-completeness.
Teaching and Learning Methods - Evaluation
Delivery |
Lectures | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Use of Information and Communications Technology |
| ||||||||||
Teaching Methods |
| ||||||||||
Student Performance Evaluation |
Final written examination (70%)
Exercises (30%)
|
Attached Bibliography
See the official Eudoxus site or the local repository of Eudoxus lists per academic year, which is maintained by the Department of Mathematics.