S604 - Midterm Solved Mcqs With References by Moaaz
S604 - Midterm Solved Mcqs With References by Moaaz
► fg
► bg
► jobs
► kill
► 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
►Turnaround time
►Waiting time
►Response time
►None of all these
►entry section
►Critical Section
►remainder section
►None of all these
►Address space
►Address Name
►Address ID
►None of all these
2
MIDTERM EXAMINATION Spring
2011
CS604 - 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
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
► man
► wan
► desc
► help
5
MIDTERM EXAMINATION Spring
2010
CS604 - Operating System
►ll
►s
► ls
► none of the given options
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
► fg
► bg
► jobs
► kill
► <Ctrl-A>
► <Ctrl-C>
► <Ctrl-Z>
► None of the given options
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
► Semaphore
► Monitor
► Critical region
► Critical section
► Spinlock
► Monitor
► Critical region
► Critical section
► True
► False
► 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
► Swap space
► Medium term scheduler
► Short term scheduler
► Long term scheduler
►True
►False
9
Question No: 2 ( Marks: 1 ) - Please choose one
The Operating system is a layer of software between _ and .
►Efficiency
►Large Virtual Memory
►Large secondary storage device
►Usability
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
►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
►Context Switching
►Dispatching
►Swapping
►Tracking
►Child
►Thread
►Zombie
►Fork
11
Question No: 13 ( Marks: 1 ) - Please choose one
Bounded Buffer is a buffer of size
►variable
►fixed
►1
►2
►3
►0
►1
►-1
►2
►0
►1
►2
►3
►4
12
MIDTERM EXAMINATION Spring
2009
CS604 - Operating System
►1024 bytes
►10242 bytes
►10243 bytes
►1000000 bytes
►Hardware
►User interface
►Hardware
►Kernel
►None of the given options
►DOS
►Windows
►UNIX
►None of the given options
►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)
►Bounded
►Unbounded
►Both Unbounded & bounded
►None of the given options
►Pipes
►BSD Sockets
►Named pipe (FIFO)
►None of the given options
►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
►<Ctrl-A>
►fg
►jobs
►kill -l
►Dispatch latency
►Scheduling
►Context switching
►None of the given options
►preemptive
►non-preemptive
►both preemptive and non- preemptive
►none of the given options
►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
►Operating system
►Application software
►All Software
►All of the given
►Application software
►Bus speed of the system
►Memory
►Virtual memory
►Long term
►Short term
►Medium term
►Swapper
►wait
►fork
►exit
►exec
16
Question No: 20 ( Marks: 1 ) - Please choose one
n-process critical section problem can be solved by using
17
CS604 - Operating System
Solved Quizzes (1 and 2)
►Critical analysis
►Critical section
►Critical path
►Critical code
►True
►False
►True
►False
►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
►Same
►Different
►Is
►Cs
►Top
►Cd
►Kernel threads
►User level threads
►Both kernel and user level thread
►None of the give option
►File
►Screen
►Printer
►Scanner
►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
►Starvation
►Deadlock
►Aging
►None of the these
►nice
►cmd
►Cat
►grep
►Interactive
►Non-interactive
►Foreground
►Preemptive
►True
►False
20
Question No: 8 of 10 ( Marks: 1 ) - Please choose one
command displays the contents of current working directory.
►Is
►Cs
►Mv
►/bin
►/dev
►/boot
►/etc
►1
►0
►Pipe
►read
►write
►open
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 .
►True
►False
►#
►$
►&
►/
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
►True
►False
►True
►False
►Layered
►Micro Kernal
►Virtual Machine
►None of The Given
►True
►False
►Software Layer
►Hardware Layer
►Lower Level Layer
►None of The Given
►True
►False
►True
►False
►Mechanism
►Policy
►Mechanism and Policy
►None of the given
►Top down
►Bottum Up
►True
►False
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
►True
►False
►Hardware
►Application
►Operating System
►Users
►Linux
►Unix
►Windows Xp
►Datebase
►True
►False
►CPU
►OS
►I/O Devices
►Memory
25
Question No: 10 of 10(Marks: 1) - Please choose one
Hardware provide basic computing resource.
►True
►False
►Kernel
►User
►Priority
►Weight
►Time
►Scheduling
►Small
►Large
26
Quiz No.2
►True
►False
►Claim edge
►Request edge
►Assignment edge
►Allocation edge
►Mutual exclusion
►Hold and wait
►No preemption
►Circular wait
►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
►Counting
►Binary
►Mutex
►Bounded buffer
►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
►Fork
► exec
►wait
►exit
►True
►False
►ls
►ps
►gcc
►cat
►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
►Chil
d
►Threa
d
►Zombie
►Fork
► 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
► Frames, pages
► Pages, Frames
► Frames, holes
► Holes, segments
►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
► Operating System
► Device Drivers
► Application Software
► Hardware
► 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
►Bakery
►Banker’s
►Mutual exclusion
►Safe Sequence
►Logical address
►Physical address
►Binary addresses
►None of the given options
►True
►False
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
►Deadlock avoidance
►Deadlock detection
►Deadlock prevention
►Deadlock removal
►Semaphore
►Mutex
►Busy w aiting
►Signal
►Counting
►Binary
►Mutex
►Bounded buffer
►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
►Non-preemptive scheduling
►Preemptive scheduling
►Dispatching scheduling
►FCFS scheduling
►Critical region
►Circular wait
►Monitors
►Critical section
35