Register
Filter

Questions by BHOJARAM

1 votes
1 answer
1
#selfdoubt
given schedule s: R2A W1B W1C R3B R2B R1A C1 R2C C2 W3A C3 How should I approach to above problem when LOCKS ARE NOT GIVEN and to find if s is 2PL ?
given schedule s: R2A W1B W1C R3B R2B R1A C1 R2C C2 W3A C3How should I approach to above problem when LOCKS ARE NOT GIVEN and to find if s is 2PL ?
1 votes
1 answer
2
#selfdoubt
 In the above ER diagram how many relational table and attributes will be in respective table??
In the above ER diagram how many relational table and attributes will be in respective table??
0 votes
0 answers
3
#selfDoubt
Consider all the elements of an array is same and choosing pivot such a way that divides array into two equal parts. Then will it behave like QuickSort best case or worst case?
Consider all the elements of an array is same and choosing pivot such a way that divides array into two equal parts. Then will it behave like QuickSort best case or worst...
3 votes
3 answers
4
#selfDoubt
complement of CFL can never be CFL. please explain if the above statement is true of false?
complement of CFL can never be CFL.please explain if the above statement is true of false?
1 votes
1 answer
5
#madeeasy
$L1=a^n b^n c^m | n,m>0$ $L2=a^n b^m c^m |n,m>0$ Then L1 intersection L2= a^n b^n c^n or a^n b^n c^m Which one will be correct??
$L1=a^n b^n c^m | n,m>0$$L2=a^n b^m c^m |n,m>0$Then L1 intersection L2= a^n b^n c^n or a^n b^n c^mWhich one will be correct??
1 votes
0 answers
6
#madeeasy
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
0 votes
0 answers
7
#gate
$L_1=\{a^m b^m c a^n b^n | m,n>=0\}$ $L_2=\{a^i b^j c^k | i, j,k >=0\}$ Then $L_1 \cap L_2$ = $\{a^m b^m c\}$ or $\{a^n b^n c\}$ or $\{a^i b^i c\}$ or $\{a^j b^j c\}$ Which one is correct??
$L_1=\{a^m b^m c a^n b^n | m,n>=0\}$$L_2=\{a^i b^j c^k | i, j,k >=0\}$Then $L_1 \cap L_2$ = $\{a^m b^m c\}$ or $\{a^n b^n c\}$ or $\{a^i b^i c\}$ or $\{a^j b^j c\}$Which...
0 votes
0 answers
8
#madeeasy
A group G having O(G)= 200 is known to be cyclic with g being one of its generator.It is given that O(g^x)=100 for some x€Z. Then value of x is?
A group G having O(G)= 200 is known to be cyclic with g being one of its generator.It is given that O(g^x)=100 for some x€Z. Then value of x is?
0 votes
0 answers
9
#madeeasy
A stack based CPU executes the instruction. Memory location 500 contain 0×88 and memory location 700 contain 0×37. Stack pointer is at 0×003F. I1: push 500 I2: push 700 I3: add I4: pop 600 I5: push 300 Then after execution of above instruction the memory location 600 contains _
A stack based CPU executes the instruction. Memory location 500 contain 0×88 and memory location 700 contain 0×37. Stack pointer is at 0×003F.I1: push 500I2: push 700I...
0 votes
1 answer
10
#madeeasy
bool foo(char *s) { char c[ ]=”correspondence”; int i=0,j=0; While(s[i] && c[j]) { if (s[i] ==c[j]) j++; i++; } if(! c[j]) return true; else return false; } The string ‘response’ and ‘credence' are passed to the above function too one by one and output is observed in each case. book data type return true or false
bool foo(char *s){ char c[ ]=”correspondence”;int i=0,j=0;While(s[i] && c[j]){ if (s[i] ==c[j]) j++;i++;}if(! c[j]) return true;else return false;}The string ‘respo...
0 votes
0 answers
11
#madeeasy
0 votes
0 answers
12
#madeeasy
If the sender window size is 128 using selective repeat arq,then the sequence no. of the frame to be send after sending 400th frames is_?
If the sender window size is 128 using selective repeat arq,then the sequence no. of the frame to be send after sending 400th frames is_?
0 votes
0 answers
13
#madeeasy
How many binary min heap possible with element(1,2,3,4,5,6,7)?
How many binary min heap possible with element(1,2,3,4,5,6,7)?
0 votes
0 answers
14
#madeeasy
No of generators in a cyclic group when O(G)=12 and O(G)=13?
No of generators in a cyclic group when O(G)=12 and O(G)=13?
0 votes
1 answer
15
#madeeasy
For two relations R(a,b) with FD F={a->b} and S(b,c) with FD F={b->c} then R natural join S is Bcnf. Explain True or False?
For two relations R(a,b) with FD F={a->b} and S(b,c) with FD F={b->c} then R natural join S is Bcnf. Explain True or False?
0 votes
0 answers
16
#Madeeasy
A 4way set associative cache lines of 32 bytes and a cache size of 16kb. Which of the below main memory blocks is mapped to set 13 of the cache memory when 16mb main memory is used? (A295D0,FCED9D,2FA0D0,F0A1B5)
A 4way set associative cache lines of 32 bytes and a cache size of 16kb. Which of the below main memory blocks is mapped to set 13 of the cache memory when 16mb main memo...