Unit-1
2 marks Questions
1.
Define operating system.
2.
List any four types of system calls.
3.
Define user view of OS.
4.
Define time-sharing systems.
5.
Define interrupt.
6.
Describe User Interface.
3 marks
Questions
1.
List any four functions of operating system.
2.
List the memory hierarchy available in operating
system.
3.
Describe Client-Server
Computing.
4.
Differentiate between
Application and System Program.
5.
Describe different Multiprocessor
System.
6.
Describe Design Goals of
Operating System.
10
Marks questions
1.
(a) Explain the memory hierarchy available in a computer
system.
(b) Discuss
services of an operating System with neat diagram.
2.
(a) Differentiate
between user mode and kernel mode operations of the operating system with
diagram.
(b) Discuss system call. Explain different types of system
calls with examples?
3.
Describe different types of
Computer System Architecture.
4.
Compare different types of
Operating System Structure.
5.
(a)Classify System Program.
(b) Identify
system calls to copy File content from source to destination.
6.
(a) Compare different User
Interfaces.
(b) Differentiate between the client-server and peer-to-peer computing?
Unit-2
2 marks Questions
1.
Define process.
2.
Define Thread.
3.
What is a ready Queue.
4.
Define fork() function.
5.
Define exec() function.
6.
Define Inter Process
Communication.
3 marks Questions
1.
List out component of Process
in memory.
2.
List various states of Process.
3.
Describe Device queue.
4.
List requirement to satisfy
critical section problem’s solution.
5.
Differentiate between Binary
and Counting Semaphore.
6.
Draw general structure of
Critical Section.
10 marks Questions
- (a) Discuss Life Cycle of Process with state transition diagram.
(b) Describe
operations on Processes.
- (a) Compare different types Process Schedulers?
(b) Consider
the following set of processes.
Process
|
Arrival
Time
|
Burst
Time
|
P1
|
0
|
6
|
P2
|
1
|
1
|
P3
|
3
|
2
|
P4
|
4
|
3
|
P5
|
5
|
5
|
Calculate Average waiting
time and Average Turn Around Time using FCFS,
SRTF Scheduling.
3.
Describe Shared Memory System
and Shared Memory System with example.
4.
(a) Discuss Peterson’s
solution.
(b)Explain solution of Dining-Philosophers
Problem using Semaphore.
5.
(a) Discuss Monitors with diagram.
(b) Explain solution of Dining-Philosophers
Problem using Monitor.
6. (a) Describe Context Switching
in Process Scheduling.
(b) Explain Process Control
Block using Diagram.
Unit-3
2 marks Questions
1. Define Cache Memory.
2. Define Registers.
3. What is Logical address space.
3 marks Questions
1. Draw hardware protection diagram
using base and Limit register.
2. Summarize Dynamic loading.
3. Differentiate between Compile Time and Load
Time Address Binding.
10 marks Questions
1. (a) Discuss Logical vs
Physical address space.
(b) Explain
dynamic linking and Shared Library.
2. (a) Compare different memory allocation Strategies.
(b) Explain different types of
Fragmentation.
No comments:
Post a Comment