Data Structure and DBMS
Review of basic data structures and their realization in an object-oriented environment. The following topics will be covered with emphasis on formal analysis and design: Dynamic Data structures; 2-3 trees, Red-black trees, binary heaps, binomial and Fibonacci heaps, Skip lists, universal hashing. Data structures for maintaining ranges, intervals, and disjoint sets with applications. Basic algorithmic techniques like dynamic programming and divide-and-conquer. Sorting algorithms with analysis, integer sorting algorithms with analysis, integer selection.
