Scribd
Upload
7 views2 pages

Ds 1

This document is an examination paper for the M.C.A. degree in Advanced Data Structures, focusing on algorithms. It includes multiple-choice questions, detailed problem-solving sections, and topics such as algorithm analysis, data structures, graph traversal, and NP-completeness. The exam is structured into three parts, with a total of 100 marks available.

Uploaded by

magimegala1105
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
7 views2 pages

Ds 1

This document is an examination paper for the M.C.A. degree in Advanced Data Structures, focusing on algorithms. It includes multiple-choice questions, detailed problem-solving sections, and topics such as algorithm analysis, data structures, graph traversal, and NP-completeness. The exam is structured into three parts, with a total of 100 marks available.

Uploaded by

magimegala1105
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

RA Reg. No.

Question Paper Code: 30139


NOVEMBER/DECEMBER 2022.
M.C.A. DEGREE EXAMINATIONS,
First Semester

ALGORITHMS
MC 4101 - ADVANCED DATA STRUCTURES AND
(Regulations 2021)
Time:Three hours
Maximum: 100 marks

Answer ALL questions.


PART A (10 >x 2 =20 marks)

1. What is the necessity of algorithm analysis?


2. What is time complexity and its types?
3. How do you identify a red-black tree?

4. What is a heap used for?

5. What are the different ways to represent graphs in memory?

6. Is Floyd-Warshall better than Dijkstra in which way?


7. What is the main idea of dynamic programming?
8. Is dynamic programming better than greedy algorithm design technique
justify?
9. Are all NP problems NP-complete? Explain.
10. List out any four NP-complete problems.
PART B-(5 x 13 = 65 marks)
11. (a) Explain Asymptotic notations and list out common notations with an
example. (13)
Or

(b) Explain Recursion Tree Method with an example. (13)


tree
12. (a) Define B tree and explain the inserting and deletion operation of B
with pseudocode and example. (13)

Or
and max
(b) Explain Heap data structure and also explain about min heap
(13)
heap with one example of heap construction.

13. (a) Difference between BFS and DFS graph traversal algorithms. Consider a
traversals. (13)
tree of minimum height of 4, and do BFSand DFS
Or
kruskal
(b) What is MST? Explain few major differences between prim and
MST. (13)

14. (a) Explain matrix chain multiplication algorithm with an example. (13)

Or
(b) Explain with an example of Huffman coding technique. List few
applications of Huffman coding. (13)

15. (a) Explain NP-complete problem with an example. (13)


Or

(b) Define P, NP, NP-Hard, NP-Complete and explain relations among these.
(13)

PART C-(1x 15 =15 marks)


16. (a) What strategy is followed in Divide and Conquer way of algorithm design
and explain quick sort algorithms in detail with an example? (15)
Or
(b) Define AVL tree and how to determine the balance factor. Explain all
rotations in detail with appropriate examples. (15)

You might also like