Assignment No.4

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Branch/Sections: B.Tech CSE/ C&D Semester : 5th


Subject Name : Design and Analysis of Algorithm MaximumMarks:30
Subject Code : BCS403
ASSIGNMENT-4
CO4 Apply classical sorting, searching, optimization and graph algorithms.

Section–A (4X2 = 08 Marks)


1(a) Write down the Floyd Warshal algorithm K1 CO4 2

1(b) Illustrate the applications of Graph Coloring Problem K2 CO4 2

1(c) Differentiate Backtracking and Branch and Bound Techniques. K1 CO4 2


1(e) List the advantages of dynamic programming K2 CO4 2

Section–B (4X3 = 12 Marks)


2(a) Discuss backtracking problem solving approach. K2,K4 CO4 3

2(b) Explain graph coloring problem with suitable example K2,K4 CO4 3

2(c) What is N queens problem? Draw a state space tree for 4 queens K2,K4 CO4 3
problem using backtracking
2(d) Discuss LCS algorithm to compute Longest Common Subsequence K2,K4 CO4 3
of two given strings and time complexity analysis
Section–C (2X5 = 10 Marks)
3(a) Find the solution of following TSP using Branch & Bound method K2,K4 CO4 5

3(b) What is the sum of subsets problem? Let w={5,7,10,12,15,18,20} and K2,K4 CO4 5
m=35. Find all possible subsets of w that sum to m using recursive
backtracking algorithm for it. Draw the portion of the state-space tree
that is generated
*******************

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy