Wednesday, September 4, 2013

2BCA3 : DATA STRUCTURES USING C NOV/DEC 2009 QUESTION PAPER

                        II Semester B.C.A Examination ,Novemeber/December 2009
                                      O.S. Scheme
                                   Computer Science
                        2BCA3: DATA STRUCTURE USING C

TIme: 3 Hours                                                                Max.marks :80

Instruction :Answe all Sections.

PART-A

Answer any eight questions .      8 X 3 = 24

1.What are the operations performed on non-primitive data structures ?

2.Write a C program to concatenate two strings.

3.Explain recursion with an Example.




4.Write an algorithm to delete an element from an array.

5.What is priority queue ? What are the types of prority queues ?

6.Write an algorithm to pop an element from the stack.

7.List the applications of queues.

8.Explain C functions used in dynamic memory allocation.

9.Explain the following terms:

i) Depth of tree.

ii) Non-terminal node.

iii)Degree of node.


10.Construct binary tree  fot  the expression ( a + b )/(c + d)

PART-B

Answer any four questions       4 X 14 = 56

11.a)Explain the memory repressentation of string specifyinbg its advantages and disadvantages. 7marks

b)Write a C program for string pattern matching .    7marks


12.a)Wrie a C program to generate Fibonacci sequence using recursion.    7marks

 b) Explain how arrays are stored in memory.        7marks


13.a) Write an algorithm to search for an element in a sorted linked list 6Marks

   b) Compare singly linked list,doubly linked list and circlarly linked lists. 8Marks

14.a)Write a C program to implement stack using pointers. 7Marks

    b) Explain the algorithm used to evaluate postfix expression    7marks

15.a) Explain the algorithm used to insert an element into a binary search tree. 7marks

    b)Explain the sequential representation of binary tree in memory.      7marks

16.a) Explain Quick sort algorithm.    7marks

   b)Explain binary search .Write a C function to implement binary  search.   7marks    

No comments:

Post a Comment