gs gs101 Regular Expressions and Languages - Converting Regular Expressions to Automata - 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 Regular Expressions and 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: What kind of expressions do we used for pattern matching?
Regular Expression
Rational Expression
Regular & Rational Expression
None of the mentioned
Question 2: Which of the following do Regexps do not find their use in?
search engines
word processors
sed
none of the mentioned
Question 3: Which of the following languages have built in regexps support?
Perl
Java
Python
C++
Question 4: The following is/are an approach to process a regexp:
Construction of NFA and subsequently, a DFA
Thompson’s Contruction Algorithm
Thompson’s Contruction Algorithm & Construction of NFA and subsequently, a DFA
None of the mentioned
Question 6: Which of the following are not quantifiers?
Kleene plus +
Kleene star *
Question mark ?
None of the mentioned
Question 7: Which of the following cannot be used to decide whether and how a given regexp matches a string:
NFA to DFA
Lazy DFA algorithm
Backtracking
None of the mentioned
Question 8: What does the following segment of code output?
$string1 = "Hello World\n"; if ($string1 =~ m/(H..).(l..)/) { print "We matched '$1' and '$2'.\n"; }
We matched ‘Hel’ and ‘ld’
We matched ‘Hel’ and ‘lld’
We matched ‘Hel’ and ‘lo ‘
None of the mentioned
Question 9: Given segment of code:
$string1 = "Hello\nWorld\n"; if ($string1 =~ m/d\n\z/) { print "$string1 is a string "; print "that ends with 'd\\n'.\n"; }
changes line
matches the beginning of a string
matches the end of a string
none of the mentioned
Question 10: Conversion of a regular expression into its corresponding NFA :
Thompson’s Construction Algorithm
Powerset Construction
Kleene’s algorithm
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
