Académique Documents
Professionnel Documents
Culture Documents
Operating with basic concepts of computer science, information technology and communication
Professional
N/A
competences
Cross
8. Contents
8.1. Lecture (syllabus) Teaching methods Notes
Administrative. Phases in Problem solving: analysing,
1.
design, implementation, tests. Algorithms performance.
2. Lists ADT. Stack. Queue. CRUD operation on lists.
Internal sorting algorithms: bubble sort, selection sort,
3. Slide based
insertion sort, merge sort
presentation and
Internal sorting algorithms (cont.): quicksort, shell sort,
4. algorithms trace
radix sort, counting sort, bucklet sort, etc
by example
Trees ADT. Representation and traversals: preorder,
5. postorder, inorder. Binary Search Trees. CRUD operation
on trees. Arbitrary trees. AVL trees.
6. Sets. Basic operations on sets. 2-3 and 2-3-4 trees. Priority
queues, heaps.
Hash table. Hash functions. Collision. Open addressing and
7.
chaining.
Graphs. Representation and traversals: DTS/BFS. CRUD
8. operations on graphs. Directed graphs. Algorithms for
shortest path (Dijkstra, Floyd)
Directed graphs. Algorithms for shortest path (Dijkstra,
9.
Floyd)
Undirected graphs. Traversals: DFS/BFS. Minimum cost
10.
spanning trees (Prim, Kruskal). Articulation point.
Algorithm Design: divide et impera, recursivity, dynamic
11.
programming.
12. Algorithm Design: brute force algorithms. greedy
13. Algorithm Design: backtracking, minimax algorithms.
Another type of computing: Grid computing vs. Cloud
14.
computing. Review of the subject..
Bibliography
1. IGNAT Iosif, IGNAT Claudia-Lavinia - Structuri de date si algoritmi, An aparitie: 2007 Cota
527.366
2. IGNAT Iosif, IGNAT Claudia-Lavinia - Structuri de date si algoritmi : indrumator de lucrari
de laborator, An aparitie: 2001 Cota 506.016
3. JOLDOS Marius, IGNAT Iosif - Data structures and algorithms : laboratory guide, An
aparitie: 2003 Cota 509.111
4. IGNAT Iosif, IGNAT Claudia-Lavinia - Programarea calculatoarelor : descrierea algoritmilor
si fundamentele limbajului C/C++ , An aparitie: 2002 Cota 508.311
5. CRAUS Mitica, BARSAN Corneliu - Structuri de date si algoritmi, An aparitie: 2002 Cota
507.305
6. CORMEN Thomas H., LEISERSON Charles E. , RIVEST Ronald R. - Introducere in
algoritmi, An aparitie: 2000 Cota 501.507
7. KNUTH Donald E. - Arta programarii calculatoarelor. Vol. 1: Algoritmi fundamentali, An
aparitie: 2000 Cota 501.199/1
8. KNUTH Donald E. - Arta programarii calculatoarelor. Vol. 3: Sortare si cautare, An
aparitie2000
9. Bridging course contents with the expectations of the representatives of the community,
professional associations and employers in the field
The lectures' topics cover the requirements of the IT&C companies and are consistent with the contents of
similar courses from other universities, both in the country and abroad.
10. Evaluation
10.3 Weight in the
Activity type 10.1 Assessment criteria 10.2 Assessment methods
final grade
Degree of assimilation of the Written examination 3h 60%
Course knowledge presented in progress Active participation on courses 10%
(instant test from current course
/3 simple question)
4 homework each for the Homework presentation (C 30%
following area: lists and sorts, code exam)
Applications trees, graphs, hash table,
algorithms designs (divide and
impera, recursivity, greedy,
backtracking, mixmax, etc.)
10.4 Minimum standard of performance
Grade >= 5