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 dirac
1
answer
1
External fragmentation in Best fit memory allocation policy
Assume 140K, 260K, 60K memory is free. What is the total external fragmentation that arises for the following requests 110K, 30K, 210K, 50K using Best-fit policy, assume no compaction A) 120K B) 110K C) 60K D)30K My ans: But the given answer is: Please explain.
Assume 140K, 260K, 60K memory is free. What is the total external fragmentation that arises for the following requests 110K, 30K, 210K, 50K using Best-fit policy, assume ...
4.2k
views
commented
Nov 13, 2015
Operating System
memory-management
test-series
+
–
2
answers
2
counting semaphore related question
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too? Please justify your answers.
A binary semaphore ensures mutual exclusion. Does a counting semaphore ensure mutual exclusion too?Please justify your answers.
1.6k
views
asked
Nov 13, 2015
Operating System
semaphore
process-synchronization
operating-system
+
–
3
answers
3
No. of bits in physical and logical address space
Is it possible to have different number of pages and frames or they need to be equal in number?
Is it possible to have different number of pages and frames or they need to be equal in number?
9.1k
views
answered
Nov 13, 2015
Operating System
memory-management
+
–
1
answer
4
Application Layer
WHICH OF THE FOLLOWING IS FALSE ? 1)DNS IS A CLIENT SERVER APPLICATION 2) DNS TREE HAVE ONLY 64 LEVELS 3)DNS ORGANISE THE NAMESPACE IN HIERARCHICAL STRUCTURE 4) DNS USE THE UDP FOR SOME MESSAGES WHILE SOME FOR TCP .
WHICH OF THE FOLLOWING IS FALSE ?1)DNS IS A CLIENT SERVER APPLICATION2) DNS TREE HAVE ONLY 64 LEVELS3)DNS ORGANISE THE NAMESPACE IN HIERARCHICAL STRUCTURE4) DNS USE THE U...
2.1k
views
answered
Nov 12, 2015
Computer Networks
computer-networks
+
–
3
answers
5
Transmission rate in a 3 node 2 link sliding window system
The distance between A to B is 4000 km. The distance between B and C is 1000 km.The propogation delay is 5 micro sec/ km for both the links. The data rate between A and B is 100kbps. Both the links are full duplex. All data frames are ... rate (in kbps) between B and C so that buffers of node B are not flooded? A. 100 B.150 C.200 D.250
The distance between A to B is 4000 km. The distance between B and C is 1000 km.The propogation delay is 5 micro sec/ km for both the links. The data rate between A and B...
3.4k
views
commented
Oct 6, 2015
Computer Networks
computer-networks
stop-and-wait
sliding-window
linear-algebra
+
–
2
answers
6
Which utilization formula to use and why?
Consider sliding window protocol for a 10 MBps point to point link with propagation delay of 2 sec. If frame size is of 4kB then what wil be the minimum number of bits number required for the sequence number? Which approach to take and ... difference in frame numbers, why does this arise and which one is correct. The answer is not affected in this question.
Consider sliding window protocol for a 10 MBps point to point link with propagation delay of 2 sec. If frame size is of 4kB then what wil be the minimum number of bits nu...
2.1k
views
asked
Oct 6, 2015
Computer Networks
computer-networks
sliding-window
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register