Contents:

• Introduction to algorithmic problem solving and description of algorithms
• Verification of algorithms correctness
• Analysis of algorithms efficiency
• Elementary sorting methods
• "Decrease and conquer" and "Divide and conquer" techniques. Recursivity. Applications and efficiency analysis
• Greedy technique. Applications
• Dynamic programming technique. Applications
• Backtracking technique. Applications
• Branch and bound technique. Applications

Prerequisites:

none

Course materials (in romanian):

Curs 1-2 (7.10.2008, 14.10.2008):   Introducere in algoritmica. Descrierea algoritmilor.  ( material curs, prezentare, introducere)
Curs 3 (21.10.2008) : Verificarea corectitudinii algoritmilor (material curs )
Curs 4-5 (28.10.2008, 4.11.2008) : Analiza eficientei algoritmilor (material curs )
Curs 6 (7.11.2008) : Analiza algoritmilor de sortare (material curs )
Curs 7 (14.11.2008) : Tehnici de elaborare a algoritmilor. Tehnica reducerii.Analiza algoritmilor recursivi. (material curs )
Curs 8-9 (21.11.2008,28.11.2008) : Tehnici de elaborare a algoritmilor. Tehnica divizarii. Sortare prin interclasare si sortare rapida (material curs )
Curs 10 (2.12.2008) : Tehnica alegerii local optimale (greedy) (material curs )
Curs 11-12 (9.12.2008,16.12.2008) : Tehnica programarii dinamice (material curs )
Curs 13-14 (6.01.2009,13.01.2009) : Tehnici de parcurgere a spatiului solutiilor (backtracking si branch and bound) (material curs )

Seminar:

Seminar 1
Seminar 2
Seminar 3
Seminar 4
Seminar 5
Seminar 6
Seminar 7: recapitulare
Seminar 8: verificare
Seminar 9
Seminar 10
Seminar 11
Seminar 12
Seminar 13
Seminar 14

Bibliography:

• T.H. Cormen, C.E.Leiserson, R.R. Rivest– Introducere in algoritmi, Mit Press 1990, trad. Computer Libris Agora.
• V. Cretu – Structuri de date si algoritmi, vol. 1, ed. Orizonturi Universitare, 2000.
• D. Lucanu, M. Craus; Proiectarea algoritmilor, Ed. Polirom, 2008.
• C. Giumale, L. Negreanu, S. Calinoiu – Proiectarea si analiza algoritmilor. Algoritmi de sortare, 1996.

Go back to index