MGKVP BCA 2017 DS_USING_C/C++
Mahatma Gandhi Kashi Vidyapeeth
BCA(3rd semester)
DATA STRUCTURES USING C/C++
2017
2017
Q1- Write a program in C to obtain the sum of two upper triangular matrices of order 3×3. 15
Q2 - (a) Explain the procedure for converting from infix to postfix with the help of an expression tree. 8+7
(b) What is a priority queue? What are its applications?
Q3 - (a) Write a C program to count the number of nodes (elements) in a singly linked list. 8+7
(b) Write a program in C to insert an element (new node) in a singly linked list at the third position from the start node.
Q4 - (a) What is a binary search tree? Write the application areas that use a binary search tree. 5+5+5
(b) What do you understand by the spanning tree (T) of a given graph G? What is the difference between a tree and a graph?
(c) Write an algorithm to carry out insertion and deletion of a node in a binary search tree.
Q5 - (a) Explain B - Tree, B - Tree Creation. 5+5+5
(b) Explain the applications of B-Trees in database environment.
(c) How can binary search trees be used for the creation of Index Sequential Files.
Q6 - (a) Write a C program for the selection sort of a list of N numbers. 8+7
(b) What is Insertion sort? Explain its technique with an example.
Q7 - (a) Write the algorithm for Binary Search and Explain it. 7+8
(b) Write a C program for Quick Sort on a list of N integers.
Q8 - Explain the Technique of 'Hashing' as an effective searching technique. What are ' Collisions' ? How can they be handle? 15
Q9 - Write short notes on : 5+5+5
(a) Tridiagonal Matrices
(b) Applications of Stacks
(c) Recursion
ALL THE BEST
😊😊😊😊😊
Comments
Post a Comment