Veer Narmad South Gujarat University 2011-3rd Sem B.C.A Computer Application SB-1443 - 303 : Advance 'C' & Data Structure Second Year ( ) - Question Paper
Second Year B. C. A. (Sem. Ill) Examination March / April - 2011 303 : Advance 'C' & Data Structure
Time : Hours] [Total Marks : 70
Instructions
Seat No.:
M CnsLLnlcj.L{l [qoicu u? snqw <h>h41.
Fillup strictly the details of signs on your answer book.
Name of the Examination :
S. Y. B. C. A. (Sem. 3)
Name of the Subject:
303 : Advance 'C' & Data Structure
Student's Signature
|
-Subject Code No.: |
|
-Section No. (1,2,.....): Nil |
(xi) Give the output of following : mainO {
intb[] = {10,20,30,40,50}; int i, * k; k=b;
for (i=0; i<=4; i++)
{
printf (%d, *k); k++
}
(a) Write a recursive function that generate first 7 N fibonacci number S. Also explain what is recursion.
(b) Explain D-queue with example. Write an algorithm 8 to insert and delete in input restricted D-queue.
(b) Convert into Postfix. 8
(i) A+(B*C-(D/E)*G)*H
(ii) (A-B)*X+Y/(F-C*E)+D
(a) Explain Lifo structure in detail. Write an algorithm 7 for all its operations.
(b) Write an algorithm to sort element of given array 8 using quick sort.
(b) Write a program to convert infix expression to prefix 8
expression.
(a) Define AVL tree. Explain possible cases during the 7 insertion of new node into it.
(b) Explain 2-3 tree with example. Also explain how to 8 search an element from 2-3 tree with proper data tracing.
(a) Answer the followqing: 8
(i) Draw tree for following traversal sequence.
Inorder : EACKFHDBG
Preorder: FAEKCDHGB
(ii) Give expression tree for following :
(a+b) * (c-d)/e
Write short notes : (any two) 15
(i) Pointers
(ii) Heap sort
(iii) Tower of Henoi
(iv) Priority Queue.
SB-1443] 2 [ 2400 ]
|
Attachment: |
| Earning: Approval pending. |
