Register
Filter

Recent activity by student2018

1 answer
1
how to solve
1 answer
4
Regular expression
S -> AaB A -> aC | $\epsilon$ B -> aB | bB | $\epsilon$ C -> aCb | $\epsilon$ Is the regular expression for the above is this: a(a + b)* a ( a* + b* )* ?
S - AaBA - aC | $\epsilon$B - aB | bB | $\epsilon$C - aCb | $\epsilon$Is the regular expression for the above is this:a(a + b)* a ( a* + b* )* ?
1 answer
7
what is the Output F
0 answers
8
which of the following are false
0 answers
9
cpu scheduling
0 answers
13
Infinite set
If S is infinite set and S1 ...........Sn be sets such that S1U S2US3 ..................USn =S, then a. Atleast one of the set Si is a finite set b. Not more than one of the sets Si can be finite c. Atleast one of the sets Si is an infinite set d. Not more than one of the sets Si can be infinite
If S is infinite set and S1 ...........Sn be sets such that S1U S2US3 ..................USn =S, thena. Atleast one of the set Si is a finite setb. Not more than one of t...
2 answers
14
Recognize the language
If L be a language recognizable by a finite automata, then language from {L}={w such that w is prefix of v where v belongs to L},is a a. Regular Language b. Context Free language c. Context Sensitive Language d. Recursive Enumerable Language
If L be a language recognizable by a finite automata, then language from {L}={w such that w is prefix of v where v belongs to L},is aa. Regular Languageb. Context Free la...
2 answers
15
FLOW CONTROL CN
3 answers
16
Time complexity
T(n)=2T(n-1)-1 , for n>0 1 , otherwise What is the time complexity
T(n)=2T(n-1)-1 , for n>0 1 , otherwiseWhat is the time complexity
1 answer
18
MadeEasy Subject Test: CO & Architecture - Cache Memory
ASAIK for Tavg(read) = T(read) = HR(read) * Tc + (1-HR) * (Tc+Tm) but while calculating they have neglected Tc in (Tc+Tm)... Please verify ??
ASAIK for Tavg(read) = T(read) = HR(read) * Tc + (1-HR) * (Tc+Tm)but while calculating they have neglected Tc in (Tc+Tm)...Please verify ??
0 answers
19
Tag bits
The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-way set associative cache is ? 24 bits 32 bits 16 bits 8 bits
The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-way set associative cache is ?24 bits32 bits16 bits8 bits
0 answers
24
SQL Duplicate columns
Assume i have two tables R(A,B) and S(A,D) 1. Select * from R,S 2. Select * from R,S where R.A>S.A What will be the name/number of columns on both of these cases?
Assume i have two tables R(A,B) and S(A,D)1. Select * from R,S2. Select * from R,S where R.A>S.AWhat will be the name/number of columns on both of these cases?
1 answer
27
How many stacks are formed
F(){ F1(){ F2(){ F3(){ } } } } Here for each function a new stack is used or single stack is used for all the functions As per me Single stack could be enough Can some one please clarify me
F(){F1(){F2(){F3(){ } } } }Here for each function a new stack is used or single stack is used for all the functionsAs per me Single stack could be enough Can some one ple...
1 answer
28
How to implement 4 input nand gate using 2 input nand gate
For me one 4-input nand gate could be implemented by five 2-input nand gates is this correct or can we implement using less number of gates
For me one 4-input nand gate could be implemented by five 2-input nand gates is this correct or can we implement using less number of gates
2 answers
29
Context Free language
If L1 is context free and L2 is not context free, then L1 ∩ L2 is context free. Is this true or not?
If L1 is context free and L2 is not context free, then L1 ∩ L2 is context free.Is this true or not?