1 answer
1
Consider a regular language L over Σ={0,1} such that L contains every string which ends with "0". The number of equivalence classes in L is ______.
2 answers
2
$(C012.25)_H - (10111001110.101)_B =$$(135103.412)_o$$(564411.412)_o$$(564411.205)_o$$(135103.205)_o$
4 answers
4
1 answer
6
a vessel contains mixture of milk and water in which water concentration is 30 percent .if 20 percent water and 30 percent milk is taken out and replaced with equal ...
2 answers
7
2 answers
9
The function $f:[0,3]\rightarrow [1,29]$ defined by $f(x)=2x^{3}-15x^{2}+36x+1$ isinjective and surjectivesurjective but not injectiveinjective but not surjectiveneither ...
1 answer
10
1 answer
11
time complexity questions like :h(n)=O(n2);f(n)= O(logn);g(n)=omega(n2);what is the complexity of :::: 1. h(n)-g(n)=?? 2. h(...
4 answers
12
coa
1 answer
13
how we will come to know that wt overhead. means here??
3 answers
14
why is B wrong? as far as i know DRAM has less number of gates and hence its cheaper. but static RAM contains many gates per bit
5 answers
16
A finite state machine with the following state table has a single input $x$ and a single out $z$.$$\begin{array}{|c|ll|}\hline\textbf{present state} & \qquad \textbf{nex...
9 answers
19
Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...
12 answers
20
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...
7 answers
23
In a simplified computer the instructions are:$$\begin{array}{|l|l|} \hline \text {OP }R _j , R _i & \text{Perform }R _j \text{ OP } R _i \text{ and store the result in r...