Which of the following is true about data parallelism or task parallelism?

DP divides data into subsets, w/ multiple threads doing same action on each

With respect to paged memory management, an inverted page table

only addresses the physical memory

For purposes of comparing CPU scheduling strategies, select the most correct statement below

response time is time from when a process enters system til first execution

A relationship between processes and threads is:

multiple threads may share data from a single process

Interprocess communication (IPC) supports system operations by:

providing a system of data sharing between two processes

For purposes of process states,

a process can change from Running or Waiting as a result of an interrupt

Considering user-level threads and kernel-level threads, identify the correct statement:

there is no limit to the number of user level threads

Consider the graphic provided below. Select the most correct statement related to this set of operations

no scheduling actions are shown in this graphic

For purposes of comparing CPU scheduling strategies, select the most correct statement below

waiting time is the total time an uncompleted process is not in the CPU

From the perspective of the computing system, the OS must

Optimize the use of the system resources

The most important task an OS must execute is

Protect the computer hardware from misuse

For purposes of kernel and user modes,

a memory access is likely a kernel mode operation

With respect to CPU operations, memory stall is the condition

where the CPU cannot access the memory in a given period of time

With consideration for the OS kernel,

the kernel is constantly running during system operations

For memory access operations,

total range of accessible memory is sum of the base value plus limit value

For purposes of memory addressing

physical address is generated by MMU, logical address is generated by CPU

Which of the following statements is true regarding user-level threads and kernel-level threads?

Kernel is unaware of user-level threads, but aware of kernel-level threads.

Which of the following is not true about thread pool

Makes it difficult for programmers to manager threads

With respect to paged memory management,

a page is an organizational structure, a frame is in physical memory

Identify the values printed at lines A, B, C, and D. (pids of the parent and child are 2600 and 2603)

Item A = 0, Item B = 2603, Item C = 2603, Item D = 2600

For purposes of memory allocation in a process,

dynamically allocated data is managed in the "Heap" section

From the following, select the most correct statement about this plot

A given CPU might have more short burst durations than long burst durations

The primary value of a process, as used in an OS is:

System and user processes appear the same to the system

For purposes of comparing CPU scheduling strategies, select the most correct statement below

wide variety of burst times, RR will likely have higher wait times vs SJF

Storage characteristics are generally found as follows:

As the amount of storage increases, speed decreases and cost decreases

For purposes of comparing CPU scheduling strategies, select the most INCORRECT statement below

The effectiveness of any one scheduling strategy can be accurately analyzed

The relationship between a trap and a hardware interrupt is

trap is software interrupt, hardware interrupt is sent along the system bus

The context of a given process:

only changes when the process is in the running state

Identify the effect of allowing two entries in a page table to point to the same page frame in memory

one page frame can share data although it might not be protected

Parallelization is generally considered to be

ability to break running parts of a program into separate executable parts

From the perspective of the user, the OS must

Make the system as responsive as possible

For purposes of defining what an operating system (OS) is,

operating systems are difficult to clearly define or specify

For purposes of process states,

a process in Running state may be moved to more than one other state

A logical address space of 64 pages of 1,024 words each, mapped onto a physical memory of 32 frames.

the logical address has 16 bits, the physical address has 15 bits

best: 358kb in 750kb, worst: 358kb in 600kb

With consideration for concurrency and parallelism,

concurrency can exist without parallelism

studbud

CS480 Midterm

63 termsStudBud Administration

Imported from external platform

Flashcards63 cardsFPractice quizPHost liveL

Questions 63

Answers

