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
Recent activity by phelps18
3
answers
1
Madeeasy Test Series
Suppose that in 1000 memory references there are 150 misses in first level and 100 misses in second level cache. Assume that miss penalty from L2 cache to memory is 120 cycles. The hit time of L2 cache is 50 cycles. If there are 4 memory references per instruction, the average stall per instruction is
Suppose that in 1000 memory references there are 150 misses in first level and 100 misses in second level cache. Assume that miss penalty from L2 cache to memory is 120 c...
1.5k
views
commented
Jan 15, 2018
1
answer
2
DmA
1.7k
views
commented
Jan 7, 2018
CO and Architecture
dma
+
–
1
answer
3
Testbook Test Series: Operating System - Process Schedule
479
views
answer selected
Nov 21, 2017
Operating System
testbook-test-series
process-scheduling
operating-system
+
–
5
answers
4
GATE CSE 2008 | Question: 13, ISRO2016-36
If $L$ and $\overline{L}$ are recursively enumerable then $L$ is regular context-free context-sensitive recursive
If $L$ and $\overline{L}$ are recursively enumerable then $L$ isregularcontext-freecontext-sensitiverecursive
11.7k
views
commented
Nov 16, 2017
Theory of Computation
gatecse-2008
theory-of-computation
easy
isro2016
recursive-and-recursively-enumerable-languages
+
–
1
answer
5
B tree
A B tree has order 10. Suppose it's leaf node already has 9 elements and one more element is inserted in it and split occurs. Now my question is is it always necessary that the split is of size 4 and 5 ie left child contain 4 values and right child node contain 5 values? Or it could also be 5 and 4? Thanks.
A B tree has order 10. Suppose it's leaf node already has 9 elements and one more element is inserted in it and split occurs. Now my question is is it always necessary th...
625
views
answered
Nov 6, 2017
Databases
databases
b-tree
+
–
0
answers
6
process
1)Which is not a function of OS a)swap space b)free space c)process creation d)effective device utilisation
1)Which is not a function of OSa)swap spaceb)free spacec)process creationd)effective device utilisation
500
views
commented
Nov 6, 2017
1
answer
7
time complexity
To find the kth smallest element in the heap , the time required is O(n), where k is less than the number of element in the heap. is this statement true should not it be O(klogn)
To find the kth smallest element in the heap , the time required is O(n), where k is less than the number of element in the heap. is this statement true should not it be ...
322
views
answered
Nov 6, 2017
DS
data-structures
binary-heap
time-complexity
+
–
1
answer
8
CN practice ques
417
views
answered
Oct 31, 2017
Computer Networks
computer-networks
channel-capacity
+
–
0
answers
9
testbook test
WHICH OF THE FOLLOWING protocol IS NOT DEFINED BY TCP/IP model at Transport layer? 1.TCP 2.SCTP 3.UDP 4.ALL the above are defined. since SCTP was NEW concept for me how should we attempt these type of questions in final exam.
WHICH OF THE FOLLOWING protocol IS NOT DEFINED BY TCP/IP model at Transport layer?1.TCP2.SCTP3.UDP4.ALL the above are defined.since SCTP was NEW concept for me how should...
621
views
edited
Oct 30, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register