0% found this document useful (0 votes)
27 views36 pages

S604 - Midterm Solved Mcqs With References by Moaaz

Hi ?

Uploaded by

saithsahib000
Copyright
© © All Rights Reserved
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
0% found this document useful (0 votes)
27 views36 pages

S604 - Midterm Solved Mcqs With References by Moaaz

Hi ?

Uploaded by

saithsahib000
Copyright
© © All Rights Reserved
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/ 36

CS604 - Operating System

Solved MCQS From May 13,2013


Midterm Papers

MC100401285 [email protected] [email protected] PSMD01

MIDTERM EXAMINATION Spring


2012
CS604 - Operating System
Question No: 1 ( Marks: 1 ) - Please choose one
command to resume the execution of a suspended job in the foreground

► fg
► bg
► jobs
► kill

Question No: 2 ( Marks: 1 ) - Please choose one


commands in Linux is used to copy file
►is
►cp
►mv
►mkdir

Question No: 3 ( Marks: 1 ) - Please choose one


The process id returned to the child process after successful fork system call execution is _.
►0
►1
►2
►3

Question No: 4 ( Marks: 1 ) - Please choose one


In addressing, the recipient is not required to name the sender.

► Symmetric
► Asymmetric
► Both symmetric and asymmetric
► None of the given options

1
Question No: 5 ( Marks: 1 ) - Please choose one
A solution to the critical section problem must satisfy the following requirements
►Progress
►Mutual exclusion
►Bounded Waiting
►All of these

Question No: 6 ( Marks: 1 ) - Please choose one


Typically the execlp system call is used after a fork system call.
►True
►False

Question No: 7 ( Marks: 1 ) - Please choose one


You can create a threads by using the pthread_create() call.
►True
►False

Question No: 8 ( Marks: 1 ) - Please choose one


The interval from the time of submission to the time of completion is the

►Turnaround time
►Waiting time
►Response time
►None of all these

Question No: 9 ( Marks: 1 ) - Please choose one


Each process must first request permission to enter its critical section. The section of code implementing this
request is called the

►entry section
►Critical Section
►remainder section
►None of all these

Question No: 10 ( Marks: 1 ) - Please choose one


IPC provides a mechanism to allow processes to communicate and to synchronize their actions without sharing
the same

►Address space
►Address Name
►Address ID
►None of all these

2
MIDTERM EXAMINATION Spring
2011
CS604 - Operating System

Question No: 1 (Marks: 1) - Please choose one


Linux is a version of operating system.

► OS/2
► Windows
► Unix
► None of the above
Question No: 2 (Marks: 1) - Please choose one
Current working directory can be accessed using --------- Command.

►. (dot)
► # ( hash )
► / (slash)
► ~ (tilt)
Question No: 3 (Marks: 1) - Please choose one
Mkfifo() is a .

► Library Call
► Command
► Directory
► None of Above

Question No: 4 (Marks: 1) - Please choose one


command gives a snapshot of the current processes.
► ps
► top
► who
► ls
Question No: 5 (Marks: 1) - Please choose one
Time interval when the I/O Devices are accessed is known as --------.
► CPU Burst
► IO Burst
► Time Slice
► None of Above

3
Question No: 6 (Marks: 1) - Please choose one
The process of switching from one process to another is called ---------------.

► Context switching
► scheduling
► quantum period
► latency
Question No: 7 (Marks: 1) - Please choose one
directory includes essential system boot files including the kernel image.
► /bin
► /boot
► /dev
► /etc
Question No: 8 (Marks: 1) - Please choose one
scheduling algorithm is sometimes called shortest remaining time first scheduling algorithm.

► Non-preemptive SJF
► Priority Scheduling
► Preemptive Shortest Job First
► FCFS
Question No: 9 (Marks: 1) - Please choose one
A semaphore that cause Busy-Waiting is termed as .
► Spinlock
► Monitor
► Critical region
► Critical section
Question No: 10 (Marks: 1) - Please choose one
Progress and Bounded Waiting are some of the characteristics to solve the critical section problems.

