1 votes
1
Is it possible that a disconnected graph be an Euler graph ?
2 votes
2
2 votes
4
how many Dfa's exists with two states over input alphabet {0,1}? a) 16b) 26c) 32d) 64
1 votes
5
#include<stdio.h void print(int n) { if (n 4000) return; printf("%d ", n); print(2*n); printf("%d ", n); } int main() { print(10); getcha...
1 votes
6
How to check whether the language is regular or not ? { wxw | w,x belongs to (a+b)raise to +}
3 votes
7
Options areA) 1:3^(1/3) B) 3^(1/3):1 C) 3:1 D) 3^(2/3):1
0 votes
8
1 votes
9
After minimzing, only 4 states left then why 6 ?
1 votes
10
The $a, b, c$ and $d$ satisfy the equations$$\begin{matrix} a & + & 7b & + & 3c & + & 5d & = &16 \\ 8a & + & 4b & + & 6c & + & 2d & = &-16 \\ 2a & + & 6b & + & 4c & + & 8...
4 votes
11
T(n) = 3T( n/3 ) + n/2The answer to the above question says that case 2 of masters theorem is applied here. How is it so?
2 votes
12
The number of distinct bracelets of five beads made up of red, blue, and green beads (two bracelets are indistinguishable if the rotation of one yield another) is,a. 243b...
0 votes
13
0 votes
14
3 votes
15
3 votes
16
Consider array A[1..100,1..100],in which elements are stored in Z representation. An example of 5x5 such array is shown below: Base address of array = 1000,size of each e...
0 votes
18
2 votes
19
3 votes
20
Describe in simple English the language represented by the regular expression r=(1+10)*