We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1
Code No: 20XX3T02(XX:CS/IT/CM/CC/CO/AD/AM) R20
II B. TECH I SEMESTER REGULAR/SUPPLEMENTARY EXAMINATIONS, JANUARY - 2023
DATA STRUCTURES (Common to CSE, INF, CSM, CIC, CSO, AID and AIM) Time: 3 Hours Max. Marks: 70 _____________________________________________________________________________________________________________
Note: Answer ONE question from each unit (5 × 14 = 70 Marks)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ UNIT-I 1. a) Define Algorithm. Explain time complexity and space complexity of an [7M] algorithm. b) Write an algorithm for searching an element using Linear search. [7M] (OR) 2. a) Explain polynomial addition using arrays. [7M] b) Write an algorithm to sort the elements using radix sort. [7M] UNIT-II 3. a) What are the various applications of Stacks and Queues? [7M] b) Write algorithms to insert new node at the beginning, at middle position [7M] and at the end of a singly linked list. (OR) 4. a) Write a C Program to perform PUSH and POP operations on Stacks. [7M] b) Why doubly link list is better than single linked list? Justify your answer [7M] by taking suitable example. UNIT-III 5. a) Explain pre-order, in-order and post-order traversals of Binary tree. [7M] b) Define Binary Search Tree. Discuss Insertion and Deletion of an element [7M] from Binary Search Tree. (OR) 6. a) Construct Binary Search Tree by inserting the following key [7M] elements:10,12,5,4,20,8,7,6,15. b) What is a Threaded Binary Tree? Explain with an example. [7M] UNIT-IV 7. a) Define Graph. Explain representation methods of Graphs. [7M] b) Write an algorithm for minimum cost spanning tree using Kruskal’s [7M] algorithm. (OR) 8. a) Discuss various Graph traversals with examples. [7M] b) Explain Dijkstra’s algorithm for finding Shortest Path in a Graph. [7M] UNIT-V 9. a) What is hashing? Briefly explain various hashing methods. [7M] b) Explain Open Hashing with an example. [7M] (OR) 10. a) What are the various Collision Resolution Techniques? Briefly explain [7M] each technique. b) Explain Boyer Moore Pattern Algorithm. [7M] ***** 06-01-2023 Page 1 of 1
Solving Multiple Distribution Center Location Allocation Problem Using Kmeans Algorithm and Center of Gravity Method Take Jinjiang District of Chengdu as an ExampleIOP Conference Series Earth and Environmental Science