aes Senaig TO rem Semester B.E./B.Tech. Degree Examination, June/July 2024 Data Structures and Applications Max. Marks: 100 Note: I. Answer any FIVE full questions, choosing ONE full question from each module, 2M: Marks, L: Bloom’s level , C: Course outcomes. — Module= 1 MILT e Qik [| What i data sroctre? Dist and explain daa swcture operations os / 12 | Cor b. | Discuss four dynamic memory allocation functions. 08 | L2 | Cor c. | With suitable example, discuss self-referential structures. 04) L2 | COL OR Q2 | a. | What is sparse matrix? Give the triplet form for given matrix and also find [ 06 | L3 | CO2 its transpose. O01 23 0 (107 0 [0 [40 1 far{of22 0 A= 2 ololo 3 [20l0 |0 [50 afo[is[o [25 . | Explain ADT stack, 07 12 | Coz . | Define Stack. Implement the operations of stack using arrays. 07/ L1 | Co2 Module =2 Q3 | a. | What is the advantage of cireular queue over ordinary queue? Discuss the | 08 | L2 | CO2 implementation of circular queue operations. , | Demonsirate multiple stacks and queues with Suitable example 12/12 [coz OR Q4 | a. | Explain Linked Stacks and Queues operations. 10 | 12 | Coz ». | Give the C functions for the following on singly linked list with example: | 10) L3 | CO3 i). Insert anode at the beginning ii) Delete a iode at the front iit) Display - = Module —3 oO Q5 |. | Define linked Tist? Implement C function for the following circular Doubly | 10 | L3 | CO3 linked list | i). Insert a node at the beginning ii) Delete a node at the end : iii) Display b. | Develop a funetion to delete a node whose information field is specified in | 10 | L3 | CO3 singly linked list. OR Q6 | a. | What isa tree? With suitable example, define 07] 12 | Cos i) Complete binary tree ii) Degree of the tree | iii) Level ofa node b. | List and explain representation of a binary tree? 07 | 12 | Cos ¢. | Explain Incthreaded binary tree. 06 | 12 [Cos 1 of2BCS304 Module—4 Q7 Ja. | For the given data, draw a binary search tree. 07 | 13 | Coa 100, 85, 45, 55, 110, 20, 70, 65. b. | List and explain the common operations of binary search tree. 07 | 12 | Cos | c. [Explain about forests. 06 | 12 | COz ‘OR Q.8 | a. | Define graph. Explain graph abstract data types. 10 . | Explain the elementary graph operations 10 Module —5 =) Q.9_[ a. | Define hashing. Explain types of hashing functions in detail 0 b. 10 [Q.10 |_| Write a short note on = 7 a. | Leftist trees — 06 | 12 | Coa b. | Optimal binary search tree 07 12 | Cos . | Priority queues 07 [12 [coz 2of2