0 votes
122
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
0 votes
123
Above solution GUARANTEES : ProgressDOESNOT GUARANTEE : Mutual Exclusion,Bounded waiting,starvationIs this correct ???
0 votes
124
The simultaneous equations on the Boolean variables x, y, z and w, X+Y+Z=1XY=0XZ+W=1have the following solution for x, y, z and w, respectively:(a) 0 1 0 0 (b) 1 1 0 1 (...
3 votes
125
T(n)=2.T((n)^(1/2)) + log ((n)^(1/2))whats the time complexity?????????????????????????/
2 votes
126
Arrange in increasing order of rate of growth:2nnlognn(logn)n(3/2)
3 votes
127
Cache size = 512KB ; Tag size = 7, Find out main memory size and tag directory. Given it is 8-way set associative .
0 votes
128
Please tell why answer is (d)?
1 votes
129
#include <stdio.h>void reverse(int i);int main(){reverse(1);}void reverse(int i){if (i 5)return ;printf("%d ", i);return reverse((i++, i));}I am not able to understand h...
0 votes
130
what is the difference between a "Block" and "Sector" in Hard disk ..??? Are they both same ???
3 votes
132
2 votes
133
why there is need of normal forms in the context free grammer ????????????????? elaborate with example plz.
3 votes
135
#include<stdio.h>int main(){ int i=10; printf("address of i=%d value of i=%d",&i,i); &i=7200; printf("address of i=%d value of i=%d",&i,i); return 0;...
7 votes
136
Which one is more powerful Deterministic push down automata or Non Deterministic push down automata ?
0 votes
137
3 votes
138
int main() { int n = 3,i,count=0; for(i=0;i<1<<n;i++) { int p = i; while(p) { int k = p & -p; p = p - k; count++; } } }The value of count variable after execution of the ...
0 votes
140
Response time, elapsed time, access time all are consider same and equivalent ? Explanation.
1 votes
141
please tell how to solve it?
3 votes
142
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?Minimum CPU utilizationMaximum throughputMinimum turnaround timeMinimu...
2 votes
143
Consider the following Deterministic Finite Automaton $M$.Let $S$ denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of str...
1 votes
146
Is the following relation in 3NF or not ?
5 votes
148
1 votes
149