Register
Filter

Recent questions without a selected answer

0 votes
0 answers
15331
nptel-assignment
The block diagram of a CPU with single bus organization is given below.What are the three control steps required to execute instruction MOV R1,32 Ans given is D. What is WMFC? Please elaborate.
The block diagram of a CPU with single bus organization is given below.What are the three control steps required to execute instruction MOV R1,32Ans given is D. What is W...
User Avatar
0 votes
1 answer
15332
Lossless and Dependency Preserving Decomposition
User Avatar
0 votes
1 answer
15333
MadeEasy Test Series
A processor overflow flag is represented as 0V(a,b,c) where arguments a is MSB of operand 1,b is MSB of operand 2, and c is MSB of the result after computing a and b. The 0V(a,b,c) of PSW becomes 1 after a’b’c+a’bc’ a’b’c+abc’ ab’c’+ab’c a’b’c+abc
A processor overflow flag is represented as 0V(a,b,c) where arguments a is MSB of operand 1,b is MSB of operand 2, and c is MSB of the result after computing a and b. Th...
User Avatar
0 votes
0 answers
15334
UPPCL Assistant engineer
An address space is specified by 24­bit and the correspondence memory space is 16 bit. How many words are there in address space? 1 M words 2 M words 8 M words 16 M words
An address space is specified by 24­bit and the correspondence memory space is 16 bit. How many words are there in address space?1 M words2 M words8 M words16 M words
User Avatar
2 votes
0 answers
15335
self doubt
if anyone have previous year math question of gate of all branches please share by google drive and share link. please friends. Thankyou.
if anyone have previous year math question of gate of all branches please share by google drive and share link.please friends.Thankyou.
User Avatar
1 votes
1 answer
15336
MadeEasy Test Series: Compiler Design - Grammar
Consider the following grammar G shown Below : S → abS | ScS | d | c The number of terminals in follow set of non-terminal S is ___________________ Is “$” symbol considered terminal?
Consider the following grammar G shown Below :S → abS | ScS | d | cThe number of terminals in follow set of non-terminal S is ___________________ Is “$” symbol cons...
User Avatar
0 votes
0 answers
15337
MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explain the solution, whats the actual logic in questions of Preprocessor codes?
Please explain the solution, whats the actual logic in questions of Preprocessor codes?
User Avatar
1 votes
0 answers
15338
A variation of a past gate question(2015-1-31)
The complexity of this program? int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j > 1; j = j/2) { p++; for (k = 1; k < p; k = k * 2) ++q; } } return q; }
The complexity of this program? int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j 1; j = j/2) { p++; for (k = 1; k < p; k = k * ...
User Avatar
1 votes
1 answer
15339
ACE Test Series
Can any tell the formula for A<B and A=B I understand the solution but I didn’t found any formula on net. Any valid links are welcome.
Can any tell the formula for A<B and A=BI understand the solution but I didn’t found any formula on net. Any valid links are welcome.
User Avatar
1 votes
1 answer
15340
Made easy test
Minimum number of tables needed to represent E1, E2 and E3 are?
Minimum number of tables needed to represent E1, E2 and E3 are?
User Avatar
1 votes
0 answers
15341
Boolean Algebra
The function f(a,b,q,g)=$\prod m(1,2,4,6,8,9)$. Can f(a,b,q,g) be written as f(q,g,b,a) + $\sum m(5,10)$? If not, what would be the correct equation?
The function f(a,b,q,g)=$\prod m(1,2,4,6,8,9)$. Can f(a,b,q,g) be written as f(q,g,b,a) + $\sum m(5,10)$?If not, what would be the correct equation?
User Avatar
2 votes
1 answer
15342
NTA NET Dec 2018
User Avatar
1 votes
1 answer
15343
Madeasy test series
Does equivalence of CFG decidable ? That is for two CFG G1 and G2 L(G1)= L(G2)? And if it is DCFG than is it decidable.
Does equivalence of CFG decidable ?That is for two CFG G1 and G2 L(G1)= L(G2)?And if it is DCFG than is it decidable.
User Avatar
0 votes
0 answers
15344
ME Test Series
A sen B men C athe D vin
A sen B men C atheD vin
User Avatar
0 votes
1 answer
15345
made easy
for 2 relations R(A,B) with functional dependency F={A->B} and S(B,C) witht functional dependency S={B->C} natural join of R and S is in BCNF
for 2 relations R(A,B) with functional dependency F={A->B} and S(B,C) witht functional dependency S={B->C} natural join of R and S is in BCNF
User Avatar
0 votes
0 answers
15346
No of Boolean Functions
How many Boolean functions are possible for 3 variable input function F(x,y,z) such that above condition is satisfied ? $f(a,b,c)=f(\bar{a},b,\bar{c})$
How many Boolean functions are possible for 3 variable input function F(x,y,z) such that above condition is satisfied ?$f(a,b,c)=f(\bar{a},b,\bar{c})$
User Avatar
0 votes
1 answer
15348
ME Test Series
User Avatar
0 votes
1 answer
15350
#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?
User Avatar
0 votes
2 answers
15351
Made easy Test
void foo(int n) { while (n! = 0) { if (!(n & 1)) printf(“*”); n = n >> 1 ; } } The number of times printf(“*”) is executed, when the value 2 raised to power 24 is passed to the function foo() is ?
void foo(int n){ while (n! = 0) { if (!(n & 1)) printf(“*”); n = n > 1 ; }} The number of times printf(“*”) is executed, whe...
User Avatar
0 votes
0 answers
15353
#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...
User Avatar
1 votes
0 answers
15354
What are the Algorithms which are (from all topics) important for GATE ?
It would be great, if the time complexities associated with them are included.
It would be great, if the time complexities associated with them are included.
User Avatar
0 votes
1 answer
15355
regular expression for mod 3 =1
someone can help me found the regular expression of L={σ×w, σϵ∑={a, b},#σ(w)mod 3 = 1} tnx.
someone can help me found the regular expression ofL={σ×w, σϵ∑={a, b},#σ(w)mod 3 = 1} tnx.
User Avatar
0 votes
0 answers
15357
Self doubt
Is the below given Peterson’s solution free from deadlock ? I am getting a doubt that if we preempt the P0 after executing line 1 and if P1 arrives next it will get blocked . Once P0 resumes it will get blocked. So both are in deadlock , Is that correct?
Is the below given Peterson’s solution free from deadlock ?I am getting a doubt that if we preempt the P0 after executing line 1 and if P1 arrives next it will get bloc...
User Avatar
1 votes
0 answers
15358
Self doubt
If P1 and P2 are two concurrent process sharing variable x with initial value 10 , then what is the max value of x possible when both process have completed? P1 : for (i=0; i < 10; i++) { x = x + 20; } P2: for (j=1;j<10;j++) { x = x + 5; }
If P1 and P2 are two concurrent process sharing variable x with initial value 10 , then what is the max value of x possible when both process have completed?P1 :for (i=0;...
User Avatar
Page: