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!
Question 1:
(a) Discuss about the evolution of operating systems from mainframe batch systems to mainframe time sharing systems.
(b) Explain your understanding of the "suspend" state of a process, supplying justifications for its existence.
(c) Discuss about 5 possible elements involved with "process control" information.
(d) Draw a 5 state queuing diagram which caters for multiple blocked queues.
Question 2:
(a) Explain the concept of mutual exclusion.
(b) Discuss requirements needed to provide support for mutual exclusion.
(c) Discuss, stating advantages and disadvantages, of User Level threads and Kernel level threads.
Question 3:
(a) Discuss about issues involved with dynamic partitioning of memory management.
(b) Discuss the implications involved with the readers/writers problem.
Define lazy swapper. Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper never swaps a page into memory unless that page will be ne
Q. Likewise some systems support many types of structures for a file's data while others simply support a stream of bytes. What are the merits in addition to demerits? Answer:
Q. What is the use of system calls? Answer: System calls permit user-level processes to request services of the operating system.
what is application software?
Placement algorithms :calculate where in available real-memory to execute a program. Common functions are next-fit, first-fit, and best-fit. Replacement algorithms :are
What is the basic approach of page replacement? If no frame is free is available, find one that is not presently being used and free it. A frame can be freed by writing its con
Define what a macro definition consists of
Entry-sequenced file organization The records in an entry-sequenced file are store up in the order they are written into the file. New records are for all time appended to
Deadlocks can be detected while the program is running, by running cycle detection algorithms on the graph that de?nes the current use of resources. De?ne this graph as follows:
Question 1 Explain the following with respect to Resource Management in Distributed Systems- Task assignment Approach Load - Balancing Approach Load - Sharing Approach
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