Gate
2
iit
Quiz [ MCQ ]
Questions List
.
.
.
.
Finite Automata | Regular Languages
Question
The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is
Answer
n(n+1)/2 +1
let * be defined as X*Y = !X+Y. Let z= X*Y value of Z*X is
Which of the following is/are tautology:
In a compiler the module that checks every character of the source text is called
The following sequence of operations is performed on a stack: PUSH(10), PUSH(20), POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH (20), POP The sequende of values popped out is:
The proposition p ^ (~ p v q) is