Time Left - 10:00 mins
ISRO 2018: TOC Booster Quiz- 1
Attempt now to get your rank among 857 students!
Question 1
Which one of the following is FALSE?
Question 2
I some programming languages, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denotes the set of letters and digit respectively. Which of the following expression defines an identifier?
Question 3
Consider the following grammar.
S
AB
A
a
A
BaB
B
bbA
Which of the following statements is false?
S
AB A
a A
BaB B
bbA Which of the following statements is false?
Question 4
The number of states required by a Finite State Machine, to simulate the behavior of a computer with a memory capable of storing 'm' words, with each word being 'n' bits long is
Question 5
How many states are there in a minimum state deterministic finite automaton accepting the language L = {w
(0,1)*, number of 0's is divisible by 2 and number of 1's is divisible by 5, respectively} ?
(0,1)*, number of 0's is divisible by 2 and number of 1's is divisible by 5, respectively} ? Question 6
An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length
Question 7
A problem whose language is recursion is called?
Question 8
G = {S →SS, S → ab, S →ba, S → ε}
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III. Language of G can be accepted by a deterministic PDA.
Which combination below expresses all the true statements about G?
I. G is ambiguous
II. G produces all strings with equal number of a’s and b’s
III. Language of G can be accepted by a deterministic PDA.
Which combination below expresses all the true statements about G?
- 857 attempts
- 5 upvotes
- 2 comments
Apr 2GATE & PSU CS
