36. Consider the randomized algorithm for verifying if the product of
two n*n matrices A and B is equal to a matrix C. Which of the following statements are true?
The randomized algorithm runs in O(n2) time on all inputs.
There are some inputs on which the randomized algorithm never gives an incorrect answer
There are some inputs on which the randomized algorithm never gives an correct answer.
For some inputs ,the probability that the randomized algorithm gives an incorrect answer is
greater than 0.5
You must be logged in to post a comment.
37. Consider the randomized find algorithm. Which of the following statements are true?
On all inputs the expected running rime of the algorithm in O(n).
There are some inputs on which the algorithm performs poorly, i.e. the expected running time is
The expected number of recursive calls to the randomized find routine is O(log n).
There is a small but non zero probability that the randomized find returns an incorrect answer.
UGC NET PAPER 1
UGC NET Management
UGC NET COMPUTER SCIENCE
UGC NET COMMERCE
GATE COMPUTER SCIENCE
CFA Level 1
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login