Download 1) What is an operating system?

Operating System
Paper 2(a) 2013
Answer any five questions
1) Define the following terms:
a) System Calls
b) Batch System
c) Time-sharing System
d) Direct Memory Access
e) Paging.
2) Consider the following set of processes, with the length of the CPU burst time 10 given in milliseconds
and lower numbers mean higher priority:
Process arrival time(ms) Next CPU Burst(ms) Priority
P1 0 10 5
P2 1 6 4
P3 3 2 2
P4 5 4 0
Draw Gantt chart for FCFS, SJF and Priority Scheduling(pre-emption and non-emption).
Also calculate Turn around Time, Waiting Time and Average Waiting Time for each process
of the above scheduling algorithms.
3) Differentiate between any two of the following:
a) Buffering and Spooling
b) Preemptive and Non-preemptive
c) Multitasking and Multiprocessing
d) Logical and Physical Address
e) Internal and External Fragmentation.
4) Write Short notes on any one of the following:
a) Sapping
b) Process Control Block
c) Demand Paging
d) Process State
e) Page Fault
f) Thrashing
g) Space Management.
5) a) Write different system Components.
b) What is CPU-IO burst cycle? Explain.
6) What is Scheduler? Describe the different types of scheduler with diagram.
7) What do you understand by free space management? Explain the different methods to implements it.
8) Explain the four major function of an operating system.
Paper 2(a) 2012
Answer any five questions
1)a) What is an operating system? How operating system work as a Manager?
b) How batch processing systems differ with sharing systems? Explain with suitable example.
2)a) Explain the need of process-scheduling. How process control block is useful in process scheduling?
b) Write different system components.
3)a) How threading is important in multi-tasking operating system? Explain with proper examples.
b) What is CPU-I/O burst cycle? Explain.
4)a) Explain any two non-pre-emptive scheduling algorithm.
b) Write major difference between pre-emptive and non-pre-emptive scheduling algorithm.
5)a) Explain the concept of "paging" in memory management.
b) How Paging and Segmentation differs?
6)a) How Virtual Memory plays a vital role in memory management?
b) Explain "FIFO" page replacement algorithm.
7)a) Why indexing is important for all operating systems? Explain "FAT" with suitable examples.
b) Explain the disadvantage of Internal Fragmentation.
8) Write Short notes on the following:
a) DMA
b) Disk scheduling algorithm
c) space Management.
Paper 2(a) 2011
Answer any five questions
1) What is an operating system? Explain the concepts of parallel systems and distributed systems.
2) Explain any two of the following:
a)I/O structure
b) System calls
c) System concepts.
3) What do you mean by a "process"? Define different states of a process? Explain process control block.
4) Describe the following:
a) Need of CPU scheduling algorithm
b) Advantage of pre-emptive algorithm.
5) What is paging? Explain need of page replacement. Describe LRU page replacement Algorithm.
6) Explain memory management duties of an operating system. How segmentation is important for
memory management?
7) How operating system manages its "free space"? How FCFS disk scheduling work?
8) Describe the following:
a) Polling
b) Bad block
c) Threats
d) Encryption.
Paper 2(a) 2010
Answer any five questions
1) What is an operating system? Explain batch operating system, time sharing operaing system and real
time operating system in deail.
2) Define any two of the following:
a) System call
b) Storage system hierarchy
c) Boot block.
3) What do mean by non-pre-emptive and pre-emptive scheduling? Define SJF and RR with detailed
example.
4) Describe the following:
a) Thrashing
b) Buffering and its need.
5) What is contiguous memory allocation? Explain paging and its hardware requirement.
6) Explain the following file allocation technique. Also explain its advantage and disadvantage.
a) Contiguous file allocation
b) Linked file allocation.
7) What do you mean by disk scheduling? Describe any two.
8) Describe the following:
a) Free Space Management
b) Process
c) Polling.
Paper 2(a) 2009
Answer any five questions
1) a) Distinguish among multiprogramming, multiprocessing, multitasking and multithreading.
b) Explain spooling.
2) a) Explain system calls.
b) Explain inerrupts and interrupt vectors.
3) a) Explain the process control block.
b) Draw and explain the process state diagram.
4) a) Define throughput, turnaround time, waiting time and response time.
b) Explain round robin scheduling algorithm.
5) a) Explain swapping.
b) Distinguish between physical address and logical address.
c) Consider the following page trace(no. of frames=3):
4,3,2,1,4,3,5,4,3,2,1,5
Calculate page fault using FIFO and LRU page replacement algorithm.
6) a) Differentiate between External and Internal segmentation.
b) Explain demand paging.
c) Consider the following data:
Segment Limit Base
0 1000 1400
1 400 6300
2 400 4300
3 1100 3200
4 1000 4700
What are the physical addresses for the following logical addresses?
i) 2, 53
ii) 3, 852
7) a) Explain indexed file allocation.
b) Given memory partitions of 100K, 500K, 200K, 300K and 600K (in order),how would
first-fit algorithm and worst-fit algorithm place processes of 212K, 417K, 112K and 426K(order)?
8) Write short notes on any three:
a) DMA
b) Disk Scheduling (SCAN)
c) Encryption
d) Shell Programing
e) i-nodes (LINUX)
f) File Structure.
Paper 2(a) 2008
Answer any five questions 1) DEfine operating system and briefly discuss its role. Differentiate
between
time-sharing and
multi-programming operating systems. Give a name of batch processing o/s and justify the answer.
2) Define job. Explain the basic idea behind 'Shortest Job First (SJF)' scheduling algorithm.
Explain how job scheduling is done in multi programming operating system.
3) Write short notes on the following:
a) Paging
b) System calls.
4) Discuss the criteria which are suggested for comparing CPU scheduling. Consider the following set
of processes that arrive at time 'O', with the length of the CPU-burst time given in milli-seconds:
Process Burst-time
P1 24
P2 3
P3 3
Compare the average turn-around time for FcFs and SJF scheduling algorithms.
5) Describe the role of Disk Scheduler. Discuss briefly several strategies followed in seek optimization.
6) Write short notes on the following:
a) Virtual Memory and its need
b) Working style of memory map table.
7) Write short notes on the following:
a) LRU approach in page replacement
b) Internal and external fragmentation
8) Write short notes on the following:
a) Benefits of thread as compared to process
b) Difference between parallel and distributed system.