Baba Ghulam Shah Badshah University 2009 M.C.A - Data structure and algorithm analysis. - Question Paper

MCA-Il/09 no. of Questions-15+ 5+ five
course Title: Data Structure and Algorithm Analysis mum Marks: 70
course No: NICA-212 Pass Marks: 28
Time Allowed: three hrs
part — A
Note: — Attempt all parts; every carry one mark.
1. Differentiate iteration and Recursion.
2 What is meant by Garbage collection?
3 elaborate the basic operations performed on any data structure?
four describe Stack and Queue.
5. How binary search tree is various from binary tree?
6. Write the time complexities of bubble sort and quick sort.
7 describe Algorithm.
8. What is an asymptotic notation? Mention its kinds.
9. Write the address computation formula for locating a in an array.
d4. What is a Priority Queue?
11. elaborate siblings?
12. elaborate the total number of comparisons and total number of exchanges on Bubbler sort for the worst case situation?
13. What is the need for external sort
14 what is a directed graph?
15. describe Bi connectivity.
part — B
Note: - Attempt any 5 ques. selecting 1 from every unit. every ques. carries 05 marks.
Q.1 describe data structure and categorize them into different kinds based on their
organization and representation, with suitable examples.
Or
describe an algorithm, giving example of Fibonacci series. elaborate the attributes of an algorithm explain?
Q.2 discuss relative merits and demerits of linked data structure over sequential data structures with suitable example.
Or
Write algorithms to insert and delete an element from linear array.
Q.3What is merits and demerits of linear queue over circular queue. discuss an application
of circular queue data structure.
Or
Write the routines for inserting and deleting elements from a queue. Check for the conditions Q-empty and Q-full.
Q.4 discuss Heap sort algorithm and show behavior on the array
A= 3, 41, 52, 26, 38 57, 9.
Or
A sorting method is stated to be stable if at the end of the method, identical elements occur in the identical order as in the original unsorted set. Is merge sort a stable sorting method? discuss.
Q.5 Construct a binary tree to satisfy the subsequent orders
In order: DBFEAGCLJHK
Post order: DFEBGLJKHCA
or
describe Graph. explain different memory representations technique used for graph with the help of an example.
part — C
Note:- Attempt any 3 ques.. every ques. carries 10 marks. -
Q'.1 describe data, information, algorithm and data structure. provide the difference
ranging from linear and nonlinear data structures with example.
Q.2 presume that every element of an array A stored in row-major order occupies 4 bytes of memory. If A is declared as: int a [10][20][5]. And the address of the 1st element of A is 2000, obtain the address of the array element A {5][12][4]. (6)
b) Write a program to delete a node in a doubly linked list. [4]
Q.3 Convert 5*(6÷2)12/4 into post fix form and evaluate that expression using stack. (Write algorithms for both operations)
Q.4 Develop a BST by inserting nodes from subsequent sequence 1 by one:
6232 22 57 37 35 47 42 52 72 92 82 97
Write algorithm to delete a provided node from BST and also perform
. e the subsequent operations.
i) Node 32 is deleted
ii) Node 72 is deleted
iii) Node 57 is deleted
Q.5 describe DFS algo and apply.

Earning:   Approval pending.