Data structures and algorithms

Lectures

• 1. Motivation, ADTs vs data structures, element type
• 2. Iterators
• 3. ADTs; memory model
• 4. Vector
• 5. Linked lists
• 6. Binary search trees
• 7. B-trees
• 8. Binary heaps
• 9, 10. Hash tables
• 11. Fibonacci heaps
• 13. Matrices, sparse matrices
• 14. Review - matrix.cpp, tree.cpp

Seminary

See http://www.cs.ubbcluj.ro/~dana/2015-2016/DSA/Activities/

Grading

The final grade will be computed as follows:

• 20% Project
• 10% Semester activity
• 70% Written exam

Minimal passing criteria

• minimum grade of 5 at the written exam
• minimum final grade 5

The re-examination session

• In the re-examination session the same grading algorithm will apply.