Advanced Algorithms · End Term · May 2023 · AN

Instance 1

Instance 2

Instance 3

None of these

R is NP-complete

R is NP-hard

Q is NP-complete

Q is NP-hard

TRUE

FALSE

TRUE

FALSE

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)

(P-X)

(Q-Y)

(R-W)

(S-X)

Yes

No

Yes

No

Yes

No

Yes

No

Yes

No

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

Edges {ij, ik}

Edges {fi, hi, ij}

Edges {ce, df, de}

Edges {fg, fi, hi}

0

1

2

3

4

Yes

No

0

1

2

0

1

      **Maths2** **Section Id :** 64065341451 **Section Number :** 13 **Section type :** Online **Mandatory or Optional :** Mandatory **Number of Questions :** 15 **Number of Questions to be attempted :** 15 **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