Scribd
Upload
38 views1 page

A2 Ada

This document outlines the assignment details for the Design and Analysis of Algorithms course for BTECH CSE V Sem, including submission date and maximum marks. It lists the course outcomes that students are expected to achieve by the end of the course, such as analyzing algorithm performance and discussing NP-complete problems. The assignment consists of five questions covering topics like greedy algorithms, prefix codes, shortest paths, the 8 queens problem, and backtracking.

Uploaded by

Sparsh Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
38 views1 page

A2 Ada

This document outlines the assignment details for the Design and Analysis of Algorithms course for BTECH CSE V Sem, including submission date and maximum marks. It lists the course outcomes that students are expected to achieve by the end of the course, such as analyzing algorithm performance and discussing NP-complete problems. The assignment consists of five questions covering topics like greedy algorithms, prefix codes, shortest paths, the 8 queens problem, and backtracking.

Uploaded by

Sparsh Verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

School of Engineering and Technology

Department of Computer Science and Engineering


Academic Year : 2023-24
BTECH CSE V Sem
Subject Name: Design and Analysis of Algorithms Sub Code:CSE 356
Assignment2
Date of Submission: 10-09-2023 Max Marks: 30

COURSE OUTCOMES

By the end of the course, students will be able to:

CO 1 Analyze the asymptotic performance of algorithms


Describe the dynamic-programming and Greedy paradigm and explain when
CO 2
an algorithmic design situation calls for it.
CO 3 Demonstrate a familiarity with major algorithms and data structures
CO 4 Apply important algorithmic design paradigms and methods of analysis
CO 5 Discuss NP-complete problems and develop algorithms to solve the problems.
CO 6 Choose appropriate algorithm design techniques for solving problems.

Note: Attempt All Questions.

Q. No. Questions Marks


Q1. Highlight the 3 major takeaways about greedy algorithms. 6
Q2. Explain the concept of prefix codes with an example. 6
Q3. Find the shortest path using Bellman ford algorithm. 6

Q4. Find the solution for 8 queens problem using greedy method. 6
Q5. Explain how sum of subsets problem can be solved using the concept of 6
backtracking.

You might also like