2014 Data Structures

Mahatma Gandhi Kashi Vidyapeeth
BCA(3rd semester)
DATA STRUCTURES USING C/C++
2014

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.

mgkvppapers.blogspot.com

Q1- (a) What are arrays? How do we represent single and multi dimensional arrays?  7

(b) Explain Sparse Arrays and Tridiagonal Matrices. 8

Q2- (a) What is Stack? Convert A*B+(C-D)/E into prefix and postfix expression using stack.  10

(b) Explain queue and D-queue. 5

Q3- Write a program in C for the creation of a five node linked list containing integers. Write functions for insertion of nodes and traversal of linked list. 15

Q4- What are Binary trees? How do we create a Binary tree? Write algorithm for the inorder traversal of binary tree. 15

Q5- What are B-tree? Explain the creation and working of a B-Tree with suitable example.    15

Q6- (a) What is Sorting? Compare Insertion Sort and merge sort with suitable example. 8

(b) What is Hashing? Write a function for binary search.  7

Q7- (a) Compare and contrast: 3.5*2=5

(i) Array and linked list 

(ii) Stack and Queue

(b) Explain Indexing of B-Trees with binary search trees. 8

Q8- Explain the following : 5*3=15

(a) Binary Search Tree

(b) Heap Sort

(c) Two - way linked list.

ALL THE BEST

😊😊😊😊😊

mgkvppapers.blogspot.com