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

Related MCQs

• Which of the following can be referred to as applications of Randomized algorithm?
• Every possible architecture partition possible changes into which of the following categories?
• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• Programmers prefer programming to testing and sometimes they take shortcuts when writing tests. For example, they may write incomplete tests that do not check for all possible exceptions that may occur.
• Which of the following is not an option to achieve reliable cost and effort estimate?
• Which of the following paradigm attempts to structure a team in a manner that achieves some of the controls associated with the closed paradigm but also much of the innovation that occurs when using the random paradigm?
• The shortest possible time in which an activity can be achieved under ideal circumstances is known as                  
• Is it possible to make quality predictions about a system based solely on evaluation of its architecture?
• With round robin scheduling algorithm in a time shared system                          
• What is FIFO algorithm?