► True
► False
Question No: 11 (Marks: 1) - Please choose one
In ---------addressing; the recipient is not required to name the sender.
► Symmetric
► Asymmetric
► Both symmetric and asymmetric
► None of the given options

4
Question No: 12 (Marks: 1) - Please choose one
The execution of critical sections must NOT be mutually exclusive

► True
► False
Question No: 13 (Marks: 1) - Please choose one
A program in execution is called a .

► Command
► Process
► Software
► Compiler
Question No: 14 (Marks: 1) - Please choose one
The critical section problem can be solved by the following except
► Software based solution
► Firmware based solution
► Operating system based solution
► Hardware based solution
Question No: 15 (Marks: 1) - Please choose one
The bottom layer in the layered approach of Operating System is-----------
► User interface
► Hardware
► Kernel
► None of the given options

Question No: 16 (Marks: 1) - Please choose one


The manual pages can be read in Linux using command.

► man
► wan
► desc
► help

5
MIDTERM EXAMINATION Spring
2010
CS604 - Operating System

Question No: 1 ( Marks: 1 ) - Please choose one


The hardware mechanism that enables a device to notify CPU is called an -------------
► Interrupt
► Signal
► Trap
► Process

Question No: 2 ( Marks: 1 ) - Please choose one


You can display the contents (names of files and directories) of a directory in UNIX/Linux directory structure
with the --------------- command.

►ll
►s
► ls
► none of the given options

Question No: 3 ( Marks: 1 ) - Please choose one


The -------------- system call suspends the calling process.
► fork
► wait
► exec
► exit

Question No: 4 ( Marks: 1 ) - Please choose one


In ---------addressing, the recipient is not required to name the sender.
► Symmetric
► Asymmetric
► Both symmetric and asymmetric
► None of the given options

Question No: 5 ( Marks: 1 ) - Please choose one


-------- command gives a snapshot of the current processes.
► ps
► top
► who
► ls

6
Question No: 6 ( Marks: 1 ) - Please choose one
--------------command to resume the execution of a suspended job in the foreground
► fg
► bg
► jobs
► kill

Question No: 7 ( Marks: 1 ) - Please choose one


You can use the ------------- command to display the status of suspended and background processes

► fg
► bg
► jobs
► kill

Question No: 8 ( Marks: 1 ) - Please choose one


You can terminate a foreground process by pressing --------------

► <Ctrl-A>
► <Ctrl-C>
► <Ctrl-Z>
► None of the given options

Question No: 9 ( Marks: 1 ) - Please choose one


A time sharing system is
► Multi tasking
► Interactive
► Multi user
► All of these

Question No: 10 ( Marks: 1 ) - Please choose one


The main characteristic of a Real time system is
► Efficiency
► Large Virtual Memory
► Large secondary storage device
► Usability

Question No: 11 ( Marks: 1 ) - Please choose one


Shared libraries and kernel modules are stored in directory
► /bin
► /dev
► /boot
► /lib

7
Question No: 12 ( Marks: 1 ) - Please choose one
scheduler selects the process from the job pool and put them in main memory.

► Long term
► Short term
► Medium term
► Swapper

Question No: 13 ( Marks: 1 ) - Please choose one


In indirect inter process communication, a sender_ mention the name of the recipient.
► do
► do not

Question No: 14 ( Marks: 1 ) - Please choose one


A is an integer variable that, apart from initialization is accessible only through two standard atomic
operations: wait and signal.

► Semaphore
► Monitor
► Critical region
► Critical section

Question No: 15 ( Marks: 1 ) - Please choose one


A semaphore that cause Busy-Waiting is termed as .

► Spinlock
► Monitor
► Critical region
► Critical section

Question No: 16 ( Marks: 1 ) - Please choose one


The execution of critical sections must NOT be mutually exclusive

► True
► False

Question No: 17 ( Marks: 1 ) - Please choose one


The performance of Round Robin algorithm does NOT depends heavily on the size of the time quantum.

► True
► False

8
Question No: 18 ( Marks: 1 ) - Please choose one
The following requirement for solving critical section problem is known as . “There exists a bound on
the number of times that other processes are allowed to enter their critical sections after a process has made a
request to enter its critical section and before that request is granted.”

