GATE CS 2007 — Question 31
A minimum state deterministic finite automaton accepting the language \(L = \{w \mid w \in \{0,1\}^*\), number of 0s and 1s in \(w\) are divisible by 3 and 5, respectively\(\}\) has
Year-wise GATE papers
GATE 2007
4 questions and papers
GATE CS 2007 — Question 55
The following postfix expression with single-digit operands is evaluated using a stack:8 2 3 ^ / 2 3 * + 5 1 * -Note that ^ is the…
GATE CS 2007 — Question 12
The maximum number of binary trees that can be formed with three unlabelled nodes is:
GATE CS 2007 — Question 64
The message 11001001 is to be transmitted using the CRC polynomial \(x^{3}+1\) to protect it from errors. The message that should be transmitted is:
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.