Scribd
Upload
176 views3 pages

DAA Question Paper

The document is an examination paper for the B.C.A. degree course on Design and Analysis of Algorithms, conducted in March 2023. It includes various sections with questions on algorithms, their characteristics, performance measurement, and specific algorithmic problems such as the knapsack problem and traveling salesman problem. The exam consists of multiple-choice questions, short answer questions, and detailed problem-solving questions across four sections.

Uploaded by

yetchanger
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
176 views3 pages

DAA Question Paper

The document is an examination paper for the B.C.A. degree course on Design and Analysis of Algorithms, conducted in March 2023. It includes various sections with questions on algorithms, their characteristics, performance measurement, and specific algorithmic problems such as the knapsack problem and traveling salesman problem. The exam consists of multiple-choice questions, short answer questions, and detailed problem-solving questions across four sections.

Uploaded by

yetchanger
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/ 3

Name : ANANTHALAKSHMY R UPRN:212113118

Date : 17/03/2023 Hall : M1(MAT) | Seat No : 6


Course Code: CA1814110 QP Code: U23260

B.C.A. DEGREE (CBCSS) REGULAR/ SUPPLEMENTARY


EXAMINATIONS, MARCH 2023
(2021 & 2018 Admissions)
Fourth Semester
CORE COURSE: DESIGN AND ANALYSIS OF ALGORITHM

Time: Three hours Maximum Marks: 80

Section A

Answer all questions (10 x 1 = 10 marks)


(Each question carries 1 mark)

Define Algorithm.
What is space complexity?
What do you mnean by binary search?
Define Quick Sort.
What do you mean by Divide and Conquer Method?
What is the spanning tree?
7. Comment on Knapsack problem.
List out any two features of dynamic programming.
What are the graph traversal methods?
19 What doyou mean by articulation point?
Section B
Answer any eight questions (8 x 2 = 16 marks)
(Each question caries 2 marks)

T\, What are the characteristics of an algorithm?


12. What is performance measurement?
13. Write algorithm using iterative function to find sum of
n numbers.

14. Write down the need of greedy method.


15/ Give computing time for Binary search.
16. Write any two characteristics of Greedy method.
17. Give the advantage of multistage graphs.
18. Write the difference between the Greedy method and
Dynamic programming.
Define the tern "BFS":

20. What are Bi-Connected Components?


24. Define: "Backtracking".
22. Write down the formula to calculate optimal solution
in 0/1 knapsack problem.

Section C

Answer any six questions (6 x 4 = 24 marks)


(Each question carries 4 marks)
23. What are the algorithm design techniques? Explain.
24. Explain the concept of Strassen's matrix
multiplication with examples.
Page 2
25. Describe the design steps in Prim's algorithm to
construct minimum Spanning tree with example.
26. Develop an algorithm for the knapsack problem using
greedy method.
Explain the procedure to finding the maximum and
minimum element of an array.
28. Summarize the factors that influence the efficiency of
the backtracking algorithm.
29. Describe the method of finding the all pair's shortest
path with diagram.
30. Summarize the implementation of graph coloring
problem with example.
31. Elaborate the Hamiltonian Cycles problem in an
undirected Graph.

Section D

Answer any two questions (2 x 15 = 30 marks)


(Each question carries 15 marks)
$2. Compare the best, worst and average case complexity
with suitable example.
33. Analyse the merge sort algorithm and sort the
following sequence of keys using merge sort: 68, 79,
17, 82, 95, 26, 31, 40, and 55.
34. Illustrate the implementation of traveling salesman
problemn using dynamic programming,
35. Examine the basic concept and algorithm for 8
queens problem.

Page: 3

You might also like