► Progress
► Bounded Waiting
► Mutual Exclusion
► Critical Region

Question No: 19 ( Marks: 1 ) - Please choose one


The critical section problem can be solved by the following except

► Software based solution


► Firmware based solution
► Operating system based solution
► Hardware based solution

Question No: 20 ( Marks: 1 ) - Please choose one


is also called Swapper.

► Swap space
► Medium term scheduler
► Short term scheduler
► Long term scheduler

MIDTERM EXAMINATION Spring


2010
CS604 - Operating System

Question No: 1 ( Marks: 1 ) - Please choose one


Linux OS can support multiple users at a time

►True
►False

9
Question No: 2 ( Marks: 1 ) - Please choose one
The Operating system is a layer of software between _ and .

►hardware, software application


►Kernel, hardware
►Dos, Windows
►Windows, Kernel

Question No: 3 ( Marks: 1 ) - Please choose one


The major advantage of multi-programming system is

►More than one jobs can be processed at a given time


►CPU utilization can be increased
►Jobs can be completed quickly
►All of the options are correct

Question No: 4 ( Marks: 1 ) - Please choose one


The main characteristic of a Real time system is

►Efficiency
►Large Virtual Memory
►Large secondary storage device
►Usability

Question No: 5 ( Marks: 1 ) - Please choose one


Command-line interpreter is also called in some operating systems.
►Kernel
►Shell
►Signal
►API

Question No: 6 ( Marks: 1 ) - Please choose one


I/O instructions are Privileged Instructions.
►True
►False

Question No: 7 ( Marks: 1 ) - Please choose one


In Linux directory structure, there is root directory.
►1
►2
►3
►4

10
Question No: 8 ( Marks: 1 ) - Please choose one
Utilities used for system administration (halt, ifconfig, fdisk, etc.) are stored in directory.

►/dev
►/boot
►/lib
►/sbin
Question No: 9 ( Marks: 1 ) - Please choose one
rm and [r]mkdir commands are used to directory.

►Create
►Move
►Remove
►Modify

Question No: 10 ( Marks: 1 ) - Please choose one


You can use the mv file1 file2 command to move

►file1 to file2.
►file 2 to file 1
►this command will not work for moving files
►None of the option is correct.
►Both option a and b are correct

Question No: 11 ( Marks: 1 ) - Please choose one


Taking the CPU from one process and giving the CPU to another process is termed as

►Context Switching
►Dispatching
►Swapping
►Tracking

Question No: 12 ( Marks: 1 ) - Please choose one


A Process that has finished working, as well as its parent process has also finished its execution. In this state the
process A will be called as process.

►Child
►Thread
►Zombie
►Fork

11
Question No: 13 ( Marks: 1 ) - Please choose one
Bounded Buffer is a buffer of size
►variable
►fixed

Question No: 14 ( Marks: 1 ) - Please choose one


In communication the process which wants to communicate with the other process must explicitly
name the recipient and the sender.
►Direct
►Indirect
►Automatic
►Self

Question No: 15 ( Marks: 1 ) - Please choose one


In indirect inter process communication, a sender mention the name of the recipient.
►does
►does not

Question No: 16 ( Marks: 1 ) - Please choose one


The returned code to the child process after successful fork system call execution is

►1
►2
►3
►0

Question No: 17 ( Marks: 1 ) - Please choose one


If the fork system call fails, it returns

►1
►-1
►2
►0

Question No: 18 ( Marks: 1 ) - Please choose one


When a process opens its first file explicitly it will get descriptor number

►1
►2
►3
►4

12
MIDTERM EXAMINATION Spring
2009
CS604 - Operating System

Question No: 1 ( Marks: 1 ) - Please choose one


I MB or 1 megabyte is equivalent to----

►1024 bytes
►10242 bytes
►10243 bytes
►1000000 bytes

Question No: 2 ( Marks: 1 ) - Please choose one


The bottom layer in the layered approach of Operating System is-----------

►Hardware
►User interface
►Hardware
►Kernel
►None of the given options

Question No: 3 ( Marks: 1 ) - Please choose one


