Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
A_i_$_h
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by A_i_$_h
0
votes
0
answers
61
branch
In case of conditional branch only PC is updated with the target address and there is no need to store the old PC value into the memory. Why is it like that? if we dont save the old PC value how will it return back to continue executing after the completion of branch instruction ?
In case of conditional branch only PC is updated with the target address and there is no need to store the old PC value into the memory.Why is it like that? if we dont sa...
310
views
asked
Nov 30, 2017
1
votes
1
answer
62
johnson counter
Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is 0, 1, 3, 7, 15, 14, 12, 8, 0 0, 1, 3, 5, 7, 9, 11, 13, 15, 0 0, 2, 4, 6, 8, 10, 12, 14, 0 0, 8, 12, 14, 15, 7, 3, 1 ... 100, 110, 111, 011 and 001, and the sequence is repeated so long as there is input pulse. Thus this is a MOD-6 Johnson counter. This is clearly OPTION A right ?
Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is 0, 1, 3, 7, 15, 14, 12, 8, 00, 1, 3, 5, 7, 9, 11, 13, 15, 00, 2, ...
3.6k
views
asked
Nov 29, 2017
0
votes
0
answers
63
Breadth first search
Suppose breadth first search is executed on the graph below starting at some unknown vertex. Assume that a call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible depth of the queue (including the initial call) is _________.
Suppose breadth first search is executed on the graph below starting at some unknown vertex. Assume that a call to visit a vertex is made only after first checking that ...
502
views
asked
Nov 29, 2017
0
votes
0
answers
64
GATE 1991 modified
Find the maximum clock frequency at which the counter in the figure below can be operated. Assume that the propagation delay through each flip flop and each AND gate is 10 ns. Also assume that the setup time for the JK inputs of the flip flops is negligible. What if the clock was asynchronous then it will be 40ns?
Find the maximum clock frequency at which the counter in the figure below can be operated. Assume that the propagation delay through each flip flop and each AND gate is 1...
586
views
asked
Nov 29, 2017
2
votes
1
answer
65
GATE - 2014 - 1- 51 modified
Consider an directed graph G where self-loops are not allowed. The vertex set of G is {(i,j)∣1≤i≤12,1≤j≤12}There is an edge from(a,b) to (c,d) if |a−c|≤1 and |b−d|≤1. The number of edges in this graph is______
Consider an directed graph G where self-loops are not allowed. The vertex set of G is {(i,j)∣1≤i≤12,1≤j≤12}There is an edge from(a,b) to (c,d) if |a−c|≤1 an...
451
views
asked
Nov 27, 2017
0
votes
0
answers
66
cache block
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by k. What is the miss ratio if the ... through a cache of associativity A<k exercising least-recently-used replacement policy? In this case everything will be a miss right?
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to...
479
views
asked
Nov 27, 2017
0
votes
0
answers
67
number of solutions
Consider the following system of equations: 3x+2y=13x+2y=1 4x+7z=14x+7z=1 x+y+z=3x+y+z=3 x−2y+7z=0x−2y+7z=0 The number of solutions for this system is ______________ For such questions The number of solutions can be classified only into 3 types right? 1.unique 2.infinite 3.no solution
Consider the following system of equations: 3x+2y=13x+2y=14x+7z=14x+7z=1x+y+z=3x+y+z=3x−2y+7z=0x−2y+7z=0The number of solutions for this system is ______________ For...
301
views
asked
Nov 27, 2017
1
votes
0
answers
68
eigen vectors
A symmetric matrix has n eigenvalues and there exist n linearly independent eigenvectors (because of orthogonality) even if the eigenvalues are not distinct. Can we infer from this that incase we get LIN vectors from a matrix they will be orthogonal to each other?
A symmetric matrix has n eigenvalues and there exist n linearly independent eigenvectors (because of orthogonality) even if the eigenvalues are not distinct.Can we infer ...
378
views
asked
Nov 27, 2017
0
votes
0
answers
69
GATE - 2008
https://gateoverflow.in/394/gate2008-84 Here option A also leads to infinite loop right? it gets stuch at index 8 because 8 + 9 / 2 = 8 it never reaches 9
https://gateoverflow.in/394/gate2008-84Here option A also leads to infinite loop right?it gets stuch at index 8because 8 + 9 / 2 = 8it never reaches 9
337
views
asked
Nov 26, 2017
1
votes
1
answer
70
GATE 2016
In an adjacency list representation of an undirected simple graph G=(V,E), each edge (u,v) has two adjacency list entries: [v]in the adjacency list of uu, and [u][u] in the adjacency list of v. These are called twins of each other. A twin pointer is a pointer from ... ) and why to consider BFS or DFS when u represent a graph as adjacency list itself its O(n+m) and as array is O(n2) right?
In an adjacency list representation of an undirected simple graph G=(V,E), each edge (u,v) has two adjacency list entries: [v]in the adjacency list of uu, and [u][u] in t...
531
views
asked
Nov 21, 2017
0
votes
0
answers
71
GATE- 2013 -44 with modificationn
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of n queue operations on an initially full queue? (A) Θ(n) (B) Θ(n+k) (C) Θ(nk) (D) Θ(n2)
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m...
686
views
asked
Nov 20, 2017
1
votes
0
answers
72
GATE 2016 - 1 - 54 with modification
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega bytes per second. Tokens arrive at a rate to sustain output at a ... and the machine needs to send 12 mega bytes of data. The minimum time required to transmit the data is _____________ seconds.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 1 mega byte and the maximum output rate is 20 mega byte...
392
views
asked
Nov 20, 2017
1
votes
1
answer
73
cache
A cache has hit ration 0.95, 64 byte lines , having cache hit latency of 5ns. The main memory takes 90ns to return the first word(16 bits) of a line and 10ns to return each subsequent word . The time needed when cache miss happens is _____(nsec) (Assume ... time to write line into cache once it has been fetched from main memory and to detect cache miss time needed same as cache hit time)
A cache has hit ration 0.95, 64 byte lines , having cache hit latency of 5ns. The main memory takes 90ns to return the first word(16 bits) of a line and 10ns to return ea...
953
views
asked
Nov 18, 2017
0
votes
1
answer
74
processsor
Assume that CISC processor contains 10 global registers, 10 local registers, 6 In register and 6 Out register. It contain 4 register windows what is the size of window and register file of the processor? a) 30 and 74 b) 32 and 74 c) 22 and 64 d) 22 and 70
Assume that CISC processor contains 10 global registers, 10 local registers, 6 In register and 6 Out register. It contain 4 register windows what is the size of window an...
677
views
asked
Nov 18, 2017
0
votes
0
answers
75
fibonacci
How fibonacci timecomplexity on dynamic approach and recursive approach is different Couldnt understand the algo properly If someone could help :)
How fibonacci timecomplexity on dynamic approach and recursive approach is differentCouldnt understand the algo properly If someone could help :)
436
views
asked
Nov 16, 2017
0
votes
0
answers
76
sorting
Sorting that will work best for powers of base n
Sorting that will work best for powers of base n
320
views
asked
Nov 16, 2017
0
votes
1
answer
77
complexity
T(n) = T(sqrt(n)) + n Taking 2m = n we can convert this as S(m/2) + 2m after this how to solve by masters?
T(n) = T(sqrt(n)) + nTaking 2m = n we can convert this as S(m/2) + 2mafter this how to solve by masters?
483
views
asked
Nov 16, 2017
Algorithms
recurrence-relation
+
–
7
votes
4
answers
78
2Darray
Consider a 2D array with elemnts stored in the form of lower triangular matrix.The elements must be crossed to read A[4,2] from the array [-6..................+8 , -6..........+8 ] is
Consider a 2D array with elemnts stored in the form of lower triangular matrix.The elements must be crossed to read A[4,2] from the array [-6..................+8 , -6.......
5.5k
views
asked
Nov 15, 2017
2
votes
0
answers
79
compulsory miss
To reduce compulsory misses , increase the cache line size How does that work ive already read some of the discussions here but still not clear with how it works
To reduce compulsory misses , increase the cache line sizeHow does that workive already read some of the discussions here but still not clear with how it works
1.4k
views
asked
Nov 15, 2017
3
votes
1
answer
80
merge sort
Merge sort using linked list is better than array in terms of space complexity true or not with explanation :)
Merge sort using linked list is better than array in terms of space complexitytrue or not with explanation :)
742
views
asked
Nov 14, 2017
Algorithms
algorithms
merge-sort
space-complexity
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register