Scribd
Upload
31 views

BCA 5- DAA- Preparatory

CAC13 - Design and Analysis of Algorithms question paper

Uploaded by

rupasandhyam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
31 views

BCA 5- DAA- Preparatory

CAC13 - Design and Analysis of Algorithms question paper

Uploaded by

rupasandhyam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

V Semester B.C.A.

Preparatory Examination, December 2024


(NEP Scheme)
COMPUTER APPLICATIONS
CAC13 - Design and Analysis of Algorithms

Time: 2 ½ Hours Max. Marks: 60

Instructions: Answer all the sections.

SECTION – A

I. Answer any six questions. Each question carries 2 marks. (6X2=12)


1. Define time complexity of an algorithm.
2. Mention any two advantages of Brute Force method.
3. What do you mean by recursive algorithm?
4. General strategy of divide and conquer.
5. Derive the Big-oh notation of f(n) = 20n + 8.
6. Mention the various factors that affect the execution time.
7. Compare Algorithm and Pseudocode.
8. Describe P and NP class.
9. Make the following complexity functions in ascending order.
2n, n, log n, n2, n3, n log n

SECTION – B

II. Answer any four questions. Each question carries 6 marks. (4X6=24)
10. Explain the fundamentals of algorithmic problem solving.
11. Write an essay on Asymptotic notations.
12. Derive the Topologically sort of the following graph:
13. Write a program that implements Prim’s algorithm to generate minimum cost spanning
Tree.
14. Write the merge sort algorithm.
15. Find the minimum spanning tree using Kruskal’s algorithm.

SECTION – C

III. Answer any three questions. Each question carries 8 marks. (3X8=24)
16. Explain worst-case, best-case, and average-case efficiencies with a specific example.
17. What are recursive algorithms? Discuss the efficiency of recursive algorithms.
18. Compare BFS and DFS algorithms.
19. Define Binary Tree. Derive the Tree Traversal Algorithms.
20. Implement the Dijkstra’s Algorithm for finding the shortest path from node 0.

**********

You might also like