Scribd
Upload
11 views3 pages

Model Test Paper DAA

This is the model Test Paper for Data Analysis and Algorithim

Uploaded by

Siddharth Sharma
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
11 views3 pages

Model Test Paper DAA

This is the model Test Paper for Data Analysis and Algorithim

Uploaded by

Siddharth Sharma
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

BTECH

(SEM V) MODEL TEST PAPER 2024-25


DESIGN AND ANALYSIS OF ALGORITHM

TIME: 3 HRS M.MARKS: 100

Note: 1 . Attempt all Sections.


SECTION A
1. Attempt all questions.
QUESTION: 1

a. What do you mean by algorithm? Write the characteristic of algorithm?

b. What do you mean by algorithm? Write the characteristic of algorithm?

c. Write short note on Fibonacci Heap?

d. Explain Binary Search Tree?

e. Define fractional Knap-Sack problem?

f. What are greedy algorithm? Explain their characteristics?

g. Explain Floyd Warshall Algorithm.

h. Explain Branch and Bound method in brief.

i. Explain the difference between the 0/1 Knapsack Problem and the Fractional
Knapsack Problem.

j Define NP, NP hard and NP complete. Give example of each.

SECTION B
2. Attempt any three of the following:

a. Explain Merge sort algorithm and sort the following sequence {23, 11, 5, 15, 68,31, 4,
17} using merge sort.

b. What are the various differences in Binomial and Fibonacci Heap? Explain

c. Prove that if the weights on the edge of the connected undirected graph are distinct
then there is a unique Minimum Spanning Tree. Give an example in this regard. Also
discuss Kruskal’s Minimum Spanning Tree in detail.

d. Apply Floyd-Warshall algorithm for constructing shortest path


e. Write short notes on the following:
i) Randomized Algorithm. ii) Approximation algorithm.

SECTION C
3. Attempt any one part of the following:

a. Write an algorithm of merge sort and prove its worst time complexity ?

b. Explain algorithm for counting sort. Illustrate the operation of counting sort on the
following array: A={0,1,3,0,3,2,4,5,2,4,6,2,2,3}?

4. Attempt any one part of the following:

a. Discuss the various cases for insertion of key in red-black tree for given sequence of key
in an empty red-black tree- {15,13,12,16,19,23,5,8}. Also show that a red-black tree with
n internal nodes has height at most 2lg(n+1).

b. Explain B-Tree and its properties. Also write B-Tree deletion cases with example.

5. Attempt any one part of the following:


a. Explain Backtracking. Let set S= {1,3,4,5}and X=8, we have to find subset sum problem
using backtracking approach

b. Explain “greedy algorithm” Write its pseudo code to prove that fractional Knapsack
problem has a greedy-choice property
6. Attempt any one part of the following:

a. Apply Branch and Bound technique to solve travelling salesman problem for the graph
whose cost matrix given below:

Cost matrix:

b. Write an algorithm of Dijkstra and implement it by taking any example.

7. Attempt any one part of the following:

a. Write and explain the algorithm to solve vertex cover problem using approximation
algorithm.

b. Explain approximation algorithm. Explore set cover problem using approximation


algorithm.

You might also like