Scribd
Upload
5 views

Assignment-4

This document outlines Assignment-4 for the Design & Analysis of Algorithm course, detailing various tasks such as efficiency analysis of backtracking, differentiation between backtracking and branch & bound techniques, and algorithms for finding all pairs shortest paths. It also includes problems related to the Longest Common Subsequence, 0/1 knapsack, Minimum Spanning Trees, and the Travelling Salesman Problem. The assignment is to be submitted by December 18, 2024, and covers multiple algorithmic concepts and applications.

Uploaded by

saptarshighoshofficial11
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
5 views

Assignment-4

This document outlines Assignment-4 for the Design & Analysis of Algorithm course, detailing various tasks such as efficiency analysis of backtracking, differentiation between backtracking and branch & bound techniques, and algorithms for finding all pairs shortest paths. It also includes problems related to the Longest Common Subsequence, 0/1 knapsack, Minimum Spanning Trees, and the Travelling Salesman Problem. The assignment is to be submitted by December 18, 2024, and covers multiple algorithmic concepts and applications.

Uploaded by

saptarshighoshofficial11
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/ 2

Assignment-4

Subject: Design & Analysis of Algorithm Subject code: BCS-503


Faculty Name: Ms. Paramjeet Kaur Session: 2024-25 (ODD)
Section: All Submission Date: 18/12/24
Issue Date: 11/12/2024
1. Explain the efficiency analysis for backtracking. (BCS-503.3,K1)
2. Differentiate between backtracking and branch & bound technique. (BCS-503.3,K2)
3. Describe the Wars hall’s and Floyd’s algorithm to finding all pair shortest path, Also give the time
complexity of both algorithm. (BCS-503.3,K1)
4. Write short note on the following: i) Hamiltonian cycle ii) Graph Colouring (BCS-503.3,K1)
5. Apply all-pairs shortest Path problem for the digraph with the weight matrix given below:
A B C D
A0 3
B20 ( BCS-503.3,K3)
C 501
D6 0
6. Design a recursive solution to the Longest Common Subsequence (LCS) problem. Determine an LCS of
(22112121) and (211221121). (BCS-503.3,K3)
7. Consider the knapsack with the corresponding weights and values for the following items using 0/1
knapsack:
Wi = < 2, 5, 3, 4 > Vi = < 3, 6, 5, 7 > Capacity = 10. (BCS-503.3,K3)
Apply the 0/1 knapsack problem using Dynamic Approach.
8. Given a set S = < 2, 5, 7, 9 > and X = 11. We have to find sum of subset using Backtracking approach.
(BCS-
503.3,K2)
9. 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 Prim’s and
Kruskal’s Minimum Spanning Tree Algorithm in detail. (BCS-503.3,K4)
10. Give solutions for 4 queen and 8 Queen problem. (BCS-503.3,K2)
11. What is Travelling Salesman Problem? Find the Solution of following Travelling Salesman Problem using
Branch and Bound Method.
Cost Matrix = v2

v1 v3

v5 v4
Note: Distances from vertex to vertex
V1- V2 =20; V1 – V3=19; V1 – V5= 22; V1 - V4=25; V2 – V5=21; V2 – V4= 23; V2 – V3=21;
V3 – V4= 21; V3 – V5=20; V4 – V5=22 (BCS-503.3,K2)

12.
Given a weighted directed graph G = (V, E) with Source “1” and weight function W:E R, then write an algorithm to solve

(BCS-503.3,K4)

You might also like