3 answers
1
Write a regular expression for all strings of $0$’s and $1$’s in which the total number of $0$’s to the right of each $1$ is even. Justify your answer.
1 answer
2
minimum spanning is a spanning tree in which removal of any edges disconnnects the tree.True or false?
0 answers
3
In his many number of ways we can paint 12 offices so that 3 are green 2 pink 2 yellow and remaining ones are white?
2 answers
4
An undirected graph has $10$ vertices labelled $1, 2,\dots , 10$ and $37$ edges. Vertices $1, 3, 5, 7, 9$ have degree $8$ and vertices $2, 4, 6, 8$ have degree $7.$ What ...
0 answers
5
To find the product of the non-zero eigenvalues of the matrix is ____$\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ ...
2 answers
6
Consider the following grammarE → E+T/TT → T*F/FF → id/(E)Calculate Lead and Last for every Non terminal.
2 answers
7
Number of subgraphs possible for K3 =____________
0 answers
8
Consider the following grammar:$S\rightarrow aA|bB$$A\rightarrow aA|bB$$B\rightarrow bB|ϵ$Then the number of states in a minimal D.F.A of the above grammar is __________...
1 answer
9
If $A=\begin{bmatrix} cos \alpha & sin \alpha \\ -sin \alpha & cos \alpha \end{bmatrix}$be such that $A +A ^{'}=I$ then the value of $\alpha$ is
0 answers
10
$The\ maximum\ value\ of\\f(x)\ =\ 2x^3-9x^2+12x-3\ in\ the\ interval\ 0<=x<=3\ is\ $_____________________
0 answers
11
A, B and C together invest in a business. It was agreed A would invest Rs.15,000, B would invest Rs.20000 and C would invest Rs.25,000. B is the working partner and gets ...
2 answers
12
$R=P\left ( P\left ( P\left ( \phi \right ) \right ) \right )$$T=P\left ( P\left ( \left \{ 1,2 \right \} \right ) \right )$What is cardinality of set $S$, where $S=R\tim...
0 answers
13
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for...
0 answers
14
Can some one expain the problem statemnt?
3 answers
15
Check whether this grammar is LL(1) or not?
1 answer
16
DFA which accepts strings in which every 'a' is followed by a 'b'
0 answers
17
0 answers
18
Detailed Solution please..!
0 answers
19
DFA please.
0 answers
20
Consider a language over Σ={a,b} such that each string has at most two a’s and at least two b’s. The number of states in minimized DFA and number of final states are...
2 answers
21
Consider the following matrix$A=\begin{bmatrix} a&a^{2} &a^{3}-1 \\ b& b^{2} &b^{3}-1 \\ c& c^{2}&c^{3}-1 \end{bmatrix}$if $|A|=0$, then the value of $abc$ is ___________...
2 answers
23
State true/falseIn CNF , S- espilon and Start symbol can appear on RHS side of production.
2 answers
26
Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$?$0$$I$$A$$1 + A + A^{2} + ...+ A^{k - 1}$Inverse is not guaranteed to exist.
0 answers
27
0 answers
28
Suppose that G is a cyclic group of order 10 with generator a belongs to G. Order of a^8 is ________.
0 answers
29
Is 1's/2's complement valid only for negative numbers? If 2's complement of a number is 1111111111110101, then the number should be 0000000000001011. Then the decimal rep...