------------has a hierarchical file system structure.

►DOS
►Windows
►UNIX
►None of the given options

Question No: 4 ( Marks: 1 ) - Please choose one


You can use the ---------command in UNIX to create a directory.

►rmdir
►mkdir
►cp
►gcc

13
Question No: 5 ( Marks: 1 ) - Please choose one
Files that start with a -------- in UNIX/Linux directory structure are known as hidden files .

►. (dot)
►# ( hash )
►/ (slash)
►~ (tilt)

Question No: 6 ( Marks: 1 ) - Please choose one


The creating process is called a--------------- process while the new processes are called the -------------- of that
process

►None of the given options


►Children, parent
►Parent, children
►Zombie, single

Question No: 7 ( Marks: 1 ) - Please choose one


buffer places no practical limit on the size of the buffer

►Bounded
►Unbounded
►Both Unbounded & bounded
►None of the given options

Question No: 8 ( Marks: 1 ) - Please choose one


The are used for communication between related or unrelated processes on the same system or
unrelated
processes on different systems.

►Pipes
►BSD Sockets
►Named pipe (FIFO)
►None of the given options

Question No: 9 ( Marks: 1 ) - Please choose one


A is an abstract key for accessing a file.

►File descriptor
►Input Redirection
►Output Redirection
►FIFO

14
Question No: 10 ( Marks: 1 ) - Please choose one
-------- command gives a snapshot of the current processes.

►ps
►top
►who
►ls

Question No: 11 ( Marks: 1 ) - Please choose one


You can display all of the signals supported by your system, along with their numbers, by using the
-----------
command

►<Ctrl-A>
►fg
►jobs
►kill -l

Question No: 12 ( Marks: 1 ) - Please choose one


The time it takes for the dispatcher to stop one process and start another running is known as the-----------.

►Dispatch latency
►Scheduling
►Context switching
►None of the given options

Question No: 13 ( Marks: 1 ) - Please choose one


First-Come, First-Served (FCFS) is a --------------scheduling algorithm.

►preemptive
►non-preemptive
►both preemptive and non- preemptive
►none of the given options

Question No: 14 ( Marks: 1 ) - Please choose one


The Shortest-Job-First Scheduling algorithm can be

►Preemptive only
►non-preemptive only
►preemptive or non-preemptive.
►None of the given options

15
Question No: 15 ( Marks: 1 ) - Please choose one
Preemptive ----------------scheduling is sometimes called shortestremaining-time-first scheduling.

►First-Come-First-Served (FCFS)
►Round-Robin
►Sorted Job First (SJF)
►Priority

Question No: 16 ( Marks: 1 ) - Please choose one


The basic purpose of is to help the users to utilize the hardware resources for
completing
different tasks in a simplified manner

►Operating system
►Application software
►All Software
►All of the given

Question No: 17 ( Marks: 1 ) - Please choose one


OS helps manages the following except

►Application software
►Bus speed of the system
►Memory
►Virtual memory

Question No: 18 ( Marks: 1 ) - Please choose one


scheduler selects the process from the job pool and put them in main memory.

►Long term
►Short term
►Medium term
►Swapper

Question No: 19 ( Marks: 1 ) - Please choose one


A parent process calling system call will be suspended until children process terminates.

►wait
►fork
►exit
►exec

16
Question No: 20 ( Marks: 1 ) - Please choose one
n-process critical section problem can be solved by using

►The bakery algorithm


►Deterministing modeling
►Analytic evaluation
►None of above

17
CS604 - Operating System
Solved Quizzes (1 and 2)

Quiz No.1 Dated Dec 04, 2012

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


is a piece of code in a cooperating process in which the process may updates shared data
(variable, file, database, etc.).

►Critical analysis
►Critical section
►Critical path
►Critical code

Question No: 2 of 10 ( Marks: 1 ) - Please choose one


Round Robin algorithm is similar to scheduling but preemption is added to switch between
processes.

►Shortest job first


►Shortest Remaining Time First
►First Come First Server
►None of these

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


DOS is single user operating system.

►True
►False

Question No: 4 of 10 ( Marks: 1 ) - Please choose one


