Scribd
Upload
27 views3 pages

Daa Model1

The document is a preparatory exam for the IV Semester BCA course on Design and Analysis of Algorithms at the Mangalore Institute of Management & Science. It consists of three parts with a total of 12 questions, requiring students to answer four from each part, covering topics such as algorithm characteristics, brute force approach, sorting algorithms, and dynamic programming. The exam is designed to assess students' understanding and application of algorithmic concepts and techniques.

Uploaded by

kannadazee9
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
27 views3 pages

Daa Model1

The document is a preparatory exam for the IV Semester BCA course on Design and Analysis of Algorithms at the Mangalore Institute of Management & Science. It consists of three parts with a total of 12 questions, requiring students to answer four from each part, covering topics such as algorithm characteristics, brute force approach, sorting algorithms, and dynamic programming. The exam is designed to assess students' understanding and application of algorithmic concepts and techniques.

Uploaded by

kannadazee9
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

MANGALORE INSTITUTE OF MANAGEMENT & SCIENCE

# 68, Ullal Main Road, Near, Bangalore University Qtrs, Bangalore-560056

PREPARATORY EXAM – JULY 2023


IV Semester BCA – DESIGN AND ANALYSIS OF ALGORITM

Time: 2 hours 30 minutes REG NO: Max. Marks: 60

Instruction: Answer any FOUR questions from each part

PART- A

I. ANSWER ANY 4 QUESTIONS Each question carries 2 marks 4x2=8

1. List any two important characteristics of Algorithm.

2. Define Brute force approach.

3.Write the worst–case analysis of Merge sort.

4. What is Dynamic Programming?

5. Define Huffman codes.

6. What are P and NP problems?

PART-B

II. ANSWER ANY 4 QUESTIONS Each question carries 5 marks 4 x 5 = 20

7. With a neat diagram, discuss the sequence of steps in designing and analysis of an algorithm.

8. Write a note on Fake coin problem.

9. Write a program to solve the string matching problem using KMP algorithm.

10.Write Topological sorting algorithm and explain with examples.

11. Write the Warshall’s algorithm to compute the transitive closure of a graph.

12. Explain decision trees for searching a sorted array with an example.
PART-C

III. ANSWER ANY 4 QUESTIONS Each question carries 8 marks 4 x 8 = 32

13.Explain in detail the Asymptotic notation used to describe the running time of an algorithm.

14. Write the DFS traversal for the given graph G.

15. Apply Floyd’s algorithm to the following graph.

16.Using Dynamic programming, solve the following Knapsack problem.

n=5, {w1,w2,w3,w4,w5} = {2, 1, 5, 2, 5} , {p1,p2,p3,p4,p5}={20,5,15,10,12}

17. Find the optimal solution for a Knapsack problem using Branch and Bound method with M=40,N=4,

{w1,w2,w3,w4}={20,25,10,15} and [p1,p2,p3,p4]=[20,40,35,45].

18.Apply Kruskal’s algorithm for the following graph.

*********ALL THE BEST********

You might also like