Algorithmics
Overview:
This is a one-semester course for the first year students of the
Computer Science section. The aim of the course is to present the basic
concepts of the algorithms design and analysis.
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: Introducere in algoritmica. Descrierea algoritmilor.
( material curs, prezentare, introducere)
Curs 3
: Verificarea corectitudinii algoritmilor
(material curs )
Curs 4-5
: Analiza eficientei algoritmilor (material curs )
Curs 6
: Analiza algoritmilor de sortare (material curs )
Curs 7
: Tehnici de elaborare a algoritmilor. Tehnica reducerii.Analiza algoritmilor recursivi. (material curs )
Curs 8-9
: Tehnici de elaborare a algoritmilor. Tehnica divizarii. Sortare prin interclasare si sortare rapida (material curs )
Curs 10
: Tehnica alegerii local optimale (greedy) (material curs )
Curs 11-12
: Tehnica programarii dinamice (material curs )
Curs 13-14
: Tehnici de parcurgere a spatiului solutiilor (backtracking si branch and bound) (material curs )
Seminar/ Laborator:
Seminar 1
Seminar 2
Seminar 3
Seminar 4: test
Seminar 5
Seminar 6
Seminar 7
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