Operating System Important Questions

UNIT-I

1.What are the various components of operating system structure and explain with a
neatsketch.(8M)

2.Differentiate between Multi Programming, Multi Tasking and Multi processing

systems.(7M)
3. Discuss the Functionalities of Operating Systems in detail. (8M)
4.What is a System call? Discuss major System calls of Operating Systems.(7M)
5. Mention the objectives and functions of Real-Time Embedded systems(7M).

6.Distinguish between client-server and peer-to-peer models of distributed systems. (8M)

7.What are the various components of operating system structure and explain with a
neat sketch.(10M)

8.List out the types of operating system and explain batch OS and time sharing OS in brief.
(15M)

9. Explain about the system calls fork, exit, wait, waitpid and exec.(15M)

10.In a multi programming and time-sharing environment ,several users share the system
simultaneously.This situation can result in various security problems.What are two such
problems.(5M)

11.Can we ensure the same degree of security in time shared machine as in a dedicated
machine?Explain your answer.(5M)

12.Under what circumstances would a user be better off using a time sharing system rather
than a PC or single –user work station.(5M)

Objective Question bank

1.What is an operating system?

a) interface between the hardware and application programs
b) collection of programs that manages hardware resources
c) system service provider to the application programs
d) all of the mentioned

2.To access the services of the operating system, the interface is provided by the
___________
a) Library
b) System calls
c) Assembly instructions
d) API
3.What is an interrupt Vector.
a) It is a unique identity given to an interrupt
b) It is a unique device number that is indexed by an address
c) It is an address that is indexed to an interrupt handler
d) None of thementioned
4. Which one of the following is not an operating system?
a) UNIX
b) Windows
c) XENIX
d) APPLE
5. What is the Process by which the operating system is loaded into the memory?
a) Booting
b) Processing
c) Loading
d) None of the above
6. The core of UNIX operating system is called
a) Kernel
b) Karnel
c) Kannal
d) None of the above
7. _________________ Operating System does not implement multitasking.
A. Windows XP
B. Windows NT
C. Windows 98
D. MS DOS
E. None
8. By the operating system which one error will be handled from the following?
A. connection failure in the network
B. power failure
C. all of the mentioned
D. lack of paper in the printer
E. Both A & B
F. None of these
9. In the most operating system if a process fails it write the error information to a?
A. new file
B. another running process
C. log file
B. none of the mentioned
E. Both C & A
10. Which one is not a real-time operating system from the following?
A. Palm OS
B. Windows CE
C. VxWorks
D. RTLinux
E. Both A & C
F. None of these
11. The systems that allow only one process execution at a time is_______
A. unitasking systems
B. uniprogramming systems
C. uniprocessing systems
D. Both A & C
E. none of the mentioned
12. The resource management can be done by operating system via_______
A. both time and space division multiplexing
B. space division multiplexing
C. time-division multiplexing
D. none of the mentioned
E. Both A & B
13. that are executed in sequence without any input from the user.
(A) Batch file
(B) Path
(C) Pipe
(D) All of these
14. DIR command is used to
(A) Display a list of files in a directory
(B) Display type of files in a sub directory
(C) Display contents of files in directory
(D) All of the above

Fill In The Blanks

1. Main memory is a volatile device which means it loses its contents in the case of
system failure or as soon as system power goes down
2. Path is the sequence of directories and subdirectories the operating system must
follow to find a specific file.
3. A Multicore computer combines two or more processors on a single piece of silicon.
4. The concept of multiple programs taking turns in execution is known as
Multiprogramming
5. An Operating System is a program that controls the execution of application
programs and acts as an interface between applications and the computer hardware.
6. Multithreading is a technique in which a process, executing an application, is
divided into threads that can run concurrently.
7. Multiprogramming was designed to keep the processor and I/O devices, including
storage devices, simultaneously busy to achieve maximum efficiency.
8. Virtual memory is a facility that allows programs to address memory from a logical
point of view, without regard to the amount of main memory physically available.
9. A significant point about theProcess Control Block is that it contains sufficient
information so that it is possible to interrupt a running process and later resume
execution as if the interruption had not occurred.

UNIT-II

1. List and explain the Scheduling Algorithms.(15M)

2. Explain the terms fork, exit, wait, waitpid, exec.

3. Consider 3 processes P1, P2 and P3, which require 5, 7 and 4 time units and arrive at
times 0, 1 and 3. Draw the Gant chart, process completion sequence and average waiting
time for.

i) Round-robin scheduling with CPU quantum of 2 time units.

ii) FCFS
4.

Consider the following set of processes, with the length of the CPU burst given in
milliseconds:
Process Burst Time Priority
P1 27 5
P2 12 1
P3 37 2
P4 19 4
P5 10 3
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw
the Gantt charts that illustrate the execution of these processes using the following
scheduling algorithms: FCFS, SJF and Priority. Also determine the average waiting time and
average turnaround time for each of the algorithms.(15M)

5.Consider the following five processes with the length of the CPU burst time in
milliseconds.
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

Processes are assumed to have arrived at time 0.

For the above set of processes find the average waiting time and average turn around time for
each of the following scheduling algorithm using Gantt chart. Consider 1 is highest priority:
a)SJF (7M) b) Non Preemptive Priority (8M)

