CS2254 OPERATING SYSTEM NOTES PDF

CS2254 OPERATING SYSTEM NOTES PDF

Dear students here we provide notes for Anna university 4TH sem Subject CS OPERATING SYSTEM notes pdf. you can download the OS notes as per the. Class lecture notes for second Year,fourth semester Operating Systems (Subject Code: CS) is available here in PDF formats for you to. Why is the Operating System viewed as a resource allocator & control program? 3. What is ii) Write short notes on co-operating process and schedulers. (8).

Author: Dair Zucage
Country: Papua New Guinea
Language: English (Spanish)
Genre: Health and Food
Published (Last): 12 May 2018
Pages: 34
PDF File Size: 3.56 Mb
ePub File Size: 15.25 Mb
ISBN: 627-4-85236-474-1
Downloads: 59859
Price: Free* [*Free Regsitration Required]
Uploader: Mekazahn

Department of Computer Science and Engineering. Briefly explain the types of system calls provided by a typical operating system. Discuss briefly the various issues involved in implementing Inter process communication IPC in message passing system. Write short notes about Process concept and process scheduling.

What are the requirements that a solution to the critical section problem must satisfy? What is critical section problem and explain two process solutions and multiple process solutions?

Explain what semaphores are, their usage, implementation given to avoid busy waiting and binary semaphores. Consider opperating following set of process, with the length of the CPU-burst time given in milliseconds: The processes are assumed to have arrived in the order p1, p2, p3, p4, p5, all at time 0.

What are the common strategies to select a free hole from a set of available holes? What are the various page replacement algorithms used for page replacement?

Notez many page faults would occur for the following replacement algorithms, assuming frame size is. What are the most common schemes for defining the logical structure of a directory? A hard disk having cylinders, numbered from 0 to The status of the queue is as follows. 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? Write cs254 about Stable storage and tertiary storage.

  COMPUTER ORGANISATION AND ARCHITECTURE BY CARL HAMACHER PDF

Where is the Menu?

cs2254 operating system question paper pdf

How to request Study Material? What is an operating system? What is the kernel? What are batch systems? Differentiate tightly coupled systems and loosely coupled systems. What is real time system? What do you mean by system calls? What is a process?

What is process control block?

What are the use of job queues, ready queues and device queues? What is meant by context switch? What is independent process? What is co-operative process? What are the benefits OS co-operating processes? State the advantage of multiprocessor system. What is the use of inter process communication? What are the benefits of multithreaded programming?

Compare user threads and kernel threads. What is the use of fork and exec system calls? Explain the various types of computer systems. Explain in detail about the threading issues. Explain about Multi-Threading Models. Explain in detail about Review of Computer Organization.

What is preemptive and no preemptive scheduling? What is a Dispatcher? What is dispatch latency? What are the various scheduling criteria for CPU scheduling? What is turnaround time? What is critical section problem? Define entry section and exit section.

Anna University 4th Semester CSE Notes

What is systrm semaphore? Define busy waiting and spin lock. What are conditions under which a deadlock situation may arise? What is a resource-allocation graph? Define request edge and assignment edge. What are the methods for handling deadlocks?

What are a safe state and an unsafe state? Write about the various CPU scheduling algorithms. Write about critical regions and monitors. Give a detailed description about deadlocks and its characterization.

CS Operating Systems: Notes

Explain about the methods used to prevent deadlocks 7. Consider the following snapshot of a system: Define logical address and physical address. What is logical address space and physical address space? What is the main function of the memory-management unit? What do you mean by best fit? What do you mean by first fit? What is virtual memory? What is Demand paging? What is a pure demand paging? Define effective access time. What is the basic approach of page replacement? What are the major problems to implement demand paging?

  20N60 DATASHEET PDF

What is a reference string? What are the advantages of Contiguous allocation? Explain about contiguous memory allocation. Give the basic concepts about paging. Explain the basic concepts of segmentation. Explain the various page replacement strategies.

Consider the following page-reference string: Remember that frames are initially empty. Explain in detail about swapping and thrashing. Write in detail about Virtual memory. What is a file? List the various file attributes. What are the various file operations? What is the information associated with an open file? What are the different accessing methods of a file? What are the operations that can be performed ce2254 a directory?

What are the structures used in file-system implementation? Operatung are the functions of virtual file system VFS? Define seek time and latency time.

What are the allocation methods of a disk space? What are the drawbacks of contiguous allocation of disk space? What are the advantages of Linked allocation? What are the disadvantages of linked jotes What are the advantages of Indexed allocation?

Define rotational latency and disk bandwidth. How free-space is managed using bit vector implementation? What are files and explain the access methods for files? Write in detail about file concept.