15 DATA STRU: Paper Code: ETCS-209 Lor oe Paper: Data Structures 3 1 4 INSTRUCTIONS TO PAPER SETTERS: ‘Maximum Mar 1, Question No, 1 should be compulsory and cover the entire syllabus. This question should have objective ‘of short answer type questions, It should be of 25 marks 2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, the student may be asked to attempt only 1 question from each unit Each question should be 12.5 marks Objective: To understand the programming and the various techniques for enhancing the programming skills for solving and getting efficient results UNIT -1: Introduction {6 programm ing Methodologies and design of algorithms. Abstract Data ‘Type, array, array ‘organization, sparse array. Stacks and Stack ADT, Stack Manipulation, Prefix, infix and) postiix expressions, their interconversion and expression evaluation. Queues and Queue ADT, Queue manipulation. General Lists and List ADT, List manipulations, Single, double and circular lists, [T1,T21.No. of hrs. 12] ‘UNIT =: ‘Trees, Propemtes of Trees, Binary ees, Binary Tree traversal, Tree manipulation algorithms, Expréestion trees and their usage, binary seach trees, AVE. Trees, Heaps and their implementation, [11,12](Ne. of hrs. 12] UNIT -: Multiway tees, BTvees, 2-3 tees, 2-3-4 trees; B* and B+ Trees, Graphs, Graph representation, Graph traversal [EL,T2]{No. of hrs. 12] ‘UNIT -1V: Sorting concept, order, stability, Selection sorts (straight, heap), insertion sort (Straight Insertion, Shell sor), Exchange Soxt (Bubble, quicksor), Merge sort (only 2-way merge sort). Searching ~ List search, sequential Search, binary search, hashing concepts, hashing methods (Direct, subtraction, modulo-division, midsquare, folding, pseudorandom hashing). collision resolution (by open addressing: linear probe, quadratic probe, pseudorandom collision resolution, linked list collision resolution), Bucket hashing. (71,72]1No. of hrs. 12] ‘Text Boo ITI] R. F. Gilberg, and B. A, Forouzan, "Data Structures: A’Pseudocode approach with C°, Thomson Learning [12] A.V. Aho,J.E. Hoperoft, J.D. Ulman “Data Structures and Algorithi, Pearson Education, Reference Books: [RI]. Sahni and B, Horowitz, “Data Structures", Galgotia Publications. [R2] Tanenbaum: "Data Structures using C”, Peatson/P HI [3] TH. Cormen, CE. Leiserson, RL. Rivest “Introduction to Algorithms”, PHL/Pearson IR4] AK Sharma, ‘Data Structures”, Pearson [RS] Ellis Horowitz and Santa Sahani “Fundamentals of Computer Algorithms", Computer Science Press Scheme sd Slab or B, Teh, 1" ear (Connon a all bach) wad bach 2014-18 and (2, 9" & 4 yea) we hatch 201514