CSOPERATING SYSTEMS QUESTION BANK. SUB. Why is the Operating System viewed as a resource allocator & control program? 3. What is the. Dear students here we provide question bank for Anna university 4th sem Subject CS OPERATING SYSTEM question bank pdf. you can download the OS. CS/ CS 45 / CS / CS / Operating Systems Part B Question Bank With Answers CSE,IT 4th Sem Semester regulation
|Published (Last):||28 October 2018|
|PDF File Size:||5.65 Mb|
|ePub File Size:||5.67 Mb|
|Price:||Free* [*Free Regsitration Required]|
State the advantage of multiprocessor system.
In its code, the program oprrating to the following addresses: What are the five major categories of System Calls? Which disk scheduling algorithm would be best to optimize the performance of a RAM disk?
Operating system OS CS2254 previous year question papers
What are the advantages of Linked allocation? The two algorithms used for its implementation are: What is an Interactive Computer System? Eventually, the first job finishes waiting and gets the CPU back. An algorithm is evaluated by running it on a particular string of memory references and qudstion the number of page faults.
What is Dual- Mode Operation? Systwm are the major problems to implement Demand Paging? Write some classical problems of Synchronization? Two processes that wish to communicate each open the FIFO: Dynamic linking is similar to dynamic loading, rather that loading being postponed until execution time, linking is postponed.
For long processes, this rate may be one process per hour; for short transactions, throughput might be 10 processes per second. What is critical section problem? Write about the various System Calls.
CSOperating Systems Question Bank Collection
Explain linked allocation in detail. Typically it involves a robotic mechanism which will mount insert and dismount removable is often copied to secondary storage before use.
How is memory protected in a ssytem environment? It can be also used to solve operaring synchronization problems. Log In Sign Up. The status of the queue is as follows 86, ,,, What is the total distance in cylinders that the disk arm moves to satisfy the entire pending request for each of the following disk-scheduling algorithms? The main program is loaded into memory and executed.
This bootstrap program tends to be simple. Allocate the first hole that is big enough.
Operatingg are the two levels in Threads? If no frame is free is available, find one that is not currently being used and free it. To obtain better memory-space utilization dynamic loading is used. Differentiate tightly coupled systems and loosely coupled systems. Define seek time and latency time.
The entire list has to be searched, unless it is sorted by size. Write the indexed allocation with its performance.
In operatiing multiprogramming system, the operating system simply switches to and executes another job. What are the advantages of Contiguous Allocation? List the various File Attributes. Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. What are the most common schemes for defining the Logical Structure of a Directory? What is Look Scheduling? This record can be found using hashing or index techniques t p h t 9. What are the two types of Real Time Systems?
A segmentation example is shown in the following diagram.
Page -1 – CS – OPERATING SYSTEMS QUESTION BANK UNIT – I TWO MARKS | karthik M –
What are the most common schemes for defining the logical structure of a directory? It is the unit of work in a modern operating system.
Calculate the effective access time. Searching can be stopped as soon as a free hole that is big enough is found. One thread immediately terminates the target thread is called asynchronous cancellation.
What are the functions of virtual file system VFS? The remaining code is the remainder section.