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!
Write short note on compression regarding the file system in Windows 2000.
NTFS is able to perform data compression on individual files or on all data files in a directory. To reduce a file NTFS divides the file's data into compression units which are blocks of 16 contiguous clusters. When every compression unit is written a data compression algorithm is applied. If the result fits into less than 16 clusters the compressed version is stored. When reading NTFS is able to determine whether data have been compressed and if they have been the length of the stored compression unit will be less than 16 clusters. To get better performance when reading contiguous compression units NTFS decompresses and prefetches ahead of the application request.
Q. Presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm. Can you do thus by simply usin
What is process control block? Every process is represented in the OS by a process control block. It has many pieces of information associated with an exact process.
LRU approximation page replacement In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for
What is starvation? A main problem related to deadlock is starvation. Starvation is the circumstances where process waits indefinitely within the semaphore. Indefinite blocking
What lead to the concept of paging? The main memory is separated into two parts that are one for the resident operating system, and one for the user processes. We may perhaps p
What is the information associated with an open file? Various pieces of information are associated with an open file which may be: File pointer Disk location of th
Q. Explain about Deadlocks? Deadlocks for (int i = 0; i // first find a thread that can finish for (int j = 0; j if (!finish[j]) { boolean temp = true; for
MDEFINE CRITICAL SECTION
What is Demand paging? Virtual memory is commonly executed by demand paging. In demand paging, the pager brings only those essential pages into memory instead of swapping in a
What are the different ways in which a thread can be cancelled? Cancellation of a target thread may happen in two different scenarios: Asynchronous cancellation: One thr
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