Advanced Algorithms · End Term · May 2023 · FN

Instance 1

Instance 2

Instance 3

None of these

TRUE

FALSE

TRUE

FALSE

TRUE

FALSE

Yes, this is a valid set of constraints.

No, the sum in the objective function should be taken only over neighbors of u.

No, the sum in the second constraint should be taken only over in-neighbors of v and out-neighbors of v, respectively.

the shortest duration

the fewest overlaps with other intervals

the smallest left endpoint (i.e, a class that starts earliest)

the smallest right endpoint (i.e, a class that finishes earliest)

TRUE

FALSE

Yes

No

Yes

No

Yes

No

Yes

No

Yes

No

Edges {ad, ed, et, ef, cf}

Edges {ad, ae, be, ce, cf}

Edges {ad, ed, et, ft}

Edges {dt, ed, et, ef, cf}

NP-hard because there is a polynomial-time reduction to SAT

NP-hard because there is a polynomial-time reduction to MaxFlow

in P because there is a polynomial-time reduction to MaxFlow

in P because there is a polynomial-time reduction to SAT

0

1

2

3

4

Yes

No

0

1

2

0

1

0

the degree of vi

      **Maths2** **Section Id :** 64065341421 **Section Number :** 13 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 17 **Number of Questions to be attempted :** 17 **Section Marks :** 50 **Display Number Panel :** Yes **Section Negative Marks :** 0 **Group All Questions :** No **Enable Mark as Answered Mark for Review and** Yes **Clear Response :** **Maximum Instruction Time :** 0