Register

Gate questions
closed

• closed by
286 views
0 0 votes
closed with the note: Previous year GATE Question

option a) 2  b) 3 c) 4 d) 5

How is option (b) - 3 correct, and is there any trick for these kinds of questions to get the answer quickly?

Voting & Accepting an answer helps improve the community
← Previous · GO Classes GATE CS/D...Next → · #GATE
← Previous in category · Interesting question...Next in category → · #GATE
Position:
Show:

Related questions

9 9 votes
4 answers 4 answers
2.2k
2.2k views
gatecse asked Feb 23
2,239 views
GATE CSE 2026 | Set 1 | Question: 16
Let $M$ be a nondeterministic finite automaton (NFA) with $6$ states over a finite alphabet.Which of the following options CANNOT be the number of states in the minimal d...
45 45 votes
7 7 answers
17.7k
17.7k views
admin asked Feb 27, 2025
17,659 views
GATE CSE 2025 | Set 2 | Question: 50
Let $\Sigma=\{1,2,3,4\}$. For $x \in \Sigma^{*}$, let $\operatorname{prod}(x)$ be the product of symbols in $x$ modulo 7. We take $\operatorname{prod}(\epsilon)=1$, where...
0 0 votes
1 1 answer
341
341 views
admin asked Oct 10, 2024
341 views
ISI2023-MCS-PCA | Question: 36
 Let us consider the language $\left\{\epsilon, a, a^{2}, \ldots, a^{10}\right\}$, where $\epsilon$ denotes the empty string, and $a^{n}$ denotes $\underbrace{a a \cdots ...
1 1 vote
1 answers 1 answer
1.1k
1.1k views
stillhere asked Sep 10, 2023
1,098 views
Minimal Finite Automata - Theory of Computation
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts the gi...