Anda di halaman 1dari 3

Course Description

Title of Course: Advanced Data Structures L-T Scheme: 3-0 Course Code: 10M11CI111 Course Credit: 3

Prerequisite: Students must have already registered for the course, Data Structure (10B11CI211). Objectives: The objective of this course is to develop problem solving ability using programming, develop ability to express solutions to problems clearly and precisely, develop ability to design and analyze algorithms, introduce with fundamental data structures, develop ability to design and evaluate Abstract Data Types and data structures. Learning Outcomes: The students shall acquire the generic skills to design and implement data structures and related algorithms for a broad-based set of computing problems with less complexity and less memory requirements. Course Contents: Amortized complexity Introduction to external sorting Dictionaries, Selection trees & k-way merging. Buffering, Run generation, Optimal merging of runs Leftist trees, Binomial heaps, Fibonacci heaps, Pairing heaps Double-ended priority queues, General methods, Interval heaps Optimal binary search trees, AVL trees, Red-black trees, Splay trees B-Trees, B+ and B* trees Binary tries, Compressed Binary Tries High-order Tries, Suffix trees, Tries and Packet forwarding Bloom Filters Segment Trees, Interval Trees, Priority Search trees

Teaching Methodology: Lectures would be interactive and it would cover the core concepts that are explained in the text and reference materials with adequate examples. Tutorials will have conceptual and numerical questions that would aid in strengthening the data structures /Advance data structure principles.Try to reduce the complexity of existing /new algorithm which can be use in real world. Evaluation Scheme: Test-1 Test-2 Test-3 Subject Seminar Quiz Assignment Attendance Total References
[1] Sartaj Sahni, Advanced Data Structures, 2nd Edition, University Press, 2010. [2] Brass, Peter, Advanced Data Structures, Cambridge University Press, New York, 2008. [3] Sartaj Sahni, Data Structures, Algorithms and applications in C++, 2nd Edition,

: : : : : : : :

15 Marks 25 Marks 35 Marks 10 Marks 05 Marks 05 Marks 05 marks 100 Marks

University Press, 2008.

[4] Sartaj Sahni, Data Structures, Algorithms and applications in Java, 2 nd Edition, [5] [6] [7] [8] [9] [10] [11] [12] [13] [14]

[15] [16] [17]

University Press, 2008. Gilberg, Forouzan, Data Structures, A pseudocode approach with C++, first Indian edition, Akash Press, 2007. Langsam, Augestein, Tanenbaum, Data Structures using C and C++. Sedgewick, Robert, Algorithms in C/C++, Pearson Education, New Delhi, 1998. Kruse, Tonso, Leung, Data Structures and Program Design in C. Carrano and Prichard, Data Abstraction and Problem solving with Java. Thomas A. Standish, Data Structures in Java, Pearson Education, New Delhi. Hanan Samet, Design and Analysis of Spatial Data Structures, Addison Wesley, reading, MA, 1990. Shukla, Data Structures using C & C++, first edition, Wiley India Pvt. Ltd., 2009. Gaede, V. and Gunther, O., Multidimensional Access Methods, ACM Computing Surveys, Vol. 30, No. 2, June 1998, pp. 170-230. Bohm, C., and Bercjtold, S., Searching in High-dimensional Spaces - Index Structures for Improving the Performance of Multimedia Databases, ACM Computing Surveys, Vol. 33, No. 3, September 2001, pp. 322-373. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge Univ. Press, 1995. R.E. Tarjan, Data Structures and Network Algorithms, SIAM, 1983. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Combridge University Press, 1998.

[18] Thomas H. Cormen, C. E. Leiserson, R.L. Rivest, and C. Stein, Introduction to

Algorithms, McGraw-Hill, 2002. [19] Fundamentals of data structures in C++, by E. Horowitz, S. Sahni, and D. Mehta, Second Edition, Silicon Press, 2007.