WorksheetsOperating Systems Quiz
Total questions: 200
Worksheet time: 2hrs 39mins
Choose a characteristic of the meaning of open source.
Processor
Free Use
Privatization
Capitalism
which company created the first operating system?
General Motors
Cadillac
IBM
Intel
Which of these is not a function of an OS:
Provide a user interface
Communicate with hardware
Allow the computer to multi-task
Improves CPU performance
What do device drivers do?
Allows the OS to communicate with hardware
Drives around the motherboard
Increases the amount of storage
Which of these is an advantage to using a command-line interface over a GUI?
More interactive
Easier to use
Less resource heavy
What type of operating system is Windows 10?
Single-user OS
Multi-user OS
What do device drivers do?
Allows the OS to communicate with hardware
Drives around the motherboard
Increases the amount of storage
What type of operating system is Windows 10?
Single-user OS
Multi-user OS
The program in our operating system always deals with what address?
logical address
virtual address
both
neither
Click on all the examples of Operating Systems
Windows
iOS
Google Docs
To access the services of operating system, the interface is provided by the ___________
System calls
API
Library
Assembly instructions
The primary purpose of an operating system is:
To make the most efficient use of the computer hardware
To allow people to use the computer,
To keep systems programmers employed
To make computers easier to use
The strategy of allowing processes that are logically runnable to be temporarily suspended is called
preemptive scheduling
non preemptive scheduling
shortest job first
first come first served
Semaphores are used to solve
Deadlock
Mutual exclusion
Inter-process Communication
Messaging
Only the process executing the critical section is allowed access to the shared variable,all other processes should prevented from doing so until the completion of the critical section. This is often referred to as-
Mutual exclusion
semaphores
Deadlock
Interprocess communication
Banker’s algorithm is used as-
Deadlock occurrence method
Deadlock avoidance method
Deadlock detection method
Deadlock recovery method
The ability for a computer to execute more than one task simultaneously
multitasking
multiprogramming
multiprocessing
timesharing
The operating system is a type of
system software
general purpose software
utility software
application software
Which is not a process state?
waiting
terminated
blocked
redirected
A signal sent by a hardware or software to CPU indicating that something needs attention
disturbance
interrupt
waiting
exclusion
FCFS is operates similar to a
stack
sorting algorithm
circle
queue
What is the most used operating system in the world?
Linux
MacOS
Windows
Ubuntu
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
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. What is the main function of the command interpreter?
a) to provide the interface between the API and application program
b) to handle the files in the operating system
c) to get and execute the next user-specified command
d) none of the mentioned
3. To access the services of the operating system, the interface is provided by the ___________
a) Library
b) System calls
c) Assembly instructions
d) API
4. Where is the interrupt in operating system?
a) either low or high memory (depending on the location of interrupt vector)
b) in the low memory
c) in the high memory
d) none of the mentioned
5. Which one of the following is not a real time operating system?
a) RTLinux
b) Palm OS
c) QNX
d) VxWorks
6. 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
7. For an effective operating system, when to check for deadlock?
a) every time a resource request is made at fixed time intervals
b) at fixed time intervals
c) every time a resource request is made
d) none of the mentioned
8. To recover from failures in the network operations _____________ information may be maintained.
a) operating system
b) ip address
c) stateless
d) state
9 The two steps the operating system takes to use a disk to hold its files are _______ and ________
a) caching & logical formatting
b) logical formatting & swap space creation
c) swap space creation & caching
d) partitioning & logical formatting
10 In Unix, which system call creates the new process?
a) create
b) fork
c) new
d) none of the mentioned
1) What is the use of directory structure in the operating system?
The directory structure is used to solve the problem of the network connection in OS.
It is used to store folders and files hierarchically.
It is used to store the program in file format.
All of the these
What is a program?
a line of instruction
a list of instructions
a computer
Where does the taskbar appear by default?
on top of Windows Desktop
at the bottom of Windows Desktop
at the sides of Windows Desktop
What manages the hardware and runs the software?
Computer Systems
Dedicated Systems
Embedding Systems
Operating Systems
What is a good definition of software?
parts of a computer that are soft
Parts of a computer that you can't see
A set of rules that tell a computer what to do
games
Earlier computer systems utilized Command Line Interface to tell a computer what to do, which interface does the computer utilize now?
Command Line Interface
Touch User Interface
Natural Language Interface
Graphical User Interface
What is accessibility?
Changing how a system looks
Changing the brightness of the computer
Allowing as many people to access computers and technology
Changing the graphics and monitor to handle your screen
Sometimes, the process in our system has pending I/O. When this thing happens, swapping _____ be done.
can
must never
both
neither
Which can the main memory take in it?
operating system
user processes
both
neither
Which is faster than first-fit?
Best fit
Worst fit
both
neither
The program counter contains the location of the instruction being executed. The address is loaded into the memory address register of the memory. How do we refer that address?
Physical address
Logical address
both
neither
The run-time mapping from virtual to physical addresses is done by a hardware device properly called:
Virtual to physical mapper
CPU mapping unit
both
neither
The base register is also known as the:
basic register
relocation register
both
neither
In allocating address space to each process, what specifies the size of the range where that process can be allocated?
Base register
Limit register
both
neither
The _____ consists of all processes whose memory images are in the backing store or in memory and are ready to run.
CPU
Secondary Storage
both
neither
The program in our operating system always deals with what address?
logical address
virtual address
both
neither
External fragmentation will not occur when:
First fit, best fit, or worst fit are used
no matter which algorithm is used, it will always occur
both
neither
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. What is the main function of the command interpreter?
a) to provide the interface between the API and application program
b) to handle the files in the operating system
c) to get and execute the next user-specified command
d) none of the mentioned
3. To access the services of the operating system, the interface is provided by the ___________
a) Library
b) System calls
c) Assembly instructions
d) API
4. Where is the interrupt in operating system?
a) either low or high memory (depending on the location of interrupt vector)
b) in the low memory
c) in the high memory
d) none of the mentioned
5. Which one of the following is not a real time operating system?
a) RTLinux
b) Palm OS
c) QNX
d) VxWorks
6. 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
7. For an effective operating system, when to check for deadlock?
a) every time a resource request is made at fixed time intervals
b) at fixed time intervals
c) every time a resource request is made
d) none of the mentioned
8. To recover from failures in the network operations _____________ information may be maintained.
a) operating system
b) ip address
c) stateless
d) state
9 The two steps the operating system takes to use a disk to hold its files are _______ and ________
a) caching & logical formatting
b) logical formatting & swap space creation
c) swap space creation & caching
d) partitioning & logical formatting
10 In Unix, which system call creates the new process?
a) create
b) fork
c) new
d) none of the mentioned
An operating system is the software that controls all the hardware. It acts as an _____________ between the user and the hardware and also between applications and the hardware.
application
operator
hardware
interface
What does an OS need to work well?
RAM memory
storage
CPU
all answers
What is the most used operating system in the world?
Linux
MacOS
Windows
Ubuntu
What does an OS need to work well?
RAM memory
storage
CPU
all answers
What is the most used operating system in the world?
Linux
MacOS
Windows
Ubuntu
Choose a characteristic of the meaning of open source.
Processor
Free Use
Privatization
Capitalism
The operating system helps to manage files
True
False
The operating system is in your mind
True
False
Operating systems allow you to interact with various devices
True
False
(a) is founded by Steve Jobs
What year was unix created?
2000
1780
1969
1945
which company created the first operating system?
General Motors
Cadillac
IBM
Intel
Do operating systems today have a graphical user interface (GUI)?
True
False
The first version of this operating system started out in 1985, offered as an extension of an already-existing MS-DOS disk operating system.
macOS
Windows
UNIX
Linux
Being one of the earliest in the category of modern computer operating systems, UNIX was developed by Bell Laboratories researchers in the early ___
1970s
1960s
1980s
1990s
Windows is an example of an open source operating system.
True
False
Through this method, a hard drive can be divided into multiple logical storage areas which can then be used to install a different operating system
Cutting
Segregation
Partitioning
Defragmentation
A group of software applications that manage the interactions between computer or mobile hardware
Multitasking
Cold Booting
Operating System
User Interface
An area in a hard drive that is allotted for virtual memory
Swap File
Thrashing
Paging
Page
A segment of memory or storage in which items are placed while waiting to be transferred from an input device to an output device.
Spooling
Foreground
Multitasking
Buffer
Tells the OS how to communicate with a specific device. All the devices that are connected into a computer needs it to communicate with the computer
Plug & Play
Driver
Thrashing
Warm Booting
Capable of handling a high volume of transactions in a multiuser environment and working with multiple processors
Linux
macOS Server
UNIX
Windows Server
An open source, Linux-based mobile operating system designed by Google for smartphones and tablets
Android
iOS
Cherry Mobile
Windows
The practice of sharing or pooling computing resources, such as servers or storage devices
Virtualizing
Virtual
Virtualization
Virtualize
Share contacts and other information by touching two devices together
Hands
Bluetooth
SHAREit
NFC Technology
Causes a display's screen to show a moving image or blank screen if no keyboard or mouse activity occurs for a specified time.
Battery Optimizer
Eco-Mode
Power Management
Screen Saver
Operating systems can include the following security tools, except:
VPN Software
Automatic Updating
Antivirus Software
Firewall
A program that assesses and reports information about various computer resources and devices.
Device Information
Activity Tracker
Performance Monitor
System Administrator
Which algorithm will minimum flow of time?
First come first serve
Shortest job first
Priority scheduling
Round robin
Round robin scheduling falls under :
Non-preemptive scheduling
Preemptive scheduling
Both a and b
None of above
From the time of submission of a process to the time of completion? The interval is termed as :
Turnaround time
Response time
Through put
Waiting time
Which requested resources are granted with deadlock detection?
Resources
Processes
Programs
User's
If a process is executing in critical section,then no other processes can be executing in their c.s :
Critical exclusion
Mutual Exclusion
Both a and b
None
In below mentioned options, which one is classical problems of synchronisation
Bounded buffer problem
Producer Consumer problem
Dining Philosophers problem
Both a and c
Which one of the following is a Synchronisation tool ?
Thread
Semaphore
Socket
Both and c
Mutual exclusive can be provided by the?
Muted locks
Binary Semaphores
Both a and b
None of above
Process Synchronisation can be done on ..?
Hardware level
Software Level
Both a and b
None of the above
A running process is not interrupted by :-
A device
Timer
Scheduler process
Power failure
The release of resource and request are?
System calls
Command line statements
Special Programs
None of above
For share able resources like printer, which condition should be used?
Hold and wait
Circular set
Both a and c
Mutual exclusion
A process in OS uses resources in the foll way ?
Requests a resource
Use a resource
Release the resource
All the above
A process that contain multiple threads?
Multi Threading
Threads
Process
Both a and b
When more than one processes access the same code segment is known as?
Synchronisation
Critical section
Mutual exclusion
None
Which is used to implement the solution of critical section problems with multiple processes
Counting semaphore
Binary semaphore
Synchronisation
Both b and c
Which is used to control access to a resource that has multiple instances
Binary semaphore
Semaphore
Counting semaphore
None
Methods of handling deadlocks?
Deadlock prevention
Deadlock detection
Deadlock avoidance
All the above
Process initiation denial and resource allocation denial techniques comes under?
Deadlock prevention
Deadlock detection
Deadlock avoidance
All the above
Deadlock is resolved by?
Aborting
Can't be resolved
Restarting the process
Both a and c
Race Condition, Critical section problem, Semaphores, Peterson's solution which all these comes under ?
Process Synchronisation
Threading
Deadlock
All the above
Which problem is generalized in terms of producer - consumer problem:
Sleeping barbar problem
Bounded buffer
Dining philosoper
Reader-Writer problem
The concept of multithreading needs proper understanding of these two terms?
Kernal and Thread
User and Kernal
A process and A thread
All the above
Types of threads?
Kernal level Thread
User level thread
Non-User level thread
Both a and b
A resource can't be taken from a process unless the process release the resource:
Circular wait
Hold and wait
No preemptive
Both b and c
Process execution consists of a cycle of _________ and ________.
CPU execution
I/O wait
RAM storage
CPU burst is followed by I/O burst.
True
False
In CPU Scheduling, CPU burst distribution is not the main concern.
True
False
Selects from among the processes in ready queue, and allocates the CPU to one of them.
Short-term scheduler
Long-term scheduler
CPU scheduler
CPU scheduling decisions may take place when a process:
Switches from running to waiting state
Switches from running to ready state
Switches from running to terminated
Switches from waiting to ready
Terminated
Does not cut execution.
Preemptive
Nonpreemptive
Cuts execution.
Preemptive
Nonpreemptive
Gives control of the CPU to the process selected by the short-term scheduler.
Dispatcher
CPU controller
Short-term CPU
Dispatcher includes:
switching context: saving and loading state
switching to user mode
Jumping to the proper location in the user program
Jumping to the improper location in the user program
What are the 5 scheduling criteria?
CPU Utilization
Throughput
Turnaround time
Waiting Time
Response Time
Keep the CPU as busy as possible.
CPU Utilization
Throughput
Turnaround time
Waiting Time
Response Time
# of processes that complete their execution per time unit.
CPU Utilization
Throughput
Turnaround time
Waiting Time
Response Time
Amount of time to execute a particular process.
CPU Utilization
Throughput
Turnaround time
Waiting Time
Response Time
Amount of time a process has been waiting in the ready queue.
CPU Utilization
Throughput
Turnaround time
Waiting Time
Response Time
Amount of time it takes from when a request was submitted until the first response is produced, not output (for time-sharing environment)
CPU Utilization
Throughput
Turnaround time
Waiting Time
Response Time
Scheduling Algorithm Optimization Criteria
Max CPU utilization
Max throughput
Min turnaround time
Min waiting time
Min response time
Short process behind long process (applies to SJF, short process first)
Convoy effect
Convey effect
Conveyor effect
Associate with each process the length of its next CPU burst.
First-Come, First-Served Scheduling
Shortest-Job-First Scheduling
Shortest-Remaining-Time-First Scheduling
Priority Scheduling
Round Robin
A priority number (integer) is associated with each process.
First-Come, First-Served Scheduling
Shortest-Job-First Scheduling
Shortest-Remaining-Time-First Scheduling
Priority Scheduling
Round Robin
The CPU is allocated to the process with the highest priority.
(smallest integer = highest priority)
True
False
SJF is priority scheduling where priority is the inverse of predicted next CPU burst time.
True
False
Low priority processes may never execute.
Starvation
Aging
As time progresses increase the priority of the process.
Starvation
Aging
Each process gets a small unit of CPU time, usually 10-100 milliseconds.
After this time has elapsed, the process is preempted and added to the end of the ready queue.
First-Come, First-Served Scheduling
Shortest-Job-First Scheduling
Shortest-Remaining-Time-First Scheduling
Priority Scheduling
Round Robin
A small unit of CPU time (q).
Quantum time
Time slice
Millisecond
System consists of resources and series of processes.
True
False
Resource types include:
CPU cycles
Memory space
I/O devices
Storage space
Each process utilizes a resource as follows:
request
use
release
terminate
Is a situation where a set of processes are blocked because each process is holding a resource and waiting for another resource acquired by some other process.
Deadlock
Lockdead
Deadblock
What are the four conditions where deadlock can arise?
Mutual exclusion
Hold and wait
No preemption
Circular wait
Singular wait
Only one process at a time can use a resource.
Mutual exclusion
Hold and wait
No preemption
Circular wait
A process holding at least one resource is waiting to acquire additional resources held by other processes.
Mutual exclusion
Hold and wait
No preemption
Circular wait
A resource can be released only voluntarily by the process holding it, after that process has completed its task.
Mutual exclusion
Hold and wait
No preemption
Circular wait
There exists a set {P0, P1, …, Pn} of waiting processes such that P0 is waiting for a resource that is held by P1, P1 is waiting for a resource that is held by P2, …, Pn–1 is waiting for a resource that is held by Pn, and Pn is waiting for a resource that is held by P0.
Mutual exclusion
Hold and wait
No preemption
Circular wait
A set of vertices V and a set of edges E.
Resource-allocation graph
Wait-for graph
Process-allocation graph
Two types of edge in resource-allocation graph:
request edge
assignment edge
allocation edge
receive edge
Directed edge P -> R
Request edge
Assignment edge
Directed edge R -> P
Request edge
Assignment edge
Process
Resource Type with 4 instances
P requests instances of R
P is holding instance of R
Process
Resource Type with 4 instances
P requests instances of R
P is holding instance of R
Process
Resource Type with 4 instances
P requests instances of R
P is holding instance of R
Process
Resource Type with 4 instances
P requests instances of R
P is holding instance of R
Deadlock
No Deadlock
Deadlock
No Deadlock
Deadlock
No Deadlock
If graph contains no cycle?
Deadlock
No Deadlock
Possibility of Deadlock
If graph contains a cycle and only one instance per resource type
Deadlock
No Deadlock
Possibility of Deadlock
If graph contains a cycle and several instances per resource type
Deadlock
No Deadlock
Possibility of Deadlock
Ensure that the system will never enter a deadlock state through
Deadlock prevention
Deadlock avoidance
Deadlock trigger
(Deadlock prevention)
Must guarantee that whenever a process requests a resource, it does not hold any other resources.
Hold and Wait
No preemption
(Deadlock prevention)
If a process that is holding some resources requests another resource that cannot be immediately allocated to it, then all resources currently being held are released.
Hold and Wait
No preemption
Requires that the system has some additional a priori information available.
Deadlock prevention
Deadlock avoidance
(Deadlock avoidance)
Simplest and most useful model requires that each process declare the __________________ of resources of each type that it may need.
maximum number
minimum number
number
It is defined by the number of available and allocated resources, and the maximum demands of the processes.
resource-allocation state
resource-allocation graph
process-allocation state
if there exists a sequence <P1, P2, …, Pn> of ALL the processes in the systems such that for each Pi, the resources that Pi can still request can be satisfied by currently available resources + resources held by all the Pj, with j < I.
Safe state
Unsafe state
If a system is in safe state
Deadlock
No Deadlock
Possibility of Deadlock
If a system is in unsafe state
Deadlock
No Deadlock
Possibility of Deadlock
Ensure that a system will never enter an unsafe state.
Prevention
Avoidance
Single instance of a resource type.
Use a resource-allocation graph
Use the banker's algorithm
Multiple instances of a resource type.
Use a resource-allocation graph
Use the banker's algorithm
Multiple instances
Each process must a priori claim maximum use
When a process requests a resource it may have to wait
When a process gets all its resources it must return them in a finite amount of time
Resource-allocation graph
Banker's algorithm
What are the data structures needed for Banker's algorithm?
Available
Max
Allocation
Need
Processes
These are the instances of resource type available.
Available
Max
Allocation
Need
These are the most instances of resource type that the process can request.
Available
Max
Allocation
Need
These are the currently allocated resources.
Available
Max
Allocation
Need
Resources that the processes need to complete its task.
Available
Max
Allocation
Need
Need = Max - Allocated
True
False
Total Number of Resources = Total of each Resource Allocation + Available
True
False
