Scribd
Upload
113 views2 pages

Design and Analysis of Algorithms

This document outlines the structure and content of the IV Semester B.C.A. Degree Examination for the Design and Analysis of Algorithms course. It includes instructions for candidates, three sections of questions with varying marks, and topics such as algorithm characteristics, recursive algorithms, and various algorithmic techniques. The examination covers both theoretical concepts and practical programming tasks related to algorithms.

Uploaded by

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

Design and Analysis of Algorithms

This document outlines the structure and content of the IV Semester B.C.A. Degree Examination for the Design and Analysis of Algorithms course. It includes instructions for candidates, three sections of questions with varying marks, and topics such as algorithm characteristics, recursive algorithms, and various algorithmic techniques. The examination covers both theoretical concepts and practical programming tasks related to algorithms.

Uploaded by

sdkdidid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
{A 008 483205 DCCA402 eo TTT TT IV Semester B.C.A. Degree Examination, July/August - 2024 COMPUTER SCIENCE Design and Analysis of Algorithms (NEP Scheme) Time : 2% Hours Maximum Marks : 60. Instructions to Candidates: Answer all the sections. SECTION-A L Answer any Four questions. Each question carries 2 marks. (4x2=8) List any two important characteristics of algorithm, Define divide and conquer ‘techniques, What is minimum cost spanning tree? Give an example. Define binary tree. List three types of binary tree traversal, Define Huffinan codes, What is backtracking? Pow ew Be SECTION-B I Answer any Four questions. Each question carries § marks, (4x5=20) 7. Explain worst case, best case and average case efficiencies with examples, 8. Whatis recursive algorithm? Analyse time efficiency for finding factorial of a number. 9. Write a program to solve Tower of Hanoi problem for different number of disks. 10. What is topological sorting? Find the topological sort of a given graph using source removal method, [P-T.0. (A @ DCCA402 i. 12. Find the minimum weight spanning tree using prime algorithm. Construct solution space tree for a set S = {11,13,24,7} &M=31- SECTION-C IM. Answer any Four questions. Each question carries 8 marks. (4*8=32) 13. 14, 18. Explain in detail the Strassen 's Matrix Multiplication method. Compare its efficiency with the conventional matrix multiplication method. Write the DFS traversal for the given graph. Trace the quick sort algorithm for the following numbers. 45,36, 15,92,35,71,64,39,73,37. Solve 4-queue problem by back tracking technique. Draw solution state - space tree. Find the optimal solution for a knapsack problem with M = 40. N=4, [W,, W,, Wy. W,}={20,25, 10,15} {P,, P,, Py. P,}=(20,40,35,45}. Write a short note on ; a Hamilton circuit problem. b. Decision tree.

You might also like