Algorithms and Data Structures (I)

Algorithms and Data Structures I

Overview | Contents | Prerequisites | Course materials (in romanian)|Bibliography

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 and fundamental data structures.

Introduction to algorithmic problem solving and description of algorithms
Verification of algorithms correctness
Analysis of algorithms efficiency
Elementary sorting methods
Linear data structures
"Decrease and conquer" and "Divide and conquer" techniques. Recursive algorithms. Applications and efficiency analysis
Greedy technique. Applications
Dynamic Programming. Applications
Systematic search by backtracking. Applications

Prerequisites:

none

Course materials (in Romanian):

Curs 1-2 (1.10.2019, 8.10.2019): Introducere in rezolvarea algoritmica a problemelor. Descrierea algoritmilor. ( material curs, introducere, prezentare curs 1, prezentare curs 2)
Curs 3 (15.10.2019): Verificarea corectitudinii algoritmilor. ( material curs, prezentare curs 3)
Curs 4-5 (18.10.2019, 22.10.2019): Analiza eficientei algoritmilor. ( material curs, prezentare curs 4, prezentare curs 5)
Curs 6 (29.10.2019): Analiza metodelor de sortare (material curs, prezentare curs 6)
Curs 7 (1.11.2019): Tehnica reducerii (material curs, prezentare curs 7)
Curs 8-9 (12.11.2019, 19.11.2019): Tehnica divizarii (material curs, prezentare curs 8, prezentare curs 9)
Curs 10 (3.12.2019) : Tehnica alegerii local optimale (greedy) (material curs, prezentare curs 10)
Curs 11-12 (10.12.2019, 17.12.2019) : Programare dinamica (material curs, prezentare curs 11, prezentare curs 12)
Curs 13 (7.01.2020) : Tehnici de parcurgere a spatiului solutiilor (backtracking) (material curs, prezentare curs 13)
Curs 14 (14.01.2020) : Recapitulare (Exemple subiecte examen scris )

Seminar (in Romanian):

Seminar 1
Seminar 2
Seminar 3
Seminar 4
Seminar 5
Seminar 6
Seminar 7
Test - example
Seminar 9
Seminar 10
Seminar 11
Seminar 12
Seminar 13
Seminar 14

Homework (in Romanian):

Homework 1 - test: 4-8.11.2019
Homework 2 - test: 2-6.12.2019
Homework 3 - test: 6-10.01.2020

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