SCHEME OF COURSE WORK

Course Details: Course Title Advanced Data Structures (Professional Elective – I) Course Code 15CT1111 L T P C :3 0 0 3 Program: B.Tech. Specialization: Information Technology Semester IV Prerequisites None Courses to which it is a prerequisite None

Course Outcomes (COs): 1 Apply concepts of Heaps. 2 Use Hash functions in indexing. 3 Design applications using Red-Black and Splay trees. 4 Explain Digital Search Structures. 5 Apply various String Matching Techniques.

Program Outcomes (POs): A graduate of Information Technology will be able to

1 Apply the knowledge of mathematics, science, engineering fundamentals and principles of Information Technology to solve problems in different domains. 2 Analyze a problem, identify and formulate the computing requirements appropriate to its solution. 3 Design & develop software applications that meet the desired specifications within the realistic constraints to serve the needs of the society. 4 Design and conduct experiments, as well as to analyze and interpret data 5 Use appropriate techniques & tools to solve engineering problems. 6 Understand the impact of information technology on environment and the evolution and importance of green computing 7 Analyze the local and global impact of computing on individual as well as on society and incorporate the results in to engineering practice. 8 Demonstrate professional ethical practices and social responsibilities in global and societal contexts. 9 Function effectively as an individual, and as a member or leader in diverse and multidisciplinary teams. 10 Communicate effectively with the engineering community and with society at large. 11 Understand engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects. 12 Recognize the need for updating the knowledge in the chosen field and imbibing learning to learn skills.

Course Outcomes Program Outcomes Mapping:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO-1 S S S S S CO-2 S S S S S CO-3 S S S S S CO-4 S S S S S CO-5 S S S S S

S - Strongly correlated, M - Moderately correlated, Blank - No correlation Assessment Methods: Seminar / Mid-Test / End Exam

Teaching-Learning and Evaluation

Week TOPIC / CONTENTS Course Sample questions TEACHING- Assessment Outcomes LEARNING Method & STRATEGY Schedule 1 UNIT-I: Single and double ended Priority Queues, CO1 1. What is the Difference Between  Lecture Mid –Test 1 Leftist Trees – Height Biased Leftist Trees, Leftist single and double ended priority Trees – Weight – Biased Leftist Trees, Binomial queues. Heaps – Cost Amortization, Definition of Binomial 2. Explain in detail about Height Heaps Biased Leftist Trees. 3. Explain in detail about Weight Biased leftist Trees. 4. Define Binomial Heaps. 2 Insertion into Binomial Heaps, Melding Two CO1 1.Write a procedure to insert an  Lecture Mid –Test 1 Binomial Heaps, Deletion of Minimum Element, element into a Binomial . Analysis 2. Write a procedure to meld two binomial heaps. 3. Write an algorithm to delete smallest element from heap. 3 Fibonacci Heaps- Definition, Deletion from an F- CO1 1.Prove that if we start with empty F-  Lecture Mid –Test 1 Heap, Decrease Key, Cascading Cut, Analysis, Heaps and perform only the Application to the Shortest Paths Problem, Pairing operations insert, meld, and delete Heaps- Definition, Meld and Insert min, then all min trees in the F-heaps are binomial trees. 4 Decrease Key, Delete Min, Arbitrary Delete, CO1 1.Into an empty two pass min pairing  Lecture / Mid –Test 1 Implementation Considerations, Complexity heap, insert elements with priorities 20, 10, 5, 18, 6, 12, 14, 9, 8 and 22(in this order). Show the min following each insert. 5 UNIT II: Hash Functions, Division, Folding, Mid CO2 1.What is the minimum number of  Lecture / Mid –Test 1 Square Function, Extraction, Radix Transformation, keys that are hashed to their home Collision Resolution, Open Addressing, Chaining positions using the linear probing technique? Show an example using a 5-cell array. 2. Is there any advantage to using binary search trees instead of linked lists in the separate chaining method? 6 Bucket Addressing, Deletion, Perfect Hash Functions CO2 1.In which case does Cichelli’s  Lecture Mid –Test 1 – Cichelli’s Mehtod, Perfect Hash Functions – The method not guarantee to generate a FHCD Algorithm, Hash Functions for extendible files minimal perfect hash function? Seminar – Extendible Hashing 2. Apply the FHCD algorithm to the nine Muses with r=n/2=4 and then with r=2. What is the impact of the value of r on the execution of this algorithm? 7 Hash Functions for extendible files – Linear Hashing, CO2 & CO3 1.Strictly speaking, the hash function  Lecture Mid –Test 1 UNIT III:Efficient Binary Search Trees: Optimal used in extendible hashing also Binary Search Trees, AVL Trees, Red – Black Trees: dynamically changes. In what sense is Seminar Definition this true? 2. Draw the transformations for the rotation types RR and RL. 3. Compare the worst-case height of a red-black with n nodes and that of an AVL tree with the same number of nodes.

