Name of the College : Valliammai Engineering College
Subject : Operating System
Website : valliammai.co.in
Document Type : Sample Question Paper
QUESTION BANK : https://www.pdfquestion.in/uploads/valliammai.co.in/342-CS2411-Operating%20System.pdf
Valliammai Operating System Question Paper
Department Of Information Technology
Cs2411 Question Bank
UNIT-I
PROCESSES AND THREADS
PART-A
1. What is an Operating system? What are the various OS Components?
2. What is spooling?
3. What is the Kernel?
Related :Valliammai Engineering College CS2401 Computer Graphics B.E Question Bank : www.pdfquestion.in/2860.html
4. What are Batch systems?
5. What is the advantage of Multiprogramming?
6. What do you mean by Time-sharing systems?
7. Define RTOS.
8. Differentiate User thread and Kernel thread.
9. What are multiprocessor systems & give their advantages?
10. What are the different types of multiprocessing?
11. What is a process state and mention the various states of a process?
12. What is process control block?
13. What are the use of job queues, ready queues & device queues?
14. What is meant by context switch?
15. Define swapping?
16. Diff.b/w process and Thread.
17. Diff. b/w Long Term Short Term Medium Scheduler.
18. What are the benefits of multithreaded programming?
19. What is the use of fork and exec system calls?
20. What are co-operating process? Give example.
PART-B
1. Explain the various types of computer systems.
2. Give an overview about threads. Explain in detail about the threading issues.
3. Explain in detail about various operating system services
4. Explain process control block
5. What is the need for system calls? Briefly explain the types of system calls provided by an operating system.
6. Explain the functions of various system components of OS
7. What are the advantages of threads? Describe the multithreading Models?
8. Explain in detail about inter process communication
9. What is meant by a process? Explain states of process with neat sketch and discuss the process state transition with a neat diagram. 10. Explain Client-Server communication with an example.
UNIT II
PROCESS SCHEDULING AND SYNCHRONIZATION
PART – A
1. Define CPU scheduling.
2. What is a Dispatcher? What is dispatch latency?
3. Which are the criteria used for CPU scheduling?
4. Write the 3 ways to deal the deadlock problem?
5. What is a resource-allocation graph?
6. Distinguish between Preemptive and Non-preemptive scheduling.
7. Define throughput?
8. What is turnaround time?
9. Define race condition.
10. Define entry section and exit section.
11. What is a semaphore?
12. Define busy waiting and spin lock.
13. Define deadlock.
14. What is the sequence in which resources may be utilized?
15. What are conditions under which a deadlock situation may arise?
16. Define request edge and assignment edge.
17. Define deadlock prevention.
18. Define deadlock avoidance.
19. What are a safe state and an unsafe state?
20. Define the term critical section.
PART B
1. Write about the various CPU scheduling algorithms.
2. Explain in detail about banker’s algorithm with example.
3. How can deadlock be detected and recover? Explain
4. Explain about the methods used to prevent deadlocks
5. Explain the classic problems of synchronization.
6. Explain deadlock and its characterization? What are the necessary conditions for a deadlock.
7. What is Synchronization? Explain how semaphore can be used to deal with n-process CSP.
8. Explain:
i) Multilevel Q scheduling
ii) Multilevel feedback scheduling
iii) Algorithm Evaluation.
iv) Real time scheduling.
9. What is critical section problem and explain two process solutions and multiple process solutions?
10.Consider the following set of processes, with the length of the CPU-burst time in given ms Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order P1, P2, P3, P4,P5 all at time 0.
a. Draw four Gants charts illustrating the execution of these process using FCFS,SJF,a non preemptive priority(a smaller priority number implies a higher priority) ,and RR(quantum=1)scheduling.
b. What is the turn around time of each process for each of the scheduling algorithms in part a?
c. What is the waiting time of each process for each of the scheduling algorithms in part a?
d. Which of the schedules in part a result in the minimal average waiting time (over all process)?