2 votes
43
What is the minimum no of states in the finite automata that accept all the strings over {0,1} where its binary equivalent is congruent to 2 modulo 5? Please explain.
3 votes
44
A language uses an alphabet of six letters, $\left\{a, b, c, d, e, f\right\}$. The relative frequency of use of each letter of the alphabet in the language is as given be...
2 votes
45
Number of binary strings of length 10 with 3 consecutive 0's or 1's is ?
1 votes
46
Consider the following grammar$S\rightarrow Aa\mid B $$B\rightarrow a\mid BC$$C \rightarrow a\mid \in$the no of productions in simplified cfg is
4 votes
48
1 votes
50
17. The binary search tree contains the values—1, 2, 3, 4, 5, 6, 7 and 8. The tree is traversed in preorder and the values are printed out. Which of the following seque...
1 votes
53
1 votes
54
Which of the following describes growth of f(x)?1. Quadratic2.Linear3.Exponential4.Logarithm
3 votes
55
3 votes
56
Consider the following function for(int n) { for(i = 1; i <= n; i = i*2) { for(j = 1; j <= i; j = j*2) printf(“GATE 2017”); } }
2 votes
57
Consider the following C program What will be the output of above program ?
2 votes
59
0 votes
60
a. m+nb. m+n-1c. 2m+1d. 2m+n-1
3 votes
64
0 votes
65
0 votes
67