JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD II Year B.Tech.

IT I Sem T P C (4+1* 0 4) ADVANCED DATA STRUCTURES THROUGH C++

Unit I : C++ Class Overview- Basic OOP concepts, Class Definition, Objects, Class Members, Access Control, Class Scope, Constructors and destructors, parameter passing methods, Inline functions, static class members, this pointer, friend functions, dynamic memory allocation and deallocation (new and delete), exception handling. Unit II : Function Over Loading, Operator Overloading, Generic Programming- Function and class templates, Inheritance basics, base and derived classes, inheritance types, base class access control, runtime polymorphism using virtual functions, abstract classes, streams I/O. Unit III : Algorithms, performance analysis- time complexity and space complexity. Review of basic data structures- The list ADT, Stack ADT, Queue ADT, Implementation using template classes in C++. Trees- basic Terminology, Binary tree ADT, Array and Linked represenatations, Traversals, Theaded binary Trees. Unit IV : Dictionaries, linear list representation, skip list representation, operations insertion, deletion and searching, hash table representation, hash functions, collision resolution-separate chaining, open addressing-linear probing, quadratic probing, double hashing, rehashing, extendible hashing, comparison of hashing and skip lists. Unit V : Priority Queues Definition, ADT, Realizing a Priority Queue using Heaps, Definition, insertion, Deletion, External Sorting- Model for external sorting, Multiway merge, Polyphase merge. Unit VI : Search Trees (Part1):Binary Search Trees, Definition, ADT, Implementation, Operations- Searching, Insertion and Deletion, AVL Trees, Definition, Height of an AVL Tree, Operations Insertion, Deletion and Searching Unit VII : Search trees (part II) : Introduction to Red Black and Splay Trees, B-Trees, B-Tree of order m, height of a BTree, insertion, deletion and searching, Comparison of Search Trees Graphs- Basic Terminology, Representation of Graphs, Graphs search methods-DFS,BFS. Unit VIII : Pattern matching and Tries : Pattern matching algorithms-Brute force, the Boyer Moore algorithm, the KnuthMorris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries. TEXT BOOKS : 1. Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd, 2nd edition, Universities Press Orient Longman Pvt. Ltd. 2. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and .Mount, Wiley student edition, John Wiley and Sons. REFERENCES : 1. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition. 2. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Thomson 3. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI. 4. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.

II Year B.Tech. IT I Sem T P C (0 3 2) ADVANCED DATA STRUCTURES LAB THROUGH C++ Objectives: To make the student learn a object oriented way of solving problems. To make the student write ADTS for all data structures. Recommended Systems/Software Requirements: Intel based desktop PC with minimum of 166 MHZ or faster processor with atleast 64 MB RAM and 100 MB free disk space C++ compiler and STL Recommended Week1 : C++ programs to implement the following using an array. a) Stack ADT b) Queue ADT Week2 : Write C++ programs to implement the following using a singly linked list. Stack ADT b) Queue ADT Week3 : Write C++ programs to implement the deque (double ended queue) ADT using a doubly linked list and an array. Week 4 : Write a C++ program to perform the following operations: a) Insert an element into a binary search tree. b) Delete an element from a binary search tree. c) Search for a key element in a binary search tree. Week5 : .Write C++ programs that use recursive functions to traverse the given binary tree in a) Preorder b) inorder and c) postorder. Week6 : Write C++ programs that use non-recursive functions to traverse the given binary tree in a) Preorder b) inorder and c) postorder. Week7 : Write C++ programs for the implementation of bfs and dfs for a given graph. Week8: Write C++ programs for implementing the following sorting methods: Merge sort b) Heap sort Week9 : Write a C++ program to perform the following operations Insertion into a B-tree b) Deletion from a B-tree Week10: .Write a C++ program to perform the following operations Insertion into an AVL-tree Week11 : Write a C++ program to implement all the functions of a dictionary (ADT) using hashing. Week12 : Write a C++ program for implementing Knuth-Morris- Pratt pattern matching algorithm. TEXT BOOKS : 1. Data Structures A Psecudocode Approach with C++,Indian Edition,R.F.Gillberg and B.A.Forouzan, Cengage Learning.

2. 2.Programming principles and practice using C++, B.Stroustrup,Addison-Wesley(Pearason Edu.)

3. Data Structures and Algorithms with OODesign patterns in C++,B.R.Priess,John Wiley & sons.