oy a Narasaraopeta Engineering College (Autonomous) NEC Koinppakonda Road, Yellamanda (P.O), Narastraopet- 522601, Guntur District, AP, IL B.Tech I Semester Supple Examinations, March-2022 Sub Code: 18BEC3THO5 DATA STRUCTURES ‘Time: 3 hours (ECE) ‘Max. Marks: 60 Nove: Answer All FIVE Questions. All Questions Carry Equal Marks_(5X 12 = GUM) QNo ‘Questions Marks Unit-l 9 Define Data Structure, Distinguish between linear and non-linear data structares witb om a sitable ex teu ii) What are the essential characteristics of any recursive algorithm? Discuss them withthe | 1944, 1 |_[help ofa sample recursive algorithm, OR = 1) Design a reearsve algorithm to nd the GCD of two postive integers. Taco the designed | poy) | algorithm with an example, ii) Define Abstract Data Type(ADT). Briefly discuss about the characteristics ofan ADT.___| [OMT T Unit ‘Wiite an algorithm for arranging elements in non-descending order using Merge Sort 12M) #1 technique and also trace the steps of algorithm with an example. 4 ‘OR 2 3) Design a recursive algorithm for Binary Search. [eM] 5) Distinguish between Internal Sorting’ and TExteraal Sorting. Give atTeast one example | .q) th category of sort —| lustrate he inserdon govt achnique With the Following ist of numbers, 7,932, 3410, | caygy 6 i 1 _ Tomy ii) Write the Underfiow and Overflow conditions in Stacks, Queues and Circular Queues. {6M} 3 ‘OR 3) Waite an algorithm to convert Infix expression into its equivalent Postfix fora. TEM bi) Write algorithms for Insertion and Deletion Operations on Circular queues (ASsumie that | igyy the circular quewe is represented using an array) Wait 3) Discuss the merits and demeriis of Linked Ist over Array with suitable example on | applications/operations 4 |” |i Waite the node siuctare of Single Linked List and wate an algorithm toinsertanodeat [Tea position ‘p’ in a Single Linked List, ‘OR | ‘Design an algorithm to create a Double Linked List and traverse it in reverse order, Ter} Write algorithms to create 2 Circular Single linked list (6M) Uni-V Define Graph. Write a algorithm to traverse the graph using BFS graph traversal technique. | [6M] a) il) Construct a Binary Tree from the following Inorder and Preorder listings: (on) 5 Inonler: [DEBAHFGC, Preonter: ABDIECFHG OR 3) Define BST. Construct a BST from the following list of numbers and show the (et) 4 sequence of steps clearly: 10, 20, 14, 3,8, 9, 7, 15, i) Discuss about various representation styles of Graphs with an example. [em1 Narasaraopeta Engineering College (Autonomous) [NEE Rowppakonda Road, Yellamanda (P.O), Narasaraopet- 522601, Guntur District, AP. Subject Code: R20CC1210 1 B.Tech. - If Semester Supple Examinations, March-2022 Data Structures (EEE, ECE) ‘Time: 3 hours Max. Marks: 70 Note: Answer All FIVE Questions. ‘AML Questions Carry Equal Marks (6 X 14=70M) 1, A) Describe Classification of Data Structures. Write an algorithm for Fibonacci serles? [14M] OR 1B} What ls Abstract Data Type? Write an algorithm for Towers of Hanol? Iam) 2. A) Write an algorithm for Merge sort and give an example. 114m) OR 1B) Write the algorithm for Quick sort and sort the following numbers using Quick sort 11,87, 6, 33, 28, 45, 34, 12, 46,27, 56 [4M] 3. A) What is @Stack? Explain the applications af stack, [24M OR 4, B) Define Queue? Explain Queue operations using Array. [amy 5. A) Write an algorithm for insertion, deletion operation on Single Linked List, [1am] OR 18} Write an algorithm for insertion operatfon on Circular Linked tist. [nem] 6. A) Write an algorithm for DFS with suitable example. [amy OR 8) Explain about operations on Binary Search Tree. {14mails, a nai WS Narasaraopeta Engineering College (Autonomous) NE Kotappakonda Road, Yellamanda (P.O), Narasernoper- 522601, Guntur Disrict, AP. ‘Subject Code: R20CC2104 II B.Tech. - I Semester Regular Examinations, February-2022 DATA STRUCTURES (CSEILAN) ‘Time: 3 hours Max. Marks: 70 Note: Answer All FIVE Questions. All Questions Carry Equal Marks (6 X14 =70M) example. Qo ‘Questions KL ]CO_| Marke Unit-L i) What is Data stracture? Explain the operation of singly linklist. Ka | co2 |™ a ii) Explain Space and Time Complexity. + [x [C02 [7M L OR, i) Explain the various operations of the list ADT with examples 4 | cor |7™ » | iijExplain Worst Case, Best Case and Average Case Time complexity x4 |co2 | with examples ‘Unit- i)Explain Binary Search with example KB [Col [7M 2 |? i) Reanange folowing numbers wing guk or 10,6 3,7, 1726, 5,58. fxe [eon [ne > + OR te b | DERPain Binary seat algorithm and Gomparet with near seateh agodiim, FS [ON |] Hani ; | ‘Unit-Ti. 3 Vv _ i Explain the evaluation of prefix expression. K4_ [C02 [7M a 3 if) Find the equivalent prefix of :8 63 +*123-/- K4 | co2 [7M OR 1p Li) Wite an algorithm to posh and pop an element from stack Ka [coz | 7M ii) Explain the basic operations of queue with pseudo code, Ka [Coz | 7M ‘Unit-IV i) Write an algorithm to delete an element anywhere from doubly linked list. K& | coz | 7M a 4 ii) Write applications of single linked list to represent polynomial expressions, | ®4 | CO2 | 7M t OR > i) Write an algorithm to Show how to reverse a single linked list. Ka {coz [7M ii)Explain deletion operation in circular linked list Ka [Coz | 7™ 5 | UniteV Explain the procedure inserting an element in Binary Search Tree KS] COs | 7 477i) Explain how to find shonest path using Dijkstra’s algorithm with an| x4 |cos [7M example. t OR B] Construct a binary search tee from these numbers- KS] COs) mM 90,36,58,96,32,92,12,93,24,97,38,60,98 . Delete nodes 12,60,36,96 H)Define Graph. Brielly explain the graph traversal algorihms with an RP |Cor [aMINARA Asa esas ay ae NEC ENGINEERING COLLEGE TAUTONONIOUS) Subject Code: R20CC1210 IB.Tech. - II Semester Regular & Supple Examinations, July-2023 Data Structures (EEE, ECE) Time: 3 hours Max. Marks: 70 Note: Answer All FIVE Questions. All Questions Carry Equal Marks (5 X 14 =70M) 41. A)I) Write a recursive procedure to compute GCD of two numbers I1) Write a recursive procedure to compute the n® Fibonacci number OR B) 1) Explain Towers of Hanoi problem with example? Write a recursive algorithm? 2. A)D) Write an algorithm to implement Binary Search technique. Use the algorithm to search 32 in the following list of elements. Explain the process at each step. 12, 16, 17, 19, 20, 22, 24, 29, 30, 32, 37 OR B) I Sort the following numbers using heap sort 45, 34, 12, 46, 27, 56, 11, 87, 6, 33, 28 11) Write an algorithm for bubble sort and also analyze the time complexity 3, A) 1) Whatis Stack? Explain the implementation of stacks using linked lists? Write the pseudo code for PUSH and POP operations on the Stack? OR B) Explain about Cifcular Queues implementation?) Write the pSeuda!code for thé operations dh Circular Queues? 4. A) 1) How to represent single linked list? Discuss. 11) Write an algorithm to delete a node in a linked list. OR B) I) Write a program for the implementation of double linked list 11) Compare and Contrast linked lists and arrays 5. A)1) Apply BFS & DFS for the follwing graph oR B) J) Construct a Binary Search Tree (BST) with the following keys: 86, 12, 42, 69, 38, 57, 74, 6, 49, 71. Also delete 42 from the constructed BST. II) Write a procedure to search an element in a Binary Search TreeSe INAKASARAVUPEH IA NEC ENGINEERING COLLEGE (AUTONOMOUS) IL B.Tech I Semester Supple Examinations, May-2023 Sub Code: 19BCI3THOS DATA STRUCTURES Time: 3 hours (CSE, IT) Max. Marks: 60 [Note: Answer All FIVE Questions. All Questions Carry Equal Marks (5 X 12 = 60M) QNo ‘Questions ‘Marks Unit-T 2 |) Wite an algorthm/pseudo code Torlinear search and mention the bes ease and worst y>y4y i case time complexity of Linear Search algorithm?. OR » | 2 Explain the various operations of the list ADT with examples (MI ii) What is algorithm? Why do we requie various complexity analysis cases? Justify eM} Unit-It a. | Describe insertion sort algorithm and trac the steps of insertion sort for sorting the Hit= [> 12, 19, 33, 26, 29, 35, 22, 37. Find the total number of comparisons made. OR 2 7) Show all the passes using insertion sort for the following list ma pp | 9426.93.17.77.31.44.55,20 ii) Differentiate Linear search and Binary search. TMi iii) Write about Bubble sort. [aM] Unit i) Explain different collision resolution techniques TMi a | iWrite« pytion application to perform insertion, deletion operations in single Tinked | ~ exp list. 3 - OR AVExplain thefourdifferenthashing functions with an example foreach (eM) b i) Write a python @pplication to perform insertion, deletion opstations in circular linked [eM list UnitIV ie i) Define stack ADT and its implementation [eM] © | il) Explain the procedure to evaluate postfix expression 623+-382/4*2434. {6M} OR - i) Convert the given infix Expression (A¥B)*C-(D-E) * (FG) into iis Equivalent ei b | Prefix and Postfix Notations. i) Creat binary search tee forthe Tollowing elements (23, 12,45, 36,5, 15,39,2.19). | i6yq Discuss about the height of the above binary search tree. Unit-V 1) Create max heap for the following elements 33, 14, 65, 02, 76, 69, 59,85, 47, 99.98. | [OM] ® ii) Explain about Breadth First Search with an example. [eM] 5 OR i) Explain heap sont with an example. [eM] b |i) What are connected components of graph? Ts there any method to find out all the to) Connected components of graph? Explain,ai NARASARAOPETA NEC ENGINEERING COLLEGE CAUTONOMOUS) IL B.Tech I Semester Supple Examinations, September-2023 Sub Code: 19BCI3THOS DATA STRUCTURES Time: 3 hours (CSE, IT) Max. Marks: 60 Note: Answer All FIVE Questions. All Questions Carry Equal Marks _(5 X 12 = 60M) QNo Questions Marks United i) Define Data Structure? How Data Stucture varies from Data Type? ae a | Represent the classification of Data Structures? 1 ii) Define Algorithm? Explain the main approaches to design an algorithm? | [6M] OR 1) What do you mean by an algorithm analysis? How efficiency of an _— b | algorithm is assessed? Explain? ii) Define ADT? Explain its significance and advantages? [eM Unit-It i) Write an algorithm for Binary Search? Apply Binary Search to find key=50 in the given list 10,20,30,40,50,60,70? Mention its best, average and worst | [6M] a | case time complexities? 2 ii) Apply the Quick Sort to sort the given list 75,26,15,67,85,54,31,49 in ion) ascending order? Mention its best, average and worst case time complexities? ‘OR » [mWaite an Algorithm for Linear Search? Analyze is performance? TMT ii) Mlustrate Heap Sort algorithm, to sort the given list 4,3,7,1,8.5. [MI Unit- Il 1) Define ashing )Discuss various types of Hashing Methods? io a. Fiiy Explain with example howa double linked lists efficient than Single [6M] Linked List? A OR, iy What do you mean By collision in hashing? Summarize various Collision [4p pp | fesolution techniques? ii) Explain various operations performed on Circular Linked List with an examples? Unie i) Define Stack? Explain various operations performed on Stack with an |examples? it) Identity the primary difference between Binary Tree and Binary Search | gy) . ‘Tree? Construct a BST from given list of elements 6,5,9,10,11,13,4,3,7.12? OR i) Define Queue ADT? Explain various operations performed on Queue with | (gy) » examples? i) Consider the given Tree Traversals Inorder: DBE AFC and Preorder | (oy) ABDECEF. Construct Binary Tree from the given Traversals? Unit-V 3] Define Heap? Explain various operations performed on Heap with suitable] 644) 5 examples? ii) Define Graph? Explain various graph representation techniques with TOM suitable examples?OR 1) Why do we need Heap? Explain different types of Heap? List out the applications of Heap? eo ii) Illustrate BFS and DFS traversals for the given graph G. © @ © © Graph a [6M] BADRI PRAVEENNEC Soe INA KRADAKAUFEHEIEA TAUTONOMOUS) ILB.Tech I Semester Supple Examinations, September-2023 Sub Code: 19BEC3THOS DATA STRUCTURES Time: 3 hours (ECE) Max. Marks: 60 Note: Answer All FIVE Questions. All Questions Carry Equal Marks _(5 X 12 = 60M) ENGINEERING COLLEGE Q.No Questions Marks Unit-1 7) Define Data Structure? Explain various types of data structure? [MI a |i) Define Recursion? What are the two main components of recursion? Explain with an 6M) 1 example pseudo code? OR b i) Explain different types of recursion with suitable examples? [6M] ii) Define ADT? Explain its significance and advantages? [eM] Unit- |), Write an algorithm for Binary Search? Apply the binary search to find Key=25 in the [eM given list 10,20,25,30,35,40,45? ii) Illustrate the process of Merge Sort for the given list of elements 7,3,2,16244,119? (eM OR 2 D) Mention the primary differences between Internal Sorting and External Sorting aa ies? Apply the Insertion Sort on the given list 8,4,6,3,1,9, 10,2. b | ii) Write an algorithm for Linear Search? Apply the linear search to find key=20 in the given list 10,20,5,35,15,25,30. Mention the best, average and worst case time complexities {6M} of this algorithm? _ Unit-I0 | p[Defing Stack? Explain various operations petformed ofStackiwiti your own examples? [J [6M] «a |jhi) Explain the differenice between Array representation jand Linked Tepresemtation of Queue ‘with suitable éxamples? [om] oe OR i) Explain how the given infix expression A+(B*C)/(E-F) can be converted to posthix jan b | expression by using stack? ii) Define Queue? Explain various operations performed on Queue with examples? [omy Unit-IV i) Identify the differences between an Array and Linked List? Explain Linked List ADT? [eM] 4 [_ Li Explain various operations performed on Cireular Linked List? [eM] OR S i) Is double linked list efficient than single linked list? Justify your answer with example? [6M] ii) List out various advantages, disadvantages and applications of Linked List? [6M] Unit-V_ 1) Define Tree data structure? Explain different tree traversal techniques with suitable 1M] a | examples? 5 ii) Define Graph? Explain various graph representation techniques with examples? [eM] OR i) Consider given Inorder Traversal: D BEA ¥ Cand Preorder Traversal: ABDEC | yp b | F. Construct a binary tree by using the given Traversals? ii) Explain various Graph Traversal Techniques with suitable examples? [eM