1
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
Consider the following declaration of a two-dimensional array in C:

char a[100][100];

Assuming that the main memory is byte-addressable and that the array is stored starting from memory address 0, the address of a[40][50] is
A
4040
B
4050
C
5040
D
5050
2
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The smallest finite automaton which accepts the language
$$L = \left. {\left\{ x \right.} \right|$$ length of $$x$$ is divisible by $$\left. 3 \right\}$$ has
A
$$2$$ states
B
$$3$$ states
C
$$4$$ states
D
$$5$$ states
3
GATE CSE 2002
MCQ (Single Correct Answer)
+2
-0.6
The Finite state machine described by the following state diagram with $$A$$ as starting state, where an arc label is $$x/y$$ and $$x$$ stands for $$1-bit$$ input and $$y$$ stands for $$2$$-bit output GATE CSE 2002 Theory of Computation - Finite Automata and Regular Language Question 51 English
A
Outputs the sum of the present and the previous bits of the input.
B
Outputs $$01$$ whenever the input sequence contains $$11$$
C
Outputs $$00$$ whenever the input sequence contains $$10$$
D
None of the above
4
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The language accepted by a pushdown Automation in which the stack is limited to $$10$$ items is best described as
A
Context free
B
Regular
C
Deterministic Context Free
D
Recursive
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12