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
0
answers
21
GATE2007 clearing ambiguity
https://gateoverflow.in/1269/gate2007-71 there is an ambiguity between the answer personally i feel it should be 11 because one MOV instruction there is not for accesing data but for storing it anybody with any valid reasoning for a chosen answer ....arjun sir please help
https://gateoverflow.in/1269/gate2007-71 there is an ambiguity between the answer personally i feel it should be 11 because one MOV instruction there is not for accesing ...
421
views
asked
Dec 20, 2017
0
votes
0
answers
22
multiplexer - GATE question
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size of the multiplexer needed? 2n line to 1 line 2n+1 line to 1 line 2n−1 line to 1 line 2n−2 line to 1 line For this option C is the answer What if inverter was not provided ?
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size of the multiplexer needed?...
1.3k
views
asked
Dec 20, 2017
0
votes
0
answers
23
tracks
https://gateoverflow.in/3846/gate2005-it-81b There is a confusion over this one Does anyone have a valid explanation ?
https://gateoverflow.in/3846/gate2005-it-81bThere is a confusion over this one Does anyone have a valid explanation ?
155
views
asked
Dec 19, 2017
0
votes
0
answers
24
contention
There is no contention in CSMA / CD network what does it mean and why ?
There is no contention in CSMA / CD networkwhat does it mean and why ?
174
views
asked
Dec 18, 2017
0
votes
0
answers
25
GATE 2004 (85)with modification
A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function g(x) for each node x. If the cost of computing g(x) is: min(number of leaf-nodesin left-subtree of x,number of leaf-nodesin right- ... of nodesin left-subtree of x,number of nodesin right-subtree of x) (i.e) it was number of nodes rather than leaf nodes
A program takes as input a balanced binary search tree with n leaf nodes and computes the value of a function g(x) for each node x. If the cost of computing g(x) is: min...
442
views
asked
Dec 18, 2017
0
votes
0
answers
26
distributive property
If suppose we take 3 vertices of a graph to check if it satisfies distributive property atleast one vertice of that graph has unique compliment then it will satisfy distributive property is this assumption correct ? if not can i have an counter example
If suppose we take 3 vertices of a graph to check if it satisfies distributive property atleast one vertice of that graph has unique compliment then it will satisfy distr...
451
views
asked
Dec 16, 2017
0
votes
0
answers
27
find cycle
To find cycle in an undirected graph which is more efficient union find or BFS ? and why
To find cycle in an undirected graph which is more efficient union find or BFS ? and why
119
views
asked
Dec 16, 2017
1
votes
0
answers
28
GATE question doubt
What does the following algorithm approximate? (Assume m>1,ϵ>0m>1,ϵ>0). x = m; y = 1; While (x-y > ϵ) { x = (x+y)/2; y = m/x; } print(x); logm m2 m1/2 m1/3 Can i get a reason of why it cannot be log m ? when finding by substituting values
What does the following algorithm approximate? (Assume m>1,ϵ>0m>1,ϵ>0).x = m; y = 1; While (x-y ϵ) { x = (x+y)/2; y = m/x; } print(x);logmm2m1/2m1/3Can i get a reason...
276
views
asked
Dec 15, 2017
0
votes
0
answers
29
GATE 2004 modified
Consider three IP networks A,BA,B and CC. Host HAHA in network AA sends messages each containing 180 bytes of application data to a host HCHC in network CC. The TCP layer prefixes 20 byte header to the message. This passes through an intermediate network BB. The maximum ... other overheads. what if the question was same but from A to B it is 512kbps and from B to C it is 1Mbps ?
Consider three IP networks A,BA,B and CC. Host HAHA in network AA sends messages each containing 180 bytes of application data to a host HCHC in network CC. The TCP layer...
223
views
asked
Dec 15, 2017
0
votes
0
answers
30
TCP minimum rate
TCP guarantees a minimum communication rate - this statement is false WHY ? MSB is set for TCP right...even if congestion occurs ans starts from slow start if MSB = 2 then it starts transmission from 2 so doesnt it assure minimum communication rate ? or am i goin wrong somewhere
TCP guarantees a minimum communication rate - this statement is falseWHY ?MSB is set for TCP right...even if congestion occurs ans starts from slow start if MSB = 2 then ...
467
views
asked
Dec 13, 2017
1
votes
0
answers
31
GATE IT 2007 | Question: 36 with modification
int i ; program main () { int j = 60; i = 50; call f (i, j); print i, j; } procedure f (x, y) { i = 100; x = 10; y = y + i ; } this is already discussed https://gateoverflow.in/3466/gate2007-it-33 but what if i was redeclared and assigned value 100 in procedure function eg ; int i = 100; then a local var i will be created ?
int i ; program main () { int j = 60; i = 50; call f (i, j); print i, j; } procedure f (x, y) { i = 100; x = 10; y = y + i ; }this is already discussed https://gateoverfl...
469
views
asked
Dec 12, 2017
0
votes
0
answers
32
inclusion
For inclusion to hold between two cache levels L1 and L2 in a multi-level cache hierarchy, which of the following are necessary? The associativity of L2 must be greater than that of L1 - this is false for principle of inclusion to hold all the caches must have the same associativity ? Also what is principle of exclusion in simple words
For inclusion to hold between two cache levels L1 and L2 in a multi-level cache hierarchy, which of the following are necessary?The associativity of L2 must be greater th...
1.0k
views
asked
Dec 11, 2017
1
votes
0
answers
33
bypass
1) why bypassing cannot eliminate RAW dependency ? 2) what are the dependencies register renaming can eliminate and why ?
1) why bypassing cannot eliminate RAW dependency ?2) what are the dependencies register renaming can eliminate and why ?
302
views
asked
Dec 11, 2017
0
votes
1
answer
34
more than n/2
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is Θ(n) Θ(logn) Θ(log∗n) Θ(1) isnt O(1) enough for this.....the answer give in this site is log N can i get a counter on why O(1) wont work ?
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers isΘ(n)Θ(logn)Θ(log∗n)Θ(1)isnt O(1)...
3.4k
views
asked
Dec 11, 2017
Algorithms
algorithms
sorting
time-complexity
+
–
0
votes
0
answers
35
tournament
Once the tournament finishes, pick up the logN competitors that were beaten by the tournament winner and hold a mini-tournament to find which one is the best among them. If we imagine that better players correspond with smaller numbers, the algorithm ... in logN−1l steps. This algorithm requires N+logN−2 comparisons to complete How is the competitors beaten by tournament winner log N ?
Once the tournament finishes, pick up the logN competitors that were beaten by the tournament winner and hold a mini-tournament to find which one is the best among them. ...
298
views
asked
Dec 10, 2017
0
votes
0
answers
36
minimum swaps
Minimum number of swaps required is in insertion or selection sort
Minimum number of swaps required is in insertion or selection sort
1.1k
views
asked
Dec 10, 2017
0
votes
0
answers
37
goodput
Suppose that it takes 1 unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size of N packets. Each packet causes an ack or a nak to be generated by the receiver, and ack/nak transmission times ... i) 1 1 - e(i/N) Here ack is sent for each packet or only after entire window size (N packets is sent ) ??
Suppose that it takes 1 unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size o...
360
views
asked
Dec 9, 2017
0
votes
1
answer
38
processing time
A router has two full-duplex Ethernet interfaces each operating at 100 Mb/s. Ethernet frames are at least 84 bytes long (including the Preamble and the Inter-Packet-Gap). The maximum packet processing time at the router for wirespeed forwarding to be possible is (in microseconds) 0.01 3.36 6.72 8 what if inter packet gap was not included?
A router has two full-duplex Ethernet interfaces each operating at 100 Mb/s. Ethernet frames are at least 84 bytes long (including the Preamble and the Inter-Packet-Gap)....
230
views
asked
Dec 9, 2017
0
votes
0
answers
39
segmentation with paging
For each of the four processes P1, P2, P3 and P4. The total size in kilobytes (KB) and the number of segments are given below. Process Total size (in KB) Number of segments P1 195 4 P2 254 5 P3 45 3 P4 364 8 The page size is 1 KB. The size ... the query as to ......each segment will require page table or not? why only one page table is taken per process and not per segment
For each of the four processes P1, P2, P3 and P4. The total size in kilobytes (KB) and the number of segments are given below.ProcessTotal size (in KB)Number of segmentsP...
1.3k
views
asked
Dec 8, 2017
Operating System
operating-system
+
–
0
votes
0
answers
40
non planar
a bipartite or complete bipartite graph.....both are non planar ?
a bipartite or complete bipartite graph.....both are non planar ?
866
views
asked
Dec 7, 2017
Page:
« prev
1
2
3
4
5
6
7
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
