Found 3 records with CourseId:6193 in academic section database. Picking the first.

Course Name: CS5800 : Advance Data Structures & Algorithms

Description: Review of Basic Concepts: Abstract data types, Data structures, Algorithms, Big Oh, Small Oh, Omega and Theta notations, Solving recurrence equations, Master theorems, Generating function techniques, Constructive induction. Advanced Search Structures for Dictionary ADT: Splay trees, Amortized analysis, 2-3 trees, 2-3-4 trees, Redblack trees, Randomized structures, Skip lists, Treaps, Universal hash functions. Advanced Structures for Priority Queues and Their Extensions: Binomial heaps, Leftist heaps, Skewed heaps, Fibonacci heaps and its amortized analysis, Applications to minimum spanning tree algorithms. Data Structures for Partition ADT: Weighted union and path compression, Applications to finite state automata minimization, Code optimization. Graph Algorithms: DFS, BFS, Biconnected components, Cut vertices, Matching, Network flow. Computational Geometry: Geometric data structures, Plane sweep paradigm. Lower Bound Theory: Adversary arguments, Information theory bounds.

Slot: B

RoomNo: CS34

Instructor: John Ebenezer Augustine

Period: JUL-NOV 2013

This page was created on: Thursday 19th of September 2013 09:35:54 PM