MGKVP BCA 2016 DS_USING_C/C++

Mahatma Gandhi Kashi Vidyapeeth
BCA(3rd semester)
DATA STRUCTURES USING C/C++
2016
MM:75                                              Timing:3hrs

Attempt any five questions                       Each ques carry 15 marks.
Note : The answers to short questions                        should not exceed 200 words and the              answers to long questions should                    not exceed 500 words.


Q1 - (a) Define a sparse matrix. Explain an efficient way of storing sparse matrix in the memory. Write a program to find the transpose of sparse matrix using this representation.                                              7+8
(b) What do you understand by row-major order and column- major order of array? Derive formula for calculating the address of an array element using base address of array.

Q2 - (a) What do you mean by D-queue? Explain the operation of insertion and deletion on D - queue.                                  7+8
(b) Using stack,write a program to determine whether an infix expression has balanced parenthesis or not.

Q3 - (a) Write a function to insert and delete a node in the beginning of a singly link list.                                                                            7+8
(b) What do you mean by doubly linked list? How traversal can be done on doubly linked list.

Q4 - (a) Construct an expression tree for the "SRIDHARACHARYA FORMULA"(positive root) . Also write pre - order, in- order and past-order traversals of the expression tree formed.                                                           7+8
(b) Write a program to find the solution of the Towers of Hanoi problem.

              mgkvppapers.blogspot.com

Q5 - (a) Create B-Tree of order 5 from the following list of data items.                                            20,30,35,85,10,55,60,25.                    7+8
(b) A binary tree T has 10 nodes. The inorder and pre-order traversals yield the following sequence :
Inorder :    D B H E A I F J C G 
Pre-order:  A B D E H C F I J G
Draw the tree T. 

Q6 - (a) Sort the following data using heap sort
92,59,27,15,13,11,19,3,4,5 7.5 + 7.5
(b)Write a c program to search a number in an array using Binary search method.

Q7 - (a) Write a c program for selection sort. 7.5 + 7.5
(b) What do you mean by hashing? Explain any five hash functions.

Q8 - Write short notes on any two of the following :      7.5 + 7.5
     (i)   Priority queue
     (ii)  Binary search tree
     (iii) Tree indexes.

ALL THE BEST
😊😊😊😊😊

Comments

Popular posts from this blog

MGKVP BCA 2ND SEM C PROGRAMMING QUESTION PAPER

Mgkvp bca 6th semester Information System : Analysis Design and Implementation previous years question papers and notes

MGKVP BCA COMPUTER FUNDAMENTAL QUESTION PAPER