Data structures 
ter 

Teaching Staff in Charge 
Lect. SERBAN Gabriela, gabis@cs.ubbcluj.ro Assoc.Prof. POP Horia Florin, Ph.D., hfpop@cs.ubbcluj.ro Lect. IONESCU Clara, clara@cs.ubbcluj.ro 
Aims 
 understanding the most used abstract data types: arrays, linked lists, binary trees, hash tabels, and developing the abilities to use them;
 developing the abilities for designing algorithms that use these structures;  learning to estimate the algorithms complexity. 
Content 
Arrays (sorting algorithms: mergesort, heapsort, radixsort, bucketsort etc.)
Linked lists (simple, and double) Hashtabels Binary trees Stacks Queues and priority queues Heap structures Maps Balanced binary search trees Spatial data structures (Quadtrees, Octtrees) Algorithms complexity 
References 
1. T. Cormen, C. Leiserson, R. Rivest  Introducere în algoritmi, Editura Computer Libris Agora, Cluj, 2000
2. E. Horowitz  Fundamentals of Data Structures in C++, Computer Science Press, 1995 3. David M. Mount  Data Structures, University of Maryland, 1993 4. wayne Ambsbury  Data Structures  From Arrays to Priority Queues, 1993 3. N. Wirth, Algorithms + Data Structures = Programs, Prentice Hall Inc., 1976 
Assessment 
Each student will receive a list of problems that must be solved during the term. For this homework the student will receive a first grade. At the end of the term the student must take an exam for which he will receive a second grade. The final grade will be the arithmetic of these two grades.
