This Theory of Computation quiz assesses understanding of Finite State Machines, regular expressions, and grammars with questions from past ISRO exams. It evaluates skills in designing and analyzing computational models, crucial for advanced studies in computer science.
The set of all strings containing the substrings 11
The set of all string containing at most two 1’s
The set of all strings containing at least two 1’s
The set of all strings that begins and ends with only 0.
Rate this question:
M x 2^n
2m+n
2^mn
M+n
Rate this question:
{1, 0}* {01}
{1, 0}* {1}
{1}{1, 0}* {1}
1*0* {0, 1}
Rate this question:
Option 1
Option 2
Option 3
Option 4
Rate this question:
(A) and (B) only
(A), (B) and (C) only
(B), (C) and (D) only
(B) and (D) only
Rate this question:
Q0, q1, q2
[q0, q1], [q0, q2], [ ]
Q0, [q1, q2]
[q0, q1], q2
Rate this question:
Any string of odd number of a’s
Any string of odd number of b’s
Any string of even number of a’s and odd number of b’s
Any string of odd number of a’s and odd number of b’s
Rate this question:
Complements a given bit pattern
Finds 2’s complement of a given bit pattern
Increments a given bit pattern by 1
Changes the sign bit
Rate this question:
(0*10*1)*
0*(10*10*)*
0*(10*1*)*0*
0*1(10*1)10*
Rate this question:
All palindromes
All odd length palindromes
Strings that begin and end with the same symbol
All even length palindromes
Rate this question:
1
5
7
8
Rate this question:
2
3
4
5
Rate this question:
A
B
C
D
Rate this question:
1, 2 and 3
2, 3 and 4
1, 2 and 4
1, 3 and 4
Rate this question:
(A) and (B) only
(A), (B) and (C) only
(B), (C) and (D) only
(B) and (D) only
Rate this question:
Every NFA can be converted to an equivalent DFA
Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine
Every regular language is also a context-free language
Every subset of a recursively enumerable set is recursive
Rate this question:
1 and 3 only
2 and 4 only
2 and 3 only
3 and 4 only
Rate this question:
Q0 and q0 respectively
Q0 and q1 respectively
Q0 and q2 respectively
Q0 and q3 respectively
Rate this question:
7
10
12
11
Rate this question:
Quiz Review Timeline (Updated): Aug 29, 2023 +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
Theory Of Computation! Computer Science Trivia
Dive into the essentials of theoretical computer science with this quiz focused on computation theory. Test your understanding of finite state machines, regular expressions, and...
Questions:
25 |
Attempts:
270 |
Last updated:
Feb 04, 2024
|
Introduction To Theory Of Computation! Hardest Trivia Quiz
Dive into the challenging world of automata with the 'Introduction to Theory Of Computation! Hardest Trivia Quiz'. Test your knowledge on DFAs, state minimization, and regular...
Questions:
18 |
Attempts:
203 |
Last updated:
Mar 21, 2023
|
Theory Of Computation: Computer Science Trivia Quiz
Dive into the essentials of computational theory with this Computer Science Trivia Quiz. Explore key concepts such as general properties of computation, efficient problem-solving...
Questions:
10 |
Attempts:
1055 |
Last updated:
Mar 20, 2023
|
Theory Of Computation! Computer Science Trivia
Dive into the essentials of theoretical computer science with this quiz focused on computation theory. Test your understanding of finite state machines, regular expressions, and...
Questions:
25 |
Attempts:
270 |
Last updated:
Feb 04, 2024
|
Introduction To Theory Of Computation! Hardest Trivia Quiz
Dive into the challenging world of automata with the 'Introduction to Theory Of Computation! Hardest Trivia Quiz'. Test your knowledge on DFAs, state minimization, and regular...
Questions:
18 |
Attempts:
203 |
Last updated:
Mar 21, 2023
|
Theory Of Computation: Computer Science Trivia Quiz
Dive into the essentials of computational theory with this Computer Science Trivia Quiz. Explore key concepts such as general properties of computation, efficient problem-solving...
Questions:
10 |
Attempts:
1055 |
Last updated:
Mar 20, 2023
|
Wait!
Here's an interesting quiz for you.