Scribd
Upload
36 views1 page

BCS 503 DAA Assignment 3

Uploaded by

s63577231
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
36 views1 page

BCS 503 DAA Assignment 3

Uploaded by

s63577231
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

ITS Engineering College Greater Noida

Department of Computer Science & Engineering


Design and Analysis of Algorithms (BCS-503)
Assignment-3

Maximum Marks: 20 Submission Date: 11-Dec-2024


COURSE OUTCOMES
By the end of the course, students will be able to:
CO No. Description Bloom’s Level
C303.1 Design new algorithms, prove them correct, and analyze their asymptotic and K4, K6
absolute runtime and memory demands.
C303.2 Find an algorithm to solve the problem (create) and prove that the algorithm K5, K6
solves the problem correctly (validate).
C303.3 Understand the mathematical criterion for deciding whether an algorithm is K2, K5
efficient, and know many practically important problems that do not admit any
efficient algorithms.
C303.4 Apply classical sorting, searching, optimization and graph algorithms. K2, K4
C303.5 Understand basic techniques for designing algorithms, including the techniques K2, K3
of recursion, divide-and-conquer, and greedy

ATTEMPT ALL QUESTIONS each question carries equal marks

Q. No. Question CO
Define principle of optimality.
1. CO-3
What are single source shortest paths? Write down Dijkstra’s algorithm for it.
2. CO-3
Explain “greedy algorithm” Write its pseudo code to prove that fractional
3. CO-3
Knapsack problem has a greedy-choice property.
Write down the Bellman Ford algorithm to solve the single source shortest
4. CO-3
path problem also write its time complexity.
What do you mean by convex hull? CO-3
5.
Explain Searching technique using divide and conquer approach.
6. CO-3
What is advantage of binary search over linear search? Also state limitations of
7. CO-3
Binary search.
Define feasible and optimal solution.
8. CO-3
Give comparison between Prim’s and Kruskal’s algorithm.
9. CO-3
Give various applications of divide and conquer.
10. CO-3

You might also like