A process is said to be in critical section if it executes code that manipulates shared data

►True
►False

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


When process opens its first file explicitly it will get descriptor number

►1
►2
►3
►4

18
Question No: 6 of 10 ( Marks: 1 ) - Please choose one
A major problem with priority scheduling algorithms is .

►Deadlock
►Aging
►Starvation
►None of the these

Question No: 7 of 10 ( Marks: 1 ) - Please choose one


All threads within a process share the address space.

►Same
►Different

Question No: 8 of 10 ( Marks: 1 ) - Please choose one


displays information about the top processes.

►Is
►Cs
►Top
►Cd

Question No: 9 of 10 ( Marks: 1 ) - Please choose one


The scheduling of are done by the operating system.

►Kernel threads
►User level threads
►Both kernel and user level thread
►None of the give option

Question No: 10 of 10 ( Marks: 1 ) - Please choose one


In Unix/ Linux, by default the standard output file is attached to the

►File
►Screen
►Printer
►Scanner

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


POSIX is a standard developed by ANSI

►IEEE
►ISO
►ACM

19
Question No: 2 of 10 ( Marks: 1 ) - Please choose one
is the basis of queuing theory which is branch of mathematics used to analyze systems
involving queues
and servers.

►Little’s Formula
►Deterministic modeling
►Queuing Theory
►Queuing Analysis

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


is a solution to the problem of indefinite blockage of low-priority processes.

►Starvation
►Deadlock
►Aging
►None of the these

Question No: 4 of 10 ( Marks: 1 ) - Please choose one


The priority of a process can be changed using command.

►nice
►cmd
►Cat
►grep

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


Batch programs are usually programs.

►Interactive
►Non-interactive
►Foreground
►Preemptive

Question No: 6 of 10 ( Marks: 1 ) - Please choose one


A process consists of
►One or more threads
►Code
►Data
►All of the given

Question No: 7 of 10 ( Marks: 1 ) - Please choose one


/usr/X11R6 is used by the X Window System.

►True
►False

20
Question No: 8 of 10 ( Marks: 1 ) - Please choose one
command displays the contents of current working directory.

►Is
►Cs
►Mv

Question No: 9 of 10 ( Marks: 1 ) - Please choose one


Linux uses directory to store system configuration files.

►/bin
►/dev
►/boot
►/etc

Question No: 10 of 10 ( Marks: 1 ) - Please choose one


User mode can run the Privileged instructions.

►1
►0

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


If your processor does not have two slots empty in Per Process File Descriptor Table, then your
system call
will fail.

►Pipe
►read
►write
►open

Question No: 2 of 10 ( Marks: 1 ) - Please choose one


First entries in Per Process File Descriptor Table are used as soon as the process is created.
►1
►2
►3
►4

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


The number of processes completed per unit time is called .

►Turn around time


►Throughput
►Response time
►Dispatch latency

21
Question No: 4 of 10 ( Marks: 1 ) - Please choose one
The procedure “The time at which the process finished working MINUS the arrival time of the process
MINUS CPU
burst for that process” will help calculate the .

►on-preemptive Shortest Job First scheduling.


►Preemptive Shortest Job First scheduling.
► FCFS
►RR Scheduling

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


/opt is used for storage of large applications.
►True
►False

Question No: 6 of 10 ( Marks: 1 ) - Please choose one


is a virtual directory in Linux and Unix.
►/proc
►/temp
►/ver
►/boot

Question No: 7 of 10 ( Marks: 1 ) - Please choose one


The Home Directory for superuser in Linux and Unix is
►/home
►/root
►None of the given

Question No: 8 of 10 (Marks: 1) - Please choose one


Linux Treats Devices as Files.
►True
►False

Question No: 9 of 10 ( Marks: 1 ) - Please choose one


An absolute pathname starts with the root directory (/) and a relative pathname starts with your home
directory.

►True
►False

Question No: 10 of 10 ( Marks: 1 ) - Please choose one


A pathname is the list of directories separated by .

►#
►$
►&
►/

22
Question No: 1 of 10 ( Marks: 1 ) - Please choose one
determines How to do something.

