In Kernel level threads, the kernel can schedule another thread of the same process if a thread is blocked.
Question 1 options:
True
False
Question 2 (2 points)
Listen
A process may have one or more threads running in the context of the process
Question 2 options:
True
False
Question 3 (2 points)
Listen
Multiple processes in a uniprocessor is known as ___
Question 3 options:
distributed processing
multiprogramming
multiprocessing
Question 4 (2 points)
Listen
Access time for disk transfer includes seek time and rotational delay.
Question 4 options:
True
False
Question 5 (2 points)
Listen
Operating systems are software executed by the processor (similar to other computer software)
Question 5 options:
True
False
Question 6 (2 points)
Listen
When swapping pages, precleaning writes out batches of modified pages.
Question 6 options:
True
False
Question 7 (2 points)
Listen
The I/O scheduling algorithm in which requests are processed in the current direction of arm movement until the arm reaches the edge of the disk then requests are processed in opposite direction is ________
Question 7 options:
FSCAN
Elevator ( SCAN )
Shortest Seek Time First
First In First Out
Question 8 (2 points)
Listen
Unlike process, threads can only be User level, not Kernel level.
Question 8 options:
True
False
Question 9 (2 points)
Listen
If a User Level Thread executes a system call, it is handled at the process level so all threads are blocked
Question 9 options:
True
False
Question 10 (2 points)
Listen
The partitioning method that results in no internal fragmentation but can cause external fragmentation is _____
Question 10 options:
simple segmentation
simple paging
Question 11 (2 points)
Listen
In block devices, buffering is used to speed up transfer.
Question 11 options:
True
False
Question 12 (2 points)
Listen
When a process is in the ___ state it is in secondary memory but is available for execution as soon as it is loaded into main memory.
Question 12 options:
Blocked
Ready
Ready/Suspend
Blocked/Suspend
Question 13 (2 points)
Listen
A physical address is
Question 13 options:
A particular example of logical address, in which the address is expressed as a location relative to some known point
Reference to a memory location independent of the current assignment of data to memory
Actual location in main memory
Question 14 (2 points)
Listen
An example of a stream storage device is a optical drive.
Question 14 options:
True
False
Question 15 (2 points)
Listen
The program counter holds address of the current instruction
Question 15 options:
True
False
Question 16 (2 points)
Listen
___ is when access to critical resource by competing processes is restricted.
Question 16 options:
Atomic operation
Mutual exclusion
Critical section
Starvation
Question 17 (2 points)
Listen
____  prevents one of the three necessary conditions for deadlock occurrence or prevent circular wait
Question 17 options:
Deadlock detection
Deadlock prevention
Deadlock avoidance
Question 18 (2 points)
Listen
___ is when the sequence of instruction is guaranteed to execute as a group, or not execute at all, having no visible effect on system state.
Question 18 options:
Mutual exclusion
Hold and wait
Atomic operation
Starvation
Question 19 (2 points)
Listen
In swapping, the fetch policy that brings clusters of pages, including the referenced page,  into main memory when a reference is made to the page is prepaging.
Question 19 options:
True
False
Question 20 (2 points)
Listen
The software implementation of mutual exclusion which uses a signaling integer to control access to a critical section is
Question 20 options:
monitor
semaphore
Question 21 (2 points)
Listen
Stream device response time and processing speed are generally faster than the block transfer
Question 21 options:
True
False
Question 22 (2 points)
Listen
Which of the following is true about threads?
Question 22 options:
Terminating a thread terminates the process
Threads cannot communicate within a process
To swap a thread, the entire process must be swapped.
Terminating a process terminates all of its threads
Question 23 (2 points)
Listen
 __  transfers data within main memory and external device without needing the CPU
Question 23 options:
DMA
Interrupt I/O
Polling I/O
Question 24 (2 points)
Listen
__  periodically checks interrupt status for the next I/O operation using processor time to do polling
Question 24 options:
DMA
Interrupt I/O
Polling I/O
Question 25 (2 points)
Listen
The pre-emptive scheduling algorithm in which each process is assigned a fixed time quantum using a FIFO ready queue is known as ______
Question 25 options:
Longest Job First (LJF)
Shortest Job First (SJF)
Round Robin
Longest Remaining Time First (LRTF)
First Come First Serve (FCFS)
Question 26 (2 points)
Listen
In the 5 state process model, the next state after Ready state is
Question 26 options:
Exit
New
Running
Blocked
Question 27 (2 points)
Listen
In User Mode, code has unrestricted access to execute any CPU instruction.
Question 27 options:
True
False
Question 28 (2 points)
Listen
Which of the following is not part of the Swapping process?
Question 28 options:
The control tables are updated
The process is put in the Running state
The context of the processor is saved
The process control block is updated
Question 29 (2 points)
Listen
Which of the following are considerations when selecting memory? Select all that apply.
Select 3 correct answer(s)
Question 29 options:
None of the above
Access time
Performance
Cost
Question 30 (2 points)
Listen
The swap replacement policy the replaces the page in memory least often referenced
is _____
Question 30 options:
Least Frequently Used (LFU)
Least Recently Used (LRU)
First In First Out (FIFO)
Last In First Out (LIFO)

Get 24/7 Homework and timed quizzes help from professional tutors! Get answers to In Kernel level threads, the kernel can schedule another thread of the same process if a thread is blocked and other timed quizzes

Answers:

1: true
2:true
3: multiprogramming
4:true
5;true
6: true
7: elevator (scan)
8:true
9:true
10: simple paging

11:true

12: ready/suspend

13: actual location in main memory

14:true

15: false

  1. Mutual exclusion
  2. Deadlock prevention
  3. Atomic operation
  4. Atomic operation
  5. ?? Confirm
  6. false
  7. Terminating a thread terminates the process
  8. DMA
  9. Polling I/O
  10. Round Robin
  11. Running
  12. false
  13. The process is put in the Running state.
  14. Access time, Performance, Cost
  15. Least Frequently Used (LFU)