Quiz [ MCQ ]
Finite Automata | Regular Languages
The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is
If the proposition ~p => q is true, then the truth value of the proposition ~p v (p => q), where ~ is negation, 'V' is inclusive or and '=>' is implication, is
How many 8-bit characters can be transmitted per second over a 9600 baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, and one parity bit and two stop bits?
Indicate which of the following well-formed formula are valid:
Which one of the following is false? Read ^ as AND, v as OR, ~ as NOT, -> as one way implication and <-> as two way implication.
In a compiler the module that checks every character of the source text is called
©2020 Gate2iit. All rights reserved