1
Which of the following is true about data parallelism or task parallelism?
TP involves dividing data into subsets and performing same action on each
DP involves different threads performing different tasks on the same data
Task parallelism requires all threads to work on different sets of data
DP divides data into subsets, w/ multiple threads doing same action on each
2
Consider the following code segment:
Value A = 0, Value B = 5
Value A = 5, Value B = 0
Value A = 0, Value B = 0
Value A = 5, Value B = 5
3
With respect to paged memory management, an inverted page table
allows each PCB to access one or more page tables
only addresses the physical memory
allows each PCB to access one page
only addresses the logical memory
4
For purposes of comparing CPU scheduling strategies, select the most correct statement below
CPU utilization is the rate or number of CPU cycles per second
response time is time from when a process enters system til first execution
turnaround time is the time a context switch takes
throughput is the rate or number of context switches per second
5
A relationship between processes and threads is:
processes may share data with a given thread
threads are executable code but may not contain their own data
multiple threads may share data from a single process
several threads may share data from several processes
6
Considering creation of multiple threads
synchronous threads do not wait for child process
Asynchronous threads wait for child process
there is no data sharing is present in synchronous threads
Asynchronous are independent
7
Interprocess communication (IPC) supports system operations by:
providing a system of message-passing between a process and OS
providing a system of independent processes to the operating system
providing a system of cooperation between any given process and the OS
providing a system of data sharing between two processes
8
For purposes of process states,
a process can change from Running or Waiting as a result of an interrupt
a process can change from Ready or Running as a result of an interrupt
a process can change states from New or Ready as a result of an interrupt
a process can change from New or Terminated as a result of an interrupt
9
Consider the following code segment:
five processes, fourteen threads
four processes, ten threads
four processes, eight threads
five processes, eleven threads
10
Considering user-level threads and kernel-level threads, identify the correct statement:
the kernel recognizes user level threads
kernel level threads are limited to no more than 8 (2^3 )
the kernel may not recognize kernel level threads
there is no limit to the number of user level threads
11
Consider the graphic provided below. Select the most correct statement related to this set of operations
no scheduling actions are shown in this graphic
there are three context switches shown in this graphic
the graphic shows an example of SJF scheduling
no context switching is shown in this graphic
12
Including the initial parent process, select the number of processes created by the program shown below?
5
32
16
8
13
For purposes of comparing CPU scheduling strategies, select the most correct statement below
waiting time is the total time it takes for a series of processes to finish
waiting time is the total time an uncompleted process is not in the CPU
waiting time is the time an process takes until it first enters the CPU
waiting time is the total time a CPU is not actually executing a process
14
From the perspective of the computing system, the OS must
Maximize the CPU speed for best program performance
Optimize the use of the system resources
Support optimized system access to running programs including the OS itself
Provide responsive input and output (I/O) to users and programs
15
The most important task an OS must execute is
Provide access to hard drive or other data
Protect the computer hardware from misuse
Display information to the user
Allow for various input or output operations
16
Select the circumstances under which the line of code marked printf("LINE J") in the code below would be reached
if this is the child function
the line will not be reached
if this is either the parent or the child function
if this is the parent function
17
For purposes of kernel and user modes,
a memory access is likely a kernel mode operation
driver/controller access to a hard drive is most likely user mode operation
a screen or command line display is likely a kernel mode operation
a mouse click is most likely a kernel mode operation
18
With respect to CPU operations, memory stall is the condition
where memory cannot access the CPU in a given period of time
where the cache cannot access the memory in a given period of time
where the memory cannot access the cache in a given period of time
where the CPU cannot access the memory in a given period of time
19
With consideration for the OS kernel,
the kernel is constantly running during system operations
the kernel is only used for low-level operations of the computing system
the kernel is the primary management tool for executing program operations
the kernel is not always necessary for some system operations
20
A fork function call returns:
zero (0) to the child function
zero (0) to both the parent and child function
the child’s pid to the child function
zero (0) to the parent function
21
Identify a programming example in which multithreading does NOT provide better performance than single-threading
A matrix multiplication program
A command-line interpreter
A web server
A word processing program
22
For memory access operations,
the MMU must access memory starting at the offset value
total range of accessible memory is sum of the base value plus limit value
the total range of accessible memory is only the limit value
MMU must access memory starting with the base and ending with the offset
23
Race condition is observed in
Sandbox
Java
Posix threads
JVM
24
With respect to memory management, swapping allows system memory
to be backed up in real time
to be directly accessed using fixed physical addresses
to be directly accessed using CPU-generated logical addresses
to appear infinite
25
For purposes of memory addressing
physical address is generated by MMU, logical address is generated by CPU
both the logical and physical addresses are generated by the CPU
logical address is generated by MMU, physical address is generated by CPU
both the logical and physical addresses are generated by the MMU
26
Which of the following statements is true regarding user-level threads and kernel-level threads?
User-level are managed by kernel, while kernel-level are managed by the app
Kernel is unaware of user-level threads, but aware of kernel-level threads.
Both user-level and kernel-level threads are unknown to the kernel.
The kernel is aware of both user-level and kernel-level threads.
27
Which of the following is not true about thread pool
Programmers need not manage creation or synchronization of threads
Makes it difficult for programmers to manager threads
Faster
creates and stores threads ina pool and helps reuse threads
28
With respect to paged memory management,
a page is an organizational structure, a frame is in physical memory
a page is a location in physical memory, a frame is in cache
a page is a location in CPU memory, a frame is in physical memory
a frame is an organizational structure, a page is in CPU memory
29
Identify the values printed at lines A, B, C, and D. (pids of the parent and child are 2600 and 2603)
Item A = 0, Item B = 2603, Item C = 2603, Item D = 2600
Item A = 2600, Item B = 2603, Item C = 2600, Item D = 2603
Item A = 2603, Item B = 2603, Item C = 2600, Item D = 0
Item A = 2600, Item B = 2600, Item C = 0, Item D = 2603
30
Using the program shown below, select the correct LINE A output
15
0
5
20
31
From the code below, select the correct output for either child process or parent process
forkResult = 0: 0, -1, -2, -3, -4
forkResult = 0: 1, 2, 4, 9, 16
forkResult > 0: 0, -1, -4, -9, -16
forkResult > 0: 0, 1, 2, 3, 4
32
For purposes of memory allocation in a process,
dynamically allocated data is managed in either "Data" or "Stack" section
dynamically allocated data is managed in the "Data" section
dynamically allocated data is managed in the "Heap" section
dynamically allocated data is managed in the "Stack" section
33
From the following, select the most correct statement about this plot
A given CPU might have more short burst durations than long burst durations
A CPU has high freq. cycles before it settles down to lower freq. cycles
A given CPU has many more low freq. cycles than it has higher freq. cycles
A given CPU has more high freq. bursts than lower freq. bursts
34
The primary value of a process, as used in an OS is:
System and user processes appear the same to the system
Kernel processes must be distinctly different from user processes
User programs are loaded into the system differently than processes
System operations are not considered to be processes, only user programs
35
For purposes of comparing CPU scheduling strategies, select the most correct statement below
equal burst times, FCFS will likely have better response time than Priority
equal burst times, SJF will likely have better throughput than FCFS
wide variety of burst times, RR will likely have higher wait times vs SJF
wide variety of burst times, FCFS will likely have lower wait times vs SJF
36
Storage characteristics are generally found as follows:
As speed of storage increases, cost decreases and amount of storage decreas
As speed of storage decreases, cost decreases and amount of storage decreas
As the amount of storage increases, speed decreases and cost decreases
As the amount of storage increases, the speed increases and cost decreases
37
For purposes of comparing CPU scheduling strategies, select the most INCORRECT statement below
Scheduling strategies do not change the throughput
The effectiveness of analyzing CPU strategies is theoretical
Scheduling strategies cannot be accurately compared to each other
The effectiveness of any one scheduling strategy can be accurately analyzed
38
A process control block (PCB) will NOT manage which of the following:
hard drive state data
processor register data
file I/O data
memory management data
39
The relationship between a trap and a hardware interrupt is
trap is reported as error, where hardware interrupt isn't always reported
they are the same thing
trap is a software interrupt and a hardware interrupt indicates exception
trap is software interrupt, hardware interrupt is sent along the system bus
40
The context of a given process:
only changes when the process is in the ready state
can change while the process is idle
only changes when the process is in the running state
only changes when the process is in the waiting/blocked state
41
Identify the effect of allowing two entries in a page table to point to the same page frame in memory
one page frame can share data although it might not be protected
one page frame can be used until a second has acquired the duplicate data
one page frame may hold two copies of data to be accessed 2+ processes
one page frame could provide access to another frame with duplicate data
42
Parallelization is generally considered to be
ability of a program to divide data into parallel/fractional component sets
ability of the operating system to manage all processes at the same time
ability to break running parts of a program into separate executable parts
ability to run several programs at the same time
43
Including the initial parent process, select the correct total number of processes from the following code.
4
8
16
3
44
From the perspective of the user, the OS must
Make the system as responsive as possible
Run the CPU as fast as possible
Support the fastest memory access
Support the fastest input or output (I/O) operations
45
In fork-join model the parent thread creates child thread but does not wait for child thread to finish
True
False
46
For purposes of defining what an operating system (OS) is,
in general, all operating systems can be defined or specified for all apps
specialized operating systems are difficult to define or specify
operating systems are difficult to clearly define or specify
an operating system can be specified for all general purpose operations
47
For purposes of process states,
a process in Waiting state is released to Ready state when queue has room
a process in Running state may be moved to more than one other state
a process in Ready state is moved to Running state when an interrupt occurs
a process in New state is always directly admitted to the Running state
48
A logical address space of 64 pages of 1,024 words each, mapped onto a physical memory of 32 frames.
the logical address has 14 bits, the physical address has 10 bits
the logical address has 16 bits, the physical address has 15 bits
the logical address has 12 bits, the physical address has 5 bits
the logical address has 6 bits, the physical address has 10 bits
49
From the following select the reason why page sizes always powers of 2
original designers used powers of two to simplify addressing
a bit always has two states
original designers developed physical memory organized by powers of two
a bit address is always a power of two
50
Given...
best: 358kb in 750kb, worst: 358kb in 600kb
first: 375kb in 392kb, worst: 375kb in 750kb
first: 500kb in 635kb, best: 500kb in 750kb
first: 115kb in 135kb, worst: 115kb in 300kb
51
With consideration for concurrency and parallelism,
parallelism can exist without concurrency
implementing concurrency requires parallelism
concurrency and parallelism are the same thing
concurrency can exist without parallelism
52
Identify the difference between initiating a thread vs initiating a process
a thread can use data initialized by the process
a thread must duplicate the process data on which it will be working
generally, process initialization is faster than thread initialization
a thread does not initialize its own data
53
With consideration for multithreading models,
it is possible to have more kernel th but not possible to have more user th
when there is only one kernel thread(for a process) parallelism is possible
A given user thread must only access one kind of kernel thread
a given user thread may only access one kind of kernel thread
54
For purposes of comparing CPU scheduling strategies, select the most correct statement below
a system using FCFS or Round Robin is more likely to experience starvation
a system using Priority or SJF is more likely to experience starvation
55
From the following components of program state, identify the one shared across threads in a multithreaded process.
variables in function scope
register variables
stack memory
global variables
56
What happens immediately after a process has been removed from a CPU (i.e., during a context switch)?
The next process’ context is loaded
An interrupt occurs
The operating system is called
The CPU is idle
57
With consideration for two-level model
it is a direct mapping model
it is a one to one model where one one mapping exists for all threads
it does not have parallelism
It is a many to many model where one to one mapping exists for some threads
58
The best way to manage memory stall is to
add faster memory to the motherboard
speed up the system memory
add faster memory to the CPU chip
speed up the bus access to the system memory
59
For conditions related to CPU scheduling strategies, select the most correct statement below
quantum time can only be used with FCFS or Round Robin strategies
quantum time is only used in preemptive systems
quantum time is no longer used on modern computers
quantum time is only used in non-preemptive systems
60
The von Neumann computer structure is best explained as
executable code is stored in high memory and data is stored in low memory
the executable code and data storage reside in the same area of memory
the executable code and data storage reside in separate areas of memory
executable code and data storage are functionally the same in any storage
61
Assuming a 1-KB page size, select the correct page number and offset for the address reference 42095
page: 41, offset 111
page 39, offset 13
page 40, offset 161
page: 42, offset: 095
62
With respect to paged memory management
to find the page number, the logical address is divided by the page size
to find the offset, the logical address is subtracted from the page size
to find the page number, the logical address is added to the page size
to find the offset, the logical address is multiplied by the page size
63
From the following, select the most correct statement related to when CPU scheduling decisions may take place
when a process switches to running from new, or when it enters the system
when a process switches to waiting from running, or to ready from waiting
when a process switches to waiting from ready, or to running from waiting
when a process switches to waiting from ready, or when it terminates

