Register
Filter

Questions by just_bhavana

2 votes
1 answer
31
Serializability and strict schedules
Answer is given as D. Not serializable, agreed. But how is it strict??
Answer is given as D. Not serializable, agreed. But how is it strict??
3 votes
1 answer
32
Relational Algebra
Consider the following schema: Student (Sid, Sname, age) Course Info (Cid, Cname, Instructor SSN) Enroll (Sid, Cid, grade). The relational algebra expression for “find the Cid’s of courses enrolled by two different students” is ??
Consider the following schema:Student (Sid, Sname, age)Course Info (Cid, Cname, Instructor SSN)Enroll (Sid, Cid, grade).The relational algebra expression for “find the ...
5 votes
1 answer
34
Self-doubt
Can there ever be a TLB hit and a page fault?
Can there ever be a TLB hit and a page fault?
2 votes
4 answers
35
Test Series
How come here deadlock is not possible?! It says each process needs a minimum of one instance to complete. So maximum could be anything greater than one and deadlock may happen in the worst case, right?
How come here deadlock is not possible?! It says each process needs a minimum of one instance to complete. So maximum could be anything greater than one and deadlock may...
17 votes
1 answer
37
Token Bucket
Token Bucket mechanism is used for congestion control at router. Bucket capacity in 700 Bytes (initially full), token arrival rate is 200 Bytes/sec and maximum output rate is 300 Bytes/sec. The amount of time (in sec) required to transmit 3000 Bytes file is _____.
Token Bucket mechanism is used for congestion control at router. Bucket capacity in 700 Bytes (initially full), token arrival rate is 200 Bytes/sec and maximum output rat...
0 votes
2 answers
38
DCFL or NCFL
L = {ai bj ck | i = k or j = k} Is it a DCFL or an NCFL?
L = {ai bj ck | i = k or j = k}Is it a DCFL or an NCFL?
6 votes
3 answers
39
DCFLs
S1: Every DCFL has unambiguous grammar S2: Every language accepted by DPDA with final state is also accepted by DPDA with empty stack S1 is given as true and S2 false. Explain how?!
S1: Every DCFL has unambiguous grammarS2: Every language accepted by DPDA with final state is also accepted by DPDA with empty stackS1 is given as true and S2 false.Expla...
1 votes
1 answer
40
Identify the language
L = { w | w $\epsilon$ (a,b)* and #a(w) - #b(w) $\leq$ 10}. Is L regular or a CFL?
L = { w | w $\epsilon$ (a,b)* and #a(w) - #b(w) $\leq$ 10}. Is L regular or a CFL?
1 votes
1 answer
41
Identify the language
L1 = {w | length of w is odd and its middle symbol is 0, w $\epsilon$ (0,1)*} Is it regular, a CFL or a CSL?
L1 = {w | length of w is odd and its middle symbol is 0, w $\epsilon$ (0,1)*}Is it regular, a CFL or a CSL?
2 votes
1 answer
42
Mealy-Moore machines
Mealy machines do not respond for epsilon whereas Moore machines do. Is this true? Please explain.
Mealy machines do not respond for epsilon whereas Moore machines do. Is this true? Please explain.
1 votes
3 answers
43
Predict the output
#include <stdio.h> void f(int); int main() { int a=4; f(a); return 0; } void f(int n) { if(n>0) { f(--n); printf("%d", n); f(--n); } } Explain how function calls take place
#include <stdio.h void f(int); int main() { int a=4; f(a); return 0; } void f(int n) { if(n>0) { f( n); printf("%d", n); f( n); } }Explain how function calls take place
0 votes
1 answer
44
C Proramming
main() { unsigned int num; int i; scanf("%u",num); for(i=0;i<16;i++) printf("%d", num << i & 1 <<15 ? 1 : 0); } This program calculates the binary equivalent of a number. Can anyone explain its working??
main(){unsigned int num;int i;scanf("%u",num);for(i=0;i<16;i++)printf("%d", num << i & 1 <<15 ? 1 : 0);}This program calculates the binary equivalent of a number. Can a...
2 votes
3 answers
46
Pointers
One of the disadvantage of pass by reference is that the called function may inadvertently corrupt the caller's data. This can be avoided by : a) declaring the actual parameters constant b) declaring the formal parameters constant c) passing pointers d) None of these
One of the disadvantage of pass by reference is that the called function may inadvertently corrupt the caller's data. This can be avoided by :a) declaring the actual para...
0 votes
1 answer
47
Finite State Machine
The difference between number of states in two equivalent mealy and moore machines is 1 a) True b) False
The difference between number of states in two equivalent mealy and moore machines is 1a) Trueb) False
Page: