A-8733 B.C.A. (Sem. II) (CBCS) Examination March / April - 2015 Data Structures Time : 3 Hours] [Total Marks : 70 Instructions : Q@ We saa g Ramat aa Grea we are aad. Seat No. Fillup strictly the detalls of @ signs on your answer book, Name ofthe Examination ‘+[.B.C.A. (SEM. Ill) (CBCS) Name ofthe Subject + [ DATA STRUCTURES e-subjactcodeno. 3 ]f 7 ]f 3 I] 3 ]-#Sestonne. (1.2.2.9 [NIL ‘Students Signature @) Write to the point, (3) Provide examples and diagrams wherever appropriate / necessary. (4) Figures to the right indicate full marks to the question. 1 Answer the following Questions: (Any Seven) 14 (@) Explain the application of link list. (>) Explain self referential structure with an example. © Evaluate postfix expression:- 5, 6, 2, +, *, 12, 4, /, « @ Explain sibling and forest in tre (© Explain Priority queue. ® What do you mean by terminal node? Explain with an example. (@ Discuss the real world example of stack. (h) Difference between int *p and int**p, 2 (A) What do you mean by stack? List out the application 7 of stack and write down the algorithm of infix to postfix. OR (A) Comparison between dynamic stack and static stack. 7 Write down the program of dynamic stack. (B) Comparison between dynamic memory allocation and 7 static memory allocation. Which is the better? "Justify your answer with an example". A-3733] 1 [Contd...3 “@ B®) ®) ®) Comparison between simple queue and circular queue. 7 Write down the algorithm of insert and delete an element in circular queue. OR What do you mean by doubly link list? Write down 7 the algorithm of (1) Insert an element in beginning (2) Insert an element at middle position, What do you mean by Sorting? Discuss the comparison 7 of sorting technique and according to you which sorting technique is more efficient. What do you mean by tree? Discuss various terminologies 7 of trees with an example. Construct the tree and write down the preorder, postorder 7 and inorder of following expr [ato] * [(@-e)/(E+g-h)]. OR Explain sequential representation or linked storage 7 representation of binary tree. jon: 5 Answer the following Questions: @M @) @) A-3733] Discuss tower of Hanoi. o What do you mean by searching? Differentiate 6 between binary search and linear search. Write down an algorithm of binary search. Comparison between LIFO and FIFO. 3 2 [ 1100 }