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.
Question : a) What do you understand by a Directory Structure? Support your answer with a diagram. b) Give an example how Access Lists and Groups are arranged to mode of
WHAT IS OPERATING SYSTEM ?ENLIST AND EXPLAIN BASIC SERVICES PROVIDE BY OS
whats the use of using ipc
Write a program (with the programming language and on the platform of your choice) to demonstrate the memory leak problem (see http://en.wikipedia.org/wiki/Memory_leak for detail
Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4
Q. Name two differences between logical and physical addresses? Answer: A logical address doesn't refer to an actual existing address rather it refers to an abstract address in
Q. Regard as a logical address space of eight pages of 1024 words every mapped onto a physical memory of 32 frames. a. How several bits are there in the logical address? b. H
What is the use of FIFOs in client-server applications
Dynamic scheduling : The number of thread in a program may be changed during the course of operation. Dynamic priority scheduling is a kind of scheduling algorithm in which the pr
Differentiate tightly coupled systems and loosely coupled systems? Loosely coupled systems:- Every processor has its own local memory Every processor can communicate
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