Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
LOOK
o Like SCAN except stops moving inwards (or outwards) when no more requests in that direction exist.
C-SCAN (circular scan)
o Moves inwards servicing requests until it arrive at the innermost cylinder then jumps to the outside cylinder of the disk without servicing any requests.
o Replicate this over and over.
o Variant service needs from inside to outside and then skip back to the innermost cylinder.
C-LOOK
o Moves inwards servicing needs until there are no more requests in that direction and then it jumps to the outermost outstanding requests.
o Variant service requirements from inside to outside after that skip back to the innermost request.
what is deadlock
Explain the Fork Function Fork function causes a new process to be created. The calling progress is duplicated as an exact copy (called the child process) that differs only in
Explain the various types of computer systems. Mainframe systems Large Number of CPU with Greatest Processing Power: Huge Memory Capacity: Increased Performance by s
Acyclic-graph directories An acyclic graph permits directories to have shared subdirectories and files. The similar file or subdirectory may be in two dissimilar directories. A
Q. Could you replicate a multilevel directory structure with a single-level directory structure in which arbitrarily long names can be used? If your answer is yes describe how you
Q. Define the difference among pre-emptive and non pre-emptive scheduling. Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution ta
Compare user threads and kernel threads. User threads:- User threads are supported above the kernel and are executed by a thread library at the user level. Thread creation
The following is a dump of a TCP header in hexadecimal format: 00CD0018 00000EF1 00000D5D 502200D1 01BF0010 We need to first split the above hex as such 00 CD 00 18 00 00
mail me
4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd