CSL205 Data Structure & Applications MBA Question Paper : mvn.edu.in
Name of the College : MVN University
Department : Management Studies
Subject Code/Name : CSL-205-Data Structure and Applications
Year : Jan.2014
Degree : MBA
Sem : III
Website : mvn.edu.in
Document Type : Previous Year Question Paper
Download Model Question Paper : https://www.pdfquestion.in/uploads/mvn.edu.in/3119-DSA.pdf
MVN Data Structure & Applications Previous Question Paper
Time Allowed: 03 hours.
Maximum Marks: 100
Related : MVN University ECL100 Basics of Electronics MBA Question Paper : www.pdfquestion.in/3114.html
Instructions
Before answering the question paper the candidate should ensure that they have been supplied the correct question paper. Complaints in this regard, if any, shall not be entertained after the examination.
January 2014
Note: Question No. 1 is Compulsory and attempt two questions from each section. All questions carry equal marks.
1(a) What do you mean by data structure? Discuss the basic operation of data structure.
(b) Difference between static and dynamic implementation of linked list.
(c)What is a circular queue? Explain its insertion algorithm withexample.
(d) Discuss Binary search tree. (5 x 4 = 20)
SECTION -A :
2 (a) What is a stack? Discuss its operation with the help of examples.(10)
(b) Convert X: A+(B*C-(D/E – F)*G)*H into postfix form. (10)
3. Write algorithm for quick sort? Show how many key comparisons are made in its worst case and best case . (20)
4. Write algorithm for insertion and deletion operation performed on circular queue. (20)
SECTION-B:
5. What is the height balanced tree? Consider the following list of elements 3,5,11,4,9,12,7,2,6,10. Create height balanced tree for above list of elements . (20)
6. What is a graph? How it can be stored in memory? Explain breadth first traversal and depth first traversal with the help of examples. (20)
7(a) Insert the following elements into an initially empty B- tree of order 5: (10)
a,g,f,b,k,c,h,n,q,r,t,m,v,e.
(b)What is DEQUE? Explain its : (5*2)
(i) Deletion of an element from the rear end of the queue.
(ii) Deletion of an element from the front end of the queue.
June 2014
Subject – Data Structure and Applications
Subject Code : CSL-205
Time Allowed : 03 hours.
Maximum Marks: 100
Instructions :
** Before answering the question paper the candidate should ensure that they have been supplied the correct question paper.
** Complaintsin this regard, if any, shall not be entertained after the examination.
** Attempt five questions. Question No. 1 is Compulsory and two questions from each section. All questions carry equal marks.
Q1: a) Explain Bubble sorting with the help of program. (5)
b) What do you mean by array? How the multidimensional array represented in memory? (5)
c) Explain Priority queue with example. (5)
d) Differentiate between directed and undirected graph. (5)
SECTION – A :
Q2: a) What is data structure? Explain its classification. (10)
b) Differentiate static and dynamic memory implementation.(5)
c) Define the term Time and Space complexity. (5)
Q3: a) What do you mean by the term searching? Explain binary searching with the help of program. (10)
b) Define sorting. Write an algorithm for selection sort to sort the following numbers. (10)
2, 5, 3, 9, 11, 6, 8, 4
Q4: a) Convert Infix to postfix & Prefix. (6) A/B*C+D*E-F*H
b) Define the term Queue. How Queue is represented inmemory? (6)
c) What do you mean by stack? Explain its push and pop operation. (8)
SECTION – B
Q5: a) Write algorithms for the following.
i) Insertion at end in single linked list. (7)
ii) Deletion at front in doubly linked list. (7)
b) Define the term circular linked list. Write an algorithm to search an element in circular linked list. (6)
Q6: a) Write an algorithm for inorder traversal of a tree using stack with the help of an example. (10)
b) What is binary search tree .Make a binary search tree for the following numbers? (10) 2, 5, 7, 1, 9, 3, 4 and delete 2, 9 numbers from the tree.
Q7: a) Write an algorithm for DFS traversal and traverse the given tree. (10)
b) Write short note on following. (2×5=10)
i) Adjacency matrices
ii) Minimum Cost spanning tree