Quiz Space

Advanced Algorithms · Quiz 2 · 6 Aug 2023 · May 2023 term

Question 2: Consider 4 sets as follows: W = {w_1, w_2, w_3}, X = {x_1…

Question 2

+3 marksNumerical answer

Consider 4 sets as follows: W={w1,w2,w3}W = \{w_1, w_2, w_3\}, X={x1,x2}X = \{x_1, x_2\}, Y={y1,y2,y3}Y = \{y_1, y_2, y_3\} and Z={z1,z2}Z = \{z_1, z_2\}.

Given capacity constraints are as follows:

c(w2)=c(y1)=c(y3)=1,c(w_2) = c(y_1) = c(y_3) = 1,

c(w1)=c(w3)=c(x2)=c(y2)=c(z1)=2,c(w_1) = c(w_3) = c(x_2) = c(y_2) = c(z_1) = 2,

c(x1)=c(z2)=3c(x_1) = c(z_2) = 3

c(wi,xi)=1, for all wi∈W and all xi∈X,c(w_i, x_i) = 1, \text{ for all } w_i \in W \text{ and all } x_i \in X,

c(yi,zi)=1, for all yi∈Y and all zi∈Zc(y_i, z_i) = 1, \text{ for all } y_i \in Y \text{ and all } z_i \in Z

c(x1,y1)=1,c(x1,y2)=2,c(x1,y3)=1c(x_1, y_1) = 1, c(x_1, y_2) = 2, c(x_1, y_3) = 1

c(x2,y1)=0,c(x2,y2)=2,c(x2,y3)=1.c(x_2, y_1) = 0, c(x_2, y_2) = 2, c(x_2, y_3) = 1.

Identify the size of a largest collection of 4-tuples from the sets W,X,YW, X, Y and ZZ satisfying the given constraints

Show answer

Correct answer: 4

Question 2 of 15 in the IIT Madras BS Advanced Algorithms (Advanced Algorithms) Quiz 2 paper sat on 6 Aug 2023, in the May 2023 term (IIT M DEGREE AN3 EXAM QPE3 06 Aug 2023). It carries 3 marks.

More questions from this paper

  1. Q1For the following sets of timings of dance classes, figure out what is the largest number of classes that you can atten…
  2. Q3Let G be a simple, undirected, unweighted graph. We use V(G) to denote the vertex set of G and E(G) to denote the edge …
  3. Q4Let G be a simple, undirected, unweighted graph. We use V(G) to denote the vertex set of G and E(G) to denote the edge …
  4. Q5There are N stones, numbered 1, 2, \ldots, N. For each (1 \leqslant i \leqslant N), the height of stone i is h_i. Assum…
  5. Q6There are N stones, numbered 1, 2, \ldots, N. For each (1 \leqslant i \leqslant N), the height of stone i is h_i. Assum…
  6. Q7There are N stones, numbered 1, 2, \ldots, N. For each (1 \leqslant i \leqslant N), the height of stone i is h_i. Assum…
  7. Q8There are N stones, numbered 1, 2, \ldots, N. For each (1 \leqslant i \leqslant N), the height of stone i is h_i. Assum…
  8. Q9Which of the following statements is true?\ Statement 1: For every graph G and every maximum flow on G, there always ex…
  9. Q10Figure question
  10. Q11Figure question
  11. Q12Consider the following definitions: A vertex cover is a subset S of V(G) such that for all (u,v) \in E(G), S \cap {u,v}…
  12. Q13Figure question
  13. Q14Figure question
  14. Q15Consider a different rounding strategy for the LP relaxation of the vertex cover problem. Instead of rounding up every …