DR.R.K.SHANMUGAM COLLEGE OF ARTS &
SCIENCE
INDILI,
KALLAKURICHI
UNIVERSITY
MODEL EXAMINATION (NOV – DEC 2022)
SUB
NAME: DESIGN AND ANALYSIS OF ALGORITHMS
SUB
CODE: CCS53 TIME: 3 Hrs MAX MARKS: 75 DATE
: 02-12-2022 CLASS:
III B.Sc., CS
SECTION
A
ANSWER
ALL QUESTIONS. 10X2=20
Marks
1. Define
algorithm.
2. Write an algorithm to find the volume of a cube.
3. What is selection sort?
4. What is binary search?
5. Define – Minimum Cost Spanning Tree.
6. List any two problems that can be solved by using Greedy
methods.
7. Define – Dynamic programming.
8. State for what multistage graphs is used.
9. Define – Hamiltonian Cycles.
10. What is Branch and bound?
SECTION B
ANSWER ALL THE QUESTIONS 5x5=25
marks
11.
(a) Write the algorithms specification. (OR)
(b)
Explain about Graphs.
12.
(a) Implement Merge Sort with your own
sample data. (OR)
(b)
Explain how to implement quick sort with sample data.
13. (a) Describe the procedure followed in Job
Sequencing with Deadline algorithm to find the
optimal solution with Greedy method.
(OR)
(b) A text is made up of characters a, b, c,
d and e each occurring with probability 0.11,
0.40, 0.16, 0.09 and 0.24 respectively. What will be the
average length of the text by
using the Optimal Huffman Coding.
14. (a) Write the procedure for All Pair Shortest
Path Problem. (OR)
(b)
Bring out the differences between BFS and DFS with example.
15. (a) Explain Graph Coloring concepts and
Chromatic Number with example . (OR)
(b) Explain about LC Branch and Bound
method.
SECTION C
ANSWER ANY THREE QUESTIONS 3x10=30
marks
16. Explain about
Asymptotic Notations in detail.
17. Explain the
procedure followed in Binary Search with example.
18.
Explain in detail about Prim’s and
Kruskal’s algorithm with example.
19.
Give a detailed note on Multistage Graph
problem to find the shortest path from
source to sink.
20. Describe the procedure for solving 8 Queens Problem.
****************************ALL THE BEST*********************
.jpg)
No comments:
Post a Comment