## "Babes-Bolyai" University of Cluj-Napoca Faculty of Mathematics and Computer Science

 Data Structures and Algorithms
 Code Semes-ter Hours: C+S+L Type Section MIE0001 2 2+1+0 compulsory Matematica MIE0001 2 2+1+0 compulsory Informatică MIE0001 2 2+1+0 compulsory Matematică informatică MIE0001 2 2+1+0 compulsory Matematici aplicate
 Teaching Staff in Charge
 Assoc.Prof. SERBAN Gabriela, Ph.D.,  gabiscs.ubbcluj.roAssoc.Prof. NICULESCU Virginia, Ph.D.,  vniculescucs.ubbcluj.roLect. IONESCU Clara, Ph.D.,  claracs.ubbcluj.roLect. CIOBAN Vasile, Ph.D.,  vciobancs.ubbcluj.roAsist. MIHIS Andreea Diana,  mihiscs.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) Hash-tabels Binary trees Stacks Queues and priority queues Heap structures Maps Balanced binary search trees Algorithms complexity
 References BIBLIOGRAFIE 1. CORMEN, THOMAS H. - LEISERSON, CHARLES - RIVEST, RONALD R.: Introducere în algoritmi. Cluj-Napoca: Editura Computer Libris Agora, 2000. 2. HOROWITZ, E.: Fundamentals of Data Structures in C++. Computer Science Press, 1995. 3. MOUNT, DAVID M.: Data Structures. University of Maryland, 1993. 4. AMBSBURY, WAYNE: Data Structures. From Arrays to Priority Queues, 1993. 5. WIRTH, N.: Algorithms + Data Structures = Programs. Prentice- Hall Inc., 1976. 6. STANDISH, T.A.: Data Structures, Algorithms & Softwae Principles in C, Addison-Wesley, 1995 7. SEDGEWIK: Algorithmen 8. Frentiu, M., Pop, H.F., Serban, G.: Programming Fundamentals, Ed. Presa Universitara Clujeana, Cluj-Napoca, 2006