be treated as malpractice the remaining blank pages. eo, 4248. 5 z B.LO.E. ASSOCIATION s aa VACHANA PITAiAHA DRP.GHALAKET?! CED r . [ LiRRARY, i eu 4 18CS32 Time: c Third Semester B.E. Degree Examination, Dec.2019/Jan.2020 Data Structures and Applications 3 hrs. Max. Marks: 100 Note: Answer any FIVE full questions, choosing ONE full question from each module. Module-1 What is data structure? What are the various types of data structure? Explain, (05 Marks) ‘What is structure? How it is different from array? Explain different types of structure declaration with examples and give differences between Union and Structure. (10 Marks) Define pointers. How to declare and initialize pointers, explain with exampie, (08 Marks) OR Explain dynamic memory allocation functions in detail (06 Marks) Write the Knuth Morris Pratt pattern matching algorithm and appiy the same to scarch the pattern ‘abedabcy” in the text: ‘abcxabedabxabedabedabcy” (08 Marks) Write a C program to: (i) Comparing strings (ii) Concatenate two strings (06 Marks) Module-2 Define stack. Give the implementation of push, pop and display funetions. Include check for empty and full conditions. (07 Marks) Write the postfix form of the following expressions using stack (i) AS$B*C-D+E\F(G+H) (i) A-B|(C*DSE) (06 Marks) Write an algorithm to evaluate a postfix expression and apply the same for the given postfix expression. ABC-D*+E$F + and assume A = 6, B=3,C = 2,D=5,E =| and F =7. (07 Marks) OR Define recursion. Write a recursive functions for the following: (i) Factorial of a number (ii) Tower of Hanoi (07 Marks) ‘What is the advantage of circular queue over ordinary queue? Write a C program to simulate the working of circular queue of integers using array. Provide the following operations: () Insert (ii) Delete (iii) Display (08 Marks) Write a note on Dequeue and priority queue. (05 Marks) Module-3 What is a linked list? Explain the different types of linked lists with neat diagram. (07 Marks) Write aC function to insert a node at front and delete a node from the rear end in a circular linked list (08 Marks) Write a C function for the concatenation of two doubly linked lists: (05 Marks) Lof3© BLUE ASSOCIATIONS | VACHANA PITAMAHA DR.P.GHALAKATT! || COLLEGE OF ENGINEER Ws Beess2e on {i tiBRARY puarur_) Describe the doubly linked lists with advantages and disadvantages. Write a C fiction to delete a node from a circular doubly linked list with header node. (08 Marks) For the given sparse matrix, give the diagrantmatic linked representation. o 4 a=|3 0 0 (04 Marks) 000 Write a C function to add (wo-polynomials represented as circular list with header node (08 Marks) Module-4 What is a tree? With suitable example, define: (i) Binary tree (ii) Level of the binary tree (iii), Complete binary tree (iv) Degree of the tree (09 Marks) Write the C routines to traverse the tree using: (Pre-order traversal (ii) Post-order traversal. (06 Marks) For the given data, draw a binary search tree and show the array and linked representation of the same: 100, 85, 45, 55, 110, 20, 70, 65. (05 Marks) OR What is the advantage of the threaded binary tree over binary tree? Explain the construction of threaded binary tree for 10, 20, 30, 40 and 50. (07 Marks) Define expression tree. For a tree given in Fig.Q8(b) traverse the tree using in-order, preorder and post-order traversals. Fig.Qg(b) (07 Marks) Construct a binary search tree by using the following in-order and preorder traversals; Inorder : BCAEDGHFI Preorder : ABCDEFGHI (06 Marks) 20f30.E. ASSOCIATION VACHANA PITAMAHE DR.P.GHALAKATT! | COLLEGE OF ENGINEERING | TL LIBRARY. BIJAPUR. 18CS32 jodul 9 a. Define graph. For the given graph, show the adjacency matrix and adjacency list 10 representation of the graph [Ref. Fig.Q%a)] Fig Q%a) (05 Marks) What are the methods used for traversing a graph? Explain any one with example and write C function for the samme, (08 Marks) Write a C function for insertion sort. Sort the following list using insertion sort 50, 30, 10, 70, 40, 20, 60 (07 Marks) oR ‘What is collision? What are the methods to resolve collision? Explain lincar probing with an example. (07 Marks} Explain in detail about static and dynamic hashing, (06 Marks) Briefly explain basic operations that can be performed on a file. Explain indexed sequential file organization, (07 Marks) 30f3