Q. Which of the following algorithms are probably correct as well as fast?

View solution

Q. Which of the following are probalistic algorithms?

View solution

Q. Which of the following options match the given statement:
Statement: The algorithms that use the random input to reduce the expected running time or memory usage, but always terminate with a correct result in a bounded amount of time.

View solution

Q. A randomized algorithm uses random bits as input inorder to achieve a _____________ good performance over all possible choice of random bits.

View solution

Q. Which of the following PSPACE can be characterized into?

View solution

Q. Complement of all the problems in PSPACE is ________

View solution

Q. Without needing extra __________ we can simulate non deterministic turing machine using deterministic turing machine.

View solution

Q. Statement : All PSPACE problems can be reduced to PSPACE-complete problems.
State true or false:

View solution

Q. NL ∈ PSPACE ∈ EXPSPACE
The given relation involves which of the following theorems?

View solution

Q. Correct the given order:
NL∈ P∈ NP∈ PH∈ PSPACE

View solution

Q. The class PSPACE is closed under the following operations:

View solution

Q. Savitch theorem relates to which of the following:

View solution

Q. PSPACE is strictly the super set of:

View solution

Q. All set of polynomial questions which can be solved by a turing machine using a polynomial amount of space:

View solution

Q. Fibonacci number falls in the category of _________ combinatorics.

View solution

Q. State true or false:
Statement: Hamiltonian cycles through any fixed edge is always even, so if one such cycle is given, the second one must also exists.

View solution

Q. Which of the following cannot solve Hamilton Circuit problem?

View solution

Q. Hamilton Circuit problem is a special case of ____________

View solution

Q. Hamilton circuit problem can have the following version/s as per the input graph:

View solution

Q. For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?

View solution