Scribd
Upload
235 views3 pages

Operating System Assignment For SYBCA: The Following Assignment Have To Be Submitted On 23 Jan 2012. OS Questions

The document provides a list of 33 questions related to operating systems concepts for a class assignment. The questions cover topics such as the definition of an operating system, batch systems, real-time systems, network operating systems, distributed operating systems, deadlocks, process control blocks, producer-consumer problem, job scheduling, process scheduling algorithms, test-and-set instructions, critical regions, busy waiting, middle level schedulers, memory allocation schemes, conditions for deadlock, Banker's Algorithm, starvation, external fragmentation, compaction, UNIX operating system structure, features of UNIX, differences between network and distributed operating systems, deadlock modelling, deadlock handling strategies, essential OS managers, types of operating systems, memory allocation schemes, process

Uploaded by

Priti Khemani Talreja
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
235 views3 pages

Operating System Assignment For SYBCA: The Following Assignment Have To Be Submitted On 23 Jan 2012. OS Questions

The document provides a list of 33 questions related to operating systems concepts for a class assignment. The questions cover topics such as the definition of an operating system, batch systems, real-time systems, network operating systems, distributed operating systems, deadlocks, process control blocks, producer-consumer problem, job scheduling, process scheduling algorithms, test-and-set instructions, critical regions, busy waiting, middle level schedulers, memory allocation schemes, conditions for deadlock, Banker's Algorithm, starvation, external fragmentation, compaction, UNIX operating system structure, features of UNIX, differences between network and distributed operating systems, deadlock modelling, deadlock handling strategies, essential OS managers, types of operating systems, memory allocation schemes, process

Uploaded by

Priti Khemani Talreja
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Operating System Assignment For SYBCA

The following assignment have to be submitted on 23rd Jan 2012. OS Questions


1. 2. 3. 4. 5. 6. 7. What is an Operating System? Write in brief about Batch System. What are Real Time Systems? State the difference between Network OS and Distributed OS. Define Deadlock. What is Process Control Block? Write in brief about the information it contains. Write in brief about Producer-Consumer Problem. How does semaphore solve this problem. 8. Write in brief about the Job Scheduler & the Process Scheduler. 9. State the difference between preemptive and non-preemptive process scheduling algorithm. Write in brief about priority process scheduling algorithm. 10. State the advantages & disadvantages of FCFC process scheduling algorithm. 11. What is Test-and-Set instruction? 12. What is a critical region? 13. What is the meaning of busy waiting? 14. Write in brief about middle level scheduler. 15. Write in brief about single user contiguous memory allocation scheme, also write an algorithm to load job in single user system. 16. List & explain the four necessary conditions for deadlock. 17. Write in brief about the Bankers Algorithm used to avoid deadlock. 18. Define Starvation. 19. Explain the term External Fragmentation. 20. What is compaction? 21. Draw the structure of UNIX OS and explain the purpose of shell. 22. What are the features of UNIX? 23. Differentiate NOS & DOS. 24. Write a short note on Deadlock Modelling. 25. List the strategies for handling deadlock . Explain any two. 26. What is an OS? Give examples of it. List 4 essential managers of OS. 27. Write a short note on types of OS.

Contd.

28. Differentiate the following (a) Best fit & First Fit memory allocation. (b) Fixed partitioning & dynamic partitioning . 29. What is process synchronization ? How it can be achieved with (a) Test and set (b) Wait & Signal 30. Define the terms : Process and Thread. 31. State the difference between SJN and SRT process scheduling algorithm. 32. Write in brief about Fixed partition allocation scheme. 33. Explain the term : Critical Section. 34. What are process priorities? How it works with processes.

Faculty : Mrs. Priti Talreja

You might also like