Quiz Space

Advanced Algorithms End Term: 3 September 2023, Set QPE1-S2 (May 2023 term)

Question 1

+3 marksOne correct option
  1. A

    Instance 1

  2. B

    Instance 2

  3. C

    Instance 3

  4. D

    None of these

Question 2

+3 marksOne correct option

Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true?

  1. A

    R is NP-complete

  2. B

    R is NP-hard

  3. C

    Q is NP-complete

  4. D

    Q is NP-hard

Question 3

+3 marksOne correct option

True or false?
It is possible that Independent-Set is in P and the problem of checking a graph has a Hamiltonian Path is not in P.

  1. A

    TRUE

  2. B

    FALSE

31 more questions in this paper

Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.

More on the Advanced Algorithms End Term 3 Sept 2023 Set QPE1-S2 paper

The IIT Madras BS Advanced Algorithms (Advanced Algorithms) End Term paper sat on 3 Sept 2023, in the May 2023 term, set QPE1-S2: 34 questions for 100 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.

FeatureAdvanced Algorithms End Term 3 Sept 2023 Set QPE1-S2 at a glance
TermMay 2023 term
SubjectAdvanced Algorithms
Course codeBSCS4021
Questions34
Marks100
Duration180 min
MCQ27
Numerical6
MSQ1
Official paperIIT M DEGREE ET1 EXAM QPE1 S2 03 Sep
Negative markingNo negative marking.
Updated

Other sets that day

Same End Term, other subjects

More Advanced Algorithms