6. Consider 3 processes P1, P2 and P3, which require 5, 7 and 4 time units and arrive at
times 0, 1 and 3. Draw the Gant chart, process completion sequence and average waiting
time for.

i) Round-robin scheduling with CPU quantum of 2 time units.(7M)

ii) FCFS (8M)
7. Explain and give the differences in how much the following scheduling algorithms
discriminate in favor of short processes.

a) Multilevel feedback queues

b) FCFS c) RR
 8. Describe the differences among short-term,medium-term,,and long term scheduling.
(5M)
9. Can a multi threaded solution using multiple user-level threads achieve better
performance on a multiprocessor system than on a single processor system.(5 M)
10.Describe the actions taken by a thread library to context switch between user level
threads.(5 M)
11.Why is it important for the scheduler to distinguish I/O-bound programs from CPU-
bound programs? (5 M)

Objective Question bank

1. Identify the circumstances under which pre-emptive CPU scheduling is used:

A.A process switches from Running State to Ready State
B.A process switches from waiting state to Ready State
C.A process completes its execution
D.A process switches from ready to waiting state.
Chose the correct option
1.(A) & (B) 2.(A) & (D) 3.(C) & (D) 4.(A),(B) & (C)

2. In operating system, each process has its own __________

a) open files
b) pending alarms, signals, and signal handlers
c) address space and global variables
d) all of the mentioned

3. Which of the Following are NOT shared by the threads of the same
process.______________
(a) Stack (b) Registers (c) Address Space (d) Message Queue
1.(a) & (b) 2.(b) & (c) 3.(a) & (b) 4.(a),(b) & (c)
4. A process residing in main memory and ready and waiting for execution,is kept on
a) Execution Queue b) Wait Queue
c) Job Queue d) Ready Queue

5. When a process is in a “Blocked” state waiting for some I/O service. When the service is
completed, it goes to the _________
a) Terminated state
b) Suspended state
c) Running state

d) Ready state
6. The Solution to critical section problem must ensure following conditions
____________
a) Only Mutual Exclusion and progress
b) Only Mutual Exclusion and Bounded Waiting
c Mutual Exclusion ,Progress and Bounded Waiting

d) Only Progress and Bounded Waiting

7. Which of the following condition is required for a deadlock to be possible?

a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned

8. A system is in the safe state if ____________

a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned

9. In a timeshare operating system, when the time slot assigned to a process is completed, the
process switches from the current state to?
a) Suspended state
b) Terminated state
c) Ready state
d) Blocked state

10. The portion of the process scheduler in an operating system that dispatches processes is
concerned with ____________
a) assigning ready processes to waiting queue
b) assigning running processes to blocked queue
c) assigning ready processes to CPU
d) all of the mentioned

11. The interval from the time of submission of a process to the time of completion is termed
as ____________
a) waiting time
b) turnaround time
c) response time
d) throughput

12. Which scheduling algorithm allocates the CPU first to the process that requests the CPU
first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned

13. In multilevel feedback scheduling algorithm ____________

a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned

14.In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
compared with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process

15.Which system call can be used by parent process to determine the termination of child
process.

a) wait

b) get

c) fork

d) exit

16.The context of a process in the PCB of a process does not contain________

a) Process State

b) Memory management information

c) The value of the CPU registers

d) Context switch time

17.What is a Process Control Block

a) Data Structure

b) A Block in Memory

c) Process type Variable

d) A secondary storage section.

18. Scheduling is done so as to

a) None of the mentioned

b) increase CPU utilisation

c) Decrease CPU utilisation

d) keep the CPU More idle

Fill in the blanks:

1. PCB stands for Process Control Block

2. Processes generate clones of themselves using the fork() system call

3. Whenever a process needs I/O to or from a disk it issues a System Call

4. Round robin scheduling falls under the category of Time Sharing Systems

5. The strategy of making processes that are logically runnable to be temporarily suspended is
called Premptive Scheduling

6. Scheduling is done so as to ____________(increase the throughput)

7. FCFS scheduling algorithm allocates the CPU first to the process that requests the CPU
first?

8.The objective of multiprogramming is------------------------(maximum CPU utilizations)

9. The ready queue is generally stored in---------------------(Linked list)

10. The list of processes waiting for a particular I/O device is called a -------------(device
queue)

11. When the process issues an I/O request __________(It is placed in an I/O queue)

12. The primary distinction between the short term scheduler and the long term scheduler is
__________(The frequency of their execution)

13. In a multiprogramming environment __________(more than one process resides in the

memory)

14. Suppose that a process is in “Blocked” state waiting for some I/O service. When the
service is completed, it goes to the __________(Ready state)

15. The context of a process in the PCB of a process does not contain __________(context
switch time)

16. In priority scheduling algorithm ____________(CPU is allocated to the process with

highest priority)

17. ------------------algorithm is defined in Time quantum( round robin scheduling algorithm)

18. Process are classified into different groups in ____________(multilevel queue
scheduling algorithm)

19. CPU scheduling is the basis of ___________(multiprogramming operating systems)

20. ------------- two steps of a process execution(CPU & I/O Burst)

21. A process is selected from the ______ queue by the ________ scheduler, to be executed.
( ready, short term)

22.-------------------------------- is turnaround time(the total time from the completion till the
submission of a process)