B.Sc. (IV Semester) Examination
COMPUTER SCIENCE
Paper IV
(Design and Analysis of Algorithms)
(Under CBCS)
]
Max. Marks
Section A- (Marks: 4 x 10 = 40)
Answer any four questions.
elp of an example explain Strassen's matrix multiplication in detail.
ce.
mic programming, explain the process involved in finding longest com
gorithm to sort the numbers using merge sort.
<plain the P, NP and NP complete problems.
Knuth Morris Pratt algorithm to find string matching.
approximation algorithm for vertex cover problem:
Depth first search algorithin with an example.
Prim's algorithm to find minimal spanning tree.
Section B - (Marks: 2 x 20 = 40)
Answer any two questions.
algorithm, explain the process involved in activity selection problen
oncept of decision trees in detail.
NP completeness and reducibility in detail.
ellman Ford algorithm to find the single source shortest path.
Answers
Answered by
1
Answer:
my god what a cuestion
Explanation:
Similar questions