Scribd
Upload
146 views2 pages

Advance Data Structure With C++ 2022

This document appears to be an exam paper for an MCA 1st Semester course covering advanced data structures using C++/Java. It contains 9 questions across 4 units. Unit 1 covers topics like divide and conquer, minimal spanning trees, recurrences, threaded binary trees, Euler graphs, and non-deterministic algorithms. Unit 2 discusses B-trees, heaps, spanning trees, Kruskal's algorithm, DFS and BFS traversal. Unit 3 explains recurrence tree method, substitution method, and binary search trees. Unit 4 is about the 0/1 knapsack problem, greedy algorithms, Knuth-Morris-Pratt algorithm, NP-complete problems, and the 8-que

Uploaded by

Anuj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
146 views2 pages

Advance Data Structure With C++ 2022

This document appears to be an exam paper for an MCA 1st Semester course covering advanced data structures using C++/Java. It contains 9 questions across 4 units. Unit 1 covers topics like divide and conquer, minimal spanning trees, recurrences, threaded binary trees, Euler graphs, and non-deterministic algorithms. Unit 2 discusses B-trees, heaps, spanning trees, Kruskal's algorithm, DFS and BFS traversal. Unit 3 explains recurrence tree method, substitution method, and binary search trees. Unit 4 is about the 0/1 knapsack problem, greedy algorithms, Knuth-Morris-Pratt algorithm, NP-complete problems, and the 8-que

Uploaded by

Anuj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Roll No.

4JN
Total No. of Questions: 9] Total No. of Pages :3
67008-N
MCA 1st Semester (Regular) Examination,
March-2022
(MCA 2 Year Programme)
(w.e.f. 2020-21)
Paper-20MCA21C5
ADVANCE DATA STRUCTURES
USING C++/JAVA
Time: Three Hours [Maximum Marks: 80
Before answering the questions, candidates should ensure that
they have been supplied the comect and comylete question paper
No complaint in this regard, will be entertained after examination.
Note-Attempt fve questionns in all, selecting one
question from each Unit. Q. No. 1 is
compulsory. All questions carry equal marks.
1. a What is Divide and Conquer method 2
(b)What are minimal spanning tree ?
What do you mean by Recurrences ?
(d What is threaded binary tree ?
67008-N (1) RR-589 P.T.O
) -What are Euler graphs ? 5. Explain the
( What do you mean by non-deterministic
following
(a) B-tree and their
algorithms ? implementation using
C++/Java
(g) What is Prim's algorithm ? Concept of heap and heap operations 8,8
Ch) What is topological sort
? 2x8 16 Unit-II
Unit-I 6. (a) What is a spanning tree ? How Kruskal's
2.
2. (a) What do you mean by complexity of algorithm results in a minimum-cost
spanning tree ? Illustrate.
algorithms ? What is the importance of
algorithm and data structure in computer (b) How is DFS traversal different from BFS
traversal ? Discuss their pros and cons. 8,8
science? Explain.
7. Explain the following :
b) What is Strassen's method ? How is
significant ? lustrate. 8,8 (a) Ford-Fulkerson algorithm

(b) Max flow-Min cut theorem 8,8


3 Explain the following:
Unit-IV
(a) Recurrence Tree Method How
8,8 8. (a) What is 0/1 Knapsack problem ?
Substitution Method
(b) Greedy method can be applied to solve
Unit-I the Knapsack problem ? Justify.
What is binary search ? Determine its What is Knuth-Morris-Pratt algorithm
?
4 (a) (b)
8,8
complexity and write down an algorithm How is it significant ? Explain.
for binary search technique. 9. Explain the following
AVL trees ? What are their
(b) What are
(a) NP Complete problems
applications ? How are these 8,E
(b) 8-Queens problem
implemented? Illustrate. 8,8
(3) RR-589
67008-N
RR-589
67008-N (2)

You might also like