COPYRIGHT RESERVED VKV(Il) — BCA (3) 2018 Time ; 3 hours Full Marks : 100 Pass Marks : 40 Candidates are required to give their answers in theirown words as far as practicable. The questions are of equal value. Answer any five questions. 4. Write a program in ‘C' to insert and delete an element in a circular link list. 2. (a) Write an algorithm to concatenet two singly linked list. (b) Write an algorithm to Split a singly linked list in two part. hat is meant by stack ? What are the Applications of stack 2 Write Push and Pop function in ‘C’. LA-3/2 * (Tum over)4./ Write a procedure to convert in-fix expression to post-fix expression. Apply | the, procedure on the following expression : (A+B) * OD) T (E~F) BY ! What is meant by Queue 2 Write a rsAm in ‘C'to create a queue froma stack. 6. Write an algorithm to insert an element in a binary search tree. 4 What is AVL tree ?\What are its advantages ? ~~ Create an AVL tree using the following sequence of data: —~ 16; 27, 9, 11, 36, 54, 81, 63 8. Explain the threaded binary tree in detail. 9. Write an algorithm for binary search. Calculate the time complexity of above algorithm. io! Write short notes on the following : (a) Data Structure _- (b) B-Tree _ (c) Dynamic Memory Allocation ory oe eo LA — 3/2 (800) (2) VKV(It) — BCA (3) {COPYRIGHT RESERVED VKV(Il) — BCA (3) \ 2046 Time : 3 hours Full Marks : 100 Qualifying Marks : 40 Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks. Answer any five questions. (FUNDAMENTAL OF DATA STRUCTURE) 1 Mitte notes on the following : 5x4 = 20 Ua) Structure (b) Array (c) Pointer (d) Do..... while 2. Write C-function of the following : 10x2 = 20 (a) To reverse a singly linked list (b) To insert a node in singly linked list JG-3/2 (Tum over)3 Differentiate between the following: 10*2 = 20 (a) Array and Linked list (b) AVL Tree and Binary Search Tree (BST) (a) Change the following infix expressions into postfix 10 (a—b)* (c+ d)/(f-(g—h)) (b) Write a C-program to implement Binary Tree. = 10 Write a C-Program to reverse a queue using one additional stack. 20 (a) What are the differences between Singly linked list and Doubly linked list. 10 (b) Implement PUSH and POP operations of stack in C-language. 10 Give the sequential representation of the following tree : 208. (a) Write a function that finds height of a binary tree, 10 (b) What is Threaded Binary Tree ? 10 oo 2 Draw a binary tree of the following sequences age 20 ‘ Pre-order In-order = A B a B H Cc G ae D A ar E Cc oo F D _ G = =a H F 10. Write a C-program to add two polynomial — equations by using Linked List. 20 ak pci rt Sd eS = JG — 3/2 (600) (3) VKV(Il) — BCA (3) afo Roast g VKV(Il) — BCA (3) i. COPYRIGHT RESERVED 2015 Timo : 3 hours Full Marks : 100 Pass Marks : 40 Candidates are required to give their answers in their own words as far as practicable. The questions are of equal value. Answer any five questions. 14. Explain data structure and discuss advantage of using Arrays in a program. 2. Discuss the method of defining and accepting data in a two dimensional array with the help of an algorithm. 3. Describe memory allocation and de-allocation and explain why it is needed in a program. Explain linear and non linear data structure with example. : ZV-8/1 (Tum over)5. What is stack ? Explain PUSH and POP with = reference to use in a stack. ie 6. Describe Queue data structure and explain how it _ is different form stack. = 7. What do you mean by Tree Traversing ? Explain \./ INORDER traversing with a suitable example. - 8/ Illustrate difference between Dynamic Memory / allocation and static memory allocation. 9. Convert the following postfix expression into prefix expression ; 38 + — 57 *3-/+ Le Write short notes on the following : (a) Bubble Sort (b) Binary Search ; BA 3 ZV-8/ (400) (2) VKV(II) — BCA)COPYRIGHT RESERVED VKV(Il) — BCA (3) 2014 Time : 3 hours Full Marks ; 80 Candidates are required (o give their answers in their own words as far as practicable. The questions are of ‘equal value. Answer any five questions. 4. What is Doubly Linked List ? Write a function : (a) To create a Doubly Linked List. (b) Compare and contrast Circular List and Doubly Linked List. efine various primitive and non-primitive data structure with suitable example. 3. Write an algorithm to find the smallest and greatest among ten numbers stored in a list. Os is non-linear data structure different from linear data structure ? Explain with suitable example. VO-3/3 (Tum over)as 5. rite an algorithm that translates an infix expression into post fix notation. 2 .~ Explain the different tree traversal techniques using suitable example. : 7 Whatis pre and post order traversal. Consider this binary tree, Give sequences for : (i) Pre-order traversal (ii) Post-order traversal A | a \ H Lx jk - ie U >’ f Gq | Ts oa 8. Write a program to push an item into stack where stack is an array of fixed size. Hei 9. Consider the following arithmetic expression in postfix notations : 752 + * 415 -/— (a) Obtain the value of it. ae. VO-3/3 (2) Contd.((b)) Find Prefix form of the above. (c) Obtain the value of Prefix form expression from it. ippiie short notes on the following : (a) BTree (b) Heap sort (c) PUSH and POP (d) Recursion and Stack VO — 3/3 (700) (3) VKV(Il) —BCA (3)far MARY COPYRIGHT RESERVED VKV(Il) — BCA (3) 2013 Time : 3 hours Full Marks : 100 Candidates are required to give their answers in their own words as far as practicable. The questions are of equal value. Answer any five questions. 4. hat is linked list ? Explain doubly linked list and circular linked list. 2 What do you mean by Stack ? Write the basic operations performed on stack. 3.Describe the concept of data structure. Explain different types of data structure. 4, What is Memory Allocation ? Define different types of memory allocation techniques. Also write the difference between Array and Linked List. YZ-3/3 % (Turn over )aK Explain the queue data structure. Also explain the various types of queue. Write a program to create a linked list. Also write the function for insertion and deletion. Write the basic terminology of tree. Explain the memory representation of binary tree. (a) Convert the following expression into postfix : () a+b*dTelf(gih)*K (ii) 12/(7-3)+2* (8 +5) * 16/4 (b) Evaluate the following postfix expression where :A=10,B=5,D=7,E=12,F=8, G=15 (i) AB -DEr (i) ABD T+EF-/G+ (iii) ABD + * E/FGHK/+* — (a) Define Height Balanced Tree with example. (b) Define BST. Write algorithm for insertion and deletion in BST. YZ-3/3 (2) Contd.LL Ps ‘Write short notes on the following : (i) Threaded Binary Tree (ii) Quick Sort eae (iil) AVL Tree ae (iv) Structure a He = YZ —3/3 (800) (3) VKV(Il) — BCA (3)COPYRIGHT RESERVED VKV(Il) — BCA (3) 2012 Time : 3 hours Full Marks : 100 e Candidates are required to give their answers in their own words as far as practicable. The questions are of equal value. + Answer any five questions. _ 1. Describe the concept of Data Structure ? Define allocation techniques with an example. How allocation technique useful for Data Structure ? (a) What are the basic operations performed on. a list ? What is the difference between doubly linked lists and singly linked list: What are the advantages of doubly linked list ‘compaired to linked list ? 2 a _S?) Write an algorithm to construct doubly linked list and search for a data. DD-8/2 (Tumover)3. Write a program to implement of linked list 2 4. Write a program to inserting a node in the middle of the link list ? 5. Convert the following expression into postfix notation : (a) ((A+B)* C-(D-E)) S(F+G) ® (b) 12/ (7-3) +2* (145) (©) (ad) (dy a&&b]|cl[l(c>f Give stepwise representation. 6. (a) DrawaB-tree by inserting the following data : 10, 2, 61, 25, 18, 16, 35. 2 (b) Write a recursive algorithm for inserting a . node into B-tree. 7. (a) “What is the difference between stack and _ queue ? ~The input file has 10 records. with keys (9) 26, 5, 37, 1/64, 17,15, 48, 19. Present the status of the file at each call of (b) quick sort. (2) . Contd. DD -8/28. 10. DD- (a) Define BST and what are the objectives of BST? (b) Define AVL Tree. The following keys are to be inserted in the order to show into an AVL Tree : A,Z,B,Y,C,X,D, WE, VF. Write short notes on the following : (a) Deallocation Memory (b) Binary Search Tree (©) Multidimensional Array (d) Traversing and Merging Link List Declare a concrete type stack variable with 15 elements. Use the new opeartor to allocate memory from free store. Also, define push () and pop .() member functions. 8/2 (1,100) (3) VKV(II)— BCA(3)