Contents:

• Introduction to algorithmic problem solving and description of algorithms
• Verification of algorithms correctness
• Analysis of algorithms efficiency
• Linear data structures
• Elementary sorting methods
• "Decrease and conquer" and "Divide and conquer" techniques. Recursivity. Applications and efficiency analysis
• Greedy technique. Applications

Prerequisites:

none

Course materials (in Romanian):

Curs 1-2 (4.10.2016, 11.10.2016):   Introducere in rezolvarea algoritmica a problemelor. Descrierea algoritmilor.  ( material curs, introducere, prezentare curs 1, prezentare curs 2)
Curs 3 (18.10.2016):   Verificarea corectitudinii algoritmilor.  ( material curs, prezentare curs 3)
Curs 4-5 (25.10.2016, 1.11.2016):   Analiza eficientei algoritmilor.  ( material curs, prezentare curs 4, prezentare curs 5)
Curs 6 (8.11.2016): Analiza metodelor de sortare (material curs, prezentare curs 6)
Curs 7-8 (15.11.2016, 22.11.2016): Structuri liniare de date (prezentare curs 7, prezentare curs 8)
Curs 9 (29.11.2016): Tehnica reducerii (material curs, prezentare curs 9)
Curs 10-11 (6.12.2016, 13.12.2016): Tehnica divizarii (material curs, prezentare curs 10, prezentare curs 11)
Curs 12 (20.12.2016) : Tehnica alegerii local optimale (greedy) (material curs, prezentare curs 12)
Curs 13 (10.01.2017) : Tehnici de parcurgere a spatiului solutiilor (backtracking) (material curs, prezentare curs 13)
Curs 14 (17.01.2017) : Recapitulare (Exemple subiecte examen scris )

Additional problems & solutions (in Romanian):

Set 1
Set 2
Set 3
Set 5
Set 6
Set 7

Bibliography:

• M.T. Goodrich, R. Tamassia, M.H. Goldwasser – Data Structures & Algorithms in Python, Wiley 2013
• 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.
• A. Levitin; Introduction to the design and analysis of algorithms, Pearson Education, third edition, 2012.
• D. Lucanu, M. Craus; Proiectarea algoritmilor, Ed. Polirom, 2008.
• S. Skiena – The Algorithm Design Manual, Sringer, second edition, 2008.

Go back to index