Gate CS-2004 Question Paper With Solutions

Q. 87 The following finite state machine accepts all those binary strings in which the

number of 1’s and 0’s are respectively

Gate CS-2004 Question Paper With Solutions

(A) divisible by 3 and 2

(B) odd and even

(C) even and odd

(D) divisible by 2 and 3

Answer: (A)

Explanation:

Gate CS-2004 Question Paper With Solutions

Learn More:   Gate ME 2014-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here