Question 31 : To which class does the Euler's circuit problem belong?
1. P class
2. NP class
3. Partition class
4. Complete class
View Answer   Discuss with Members

Question 32 : How many steps are required to prove that a decision problem is NP complete?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 33 : There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 34 : The choice of polynomial class has led to the development of an extensive theory called ________
1. computational complexity
2. time complexity
3. problem complexity
4. decision complexity
View Answer   Discuss with Members

Question 35 : How many stages of procedure does a non-deterministic algorithm consist of?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 36 : A non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of its verification stage is polynomial.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 37 : In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 38 : In what time can the Hamiltonian path problem can be solved using dynamic programming?
1. O(N)
2. O(N log N)
3. O(N²)
4. O(N² 2^N)
View Answer   Discuss with Members

Question 39 : For a graph of degree three, in what time can a Hamiltonian path be found?
1. O(0.251ⁿ)
2. O(0.401ⁿ)
3. O(0.167ⁿ)
4. O(0.151ⁿ)
View Answer   Discuss with Members

Question 40 : Including a parity bit along with the data surely detects the errors.
1. true
2. false
3.
4.
View Answer   Discuss with Members