gs gs101 Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Other Classes Of Problems. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: A randomized algorithm uses random bits as input inorder to achieve a _____________ good performance over all possible choice of random bits.
worst case
best case
average case
none of the mentioned
Question 2: 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.
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.
Las Vegas Algorithm
Monte Carlo Algorithm
Atlantic City Algorithm
None of the mentioned
Question 3: Which of the following are probalistic algorithms?
Las Vegas Algorithm
Monte Carlo Algorithm
Atlantic City Algorithm
All of the mentioned
Question 4: Which of the following algorithms are probably correct as well as fast?
Las Vegas Algorithm
Monte Carlo Algorithm
Atlantic City Algorithm
All of the mentioned
Question 5: Prisonner’s dilemma can be related to the following:
cooperative behaviour
graph theory
all of the mentioned
None of the mentioned
Question 6: Unix sort command uses _________ as its sorting technique.
Quick Sort
Bucket Sort
Radix Sort
Merge Sort
Question 9: Which of the following can be solved in computer science?
P=BPP problem
NP=co-NP problem
Do one way problems exist?
All of the mentioned
Question 10: Which of the following can be referred to as applications of Randomized algorithm?
Quicksort
Min Cut
Verifying Matrix Multiplication
All of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