►Mechanism
►Policy
►Mechanism and Policy:
►None of the given

Question No: 2 of 10 ( Marks: 1 ) - Please choose one


User Goal of OS is that It easy to use, reliable, safe and fast.

►True
►False

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


We can install and run multiple OS by using VMWare.

►True
►False

Question No: 4 of 10 ( Marks: 1 ) - Please choose one


Mach, MacOS X Server, QNX, OS/2 and Windows NT are examples of OS Based on _.

►Layered
►Micro Kernal
►Virtual Machine
►None of The Given

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


In Layered Approach of OS, the Layer highest Layer is User Interface layer.

►True
►False

Question No: 6 of 10 ( Marks: 1 ) - Please choose one


In Layered approach of OS, Lowest Layer is known as .

►Software Layer
►Hardware Layer
►Lower Level Layer
►None of The Given

Question No: 7 of 10 ( Marks: 1 ) - Please choose one


Operating System is the Manager of Hardware Resources.
►True
►False
23
Question No: 8 of 10 ( Marks: 1 ) - Please choose one
An operating system is a control program that manages the execution of user programs to prevent errors and
improper use of a computer.

►True
►False

Question No: 9 of 10 ( Marks: 1 ) - Please choose one


The bottom-up view is that operating system is a resource manager who manages the hardware and software
resources in
the computer system.

►True
►False

Question No: 10 of 10 ( Marks: 1 ) - Please choose one


determines What will be done.

►Mechanism
►Policy
►Mechanism and Policy
►None of the given

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


copy file1 file2 is an example of OS view.

►Top down
►Bottum Up

Question No: 2 of 10 ( Marks: 1 ) - Please choose one


The Top-down view is that it is a program that acts as an intermediary between a user of a computer and the
computer
hardware, and makes the computer system convenient to use.

►True
►False

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


Managing Secondary Storage Involves all of the Following except

►Allocating storage space


►Deallocating Storage
►Prevent Overwritting
►Insure integrity of shared data

24
Question No: 4 of 10 ( Marks: 1 ) - Please choose one
The Purpose of Operating System is to generate Executable Programs and to them.

►Regenetrate
►Execute
►Store
►Remove

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


Users are the People, machines or computers that uses the Hardware resources.

►True
►False

Question No: 6 of 10 ( Marks: 1 ) - Please choose one


Database, Complier, Video games are examples of .

►Hardware
►Application
►Operating System
►Users

Question No: 7 of 10 ( Marks: 1 ) - Please choose one


Which of the Following is not an Operating System.

►Linux
►Unix
►Windows Xp
►Datebase

Question No: 8 of 10 ( Marks: 1 ) - Please choose one


Operating system enables the user to use the Hardware Resources.

►True
►False

Question No: 9 of 10 ( Marks: 1 ) - Please choose one


Which of the following is NOT a Hardware Resource.

►CPU
►OS
►I/O Devices
►Memory

25
Question No: 10 of 10(Marks: 1) - Please choose one
Hardware provide basic computing resource.

►True
►False

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


is a preemptive scheduling algorithm.

►First Come First Serve


►Shortest Job First
►Round Robin
►None of these

Question No: 2 of 10 ( Marks: 1 ) - Please choose one


The priorities of processes in the group remain fixed.

►Kernel
►User

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


The process of switching from one process to another is called latency.
►True
►False

Question No: 4 of 10 ( Marks: 1 ) - Please choose one


In Unix/ Linux, by default the standard input file is attached to the
►Mouse
►Keyboard
►Light pen
►Joystick

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


The nice value helps in assigning to a process.

►Priority
►Weight
►Time
►Scheduling

Question No: 10 of 10 ( Marks: 1 ) - Please choose one


integer shows the highest priority of a process in CPU scheduling

►Small
►Large

26
Quiz No.2

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


If a system is not in a safe state, there can be No deadlocks.

►True
►False

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


A dashed line is used to represent a in Resource Allocation Graph.

►Claim edge
►Request edge
►Assignment edge
►Allocation edge

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


The process of holding at least one resource and waiting to acquire additional resources that are currently being
held by other processes is known as .

