Scribd
Upload
107 views1 page

DAA QUESTIONS Recourse 2023

DAA QUESTION Paper

Uploaded by

kanishkk070
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
107 views1 page

DAA QUESTIONS Recourse 2023

DAA QUESTION Paper

Uploaded by

kanishkk070
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/ 1

Name:

Enrolment No:

RECOURSE EXAMINATION – JANUARY 2023


Course: CSE2020 - DESIGN AND ANALYSIS OF ALGORITHMS

Programme: B.Tech (CSE) Semester: III


Duration: 2 hr. Max. Marks: 40

Instructions:

1. All questions are compulsory.


2. When answering, clearly state the question number in the margin of the answer script.
3. Write your answers with suitable diagrams/figures and give examples etc. Start answering a new
question in a new page.
4. This is a closed book examination. Calculator is not required

Question Question Mark CO &


No. BL
Q1 i) What is the implication of the RAM model in the analysis of an algorithm?
Explain. 5+5= CO3 &
ii) With a suitable example, explain the importance of Master’s method in 10 L4
analyzing the time complexity of a divide-and-conquer algorithm.

Q2
i) How can we solve the single-source-shortest-path problem with the help
of a greedy algorithm? Write the algorithm and analyze its time 6+4= CO3 &
complexity.
10 L3
ii) In context of the above algorithm, explain all the characteristics of a
greedy algorithm.

Q3
With a suitable example explain how to find the Hamiltonian-cycle from
a given graph with the help of a backtracking algorithm. Draw the state-
space tree and mark the solution path for the example problem. CO2 &
10
[Hint: Define a Hamiltonian cycle of a graph with example. Then explain the L3
backtracking approach clearly stating what are the constraints to be checked
during traversal of the graph. Mark the dead-ends and non-promising nodes etc.]
Q4 CO3 &
Let X be a NP-Complete problem. “If we find a polynomial-time algorithm
10
to solve X, then it would suggest that P=NP.” - Justify the statement. L4

You might also like