A. I. Cuza University of IaşiDesign and Analysis of Algorithms
| Course name | Design and Analysis of Algorithms | Code | CS3101 |
| Class | Computer Science, 2005 - 2008 | ||||||
| Level | Undergraduate | Year | 3 | Semester | 1 | Status | Compulsory |
| Hours per week | Total hours per semester | Total hours of individual work | Credits | Evaluation type | Teaching language | |||
| C | S | L | Pr | |||||
| 2 | 2 | 0 | 0 | 56 | 94 | 5 | M | ro |
| Taught by | Academic and scientific title, name |
|
Professor, PhD,
Dorel Lucanu
|
| Required courses |
| Objectives | The purpose of this course is to give a good understanding of algorithm design and analysis and to present the main algorithmic paradigms. |
| General thematics | Run time and space of algorithms. Sorting. Searching. Algorithms on graphs. String matching. Greedy algorithms. Divide-et-impera paradigm. Dynamic programming paradigm. Backtracking paradigm. NP-complete problems. Aproximation algorithms. |
| Seminary / Laboratory thematics | Examples and discussions helping the understanding of the algorithms, applications of the algorithms, discussions regarding the efficient implementation of the algorithms, new case-studies, problem solving using algorithms. |
| Teaching methods | Transparences and video projector. The focus is on the understanding of the concepts and algorithms. There are electronic notes for all lectures accessible from the web page of the course. |
| Bibliography | T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to Algorithms, MIT Press, 1990. T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introducere în Algoritmi,Computer Libris Agora, 2000. D. Lucanu: Bazele proiectării programelor şi algoritmilor, Universitatea "Al. I. Cuza", Iaşi, 1996. L. Livovshi, H. Georgescu: Sinteza şi analiza algoritmilor, Ed. Ştiinţifică şi enciclopedică, 1986. |
| Evaluation | conditions | seminar activity (minim 50% participation), at least one homework, written test |
| criterias | the average obtained at home works: minim 5 written test: minim 4 | |
| modes | seminar activity: questions, participation at discussions, proposals of new related discussion issues home works: there are 2 home works (weeks 5,10) presented as individual projects written test: includes questions covering all taught issues bonus: each original solution or investigation of strong related problems can contribute with maximum 10% at the final evaluation | |
| formula | 10% seminar activity + 40% home works + 50% written test + bonus |