2015 Data Structures
Mahatma Gandhi Kashi Vidyapeeth
BCA(3rd semester)
DATA STRUCTURES USING C/C++
2015
Note : The answers to short questions should not exceed 200 words and the answers to long questions should not exceed 500 words.
Q1- (a) Distinguish between primitive and non-primitive data structures. Explain how integer data are mapped to storage. 7
(b) A three - dimensional array X[5][6][7] is stored with base address 400. What is the address of X[2][3][4] ? 8
Q2- (a) Write down the algorithm for conversion of infix expression to postfix expression and explain with example. 8
(b) Define Queue. Explain the operation of Insertion and Deletion on the queue. 7
Q3-(a) What are the advantages of doubly linked list over singly linked list? 7
(b) Write a program in C for deletion of data item in the linked list at the specified position. 8
Q4- (a) Write the function of preorder , postorder and inorder for traversing a tree. 8
(b) Write the properties of Binary Search Tree. What are the applications of Binary Search Trees? 7
Q5- Define B-trees. Create a B-tree for the following list of elements:
L = {80,40,60,20,20,20,30,70,50,90,110}
Given minimization factor t=3
Minimum degree = 2 and Maximum degree = 5
Q6- Illustrate the operation of HEAP-SORT on the array. 15
A = [5,13,2,25,7,17,8,4]
Q7- (a) Differentiate between Internal Sorting and External Sorting with example. 7
(b) Compare and contrast between sequential search and binary search. 8
Q8- Write short notes on the following : 5+5+5
(a) Tridiagonal Matrix
(b) Priority Queue
(c) Hashing.
ALL THE BEST
😊😊😊😊😊
Comments
Post a Comment