0 votes
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 ______.
24 votes
2
$(C012.25)_H - (10111001110.101)_B =$$(135103.412)_o$$(564411.412)_o$$(564411.205)_o$$(135103.205)_o$
0 votes
4
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 ...
0 votes
5
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(...
0 votes
6
coa
2 votes
7
how we will come to know that wt overhead. means here??
0 votes
8
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
13 votes
10
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...