Register
Filter

Recent activity by Red_devil

0 answers
1
Test series
The number spanning trees for the graph I think the answer should be 3. But answer given is 2
The number spanning trees for the graphI think the answer should be 3.But answer given is 2
0 answers
2
reg and graph colour
https://gateoverflow.in/8098/gate2015-2-19 How is register allocation and graph colouring related
https://gateoverflow.in/8098/gate2015-2-19How is register allocation and graph colouring related
1 answer
3
Relative Addressing Mode
A two- word instruction is stored in a location A. The operand part of instruction holds B. If the addressing mode is relative , the operand is available in location : A. A+B+2 B.A+B+1 C.B+1 D.A+B Explain with diagram.
A two- word instruction is stored in a location A. The operand part of instruction holds B. If the addressing mode is relative , the operand is available in location :A. ...
0 answers
4
Data Dependency
0 answers
5
all npcomplete
2 problems A and B both are known to be NP-COMPLETE ? Is it possible that we can reduce A to B ??
2 problems A and B both are known to be NP-COMPLETE ? Is it possible that we can reduce A to B ??
0 answers
6
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=17252928676307264993 how to solve these type of question someone please help?
https://gateoverflow.in/?qa=blob&qa_blobid=17252928676307264993how to solve these type of question someone please help?
1 answer
7
Which of the following is true?
1)S1 is regular but not S2 2)S2 is regular but not S1 3)S1 and S2 are not regular 4)S1 and S2 are regular
1)S1 is regular but not S22)S2 is regular but not S13)S1 and S2 are not regular4)S1 and S2 are regular
0 answers
9
minimum swaps
Minimum number of swaps required is in insertion or selection sort
Minimum number of swaps required is in insertion or selection sort
0 answers
10
madeeasy work book
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames allocated to the process then what is the minimum and maximum number of page faults possible?
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames ...
2 answers
11
B+ tree
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum keys per node], to make it to reach 3-levels are __________.
The minimum number of elements (keys) that need to be inserted into a B+ tree with the order of internal node 3 [maximum child pointers per node] and leaf node 2 [maximum...
1 answer
13
Operating system:- Interrupts
when the interrupt occurs ,then a: process switching may be there b: context saving must be there c: both a and b d.None of these
when the interrupt occurs ,thena: process switching may be thereb: context saving must be therec: both a and bd.None of these
0 answers
14
permutation and combination
How many to divide 2t objects? A. 2 groups of t each B. t groups of 2 each
How many to divide 2t objects?A. 2 groups of t eachB. t groups of 2 each
2 answers
15
Algo:- Test series
Consider the following code: Which of the following represents the number of additions performed by above code?
Consider the following code:Which of the following represents the number of additions performed by above code?
0 answers
16
avg case unsuccessful linear search complexity
Average case complexity of sequential search if the element that is searched is not in the list a) ( n+p) /2 b) (np+1)/2 c) n(1-p/2)+p/2 d) n(1+p/2) +p/2
Average case complexity of sequential search if the element that is searched is not in the lista) ( n+p) /2 b) (np+1)/2 c) n(1-p/...
0 answers
17
Digital logic Latch self doubt
I read that latch are level triggered and flip flop are egde triggered . Doubts 1. can a latch be synchronous? Is gated latch synchronous?? 2. Is flip flop always synchronous??
I read that latch are level triggered and flip flop are egde triggered .Doubts1. can a latch be synchronous? Is gated latch synchronous??2. Is flip flop always synchron...
0 answers
18
Non Abelian Group
Let G be a non-abelian group, order of G can be ? (A) 24 (B) 44 (C) 54 (D) 34
Let G be a non-abelian group, order of G can be ?(A) 24 (B) 44 (C) 54 (D) 34
0 answers
19
turing machine
is recursive enumerable and recursive set both are infinitely countable set??????? explain if yes or why not.
is recursive enumerable and recursive set both are infinitely countable set???????explain if yes or why not.
1 answer
20
types of miss in cache
a direct-mapped cache of the size of 4 blocks. The main memory block access sequences are 0,1,2,3,4,1,2,3,0,4,0 No. of compulsory misses, conflict misses and capacity misses?
a direct-mapped cache of the size of 4 blocks. The main memory block access sequences are 0,1,2,3,4,1,2,3,0,4,0 No. of compulsory misses, conflict misses and capacity mis...
1 answer
21
self doubt
what is the difference between basic , conservative , strict and rigorous lock ?
what is the difference between basic , conservative , strict and rigorous lock ?
1 answer
22
2 phase locking
how does a 2 phase locking protocol cause deadlock ? and why is it conflict serializable
how does a 2 phase locking protocol cause deadlock ?and why is it conflict serializable
0 answers
23
tautology
2 answers
24
Programming doubt
What will be output if you will compile and execute the following c code? #include<stdio.h> int main(){ char c=125; c=c+10; printf("%d",c); return 0; } (A) 135 (B) 115 (C) -121 (D) -8 (E) Compiler error
What will be output if you will compile and execute the following c code? #include<stdio.h>int main(){char c=125;c=c+10;printf("%d",c); return 0;}(A) 135(B) 115(C) -121(D...
1 answer
25
RAW, WAR, WAW hazards
J1: R1 = 100 J2: R1 = R2 + R4 J3: R2 = R4 + 25 J4: R4 = R1 + R3 J5: R1 = R1 + 30 Give the no of RAW, WAR and WAW hazards
J1: R1 = 100J2: R1 = R2 + R4J3: R2 = R4 + 25J4: R4 = R1 + R3J5: R1 = R1 + 30Give the no of RAW, WAR and WAW hazards
1 answer
26
gatebook
Which of the above is(are) CFL(s)? A. L1 and L2 B. Only L1 C. Only L2 D. None
Which of the above is(are) CFL(s)?A. L1 and L2B. Only L1C. Only L2D. None
0 answers
28
cache
what is cache hit time and what is cache hit latency ? are they both same ?
what is cache hit time and what is cache hit latency ? are they both same ?
0 answers
29
REALTION ALGEBRA
Consider the following relations: The number of records resulted by the following relational algebra expression are _________?
Consider the following relations:The number of records resulted by the following relational algebra expression are _________?
1 answer
30
DAG problem
What will be the DAG representation of a=b+c , b= b+c
What will be the DAG representation of a=b+c , b= b+c