GATE exam stream
174 questions and papers
Let \(L_1 = \{w \in \{0,1\}^* \mid w\) has at least as many occurrences of (110)'s as (011)'s\(\}\). Let \(L_2 = \{w \in \{0,1\}^* \mid w\) has at least as many occurrences of (000)'s as (111)'s\(\}\). Which one of the following is TRUE?
Which of the following problems are decidable?Does a given program ever produce an output?If \(L\) is a context-free language, then is \(\bar{L}\) also context-free?If \(L\) is a regular language, then is \(\bar{L}\) also regular?If \(L\) is a recursive…
Let \(L = \{w \in (0+1)^* \mid w\) has an even number of 1s\(\}\), i.e. \(L\) is the set of all bit strings with an even number of 1s. Which one of the regular expressions below represents \(L\)?
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
Consider the languages \(L_1 = \{a^n b^n c^m \mid n, m > 0\}\) and \(L_2 = \{a^n b^m c^m \mid n, m > 0\}\). Which one of the following statements is FALSE?
Consider the following C program:#include <stdio.h> int jumble(int x, int y) { x = 2 * x + y; return x; } int main() { int x =…
Consider the following C program:#include <stdio.h> struct Ournode { char x, y, z; }; int main() { struct Ournode p = {'1', '0', 'a' + 2}; struct Ournode…
Consider the following C program:void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; __________ ; /* call to f()…
Consider the following C program:#include <stdio.h> int *A, stkTop; int stkFunc(int opcode, int val) { static int size = 0, stkTop = 0; switch (opcode) { case -1:…
Consider a max-heap stored in an array using the usual level-order (breadth-first) representation:40, 30, 20, 10, 15, 16, 17, 8, 4The value 35 is now inserted into this…
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.
