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

Author: Nilkis Arashigar
Country: Luxembourg
Language: English (Spanish)
Genre: Environment
Published (Last): 15 June 2017
Pages: 166
PDF File Size: 19.38 Mb
ePub File Size: 3.34 Mb
ISBN: 306-7-46322-121-5
Downloads: 30463
Price: Free* [*Free Regsitration Required]
Uploader: Tudal

What are the major problems to implement demand paging?

CPU scheduling p algorithm affects only the amount of time that a process spends waiting in the ready queue. The remaining code is the remainder section. What does swap-space management mean? What is a process?


Anna University – Mathematics 1 – January Que What are the necessary conditions for a deadlock to occur? This process is called swapping. Explain in detail about the threading bqnk.

What is a file?

A thread that is to be cancelled is often referred to as the target thread. An hank method for avoiding deadlocks is to require additional information about how resources are to be requested. Descriptors represent h t underlying objects supported by the kernel, and are created by system calls specific to the type of object. Therefore they are fairly sophisticated. What are the functions of virtual file system VFS?


CSOperating Systems Question Bank Collection

Allocate the smallest hole that is big enough; must search entire list, unless ordered by size. What is co-operative process? Write notes about disk management and swap-space management. What are the different accessing methods of a file? What are the operatting Disk-Scheduling Algorithms?

When starting execution of a process with no pages in memory, the operating system sets the instruction pointer to the first instruction of the process, which is on a non-memory resident page, the process immediately faults for the page.

For a computer to start running when powered up or rebooted it needs to have an initial program to run. This bootstrap program tends to be simple.

Turnaround time is the interval from the time of submission to the time of completion of a process. What is a semaphore? What is a Resource-Allocation Graph?

Operating system OS CS2254 previous year question papers

What is Demand Paging? In demand paging, the pager brings only those necessary pages into memory instead of swapping in a whole process. What is Dispatch Latency? A state is safe if the system can allocate resources to each process in some order and still avoid a deadlock.


Searching can either start at the beginning of the set of holes or where the previous first-fit search ended. Consider the following snapshot of a system: What is meant by Locality of Reference? This situation is called a deadlock. Critical region is a control structure for implementing mutual exclusion over a shared variable. Total CPU time used by a process to date. Define logical address and physical address. Begins at the root and follows a path down to the specified file, giving the directory names on the path.

The requirements can be divided into two basic groups: Thank you for your comment. Define Effective Access Time.

What are the various file operations? What is the principal advantage of the multiprogramming?