Design & Analysis of Algorithms (ES-CS 401)

AY: 2019-20

QUIZ-I on “BRANCH & BOUND, NETWORK FLOW”

Lectures: 21.03.2020, 24.03.2020

INSTRUCTIONS: Answers can be handwritten or typed. Scanned pdf copy (for handwritten)/ pdf
copy (for typed) must be renamed as “11500318xxx.pdf” only. Submit in Moodle in appropriate
university roll slot. Use multiple colors and minimal statements while answering.

Q1. Consider the flow network with flow 6 in Fig.1. Complete the network and redraw. Hence find
the maximum flow of the network by applying Ford-Fulkerson algorithm. Show intermediate steps of
residual network and augmenting paths.

2/2
a d
2/3 1/2
0/10

0/3
0/1
s b t
0/1
1/1
4/4 5/5

5/5
c e

Q2. Solve the 4 Queens problem using LIFO Branch & Bound technique. Show also the queue of live
nodes, E-nodes.

Q3. How can you model the following 15-puzzle problem as branch & bound solvable problem?

Given Arrangement Goal Arrangement

1 3 4 15 1 2 3 4
2 5 12 5 6 7 8
7 6 11 14 9 10 11 12
8 9 10 13 13 14 15

----------------------