The document is an exam paper for a Data Structures and Algorithms course. It contains 13 multiple choice and short answer questions across two sections. Section A contains 15 compulsory two mark questions testing basic concepts. Section B contains 9 five mark questions requiring longer explanations and algorithms. The questions cover a range of topics including stacks, trees, graphs, sorting algorithms and data structure implementations.
The document is an exam paper for a Data Structures and Algorithms course. It contains 13 multiple choice and short answer questions across two sections. Section A contains 15 compulsory two mark questions testing basic concepts. Section B contains 9 five mark questions requiring longer explanations and algorithms. The questions cover a range of topics including stacks, trees, graphs, sorting algorithms and data structure implementations.
The document is an exam paper for a Data Structures and Algorithms course. It contains 13 multiple choice and short answer questions across two sections. Section A contains 15 compulsory two mark questions testing basic concepts. Section B contains 9 five mark questions requiring longer explanations and algorithms. The questions cover a range of topics including stacks, trees, graphs, sorting algorithms and data structure implementations.
The document is an exam paper for a Data Structures and Algorithms course. It contains 13 multiple choice and short answer questions across two sections. Section A contains 15 compulsory two mark questions testing basic concepts. Section B contains 9 five mark questions requiring longer explanations and algorithms. The questions cover a range of topics including stacks, trees, graphs, sorting algorithms and data structure implementations.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 2
Roll No. ......................
Total No. of Questions : 13] [Total No. of Pages : 02
J-3268[S-1124] [2037] MCA (Semester - 3rd) (B.Sc. IT (Sem. - 2nd)) DATA STRUCTURES & ALGORITHMS (MCA - 302/202) Time : 03 Hours Maximum Marks : 75 Instruction to Candidates: 1) Section - A is compulsory. 2) Attempt any Nine questions from Section - B.
Section - A (15 x 2 = 30) Q1) a) What are the applications of stack? b) A complete binary tree contains 15 nodes. Calculate the depth of the tree. c) Define ADT. What are its advantages? d) What is the difference between linklist and array? e) What is the difference between graph and tree? f) What are the limitations of binary tree? g) What is the complexity of an algorithm? h) What is deque? List its different types? i) What is Bubble sort technique? j) Define : (i) almost complete binary tree (ii) strictly binary tree. k) What are AVL trees? What are its advantages? l) Write the complexities of (i) Heap sort (ii) Quick sort (iii) Merge sort m) Differentiate between depth first search and breadth first search. n) Define : (i) Minimum spanning tree (ii) Forest o) What are the applications of graph? P.T.O. Section - B (9 x 5 = 45) Q2) Explain Dijkastra’s algorithm.
Q3) Write an algorithm to insert an element in a binary search tree.
Q4) Write an algorithm to insert an element at the end in a circular link list.
Q5) Discuss the different tree representation methods.
Q6) Write the procedure to insert an element in the middle of an array.
Q7) Write a procedure to convert infix expression to postfix expression. Apply
the procedure on the following data Q:((A+B)*D)h(E-F)
Q8) Write heap sort algorithm. Discuss its complexity.
Q9) Let E denote the following algebraic expression:
[a+(b-c)]*[(d-e)/(f+g-h)] (a) Draw the corresponding binary tree (b) Apply the preorder traversal (c) Apply the postorder traversal
Q10) Explain the various graph representation methods. List merits and demerits of each.
Q11) Write a short note on Redix sort.
Q12) How would you implement a queue of stacks, a stack of queues, a queue of queues? Write routines to implement the appropriate operations for each of these data structures.