►Mutual exclusion
►Hold and wait
►No preemption
►Circular wait

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


In Resource Allocation Graph, A Pi →Rj indicates that process Pi may request resource Rj at some
time in the future.

►Claim edge
►Request edge
►Assignment edge
►Allocation edge

27
Question No: 1 of 10 ( Marks: 1 ) - Please choose one
If the system can allocate resources to each process in some order and still avoid a deadlock then it said to be in
state.

►Safe
►Unsafe
►Mutual
►Starvation

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


A condition where a set of blocked processes each holding a resource and waiting to acquire a resource held by
another process in the set is termed as .
►Deadlock
►Starvation

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


The following is NOT a classical problem of synchronization

►Bounded buffer problem


►Reader writer problem
►Dining philosopher‟s problem
►Counting semaphore problem

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


The integer value of semaphores can range over an unrestricted integer domain.

►Counting
►Binary
►Mutex
►Bounded buffer

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


The condition in which a set {P0, P1… Pn} of waiting processes must exist such that P0 is waiting for a
resource that is held by P1, P1 is waiting for a resource that is held by P2, and so on, Pn-1 is waiting for a
resource held by Pn, and Pn is waiting for a resource held by P0. This condition is known as .

►Mutual exclusion
►Hold and wait
►No preemption
►Circular wait

28
Question No: 1 of 10 ( Marks: 1 ) - Please choose one
You can use the rm file1 command to file1

►Retrieve
►Remove
►Make
►modify

Question No: 2 of 10 ( Marks: 1 ) - Please choose one


The correct command for compiling C program named program.c in Linux environment is

►gcc program.c –o FirstPrgram


►gcc –o FirstProgram program.c
►gcc –z FirstProgram program.c
►gcc program.c –m FirstPrgram

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


Using _system, we can create a new process in Linux.

►Fork
► exec
►wait
►exit

Question No: 4 of 10 ( Marks: 1 ) - Please choose one


Cooperating processes never share any data, code, memory or state.

►True
►False

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


command display the status of a process.

►ls
►ps
►gcc
►cat

Question No: 6 of 10 ( Marks: 1 ) - Please choose one


Swapper is also termed as Short term scheduler.

►True
►False

29
Question No: 7 of 10 ( Marks: 1 ) - Please choose one
system call is used to write to a file or FIFO or any other IPC channel.

►read
►write
►ope
n
►fork

Question No: 8 of 10 ( Marks: 1 ) - Please choose one


A Process „A‟ that has finished working but its parent process has also finished its execution. In this state the
process „A‟
will be called as process.

►Chil
d
►Threa
d
►Zombie
►Fork

Question No: 9 of 10 ( Marks: 1 ) - Please choose one


scheduling allows a process to move between queues.
►Round
Robin
►First Come First
Serve
►Multilevel Feedback Queue
►Shortest Remaining Time
First

Question No: 10 of 10 ( Marks: 1 ) - Please choose one


Round Robin algorithm is most suitable for .

Time sharing system

Real time systems and batch


systems Running Batch programs
Expert
system

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


Kernel is responsible for scheduling the user level threads.
►True
►False
Question No: 2 of 10 ( Marks: 1 ) - Please choose one
A ---------------- (or an exception) is a software-generated interrupt caused either by an error (division by zero
or invalid
memory access) or by a user request for an operating system service.

► Interrupt
► Trap
► Signal
► Process

30
Question No: 3 of 10 ( Marks: 1 ) - Please choose one
Which register holds the smallest legal physical memory address for a process?

► Base register
► Limit register
► Status register
► None of the given options

Question No: 4 of 10 ( Marks: 1 ) - Please choose one


The --------------semaphore provides mutual exclusion for accesses to the buffer pool and is initialized to the
value 1.
► mutex
► binary
► couting
► none of the given options

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


Binary semaphores are those that have only two values---------
► 0 and n
► 0 and 0
► 0 and 1
► None of the given options

Question No: 6 of 10 ( Marks: 1 ) - Please choose one


Physical memory is broken down into fixed-sized blocks, called----------- and Logical memory is divided
into blocks of the same size, called -----------

