CB CSISCHEME Third Seme: er B.E./B.Tech, Degree Examination, Dec.2024/Jar Data Structures and Applications Time: 3 hrs. Max. M i Note: 1. Answer any FIVE full questions, choosing ONE full question from each module 2M: Marks , L: Bloom's level, C: Course outcomes. : _ Module 1 77 [MIL] c Qi Ja. Define Data Structures. Explain the-classification of data structures with a | 8 | 12) COL neat diagram. “Sy Write a © Functions to impleffert pop , push and display Operations for | 7 | L2 | CO2 stacks using assays, a Differentiate structures an@-unions.— eee 5 |2| com OR — 3 Q2 a.) Write an algorithmito evaluate a postfix expression and apply the same for| 7 | L3 | COz the given postfix expression. 62/3-42- | | | 4 | ’b. Explain the @ynamic memory allocation Function in detail. |e | i2| cor | + 7 Whttls Sparse matrix? Give the tiple form of a given matrix and find its 5 | 13 | cor| transpose | 00304] « | | =] " os 7 4 \ | ae | oooo00 | lo 264 ol | zs Sess | [ Module=2 a @3 a. | Define Queue. Discuss how to represent a queue using dynamic assays. | 8 | L2 | CO2 | t 7 ol b. Write C Function to implement nsertion() , deletion () and display ( yl 6 | 13 | coz | operations on circular qu | | | | ¢. | Write a note on Multi and queues with suitable diagram, 6 | 12 | Coz : ORY = | What is a linked list? Explain the different types of linked list with neat] 6 | L2 | CO3 diagram, b. Writes n Tor the following’on singly linked list with example 8 | 13 | Cos ide of the 1g ) Delete anode at the | Display. 4 | | €. | Write the C function #6 add two polynomials, e \6 | 12 {cos} | \ \ ee dich lof2ae ‘additional list operation + [ i) _ Inverting Singly linked list ii) ‘Concaténating Singly linked list. | pecs S304 12] cos} | 6 [12 | cos] ‘OR Pe, _— @6 Ja.) Discuss Inorder , Preorder , Postordé, and Level order traversal with [ 8 [13 [Cos] suitable function for each. | | | | s | | . Define the threaded binary tree, Construct threaded binary wee for the | 6 | L2 | cos) following element: A, B, C,DpEy F, G, H, 1. Wests cal | ‘e. Write aC function for the following | 6 | 13 | cos | i) Insert a node at the beginning of doubly linked.list! kept ii) Deleting a node at the end of the doubly linked fist. | \ | Q7 | a. | Define Forest , Transform the forest intola-binary tree and traverse using [8 | L1| cos| inorder , preorder and postorder traversal with an example. | b. Define ‘Binary search tree. Constructa binary search tree for the following | 6 | 12 | cos | elements: 100,85, 45,55, 120,20, 70,90, 115, 65,130, 145 | | | Discuss Selection tree with an example. \6 | 12 (co \ ~ OR ae Bad Q8 | a. | Define Graph. Explain adjacency is aga list representation | 8 | L2 | COS with an example: 4 ._™. &’ b. | Define the Doing tis ya Bar 6 | L2 | COs i) Digraph ii) Weighted ap ii) es US graph. @ Briefly explain about Elem 3ph operations. > 6 | 13 | Cos a SS oS t= in detail OR Define Hashing. Explain. different has examples, _