CS480 Midterm Flashcards | StudBud

CS480 Midterm

63 termsStudBud Administration

Imported from external platform

Flashcards63 cardsFPractice quizPHost liveL

Questions 63

Answers

1
Which of the following is true about data parallelism or task parallelism?
TP involves dividing data into subsets and performing same action on each
DP involves different threads performing different tasks on the same data
Task parallelism requires all threads to work on different sets of data
DP divides data into subsets, w/ multiple threads doing same action on each
2
Consider the following code segment:
Value A = 0, Value B = 5
Value A = 5, Value B = 0
Value A = 0, Value B = 0
Value A = 5, Value B = 5
3
With respect to paged memory management, an inverted page table
allows each PCB to access one or more page tables
only addresses the physical memory
allows each PCB to access one page
only addresses the logical memory
4
For purposes of comparing CPU scheduling strategies, select the most correct statement below
CPU utilization is the rate or number of CPU cycles per second
response time is time from when a process enters system til first execution
turnaround time is the time a context switch takes
throughput is the rate or number of context switches per second
5
A relationship between processes and threads is:
processes may share data with a given thread
threads are executable code but may not contain their own data
multiple threads may share data from a single process
several threads may share data from several processes
6
Considering creation of multiple threads
synchronous threads do not wait for child process
Asynchronous threads wait for child process
there is no data sharing is present in synchronous threads
Asynchronous are independent
7
Interprocess communication (IPC) supports system operations by:
providing a system of message-passing between a process and OS
providing a system of independent processes to the operating system
providing a system of cooperation between any given process and the OS
providing a system of data sharing between two processes
8
For purposes of process states,
a process can change from Running or Waiting as a result of an interrupt
a process can change from Ready or Running as a result of an interrupt
a process can change states from New or Ready as a result of an interrupt
a process can change from New or Terminated as a result of an interrupt
9
Consider the following code segment:
five processes, fourteen threads
four processes, ten threads
four processes, eight threads
five processes, eleven threads
10
Considering user-level threads and kernel-level threads, identify the correct statement:
the kernel recognizes user level threads
kernel level threads are limited to no more than 8 (2^3 )
the kernel may not recognize kernel level threads
there is no limit to the number of user level threads
11
Consider the graphic provided below. Select the most correct statement related to this set of operations
no scheduling actions are shown in this graphic
there are three context switches shown in this graphic
the graphic shows an example of SJF scheduling
no context switching is shown in this graphic
12
Including the initial parent process, select the number of processes created by the program shown below?
5
32
16
8
13
For purposes of comparing CPU scheduling strategies, select the most correct statement below
waiting time is the total time it takes for a series of processes to finish
waiting time is the total time an uncompleted process is not in the CPU
waiting time is the time an process takes until it first enters the CPU
waiting time is the total time a CPU is not actually executing a process
14
From the perspective of the computing system, the OS must
Maximize the CPU speed for best program performance
Optimize the use of the system resources
Support optimized system access to running programs including the OS itself
Provide responsive input and output (I/O) to users and programs
15
The most important task an OS must execute is
Provide access to hard drive or other data
Protect the computer hardware from misuse
Display information to the user
Allow for various input or output operations
16
Select the circumstances under which the line of code marked printf("LINE J") in the code below would be reached
if this is the child function
the line will not be reached
if this is either the parent or the child function
if this is the parent function
17
For purposes of kernel and user modes,
a memory access is likely a kernel mode operation
driver/controller access to a hard drive is most likely user mode operation
a screen or command line display is likely a kernel mode operation
a mouse click is most likely a kernel mode operation
18
With respect to CPU operations, memory stall is the condition
where memory cannot access the CPU in a given period of time
where the cache cannot access the memory in a given period of time
where the memory cannot access the cache in a given period of time
where the CPU cannot access the memory in a given period of time
19
With consideration for the OS kernel,
the kernel is constantly running during system operations
the kernel is only used for low-level operations of the computing system
the kernel is the primary management tool for executing program operations
the kernel is not always necessary for some system operations
20
A fork function call returns:
zero (0) to the child function
zero (0) to both the parent and child function
the child’s pid to the child function
zero (0) to the parent function
21
Identify a programming example in which multithreading does NOT provide better performance than single-threading
A matrix multiplication program
A command-line interpreter
A web server
A word processing program
22
For memory access operations,
the MMU must access memory starting at the offset value
total range of accessible memory is sum of the base value plus limit value
the total range of accessible memory is only the limit value
MMU must access memory starting with the base and ending with the offset
23
Race condition is observed in
Sandbox
Java
Posix threads
JVM
24
With respect to memory management, swapping allows system memory
to be backed up in real time
to be directly accessed using fixed physical addresses
to be directly accessed using CPU-generated logical addresses
to appear infinite
25
For purposes of memory addressing
physical address is generated by MMU, logical address is generated by CPU
both the logical and physical addresses are generated by the CPU
logical address is generated by MMU, physical address is generated by CPU
both the logical and physical addresses are generated by the MMU
26
Which of the following statements is true regarding user-level threads and kernel-level threads?
User-level are managed by kernel, while kernel-level are managed by the app
Kernel is unaware of user-level threads, but aware of kernel-level threads.
Both user-level and kernel-level threads are unknown to the kernel.
The kernel is aware of both user-level and kernel-level threads.
27
Which of the following is not true about thread pool
Programmers need not manage creation or synchronization of threads
Makes it difficult for programmers to manager threads
Faster
creates and stores threads ina pool and helps reuse threads
28
With respect to paged memory management,
a page is an organizational structure, a frame is in physical memory
a page is a location in physical memory, a frame is in cache
a page is a location in CPU memory, a frame is in physical memory
a frame is an organizational structure, a page is in CPU memory
29
Identify the values printed at lines A, B, C, and D. (pids of the parent and child are 2600 and 2603)
Item A = 0, Item B = 2603, Item C = 2603, Item D = 2600
Item A = 2600, Item B = 2603, Item C = 2600, Item D = 2603
Item A = 2603, Item B = 2603, Item C = 2600, Item D = 0
Item A = 2600, Item B = 2600, Item C = 0, Item D = 2603
30
Using the program shown below, select the correct LINE A output
15
0
5
20
31
From the code below, select the correct output for either child process or parent process
forkResult = 0: 0, -1, -2, -3, -4
forkResult = 0: 1, 2, 4, 9, 16
forkResult > 0: 0, -1, -4, -9, -16
forkResult > 0: 0, 1, 2, 3, 4
32
For purposes of memory allocation in a process,
dynamically allocated data is managed in either "Data" or "Stack" section
dynamically allocated data is managed in the "Data" section
dynamically allocated data is managed in the "Heap" section
dynamically allocated data is managed in the "Stack" section
33
From the following, select the most correct statement about this plot
A given CPU might have more short burst durations than long burst durations
A CPU has high freq. cycles before it settles down to lower freq. cycles
A given CPU has many more low freq. cycles than it has higher freq. cycles
A given CPU has more high freq. bursts than lower freq. bursts
34
The primary value of a process, as used in an OS is:
System and user processes appear the same to the system
Kernel processes must be distinctly different from user processes
User programs are loaded into the system differently than processes
System operations are not considered to be processes, only user programs
35
For purposes of comparing CPU scheduling strategies, select the most correct statement below
equal burst times, FCFS will likely have better response time than Priority
equal burst times, SJF will likely have better throughput than FCFS
wide variety of burst times, RR will likely have higher wait times vs SJF
wide variety of burst times, FCFS will likely have lower wait times vs SJF
36
Storage characteristics are generally found as follows:
As speed of storage increases, cost decreases and amount of storage decreas
As speed of storage decreases, cost decreases and amount of storage decreas
As the amount of storage increases, speed decreases and cost decreases
As the amount of storage increases, the speed increases and cost decreases
37
For purposes of comparing CPU scheduling strategies, select the most INCORRECT statement below
Scheduling strategies do not change the throughput
The effectiveness of analyzing CPU strategies is theoretical
Scheduling strategies cannot be accurately compared to each other
The effectiveness of any one scheduling strategy can be accurately analyzed
38
A process control block (PCB) will NOT manage which of the following:
hard drive state data
processor register data
file I/O data
memory management data
39
The relationship between a trap and a hardware interrupt is
trap is reported as error, where hardware interrupt isn't always reported
they are the same thing
trap is a software interrupt and a hardware interrupt indicates exception
trap is software interrupt, hardware interrupt is sent along the system bus
40
The context of a given process:
only changes when the process is in the ready state
can change while the process is idle
only changes when the process is in the running state
only changes when the process is in the waiting/blocked state
41
Identify the effect of allowing two entries in a page table to point to the same page frame in memory
one page frame can share data although it might not be protected
one page frame can be used until a second has acquired the duplicate data
one page frame may hold two copies of data to be accessed 2+ processes
one page frame could provide access to another frame with duplicate data
42
Parallelization is generally considered to be
ability of a program to divide data into parallel/fractional component sets
ability of the operating system to manage all processes at the same time
ability to break running parts of a program into separate executable parts
ability to run several programs at the same time
43
Including the initial parent process, select the correct total number of processes from the following code.
4
8
16
3
44
From the perspective of the user, the OS must
Make the system as responsive as possible
Run the CPU as fast as possible
Support the fastest memory access
Support the fastest input or output (I/O) operations
45
In fork-join model the parent thread creates child thread but does not wait for child thread to finish
True
False
46
For purposes of defining what an operating system (OS) is,
in general, all operating systems can be defined or specified for all apps
specialized operating systems are difficult to define or specify
operating systems are difficult to clearly define or specify
an operating system can be specified for all general purpose operations
47
For purposes of process states,
a process in Waiting state is released to Ready state when queue has room
a process in Running state may be moved to more than one other state
a process in Ready state is moved to Running state when an interrupt occurs
a process in New state is always directly admitted to the Running state
48
A logical address space of 64 pages of 1,024 words each, mapped onto a physical memory of 32 frames.
the logical address has 14 bits, the physical address has 10 bits
the logical address has 16 bits, the physical address has 15 bits
the logical address has 12 bits, the physical address has 5 bits
the logical address has 6 bits, the physical address has 10 bits
49
From the following select the reason why page sizes always powers of 2
original designers used powers of two to simplify addressing
a bit always has two states
original designers developed physical memory organized by powers of two
a bit address is always a power of two
50
Given...
best: 358kb in 750kb, worst: 358kb in 600kb
first: 375kb in 392kb, worst: 375kb in 750kb
first: 500kb in 635kb, best: 500kb in 750kb
first: 115kb in 135kb, worst: 115kb in 300kb
51
With consideration for concurrency and parallelism,
parallelism can exist without concurrency
implementing concurrency requires parallelism
concurrency and parallelism are the same thing
concurrency can exist without parallelism
52
Identify the difference between initiating a thread vs initiating a process
a thread can use data initialized by the process
a thread must duplicate the process data on which it will be working
generally, process initialization is faster than thread initialization
a thread does not initialize its own data
53
With consideration for multithreading models,
it is possible to have more kernel th but not possible to have more user th
when there is only one kernel thread(for a process) parallelism is possible
A given user thread must only access one kind of kernel thread
a given user thread may only access one kind of kernel thread
54
For purposes of comparing CPU scheduling strategies, select the most correct statement below
a system using FCFS or Round Robin is more likely to experience starvation
a system using Priority or SJF is more likely to experience starvation
55
From the following components of program state, identify the one shared across threads in a multithreaded process.
variables in function scope
register variables
stack memory
global variables
56
What happens immediately after a process has been removed from a CPU (i.e., during a context switch)?
The next process’ context is loaded
An interrupt occurs
The operating system is called
The CPU is idle
57
With consideration for two-level model
it is a direct mapping model
it is a one to one model where one one mapping exists for all threads
it does not have parallelism
It is a many to many model where one to one mapping exists for some threads
58
The best way to manage memory stall is to
add faster memory to the motherboard
speed up the system memory
add faster memory to the CPU chip
speed up the bus access to the system memory
59
For conditions related to CPU scheduling strategies, select the most correct statement below
quantum time can only be used with FCFS or Round Robin strategies
quantum time is only used in preemptive systems
quantum time is no longer used on modern computers
quantum time is only used in non-preemptive systems
60
The von Neumann computer structure is best explained as
executable code is stored in high memory and data is stored in low memory
the executable code and data storage reside in the same area of memory
the executable code and data storage reside in separate areas of memory
executable code and data storage are functionally the same in any storage
61
Assuming a 1-KB page size, select the correct page number and offset for the address reference 42095
page: 41, offset 111
page 39, offset 13
page 40, offset 161
page: 42, offset: 095
62
With respect to paged memory management
to find the page number, the logical address is divided by the page size
to find the offset, the logical address is subtracted from the page size
to find the page number, the logical address is added to the page size
to find the offset, the logical address is multiplied by the page size
63
From the following, select the most correct statement related to when CPU scheduling decisions may take place
when a process switches to running from new, or when it enters the system
when a process switches to waiting from running, or to ready from waiting
when a process switches to waiting from ready, or to running from waiting
when a process switches to waiting from ready, or when it terminates