8 Representation of Red-Black Tree, Searching a Red- CO3 1.Develop the deletion  Lecture Mid –Test 1 Black Tree, Inserting into a Red-Black Tree, Joining transformations for Red-Black tree. Red-Black Trees Show that deletion from a Red – Seminar Black tree requires at most one rotation. 9 Mid-Test 1 CO1, CO2, Mid-Test 1 CO3 (Week 9) 10 Splitting a Red – Black Tree, Splay Trees, Bottom – CO3 1.Obtain a function to perform a two-  Lecture / Mid –Test 2 Up Splay Trees, Top – Down Splay Trees way join on red-black trees. You may  Demonstration assume the existence of functions to search, insert, delete, and perform a three-way join. What is the time complexity of your two-way join function? 2. What is the maximum height of a bottom-up that is created as the result of n insertions made into an initially empty splay tree? Give an example of a sequence of inserts that results in a splay tree of the height? 11 UNIT –IV: Digital Search Structures – Digital CO4 1.Write the binary functions for  Lecture Mid –Test 2 Search Trees, Digital Search Trees- Definition, the search, insert, and delete  Problem solving Insertion, Deletion, Binary and Patricia: Binary operations. Seminar Tries, Compressed Binary Tries, Patricia 2. Write a function to delete the element with key k from a Patricia. 12 Multiway Tries, Definition, Searching a Trie, CO4 1.Draw the tire obtained for the  Lecture Mid –Test 2 Sampling Strategies, Insertion into a Trie, Deletion following data: AMIOT, AVENGER, from a Trie AVRO, HEINKEL, HELLDIVER, Seminar MACCHI, MARAUDER, MUSTANG, SPITFIRE, SYKHOI sample the keys from left to right one character at a time. 13 Keys with different length, Height of Trie, Space CO4 1.Explain how a trie could be used to  Lecture / required and alternative load structures, Prefix search implement a spelling checker. Mid –Test 2 and applications, Compressed Tries, Compressed Tries Seminar 14 Compressed Tries with Skip Fields, with labeled CO4 1.Write an algorithm to insert a key = Lecture / Mid –Test 2 edges, Space Required by a compressed Trie, value x into a trie in which the keys are sampled from left to right, one character at a time. 15 UNIT – V: String Matching- Exact String Matching CO5 1.Apply the Knuth-Morris-Pratt = Lecture / Mid –Test 2 – Straightforward algorithms, The Knuth – Morris – algorithm first with next and then with Pratt Algorithm, The Boyer – Moore Algorithm nextS to P=bacbaaa and T=bacbacabcbacbbbacabacbabcbbba. 16 Multiple Searches, Bit-Oriented Approach, Matching CO5 1.Consider the serch for a pattern in a  Lecture Mid-Test 2 Sets of Words text when the pattern is non in the text. What is the smallest number of character comparisions in this case executed by i. Knuth-Morris-Pratt? ii. Boyer-Moore? 17 Regular Expression and Matching, Suffix Tries and CO5 1.Draw Ukkonen suffix tries for  Lecture Mid-Test 2 Trees, Suffix Arrays a. aaaa d. abcd g. aaba b. aabb e. baaa h. aaab c. abba f. abaa 18 Mid-Test 2 CO3, CO4, Mid-Test 2 CO5

19/20 END EXAM