For More Question Papers Visit - www.pediawikiblog.com 17C833 Third Semester B.E. Degree Examination, June/July 2019 Data Structures and Applications Time: 3 hrs. Max. Marks: 100 Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 1a. Define Data structures. Give its classification. What are the basic operations that can be performed on data structure? (08 Marks) b. Give the ADT for sparse matrix. Express the given sparse matrix in the triplet form and find its transpose. fio 0 0 25 0 7] | 0 23 0 0 45) 0 0 0 0 32 | A= (08 Marks) 4 0 0 31 0} 0 0 0 0 0} 0 0 3 0 0} Consider the given 2 polynomials, ‘ A(xy= 4x" +3x'+5 and B(x) =x" + 10x" + 1 Represent the polynomials using Array of structures. (04 Marks) OR Explain the dynamic memory allocation functions in detail (08 Marks) Write a C program using pointers to (i) Coneatenate two strings, (ii) reverse a string (06 Marks) Apply Knut-Morris-Pratt (KMP) patter matching algorithm to search the patter “abedabey” in the text “abexabedabxabedabedabey” (06 Marks) Module-2 Define stack data structure and give the ADT for stack, Write C functions for push(_) and pop(_ ) operations. (08 Marks) Convert the given infix expressions to postlix and prefix expression. (i) (atbed+e/(tt gh) +i (ii) (a/(b- e+ d)) *(e— 1 * gy (06 Marks) Write an algorithm for evaluation of postfix expression. Trace the same for the expression able—de *tac #t where a=6,b=3,c=1,d=2,e=4 (06 Marks) OR Define recursion. Write C recursive functions for the following : (i) Tower of Hanoi (ii) Factorial of a give number. (07 Marks) Write C functions for inserteq( ) and deletecq( ) operations on a circular queue. (0S Marks) Explain in detail multiple stacks, with relevant functions in C (08 Marks) For More Question Papers Visit - www.pediawikiblog.comFor More Question Papers Visit - www.pediawikiblog.com Module-3 Define linked lists. Explain in detail, the primitive operations performed on Supply Linked List (SLL). List the different types of linked lists, (12 Marks) Write C functions for the following operations on Doubly Linked List (DLL). (i) Concatenation of wo DLL (ji) Search the DLL. for the given key element (08 Marks) oR Write a C program to implement linked stacks. (08 Marks) Write an algorithm to add 2 polynomials using circular simply linked list (SLL), And also represent the given polynomial using CSL P(x, y, 2) = 6x°y'z.— Aye + 3x°yz + Dxy'z— Days! (08 Marks) For the given sparse matrix give the linked list representation, 00400 65000 aly (04 Marks* 30 0 00002 Modute-4 Define tree data structure, Represent the tree given in Fig.Q7(a) using (i) List representation Gi) Lefi-Child Right-Sibling representation (iii) Degree-two or Binary tree representation. @. Ate & © Soe © G © Fig. Q7(a) (08 Marks) Write recursive C funetions for in-order, pre-order, post-order traversals of binary tree (BT). Also give the 3 traversals for the BT shown in Fig.Q7(b) (12 Marks) OR Define Binary Search Tree (BST). Construct BST for the clement step-by-step, 100, 85, 45, 55, 110, 20, 70, 65, 113, 145, 132, 96 (08 Marks) Define threaded binary trees. Given in-order sequence: DIGBHEAFKIC and post-order sequence : JGDHEBKIFCA, construct BT for the same. (08 Marks) Write an algorithm for deleting a key element from BST (04 Marks) For More Question Papers Visit - www.pediawikiblog.comFor More Question Papers Visit - www.pediawikiblog.com Module-5 a. Define the terminologies with example for graph data structure (i) Graph (ii) Multigraph (iii) Complete graph. (06 Marks) b. Give the adjacency matrix and adjacency list representation for the weighted graph given in Fig.Q%b). (06 Marks) Fig.Q%b) €. Write an algorithm for BFS and DFS graph traversal methods (08 Marks) OR Apply insertion sort technique for the following elements | 77, 33, 44, 11, 88, 22, 66, 55 (08 Marks) b. Explain Hashing and collision. What are the methods used to resolve collision. (08 Marks) What are the basic operations that can be periormed on a file? List the methods used for file organization (any 2) (04 Marks) For More Question Papers Visit - www.pediawikiblog.com