IT 342 Exam 2 Questions And Answers |
Guaranteed Success 2024|2025
KLT CORRECT ANSWERS Kernel Level thread, Managed by Kernel and done by
system calls
Multithreaded CORRECT ANSWERS Ability of an OS to support multiple threads for a
program, essentially dividing a program's tasks into subtasks such as a word program
that saves input, checks grammar and spelling, and backup all at the same time
Thread Control Block CORRECT ANSWERS Holds pointer info to PCB, saves CPU
state of thread if interrupted, holds information about thread needed to manage it
Light Weighted Process CORRECT ANSWERS A process that runs multiple user
threads
Thread CORRECT ANSWERS Smallest sequence of programming instructions that can
be managed independently by a scheduler
ULT CORRECT ANSWERS User Level Thread that is in user space and is managed by
the application /implemented by thread library
Motivation behind the concept of thread CORRECT ANSWERS To divide a task into
multiple subtasks
Reasons of Multithreading CORRECT ANSWERS To run tasks simultaneously for a
program so they wouldn't have to wait
Thread Implementation CORRECT ANSWERS Either KLT, ULT, or Hybrid
Thread Management CORRECT ANSWERS Execution state, saved thread context,
execution stack, access to process resources
Thread Synchronization CORRECT ANSWERS When threads share same address
space and other resources and can be affected if any alteration happens to a resource
of one thread
Resource Ownership CORRECT ANSWERS Resources of a thread remain with the
thread
Difference between ULT and KLT? CORRECT ANSWERS KLT supports parallelism
allowing more than one thread of a process to be executed
, Advantages of Multithreading? CORRECT ANSWERS More performance, low
overhead, resource sharing, efficient communications
How are Threads assigned to hyperthreaded CPUs? CORRECT ANSWERS By the
scheduler
Why is it cheaper to switch between thread than between processes? CORRECT
ANSWERS They are more easily managed, resources are shared, control blocks are
larger, easier memory management, TCB MEMORY AND RESOURCES ARE SHARED
THEREFORE EASIER AND CHEAPER
Scheduling CORRECT ANSWERS Switching the CPU among multiple processes
Multiprogramming CORRECT ANSWERS When CPU runs multiple programs at once
rather than in sequence
Preemptive CORRECT ANSWERS Switching from one process to another before it
finishes
First Come First Served CORRECT ANSWERS Processes are done on first come first
serve basis
Shortest Job First CORRECT ANSWERS Not preemptive but runs processes with the
smallest cpu burst time, still has a queue and looks at what is shortest is the queue
Shortest Remaining Time CORRECT ANSWERS Preemptive, similar to SJF but can
interrupt the queue if one process is shorter than another
Priority CORRECT ANSWERS Selecting process with highest priority
Aging CORRECT ANSWERS When priority is increased as length of waiting increases
Round Robin CORRECT ANSWERS Processes run for certain time quanta then enter
the back of queue, preemptive
Quantum CORRECT ANSWERS Amount of time a process is allowed to run in a
preemptive process scheduler
Multilevel Queue CORRECT ANSWERS Separate queues for each group of processes,
each queue can have a different scheduling algorithm
Multilevel Feedback CORRECT ANSWERS Multiple queues that each have a time
quanta, once a process is finished with one queue after being executed once it moves
onto the next until all processes are finished
Guaranteed Success 2024|2025
KLT CORRECT ANSWERS Kernel Level thread, Managed by Kernel and done by
system calls
Multithreaded CORRECT ANSWERS Ability of an OS to support multiple threads for a
program, essentially dividing a program's tasks into subtasks such as a word program
that saves input, checks grammar and spelling, and backup all at the same time
Thread Control Block CORRECT ANSWERS Holds pointer info to PCB, saves CPU
state of thread if interrupted, holds information about thread needed to manage it
Light Weighted Process CORRECT ANSWERS A process that runs multiple user
threads
Thread CORRECT ANSWERS Smallest sequence of programming instructions that can
be managed independently by a scheduler
ULT CORRECT ANSWERS User Level Thread that is in user space and is managed by
the application /implemented by thread library
Motivation behind the concept of thread CORRECT ANSWERS To divide a task into
multiple subtasks
Reasons of Multithreading CORRECT ANSWERS To run tasks simultaneously for a
program so they wouldn't have to wait
Thread Implementation CORRECT ANSWERS Either KLT, ULT, or Hybrid
Thread Management CORRECT ANSWERS Execution state, saved thread context,
execution stack, access to process resources
Thread Synchronization CORRECT ANSWERS When threads share same address
space and other resources and can be affected if any alteration happens to a resource
of one thread
Resource Ownership CORRECT ANSWERS Resources of a thread remain with the
thread
Difference between ULT and KLT? CORRECT ANSWERS KLT supports parallelism
allowing more than one thread of a process to be executed
, Advantages of Multithreading? CORRECT ANSWERS More performance, low
overhead, resource sharing, efficient communications
How are Threads assigned to hyperthreaded CPUs? CORRECT ANSWERS By the
scheduler
Why is it cheaper to switch between thread than between processes? CORRECT
ANSWERS They are more easily managed, resources are shared, control blocks are
larger, easier memory management, TCB MEMORY AND RESOURCES ARE SHARED
THEREFORE EASIER AND CHEAPER
Scheduling CORRECT ANSWERS Switching the CPU among multiple processes
Multiprogramming CORRECT ANSWERS When CPU runs multiple programs at once
rather than in sequence
Preemptive CORRECT ANSWERS Switching from one process to another before it
finishes
First Come First Served CORRECT ANSWERS Processes are done on first come first
serve basis
Shortest Job First CORRECT ANSWERS Not preemptive but runs processes with the
smallest cpu burst time, still has a queue and looks at what is shortest is the queue
Shortest Remaining Time CORRECT ANSWERS Preemptive, similar to SJF but can
interrupt the queue if one process is shorter than another
Priority CORRECT ANSWERS Selecting process with highest priority
Aging CORRECT ANSWERS When priority is increased as length of waiting increases
Round Robin CORRECT ANSWERS Processes run for certain time quanta then enter
the back of queue, preemptive
Quantum CORRECT ANSWERS Amount of time a process is allowed to run in a
preemptive process scheduler
Multilevel Queue CORRECT ANSWERS Separate queues for each group of processes,
each queue can have a different scheduling algorithm
Multilevel Feedback CORRECT ANSWERS Multiple queues that each have a time
quanta, once a process is finished with one queue after being executed once it moves
onto the next until all processes are finished
