Algorithm Engineering (MAE844): Διαφορά μεταξύ των αναθεωρήσεων
Από Wiki Τμήματος Μαθηματικών
Χωρίς σύνοψη επεξεργασίας |
|||
Γραμμή 117: | Γραμμή 117: | ||
=== Attached Bibliography === | === Attached Bibliography === | ||
See [https://service.eudoxus.gr/public/departments#20 Eudoxus]. Additionally: | |||
* K. Mehlhorn and S. Naeher, LEDA: A platform for combinatorial and geometric computing, Cambridge University Press, 1999. | * K. Mehlhorn and S. Naeher, LEDA: A platform for combinatorial and geometric computing, Cambridge University Press, 1999. | ||
* M. Mueller-Hannemanni and S. Schirra, Algorithm Engineering - Bridging the Gap between Algorithm Theory and Practice, Springer 2010. | * M. Mueller-Hannemanni and S. Schirra, Algorithm Engineering - Bridging the Gap between Algorithm Theory and Practice, Springer 2010. |
Αναθεώρηση της 17:18, 23 Ιουλίου 2022
Undergraduate Courses Outlines - Department of Mathematics
General
School |
School of Science |
---|---|
Academic Unit |
Department of Mathematics |
Level of Studies |
Undergraduate |
Course Code |
MAE844 |
Semester |
8 |
Course Title |
Algorithm Engineering |
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) | - |
Learning Outcomes
Learning outcomes |
This course aims at introducing to students the concepts , techniques, properties, developments and applications of basic and advanced algorithms and data structures.
|
---|---|
General Competences |
|
Syllabus
- Introduction to algorithm engineering
- Methodology of Algorithm Engineering: motivation, applications, software systems
- System checking
- Software reliability and correctness
- STL and Generalized programming
- Experimental evaluation of algorithms
Teaching and Learning Methods - Evaluation
Delivery |
Lectures | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Use of Information and Communications Technology |
| ||||||||||
Teaching Methods |
| ||||||||||
Student Performance Evaluation |
|
Attached Bibliography
See Eudoxus. Additionally:
- K. Mehlhorn and S. Naeher, LEDA: A platform for combinatorial and geometric computing, Cambridge University Press, 1999.
- M. Mueller-Hannemanni and S. Schirra, Algorithm Engineering - Bridging the Gap between Algorithm Theory and Practice, Springer 2010.
- C.C. McGeoch, A Guide to Experimental Algorithmics, Cambridge University Press, 2012.
- J. Siek, L.Q. Lee, and A. Lumsdaine, The Boost Graph Library, Addison-Wesley, 2002.
- M.A. Weiss, Data structures and problem solving with C++, 2 Edition, Addison-Wesley, 2000.