gs gs101 Properties of Regular Languages - Applications of Pumping Lemma - 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 Properties of Regular Languages. 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: Which kind of proof is used to prove the regularity of a language?
Proof by contradiction
Direct proof
Proof by induction
None of the mentioned
Question 2: The language of balanced paranthesis is
regular
non regular
may be regular
none of the mentioned
Question 4: Which of the following is/are an example of pigeon hole principle?
Softball team
Sock picking
Hair counting
All of the mentioned
Question 5: Pigeonhole principle can be applied in the following computer science algorithms:
hashing algorithm
lossless compression algorithm
hashing algorithm and lossless compression algorithm
none of the mentioned
Question 6: If n objects are distributed over m places, and n < m, then some of the places receive:
at least 2 objects
at most 2 objects
no object
none of the mentioned
Question 7: Which of the following fields may have pigeonhole principle violated?
Discrete mathematics
Computer Science
Quantum Mechanics
None of the mentioned
Question 8: Which of the following is not an application of Pumping Lemma?
{0i1i|i>=0}
{0ix|i>=0, x∈{0, 1}* and |x|<=i}
{0n| n is prime}
None of the mentioned
Question 9: Which of the following can refer a language to be non regular?
Pumping Lemma
Myphill Nerode
Pumping Lemma and Myphill Nerode
None of the mentioned
Question 10: Which of the following is not an example of counting argument?
Pigeonhole principle
Dirichlet’s drawer principle
Dirichlet’s box principle
None 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
