Scribd
Upload
150 views1 page

Model Examination, Feb - 2021 I MSC Cs - I Semester Analysis and Design of Algorithm Time: 3 Hrs Marks: 75 Part - A Answer The Following. (10 X 1 10)

The document outlines a model examination for the I MSC CS - I Semester course on Analysis and Design of Algorithms at Nilgiri College of Arts and Science. It includes various questions on algorithms such as Prim's algorithm, single-source shortest path, optimal binary search trees, and dynamic programming. The exam consists of multiple parts with questions requiring detailed explanations and algorithm descriptions.

Uploaded by

zahid
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
150 views1 page

Model Examination, Feb - 2021 I MSC Cs - I Semester Analysis and Design of Algorithm Time: 3 Hrs Marks: 75 Part - A Answer The Following. (10 X 1 10)

The document outlines a model examination for the I MSC CS - I Semester course on Analysis and Design of Algorithms at Nilgiri College of Arts and Science. It includes various questions on algorithms such as Prim's algorithm, single-source shortest path, optimal binary search trees, and dynamic programming. The exam consists of multiple parts with questions requiring detailed explanations and algorithm descriptions.

Uploaded by

zahid
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

SUB Code: 13A Reg No:_____________

NILGIRI COLLEGE OF ARTS AND SCIENCE, THALOOR 13. A) Explain prim’s algorithm using greedy method. (OR)
MODEL EXAMINATION, FEB – 2021 B) Explain single – source shortest path algorithm.
I MSC CS – I SEMESTER
ANALYSIS AND DESIGN OF ALGORITHM 14. A) Explain about optimal binary search tree. (OR)
Time: 3 Hrs Marks: 75 B) Explain the general method of dynamic programming.
PART – A
Answer the following. (10 x 1 = 10) 15. A) Describe Graph Coloring. (OR)
1. ____ refers to the task of determining how much computing B) Explain about Traveling Salesperson using Branch and
and storage of an algorithm requires. Bound technique.
2. The complexity of searching an element from a set of n
elements using Binary search algorithm is______. PART – C
3. What are the elementary data structures? Answer the following. (5 x 8 = 40)
4. A _____ is a finite set of nodes that is either empty or consists 16. A) Explain in detail about tree structure. (OR)
of a root and two disjoint nodes. B) Describe in detail about elementary data structures.
5. ________ sort locates the largest value and places it in the final
array position. 17. A) Explain the basic traversal and search technique. (OR)
6. Any subset that satisfies the constraints is called _____. B) Describe quick sort with algorithm.
7. What is the formula for finding knapsack problem?
8. Define dynamic programming. 18. A) Write a short note on 0/1 knapsack problem using greedy
9. Define Hamiltonian Cycles. method. (OR)
10. What are the two main constraints used to solve backtracking B) Describe an optimal randomized algorithm.
methods?
19. A) Explain in detail about multistage graphs. (OR)
PART – B B) Explain 0/1 knapsack problem using dynamic method.
Answer the following. (5 x 5 = 25)
11. A) Explain about algorithm specification. (OR) 20. A) Explain in detail about the general method of Branch and
B) Explain Heap sort with example. Bound. (OR)
B) Explain 8 – Queen Problem using backtracking method.
12. A) What are the techniques for binary trees? (OR)
B) Explain about Merge sort algorithm.

You might also like