► Frames, pages
► Pages, Frames
► Frames, holes
► Holes, segments

Question No: 7 of 10 ( Marks: 1 ) - Please choose one


A page table needed for keeping track of pages of the page table is called --------------
► 2-level paging
► Page directory
► Page size
► Page table size

Question No: 8 of 10 ( Marks: 1 ) - Please choose one


The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a --------
address, and the address it gets translated to by the MMU is called a ---------address.

►Virtual, physical
► Hexadecimal, Binary,
► Valid, invalid
► Physical, Virtual

31
Question No: 9 of 10 ( Marks: 1 ) - Please choose one
Each page is a power of -------- bytes long in paging scheme.

►2
►3
►4
►5

Question No: 10 of 10 ( Marks: 1 ) - Please choose one


Which part of the computer system helps in managing the file and memory management system?

► Operating System
► Device Drivers
► Application Software
► Hardware

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


Which of the following is correct definition for wait operation?
► wait(S) {
while(S<=0)
;// no o
S--;
}
► wait(S) {
S++;
}
► wait(S) {
while(S>=0)
;// no op
S--;
}
► wait(S) {
S--;
}

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph
contains a

► Cycle
► Graph
► Edge
► Node

32
Question No: 4 of 10 ( Marks: 1 ) - Please choose one
------------ register contains the size of the process

►Base register
►Index register
►Limit register
►Stack pointers register

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


The -----------scheme is not applicable to a resource allocation system with multiple instances of each
resource type.

►Wait for graph


►Resource allocation graph
►Both Resource-allocation and wait-for graph
► None of the given options

Question No: 6 of 10 ( Marks: 1 ) - Please choose one


algorithm is used in Deadlock avoidance.

►Bakery
►Banker’s
►Mutual exclusion
►Safe Sequence

Question No: 7 of 10 ( Marks: 1 ) - Please choose one


What do we name to an address that is loaded into the memory-address register of the memory?

►Logical address
►Physical address
►Binary addresses
►None of the given options

Question No: 8 of 10 ( Marks: 1 ) - Please choose one


Cache is non-volatile memory.

►True
►False

Question No: 9 of 10 ( Marks: 1 ) - Please choose one


A system call

►Is an entry point into the kernel code


►Allows a program to request a kernel service
►Is a technique to protect I/O devices and other system resources
►All of the these

33
Question No: 10 of 10 ( Marks: 1 ) - Please choose one
The condition where a set of blocked processes each holding a resource and waiting to acquire a resource held
by another
process in the set, is termed as .

►Deadlock
►Starvation

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


Banker‟s algorithm is used for

►Deadlock avoidance
►Deadlock detection
►Deadlock prevention
►Deadlock removal

Question No: 2 of 10 ( Marks: 1 ) - Please choose one


The requires that once a writer is ready, that writer performs its write as soon as possible , if a writer
waiting to access the object, no new readers may start reading.

►first readers-writers problem


►second readers-writers problem
►third readers-writers problem
►fourth readers-writers problem

Question No: 3 of 10 ( Marks: 1 ) - Please choose one


is an integer variable accessible through wait and signal which are atomic operations.

►Semaphore
►Mutex
►Busy w aiting
►Signal

Question No: 4 of 10 ( Marks: 1 ) - Please choose one


The integer value of semaphores can not be greater than 1.

►Counting
►Binary
►Mutex
►Bounded buffer

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


Starvation is infinite blocking caused due to unavailability of resources.

►True
►False

34
Question No: 4 of 10 ( Marks: 1 ) - Please choose one
Operating System provides services such as Managing Primary and Secondary Storage, Processes and
Allowing user to manage his/her files and directories.

►True
►False

Question No: 5 of 10 ( Marks: 1 ) - Please choose one


is used in real time operating systems.

►Non-preemptive scheduling
►Preemptive scheduling
►Dispatching scheduling
►FCFS scheduling

Question No: 1 of 10 ( Marks: 1 ) - Please choose one


Preventing a condition of to happen, deadlocks can be prevented to happen.

►Critical region
►Circular wait
►Monitors
►Critical section

35

You might also like