Learn with Anil · TGPSC HMWSSB Manager (Engineering) PYQsPractise online →Subscribe ₹149

TGPSC HMWSSB Manager 2015 Paper 2 CSE · Question 45

Question 45 of the TSPSC Manager (Engineering), HMWSSB, 2015: Paper 2 (Computer Science & Information Technology) (1 November 2015). Try it first, then open the answer. The explanation is in the practice app with the All-in-One Pass.

  1. Manager 2015 Paper 2 (CS & IT) · Q45 · Algorithms · Complexity & Recurrences

    Which one of the following statements is correct? i) The Euler tour of a graph can be determined in polynomial time ii) The Hamiltonian cycle can be determined in polynomial time. iii) Determining whether a directed graph has a Euler tour is NP-complete iv) Determining whether a directed graph has a Hamiltonian cycle is NP-complete

    1. (i) and (ii)
    2. (i) and (iv)
    3. (ii) and (iii)
    4. (iii) and (iv)
    Show answer

    Answer: (2) (i) and (iv)

    Explanation: open it in the practice app. It needs the ₹149 All-in-One Pass: one payment for every exam on the site.

Answer it in the practice appMake a topic-wise quiz