Scribd
Upload
29 views2 pages

5th Sem March-April 2024 Design and Analysis of Algorithms

This document outlines the examination structure for the V Semester B.C.A. Degree Examination in Design and Analysis of Algorithms for March/April 2024. It includes instructions for candidates, three sections of questions with varying marks, and topics such as algorithm definitions, complexities, and specific algorithms like Dijkstra's and Prim's. The exam consists of multiple-choice questions, short answer questions, and detailed problem-solving questions.

Uploaded by

Kavya
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
29 views2 pages

5th Sem March-April 2024 Design and Analysis of Algorithms

This document outlines the examination structure for the V Semester B.C.A. Degree Examination in Design and Analysis of Algorithms for March/April 2024. It includes instructions for candidates, three sections of questions with varying marks, and topics such as algorithm definitions, complexities, and specific algorithms like Dijkstra's and Prim's. The exam consists of multiple-choice questions, short answer questions, and detailed problem-solving questions.

Uploaded by

Kavya
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/ 2

795487

47921/E0210
Reg. No.
VSemester B.C.A. 6(NEP) Degre Examination, March/April - 2024
DESIGN AND ANALYSIs OF ALGORITIMS
(Regular)
Time:2 Hours Maximum Marks : 60

Instructions to Candidates:

1) All Sections are compulsory.


2) Draw diagram wherever necessary,
3) Give examples if needed.
SECTION -A
Answer any TENquestions. Each queSton carries 2 marks. (10x2=20)
1. Define algorithm? Mention its criterias.
2. Mention areas where algorithms are used.
3. Define asymptotic Notation? Name them.
4. Define space complexity and time complexity.
5. What is Prim's Algorithm ?
6. Define Decrease - and - conquer.
7. Define decision tree? Mention key factors.
8. Define binary search.

9. What is Dijkstras Algorithm?


10. What is basic efficiency class? Name any two classes.
11. Define greedy method? Mention any one application of it.
12. What is NP class problem?

[P.T.O.
(2)
47921/E0210
Answer any FOUR from the
SECTION-B
following questions. Each question carries S marks.
(4x5=20)
13. Explain characteristics ofAlgorithm.
14. Explain 9(theta ), big '0' e (omega) Notations with examples.
15. Write algorithm for quick sort:
16. Explain basic tree traversal techniques. Write algorithm for them.
17. Write pseudocode for Dijkstra's Algorithm.
SECTION -C
Answer any TWO of the following questions. Each question carries 10 marks.
(2x10=20)
18. Explain Brute force method Mention its Applications. Solve selection sort for the following
Numbers 9,1,8,2,7,3,6,4,5
19. a) Explain travelling salesman problem. (5)
b) Discuss knapsack problem using greedy method. (5)
20. a) Explain divide-and-conquer. Write pseudocode (5)
b) Explain Kruskal's Algorithm with example. (5)

You might also like