Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by A_i_$_h
1
votes
1
answer
41
slow start
slow start mechanism is used to deal with congestion control right ?
slow start mechanism is used to deal with congestion control right ?
406
views
asked
Dec 6, 2017
1
votes
0
answers
42
connection establish
in TCP connection establishment phase (S1) The server moves LISTEN → SYN_RCVD → SYN_SENT → ESTABLISHED in the state machine on no packet loss =>False . (S2) The server moves LISTEN → SYN_RCVD → ESTABLISHED in the state machine on no packet loss. => True what does these statements actually mean ?
in TCP connection establishment phase(S1) The server moves LISTEN → SYN_RCVD → SYN_SENT → ESTABLISHED in the state machine on no packet loss =>False .(S2) The se...
753
views
asked
Dec 6, 2017
0
votes
0
answers
43
exponent
The exponent of 11 in the prime factorization of 300! is 27 28 29 30 the answer is 29.....but what if the question was just factorisation and not prime factorisation is there any difference ?
The exponent of 11 in the prime factorization of 300! is27282930the answer is 29.....but what if the question was just factorisation and not prime factorisationis there a...
556
views
asked
Dec 6, 2017
0
votes
0
answers
44
subfield
https://gateoverflow.in/3316/gate2008-it-26 is this still in syllabus?
https://gateoverflow.in/3316/gate2008-it-26is this still in syllabus?
143
views
asked
Dec 6, 2017
0
votes
1
answer
45
hamiltonian
what are the conditions to check if a graph is hamiltonian ?
what are the conditions to check if a graph is hamiltonian ?
343
views
asked
Dec 6, 2017
1
votes
0
answers
46
waiting time
Frames of 1000 bits are sent over a 106 duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let I be the minimum number of bits (I) that will be ... packets again(full duplex)...so fully transit the link by 51 packets right ? why asssuming only for one way propogation as 25 frames
Frames of 1000 bits are sent over a 106 duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in...
520
views
asked
Dec 5, 2017
0
votes
0
answers
47
asynchronous ciricuit
In the sequential circuit shown below, if the initial value of the output Q1Q0 is 00. What are the next four values of Q1Q0? When Q0 changes from 0 to 1(positive edge triggered)......Q1 toggles doubt 1 - is it because the input to T flip flop is 1 and ... filp flop was 0 then even upon triggering Q1 will remain as Q1? doubt 3 - what will be the case if D flip flop was used
In the sequential circuit shown below, if the initial value of the output Q1Q0 is 00. What are the next four values of Q1Q0?When Q0 changes from 0 to 1(positive edge trig...
364
views
asked
Dec 4, 2017
0
votes
1
answer
48
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
673
views
asked
Dec 4, 2017
0
votes
0
answers
49
time complexity
https://gateoverflow.in/46212/cmi2011-b-06a what will be the time complexity of this algo is it O(n2) ? to find largest element = O(n) holding in hand and rotating..which is just exchanging the top and bottom element = O(1) rotating the entire stack = O(n) for one element O(n) + O(n) = O(n) then for n elements O(n) * O(n) = O(n2) correct me if am wrong
https://gateoverflow.in/46212/cmi2011-b-06awhat will be the time complexity of this algois it O(n2) ?to find largest element = O(n)holding in hand and rotating..which is...
260
views
asked
Dec 3, 2017
0
votes
1
answer
50
self doubt
what is the difference between basic , conservative , strict and rigorous lock ?
what is the difference between basic , conservative , strict and rigorous lock ?
438
views
asked
Dec 2, 2017
0
votes
0
answers
51
predicate
Which one of the following options is CORRECT given three positive integers x,y and z, and a predicate P(x)=¬(x=1)∧∀y(∃z(x=y∗z)⇒(y=x)∨(y=1)) (A) P(x) being true means that x is a prime number (B) P(x) being true means that x is a number other than 1 (C) P(x ... gate question and answer is option A what if it is modified as P(x)=¬(x=1)∧∀y(∀z(x=y∗z)⇒(y=x)∨(y=1)) what difference does it make
Which one of the following options is CORRECT given three positive integers x,y and z, and a predicate P(x)=¬(x=1)∧∀y(∃z(x=y∗z)⇒(y=x)∨(y=1))(A) P(x) being tr...
270
views
asked
Dec 2, 2017
0
votes
0
answers
52
addressing mode
Register Indirect Scaled Addressing How does it work
Register Indirect Scaled AddressingHow does it work
145
views
asked
Dec 2, 2017
0
votes
1
answer
53
planar graph
Is this a planar graph ?
Is this a planar graph ?
850
views
asked
Dec 2, 2017
0
votes
0
answers
54
syllabus
Is live variable analysis in syllabus ?
Is live variable analysis in syllabus ?
348
views
asked
Dec 1, 2017
0
votes
1
answer
55
congestion window
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. ... (timeout) ( new threshold=6) 2 4 6 8 10 so the answer = 10 am i right or wrong if wrong do help
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the thr...
573
views
asked
Dec 1, 2017
0
votes
0
answers
56
graph
https://gateoverflow.in/1537/gate2013_26 doubt 1 : Clique is nothing but ...the taken vertices should form a complete graph right ? doubt 2 : statement P says line graph of cycle is a cycle.....incase we take a complete graph with 4 vertices....in that we see 4 cycles formed.....and for the line graph also 4 cycles should be formed ? Can such a statement be infered from the statement P
https://gateoverflow.in/1537/gate2013_26doubt 1 : Clique is nothing but ...the taken vertices should form a complete graph right ?doubt 2 : statement P says line graph of...
526
views
asked
Dec 1, 2017
1
votes
0
answers
57
view serializable
Consider the following transactions with data items P and Q initialized to zero: T1T1 read (P); read (Q); if P = 0 then Q := Q + 1 ; write (Q). T2T2 read (Q); read (P); if Q = 0 then P := P + 1 ; write (P) Any non-serial interleaving of T1 and T2 for concurrent execution will be view serialiable?
Consider the following transactions with data items P and Q initialized to zero:T1T1read (P); read (Q); if P = 0 then Q := Q + 1 ; write (Q).T2T2read (Q); read (P); if Q ...
437
views
asked
Dec 1, 2017
0
votes
0
answers
58
cycles
1)Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of ordered cycles of length three? 2)Consider an directed random graph of eight vertices. The probability that ... that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
1)Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of ordered c...
769
views
asked
Nov 30, 2017
1
votes
0
answers
59
indexed
A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table (T1), which occupies exactly one page. Each entry of T1 stores ... virtually indexed and physicallly indexed cache...... If possible a small example to differentiate the 3 cases...would be helpful :)
A computer uses 46-bit virtual address, 32-bit physical address, and a three–level paged page table organization. The page table base register stores the base address o...
333
views
asked
Nov 30, 2017
0
votes
0
answers
60
decidability
A is a DFA and N is an NFA. Is L(A)=L(N) is decidable or not
A is a DFA and N is an NFA. Is L(A)=L(N) is decidable or not
229
views
asked
Nov 30, 2017
Page:
« prev
1
2
3
4
5
6
7
8
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
