Syllabus

Data Structures and Algorithms INGK421

Teacher: Zita Kovács Consulting hours (IK-231):

• wednesdays, 9-10

• thursdays, 11-12 Homepage: arato.inf.unideb.hu/~kovacs.zita/dsa.html

Topics Concept and classification of data structures. Operations on data structures (create, add,

delete, change, search, traverse, process). Representation and implementation and usage of

data structures. Abstract data structures. Set, multi-set, array, associative array, list, stack,

queue, string, tree, balanced tree, red-blacktree, B-tree, net, record. File operations (create,

modify, process, reorganize, sort.) File structures (simple and complex), linking, indexing.

Serial, sequential, direct, random, indexed, inverted, multi-list, B+-tree files. Multi-

dimensional index.

Seminars (practical part)

The signature proves, that you successfully pass all of the requirements of the seminar:

• ATTENDANCE. You have to participate in the seminars, that is why we use an

attendance register on the seminars. No more than three absences are allowed.

• COURSE TESTS. You have to pass two practical tests during the seminar period. The

successful tests must be at least 50%, each.

o It is permitted to repeat the test (if it is necessary). In this case, the repeat test must

be at least 60%. (date: at the end of the semester)

Compulsory / RecommendedReadings • G. Gonnet, R. Baeza-Yates: Handbook of algorithms and datastructures, In Pascal and C.,

Addison-Wesley. 1991.

• R. Sedgewick: Algoritmsin C++, Addison-Wesley. 1991.

• E. Horowitz, S. Shani: Fundamentals of Computer Algorithms, Computer Science Press,

1998.