Copy and Edit

Operating System

Description

Computer Science Quiz on Operating System, created by Sami Khan on 29/05/2020.
Sami Khan
Quiz by Sami Khan, updated more than 1 year ago More Less
Faheem Ahmed
Created by Faheem Ahmed about 6 years ago
Sami Khan
Copied by Sami Khan almost 4 years ago
3
0
0

Resource summary

Question 1

Question
Which of the following page replacement algorithm use the technique of replace that page which is not used in the near future?
Answer
  • Least Recently Used
  • Least Frequently Used
  • Optimal Page Replacement
  • First In First Out

Question 2

Question
A common programming construct for implementing mutual exclusion which uses condition variables is called
Answer
  • Semaphore
  • Deadlock
  • Monitor
  • Locking interrupts
  • Threads

Question 3

Question
DMA stands for
Answer
  • Direct Management access
  • Direct memory access
  • Dual memory access
  • Data memory access
  • Dual memory array

Question 4

Question
Which of the following is in correct order of size, smallest first?
Answer
  • Cylinder, track, sector
  • Cylinder, sector, track
  • Sector, track, cylinder
  • Sector, cylinder, track
  • Track, cylinder, sector

Question 5

Question
Which of the following is NOT a necessary condition for deadlock to occur?
Answer
  • Mutual exclusion
  • Hold and wait
  • Wait and signal
  • Circular wait
  • Hold

Question 6

Question
The time required to move the disk head to the desired track is known as
Answer
  • Access Time
  • Track Time
  • Latency Time
  • Seek Time
  • Block Time

Question 7

Question
A distributed system is a collection of processors that do not share_______.
Answer
  • CPU
  • Memory
  • I/O devices
  • Network
  • File

Question 8

Question
The process of converting logical address into physical address is known as
Answer
  • Conversion
  • Displacement
  • Relocation
  • Transfer
  • None of the above

Question 9

Question
In a segmentation scheme the logical memory will be divided into
Answer
  • Pages
  • Frames
  • Blocks
  • Cells
  • Segments

Question 10

Question
Which of the technique is used to recover the process from starvation situation?
Answer
  • Paging
  • Aging
  • Compaction
  • Starvation
  • Reduction

Question 11

Question
In Unix, dev/null
Answer
  • Is a file
  • Has write permission for all
  • Is the UNIX built-in dustbin
  • All of these

Question 12

Question
Redirection in pipes can be achieved by using
Answer
  • >
  • >>
  • tee
  • lpr

Question 13

Question
The PID of the kernel process is
Answer
  • 0
  • 1
  • 2
  • undefined

Question 14

Question
Which of the following statements best explains a process?
Answer
  • It is a program.
  • It is a program in execution.
  • It is an instance of a program in execution.
  • It is a program that uses system calls.

Question 15

Question
An incremental backup
Answer
  • uses more tapes
  • should be done each month
  • saves only files that have recently changed
  • saves all files

Question 16

Question
In real-time operating systems, which of the following is the most suitable scheduling scheme?
Answer
  • round-robin
  • first-come-first-served
  • preemptive
  • random scheduling

Question 17

Question
If there are 32 segments, each of size 1 K byte, then the logical address should have
Answer
  • 13 bits
  • 14 bits
  • 15 bits
  • 16 bits

Question 18

Question
Which of the following refers to the associative memory?
Answer
  • Address of the data is generated by the CPU
  • Address of the data is supplied by the users.
  • There is no need for an address ie the data is used as an address
  • Data are accessed sequentially

Question 19

Question
Mutual exclusion problem occurs between
Answer
  • two disjoint processes that do not interact
  • processes that share resources
  • processes that do not use the same resource
  • None of these

Question 20

Question
Kernel is
Answer
  • considered as critical part of operating system.
  • software which monitors operating system.
  • set of primitive functions upon which rest of operating system functions are built up.
  • none of the above.

Question 21

Question
Which of the following page replacement algorithms suffers from Belady`s anomaly?
Answer
  • Optimal replacement
  • LRU
  • FIFO
  • Both optimal replacement and FIFO

Question 22

Question
Locality of reference implies that the page reference being made by a process
Answer
  • will always be to the page used in previous page refernce
  • is likely to be one of the pages used in the last few page references
  • will always be one of the pages existing in memory
  • will always lead to a page fault

Question 23

Question
The time of admission of job to ready queue to completion is_______
Answer
  • Turnaround time
  • Burst time
  • Response time
  • None of the above

Question 24

Question
which of the following is the command for the searching a pattern in a file
Answer
  • find
  • grep
  • lookup
  • none

Question 25

Question
When fork() is given
Answer
  • It creats a child process
  • Allocate slot in process table
  • returns 0 to parent & ID to child
  • All of the above
Show full summary Hide full summary

Want to create your own Quizzes for free with GoConqr? Learn more.

Similar

Computing Hardware - CPU and Memory
ollietablet123
SFDC App Builder 2
Parker Webb-Mitchell
Data Types
Jacob Sedore
Intake7 BIM L1
Stanley Chia
Software Processes
Nurul Aiman Abdu
Design Patterns
Erica Solum
CCNA Answers – CCNA Exam
Abdul Demir
Abstraction
Shannon Anderson-Rush
Spyware
Sam2
HTTPS explained with Carrier Pigeons
Shannon Anderson-Rush
Data Analytics
anelvr
Browse Library