Q. Savitch theorem relates to which of the following:

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Complement of all the problems in PSPACE is ________

View solution

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

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 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. Which of the following are probalistic algorithms?

View solution

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

View solution

Q. Prisonner’s dilemma can be related to the following:

View solution

Q. Unix sort command uses _________ as its sorting technique.

View solution

Q. State true or false:
Statement: A turing machine has the capability of using randomly ‘generated’ numbers.

View solution

Q. For the given algorithm, find the probability of finding after k iterations:
find_a(array A, n, k)

begin

i=0

repeat

Randomly select one element out of n elements

i=i+1

until i=k or a is found

end

View solution

Q. Which of the following can be solved in computer science?

View solution

Q. Which of the following can be referred to as applications of Randomized algorithm?

View solution

Q. Which among the following is smallest for n=50

View solution

Q. The space complexity of a turing machine is undefined if:

View solution