Quiz
ssss
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (163)
1According to section 5.3 Scheduling Algorithms of our book Operating System Concepts, which of the following is the most complex CPU scheduling algorithm?
- AMultilevel Feedback Queue Scheduling
- BPriority Scheduling
- CRound-Robin Scheduling
- DShortest-Job-First Scheduling
- EFirst-Come, First-Served Scheduling
2ZyBooks 5.3 CS 3113: What is the number of instructions that can be executed within a unit of time at a given clock rate?
- AThroughput
- BTurnaround Time.
- CWaiting Time.
- DResponse Time.
3According to zyBooks CS3113: Introduction to Operating Systems Chapter 6 Section 5, what tool provides atomic operations for basic data types?
- AAtomic Variable
- BMemory Barrier
- CMemory Model
- DEntry Section
- EPeterson's Solution
4According to zyBooks CS3113: Introduction to Operating Systems Chapter 6 Section 9 (Liveness), when a semaphore with a waiting queue is utilized, it is possible for two or more processes to wait endlessly for an event that can be caused by just one of the processes in the waiting queue. What state best describes this phenomenon?
- ADeadlocked State
- BBlocked State
- CState Save
- DPriority inversion
5According to zyBooks CS3113: Introduction to Operating Systems, Chapter 6 Section 6, which of the following is the simplest tool of the higher-level software tools used to solve the critical-section problem?
- AMutex Lock
- BPeterson's Solution
- CAtomic Variable
- DMemory Barriers
- EScrewdriver
6What is a race condition?
- ASeveral processes access and manipulate the same data concurrently, producing unexpected results.
- BThe CPU scheduler switches between tasks with similar predicted run times.
- CA process is switched off the CPU just before it is finished executing to complete another process.
- DMultiple processes track each others progress and increase priority to slower processes.
- EWhen several people agree to see which of them is the fastest.
7According to Dr.Grant's Lecture on October 25, 2022, in Week 10 over Synchronization Tools and Memory Management, and synchronization-tools.pdf, which of the following are all concerns for control problems in COMPETING processes?
- ANeed for mutual exclusion, starvation, deadlock
- BStarvation, deadlock, need for mutual inclusion
- CData coherence, deadlock, starvation
- DDeadlock, busy-waiting, starvation
- ELivelock, starvation, atomic operations
8According to zyBooks Section 6.8 - CS3113, which of the following is NOT a problem that frequently occurs in processes.
- AA process might request access to the incorrect resource.
- BA process might access a resource without first gaining access permission to the resource.
- CA process might never release a resource once it has been granted access to the resource.
- DA process might attempt to release a resource that is never requested.
- EA process might request the same resource twice (without first releasing the resource).
9According to Dr.Grant's ch6.pdf, which of these is a synchronization tool that provides more sophisticated ways for processes to synchronize their activities?
- ASemaphores
- BMutex Locks
- CDeadlock
- DMonitors
- ERace condition
10According to zyBooks CS3113: Introduction to Operating Systems Chapter 9, Section 3 (Contiguous Memory Allocation), which of the following is a type of memory allocation where the smallest hole in memory that is large enough to satisfy the memory request is chosen for the memory request to be allocated into?
- ABest-fit method
- BWorst-fit method
- CFirst-fit method
- DContiguous Memory Allocation method
- ELast-fit method
11According to Dr. Grant's lecture on Oct 25th, what is starvation?
- AWhen a runnable process is not being run because the scheduler keeps prioritizing other processes.
- BWhen multiple threads or processes read and write a shared data item and the final result depends on the relative timing of their execution.
- CWhen all runnable processes are run and there are no more processes to run.
- DWhen two or more processes are unable to proceed because each is waiting for one of the others to do something.
- EWhen a process doesn't get enough string cheese
12According to synchronization-tools.pdf, which of the following is true regarding nonblocking send, blocking receive synchronization?
- ASender continues on but the receiver is blocked until the request message arrives
- BSometimes referred to as a rendevous
- CBoth sender and receiver are blocked until the message is delivered
- DNeither party is required to wait
- EIt solves the halting problem
13According to section 6.5 Synchronization Tools of our book Operating System Concepts - to avoid race conditions, when entering a critical section, what must a thread do?
- AIt must first acquire the mutex lock and then release the mutex lock when exiting a critical section.
- BIt needs to first release the mutex lock and then acquire it.
- CIt only needs to acquire the mutex lock.
- DA thread must only release the mutex lock before entering the critical section.
- EA thread does not need to do anything when entering a critical section.
14According to Dr. Grant's lecture 10/25/2022 in week 10 synchronization-tools.pdf, what is an advantage of special machine instructions?
- AIt can be used to support multiple critical sections.
- BBusy-waiting is employed.
- CStarvation is possible.
- DDeadlock is possible.
- ECarried out atomically (not subject to interruption).
15According to Dr. Grant's Lecture on October 25, 2022 and the synchronization-tools.pdf slides, what datatype does a semaphore value have?
- AInteger
- BVoid
- CChar
- DDouble
- EFloat
16According to the synchronization-tools.pdf file, when it comes to concurrency, what is a not a concern of the operating system?
- AImplementing concurrency on a single or multi processor machine
- BTracking various running processes
- CAllocating and deallocating resources for running processes
- DProtecting data against interference by other processes
- ESpeed should be independent relative to the speed of concurrent processes.
17According to zyBooks CS3113: Introduction to Operating Systems Chapter 6 Section 8, what is a monitor type?
- Aabstract data type
- Bprimitive data type
- Cint
- Dlong
- Eshort
18According to Dr.Grant's Lecture on October 25, 2022, and the synchronization-tools.pdf, what term is best described as "the requirement that when one process is in a critical section that accesses shared resources, no other process may be in a critical section that accesses any of those shared resources"?
- AMutual exclusion
- BRace condition
- CDeadlock
- DLivelock
- EStarvation
19According to Dr. Grant's Lecture on 10/25/22: Lecture 19(Synchronization Tools 1), which is not a difficulty of Concurrency
- AOn average, better response time and performance.
- BSharing of Global Resources.
- CDifficult for the OS to manage the allocation of resources optimally.
- DDifficult to locate programming errors as results are not deterministic and reproducible.
- EDifficult to pronounce.
20According to Dr. Grant's lecture on synchronization tools, what is livelock?
- ALivelock is when two or more processes become unable to proceed by perpetually giving-way to another process.
- BLivelock is when two or more processes become unable to proceed because they are each waiting on a response from the other.
- CLivelock is when a process/portion of a process cannot be broken down into multiple processes/threads.
- DLivelock is when a process is in it ready state, but doesn't ever get chosen by the scheduler.
- ELivelock is when the result of multiple accesses to a shared resource is dependent upon the relative timing of the execution of those accesses.
21According to Dr. Grant's Lecture on 10/27/2022 Lecture 20, Memory Management Technique divides main memory into static partiotions at system generation time?
- AFixed Partitioning
- BDynamic Partitioning
- CSimple Paging
- DProtection
- ESharing
22Which of the following is not a memory management requirement?
- ADynamic Partitioning
- BProtection
- CLogical Organization
- DPhysical Organization
23According to Dr. Grant's lecture on 10/27/2022 and the slide deck memory_management.pdf, which of the following is NOT one of the disadvantages of fixed memory partitioning?
- AFixed partitioning can lead to external fragmentation
- BFixed partitioning can lead to internal fragmentation
- CFixed partition sizes limits the number of available processes
- DFixed partitions can be too small for some programs
24According to memory_management.pdf slide #11, from Week 10. Which of the following memory management techniques has the weakness of producing an overhead of complex memory management?
- AVirtual Memory Paging.
- BSimple Paging.
- CSimple Segmentation.
- DDynamic Partitioning.
- ENext Partitioning.
25According to Dr. Grant's lecture on 10/27/22 over Memory Management, which definition best describes a Segment?
- AA variable-length block of data that resides in secondary memory
- BA fixed length block of data that resides in main memory
- CA fixed length block of data that resides in secondary memory
- DA variable-length block of data that resides in main memory
- EA block of generic memory
26According to Dr.Grant's Week 10 Lecture 19 (Synchronization Tools 1), which concurrency mechanism is a data type that is used to block a process or thread until a particular condition is true?
- ACondition Variable
- BBinary Semaphore
- CEvent Flags
- DSpinlocks
- EDeadlock
27According to Dr. Grant's lecture on October 27 (memory_management), what is memory paging?
- APartitioning memory and processes into smaller equal sized pieces.
- BThe use of semaphores to protect memory modules
- CA specialized placement algorithm
- DA synchronization technique used by the OS
28According Dr Grant's lecture on October 27, which of the following statements is not true regarding memory management?
- AFor fixed partitioning, all partitions are of an equal size.
- BFor dynamic partitioning, a process is loaded into a partition of exactly the same size.
- CFor fixed partitioning, a process is loaded into a static partition of equal or greater size.
- DFor simple paging, a process is divided into equal-sized pages and is loaded by loading all of its pages available
- EFor simple segmentation, A process is loaded by loading all of the segments it has been divided into.
29According to the “synchronization-tools.pdf”, which of the following is not a characteristic of a monitor
- AMultiple process may be executing in the monitor.
- BLocal data variables are accessible only by the monitor’s procedures and not by any external procedure.
- CProcess enters monitor by invoking one of its procedures.
- DOnly one process may be executing in the monitor at a time.
30According to Dr. Grant’s lecture 19 (synchronization tools 1) and synchronization pdf on canvas, which of the following is not a common concurrency mechanism?
- Adeadlock
- Bsemaphore
- CMonitor
- Dcondition variable
- Emutex
31According to the memory_management.pdf from week 10, which is not a part of Addressing Requirements for a Process?
- ARelocation
- BProcess Control Block
- CProgram
- DData
- EStack
32According to zyBooks Section 9.6: Swapping, which of the following does not describe standard swapping?
- AIt must provide direct access to memory images.
- BIt increases the real physical memory of a system
- CIt is a relatively fast process
- DIt involves moving a page from memory to the backing store
- EIt asks applications to voluntarily relinquish allocated memory
33According to Dr. Grant's Lecture on October 25, 2022, What is an Event Flag?
- AA memory word used as a synchronization method between threads.
- BA data type that is used to block a particular process or thread until a particular condition is true.
- CA mutual exclusion mechanism in which a process executes in an infinite loop waiting for the value of a lock variable to indicate availability.
- DA means for two processes to exchange information that may be used for synchronization.
- EA semaphore that takes on only the values 0 and 1.
34Which of the following represents the correct order needed for address translation?
- ACompare the offset, expressed in the rightmost m bits, to the length of the segment. If the offset is greater than or equal to the length, the address is invalid.
- BUse the segment number as an index into the process segment table to find the starting physical address of the segment.
- CExtract the segment number as the leftmost n bits of the logical address.
- DThe desired physical address is the sum of the starting physical address of the segment plus the offset
35According to memory_managment.pdf from Week 10, which of the following best describes Protection in regards to memory management requirements?
- AProcesses acquiring permission to reference memory locations for reading or writing purposes
- BActive processes being swapped in and out of main memory in order to maximize processor utilization
- CAllowing each process access to the same copy of the program rather than having their own separate copy
- DDividing the main memory into a number of static partitions at system generation time
- ELoading each process into a partition of exactly the same size as that process
36According to Dr. Grant's week 10 slides, memory_management.pdf, What is the definition of a "Frame".
- AA fixed-length block of main memory.
- BA fixed-length block of data
- CA variable-length block of data
- DA variable-length block of main memory.
37According to memory_management.pdf slide #11, from Week 10. Which of the following is a weakness of simple paging?
- AA small amount of internal fragmentation.
- BOverhead of complex memory management.
- CExternal fragmentation.
- DInefficient use of processor due to the need for compaction to counter external fragmentation.
38According to Zybooks Section 6.8: Monitors, which one of these is not an actual problem due to the monitor concept not being able to guarantee observation of the preceding access sequence?
- AA process might request a resource that doesn't exist.
- BA process might access a resource without first gaining access permission to the resource.
- CA process might never release a resource once it has been granted access to the resource.
- DA process might attempt to release a resource that it never requested.
- EA process might request the same resource twice (without first releasing the prior resource).
39According to memory management.pdf, If there are free blocks in memory of sizes 12M, 6M, 10M, 16M in that order with the last allocated block having been between the 10M and 16M free blocks. What placement algorithm was used in the allocation of a block of memory of size 8M to the 10M free block?
- ABest Fit
- BFirst Fit
- CNext Fit
- DCompaction
- ELargest Fit
40According to Dr. Grant's Lecture on Thursday, October 27, which of the following is a strength of fixed partitioning?
- AIt is simple to implement.
- BNo internal fragmentation
- CNo external fragmentation
- DImproves memory utilization
- EOffers protection and sharing support
41According to Dr. Grant's week 9 lecture on Ch 6: Synchronization Tools, what is the main purpose of the `flag[ ]` variable in Dekker's and Peterson's algorithms?
- ATo check for process exclusivity (mutual exclusion)
- BTo alert the user of bugs/errors
- CTo begin sharing resources with the other process
- DTo begin starving the other process of resources
42According to Dr.Grant's Lecture on October 25, 2022, in Week 10 over Synchronization Tools and Memory Management, and synchronization-tools.pdf, which one of the followings is NOT correct about requirements of mutual exclusion?
- AAssumptions are made about relative process speeds or number of processes.
- BMutual exclusion must be enforced.
- CProcess that halts must do so without interfering with other processes.
- DWhen no process in critical section, any process that request entry to its critical section must be permitted to enter without delay
- EIt must not be possible for a process requiring access to a critical section to be delayed indefinitely
43According to memory_management.pdf, which of these is NOT a fact about a Page Table?
- ACompromised of fixed and dynamic partitioning schemes
- BMaintained by operating system for each process
- CContains the frame location for each page in the process
- DUsed by processor to produce a physical address
44According to Dr. Grant's Lecture on 10/25/22 and synchronization-tools.pdf, what are atomic operations?
- AA function or action implemented as a sequence of one or more instructions where no other process can see an intermediate state or interrupt the operation. The sequence will execute as a group or not execute at all.
- BA situation where two or more processes are unable to proceed because they are waiting on responses from the other.
- CA situation where two or more processes continuously change their states in response to the change in the other without being able to proceed and do any useful work.
- DA situation where a runnable process gets overlooked indefinitely by the scheduler as it is never chosen by it.
45According to Operating System Concepts, section 9.3.1 (Paging, Basic Method), which of the following is not a step taken by the MMU to translate a logical address generated by the CPU to a physical address
- AReplace the offset d in the logical address
- BExtract the page number p
- CUse p, the page number, as an index into the page table
- DExtract the frame number f, corresponding to p, from the page table
- EReplace the page number p in the logical address with the frame number
46According to CS 3113: Introduction to Operating Systems Zybook Section 6.6, which of the following is NOT true about mutex locks?
- AMutex locks are not guaranteed to have atomic operations.
- BMutex locks can be used to solve the critical section problem.
- CMutex locks are not the same as boolean variables.
- DMutex locks operate with acquire() first, followed by release().
- EMutex locks utilize a boolean variable to indicate if it is available.
47According to memory_management.pdf slide #11, from Week 10. Which of the following memory management techniques divides the process into a number of segment, where the process is loaded by loading all of its segments into dynamic partitions that need not be contiguous?
- ASimple Segmentation
- BDynamic Partitioning
- CSimple Paging
- DVirtual Memory Paging
- EVirtual Memory Segmentation
48When does a race condition occur?
- AWhen multiple processes or threads read and write data items.
- BWhen a program runs synchronously.
- CWhen a program's execution time is tested.
- DWhen the operating system internally audits processes and their run time.
- EWhen two programmers compete to get the last Red Bull from OnCue.
49According to the slides covering memory management, which of the following is not a memory management technique?
- ADynamic Fixed Paging
- BSimple Paging
- CSimple Segmentation
- DVirtual Memory Paging
- EVirtual memory Segmentation.
50According to Dr. Grant's Week 10 slides "memory_management.pdf", which property is associated with both Virtual Memory Paging and Virtual Memory Segmentation?
- AHigher degree of multiprogramming
- BLittle operating system overhead
- CExternal fragmentation
- DProtection and sharing support;
51According to zyBooks CS3113: Introduction to Operating Systems Chapter 6 Section 10 (Evaluation), Under what type of loads will CAS protection will be faster than traditional synchronization?
- AModeratly-contended
- BUncontended
- CHighly Contented
- DAll of above
- ENone of above
52 In Dr. Grant's lecture on 10/27/22 on Memory Management, which definition best describes a Segment?
- AA variable length block of data that resides in secondary memory
- BA length that is fixed in main memory.
- CA length that is fixed in backup memory
- DA dynamic length block in the main memory
- EA block of generic memory
53According to "Operating System Concepts 10th Edition," which of the following operations suspends a process and uses priority number c to determine the order in which it resumes?
- Ax.wait(c)
- Bwait(c)
- Csleep(c)
- Dx.sleep(c)
- Esignal(c)
54Mutual exclusion was discussed during Dr. Grants lecture #19 on synchronization tools. Ensuring mutual exclusion, if a process encounters an error and may crash, what should the process do?
- Arelease the lock on the critical section and exit.
- Bthe process should exit immediately.
- Cdisable interrupts until it can safely resume or exit.
- Dshare the critical section with another process until it can resume or exit.
- Ehalt all processes.
55According to Dr. Grant's lecture on 10/18, which of the 5 scheduling criteria means "amount of time it takes from when a request was submitted until the first response is produced (not output)"?
- AResponse time
- BThroughput
- CTurnaround time
- DWaiting time
- ECPU Utilization
56According to page 11 of the memory management powerpoint located in modules, which of the following is a weakness of dynamic partitioning?
- AInefficient use of the processor.
- BInefficient use of memory.
- COverhead of complex memory management.
- DInternal Fragmentation.
- ENone of the above.
57According to Dr. Grant's lecture on 10/27/2022, what is a direct result of external fragmentation?
- AMemory utilization declines.
- BModules can be written and compiled independently.
- CMechanisms used to support relocations also support sharing capabilities.
- DPartitions memory into equal fixed-size chunks that are relatively small.
- EProcessor must know how to access for the current process.
58According to Dr. Grant's slides titled "deadlock.pdf", what is the UNIX signal that indicates a bad argument to a system call?
- ASIGSYS
- BSIGINT
- CSIGHUP
- DSIGBUS
- ESIGPIPE
59what is a segment of memory?
- Aa variable-length block of data in secondary memory
- Ba fixed-length block of data in main memory
- Ca fixed-length block of data in secondary memory
- Da variable-length block of data in main memory
60what are the two main methods of deadlock prevention?
- AIndirectly by preventing the occurrence of one of the three necessary conditions, and directly by preventing the occurrence of a circular wait.
- BIndirectly by preventing the occurrence of one of the three necessary conditions, and directly by preventing the occurrence of mutual exclusion.
- CIndirectly by preventing the occurrence of one of the three necessary conditions, and directly by preventing the occurrence of a hold-and-wait.
- DIndirectly by preventing the occurrence of one of the four necessary conditions, and directly by preventing the occurrence of a no pre-emption.
- EIndirectly by preventing the occurrence of one of the four necessary conditions, and unintentionally by accidentally realizing you prevented a deadlock later.
61According to Dr. Grant's pre recorded Lecture 22b (Pre-recorded deadlock Part 2) what does the UNIX do for messages?
- AIt provides the msgsnd and msgrcv system calls for processes to engage in passing.
- BIt sends the output command of a program to be processed.
- CIt provides the memory allocation for messaging.
- DIt doesnt do anything for messages.
- EIt helps secure the transmission of data.
62According to deadlock.pdf, given an object's status is found to be "read lock" which of the following can be happening to that object.
- AMultiple threads are read-only accessing that object.
- BA thread is currently writing to that object and preventing reads.
- CA single thread is reading the object and one is writing to the object
- DNo threads are accessing the object
- EA thread is currently writing to that object and preventing other threads from writing.
63According to zyBooks CS3113: Introduction to Operating Systems Chapter 8, Section 8 (Deadlock detection), which of the following is not involved in the interaction between databases and deadlocks?
- Arequest matrices
- Btransactions
- Cwait-for graphs
- Dvictims
- Elocks
64According to Dr. Grant's lecture 21 (Paging+Segmentation), which of the following best describes the effect of Segmentation?
- AFragmentation will occur as a result of segmentation.
- BAddressing uses a segment number.
- CA program can be divided into segments of different lengths.
- DA program can be divided into segments that have a maximum length
- EAddressing uses an offset.
65the simplest way to prevent deadlocks is to do what?
- ADeny circular wait
- BNo preemption
- Cno Mutual Exclusion
- DIgnore deadlocks exist altogether
66Which of the following options INCORRECTLY describes a spinlock?
- ALocked-out threads will continue trying to access the lock even if denied.
- BAre most effective where wait time for acquiring a locked is expected to be short.
- CCan only be acquired by one thread at a time.
- DMost common technique for protecting a critical section in Linux.
67which of the following is not a method of deadlock prevention?
- Adeny the start of a process if deadlock conditions met
- BSome resources must not be shared between requests
- Crequest one resource at a time with simultaneously granted requests
- Ddenial of further request requires request of resources
- Elinear ordering of resource types
68According to the deadlock slides, which deadlock approach coincide with the following description: Disallow one of the three necessary conditions for deadlock occurrence, or prevent circular wait condition from happening.
- ADeadlock prevention
- BDeadlock detection
- CDeadlock avoidance
- DMutual Exclusion
- ECircular Wait
69what is one method by which a livelock can typically be avoided?
- AHave each thread retry the failing operation at random times
- BWhen a collision occurs, always attempt to retransmit the packet immediately
- COnly allow each thread to request resources in an increasing order of enumeration
- DOnly use sharable resources
- EIgnore the potential for a livelock to occur in the system
70According to Dr. Grant's slides deadlock.pdf in Week 11, which of the following is not a valid strategy to recover from a deadlock?
- APause all processes and run each one sequentially
- BBack up each deadlocked process to a previous checkpoint and restart all processes
- CAbort deadlocked processes until deadlock is cleared
- DPreempt sources until deadlock no longer exists
71how are deadlock prevention and fire extinguishers the same?
- AThey both remove a condition of a deadlock/fire to prevent it.
- BThey both stop the problem by shutting down all conditions of the problem.
- CYou need them to avoid a deadlock/fire.
- DThey can stop a deadlock/fire without removing any of the conditions.
- EThey both hurt if you get one thrown at you.
72According to Dr. Grant's Week 11 "deadlock.pdf", Which of the following is an advantage to deadlock avoidance?
- AIt is less restrictive than deadlock prevention.
- Bit maximized the resource requirement for each process.
- CA process may exit while holding resources.
- DThere can be a fixed number of resources to allocate.
73which of the following is a way a process may respond to a signal?
- AIgnoring the signal
- BUpdating a field in the process table
- CAllowing a single thread to access the object for writing at one time, while excluding all readers
- DCalling another signal
- ELooking at the priority of the interrupt
74During Professor Grant's lecture #22a on Deadlocks, what did he say the purpose of the banker's algorithm was? And what did the two matrices, Allocation matrix A and Claim matrix C, represent?
- AA contains the current allocations of each process, and C contains the amount of resources required for each process. Banker's algorithm is used to avoid deadlocks by checking if allocating resources will result in a deadlock.
- BA contains the requests by each process, and C contains the total resources allocated to each process. Banker's algorithm is used to recover from deadlock.
- CA contains the current allocations of each process, and C contains the amount of resources required for each process. Banker's algorithm is used to recover from deadlock.
- DA contains the requests made by each process, and C contains the current allocations of each process. Banker's algorithm is used to avoid deadlocks by checking if allocating resources to processes will result in a deadlock.
- EA contains the amount of resources required for each process, and C contains the resources requested by each process. Banker's algorithm is used to recover from deadlock.
75According to Dr Grant's Lecture 21 (Paging+Segmentation) and memory_management.pdf, which of the following describes Simple Paging?
- AMain memory is divided into a number of equal-sized frames. Processes are divided into equal-sized pages the same length as the frames and then loaded.
- BPartitions are created during run-time and processes are loaded into same-sized partitions.
- CMain memory is divided into static partitions at system generation time. A process is then loaded into a partition that is equal size or larger.
- DEach process is divided into segments. The segments are loaded into not-necessarily-contiguous dynamic partitions.
- EProcesses and memory are sized at random and match together through the power of friendship.
76According to zyBooks CS3113: Introduction to Operating Systems Chapter 8, Section 4 (Deadlock Characterization) what is the definition of a request edge?
- Adirected graph for precise description of deadlocks.
- BIn a system resource-allocation graph, an edge (arrow) indicating a resource request.
- CIn a system resource-allocation graph, an edge (arrow) indicating a resource assignment.
- DA set of methods intended to ensure that at least one of the necessary conditions for deadlock cannot hold.
77According to Dr. Grant's lecture on Nov. 1st, what deadlock approach does not grant a resource allocation if that action may lead to deadlock?
- ADeadlock avoidance
- BDeadlock prevention
- CDeadlock detection
- DCircular Wait
- EMutual Exclusion
78which of the following best describes the circular wait deadlock condition?
- AA closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain.
- BOnly one process may use a resource at a time.
- CA process may hold allocated resources while awaiting assignment of other resources.
- DNo process may access a resource until that has been allocated to another process.
- ENo resource can be forcibly removed from a process holding it.
79which of the following are an advantage of dynamic partitioning?
- ANo internal fragmentation
- BEfficient use of processor
- CLittle operating system overhead
- DMaximum number of active processes is fixed
- EIt is the fanciest way to split up processes
80under the normal mode of operation, a thread may utilize a resource in which sequence?
- ARequest, Use, Release
- BRelease, Use, Request
- CUse, Request, Release
- DRequest, Release, Use
- EA thread may utilize a resource in any sequence
81Assume you have a semaphore lock value of 1 and that you have three processes A,B,C that access the process which have a run time of 3,2,6 respectively. If all three process try to access starting at the same point in time (but are in queue order of A,B,C) what will the value of the semaphore lock at time 4?
- A-1
- B1
- C-2
- D0
- E42
82What are the differences between livelock and deadlock?
- AIn livelock 2 or more threads continue to attempt to do work but obstruct each others progress. In deadlock 2 or more threads are stopped waiting for another waiting thread to complete.
- BIn livelock 2 or more threads are stopped waiting for another waiting thread to complete. In deadlock 2 or more threads continue to attempt to do work but obstruct each others progress.
- CIn livelock 1 thread continues to attempt to do work but is obstructed by another waiting thread. In deadlock 2 or more threads attempt to do work but obstruct each others progress.
- DIn livelock 2 or more threads continue to attempt to do work but obstruct each others progress. In deadlock 1 thread is stuck waiting on another thread that is running indefinitely.
- ELivelock is an organic security mechanism like a guard dog. Deadlock is more like a password or padlock.
83which of the necessary conditions for a deadlock to occur is the most practical solution to prevent a deadlock because it invalidates one of the necessary conditions.
- ACircular Wait
- BHold and Wait
- CMutual Exclusion
- DNo Preemption
- ELivelock
84which of the following is the correct data structure for "Available", in the bankers algorithm?
- AVector
- BMatrix
- CLinked List
- DGraph
- ETree
85what is internal fragmentation?
- AWasted space due to the block of data loaded being smaller than the partition.
- BA process is divided into a number of segments.
- CWhen memory becomes more and more fragmented and memory utilization declines.
- DChooses the block that is closest in size to the request.
- EA system comprised of fixed and dynamic partitioning schemes.
86According to Dr.Grant's Lecture in Week 11 and memory_management.pdf, which of the following is not one of the requirements memory management is intended to satisfy.
- ACooperation
- BRelocation
- CProtection
- DSharing
- ELogical Organization
87what does compaction overcome?
- AExternal fragmentation
- BInternal fragmentation
- CWorst-fit memory allocation
- DHoles
- EFixed partitioning
88which of the following a weakness for Fixed Partitioning?
- AInefficient use of memory due to internal fragmentation; maximum number of active processes is fixed.
- BInefficient use of processor due to the need for compaction to counter external fragmentation.
- COverhead of complex memory management.
- DExternal fragmentation.
- EComplicated to implement.
89According to CS 3113: Introduction to Operating Systems home Section 8.4: "Deadlock characterization" Zybook, all of the following are required simultaneously for a deadlock situation to occur EXCEPT,
- APreemption
- BCircular wait
- CHold and wait
- DMutual exclusion
90What is the paging method?
- APartition memory into equal fixed-size chunks that are relatively small
- BPartition memory into not equal fixed-size chunks that are relatively small
- CPartition memory into equal fixed-size chunks that are relatively big
- DPartition memory into not equal fixed-size chunks that are relatively big
91According to Dr. Grant's lecture 21 (Paging+Segmentation), what is NOT true about Segmentation?
- ACauses internal fragmentation
- BA program can be divided into segments that vary in length
- CAddressing uses a segment number
- DAddressing uses an offset
- EA program can be divided into segments that have a maximum length
92According to Zybooks Chapter 8 deadlock, which of the following is a way to try an attempt to recover from a deadlock?
- Aaborting one of the processes in the circular wait
- Baborting all processes in the circular
- Ckeep running and hope the deadlock fix’s itself
- DThere is no way to every recover from deadlock.
93which of the following best describes livelock?
- Aa condition in which a thread continuously attempts an action that fails
- Ba situation where every thread in a set is blocked waiting for an event that only be caused by another thread in the set
- Can edge indicating a resource request
- Dan edge indicating a resource assignment
- Evariable length block of data that resides in secondary memory
94what are the 4 conditions that cause deadlock?
- AMutual exclusion, hold and wait, no pre-emption, and circular wait
- BHold and wait, internal fragmentation, timeout, and mutual exclusion
- CNo pre-emption, circular wait, scrum, and bus system
- DCircular wait, use of a for loop, fork(), and exit()
- EMutual Inclusion, proceed without question, removability, and linear execution
95when looking at the conditions for deadlock, which best describes circular wait?
- AA chain of processes such that a process holds a resource that the next process needs in the chain.
- BNo resource can be forcibly removed from a process holding it.
- CA process waiting for other resources can hold current resources until needed resources are obtained.
- DOnly one process may use a resource at a time.
- EWhere everyone waits in a circle for duck duck goose.
96According to the deadlock.pdf, which of the following is not a resource that is reusable?
- Ainformation in I/O buffers
- BI/O channels
- Cmain memory
- Dsemaphores
- Efiles
97which of the following is NOT a strategy to recover from deadlock?
- AGive each processes unlimited CPU resources so every process has sufficient resources
- BAbort all deadlocked processes
- CBack up each deadlocked process to some previously defined checkpoint and restart all processes
- DSuccessively abort deadlocked processes until deadlock no longer exists
- ESuccessively preempt resources until deadlock no longer exists
98which approach involves periodically checking for the presence of a deadlock and taking action to recover?
- ADeadlock Detection
- BDeadlock Prevention
- CDeadlock Avoidance
- DMutual Exclusion
- ECircular Wait
99According to the deadlock.pdf from modules week 11 by Dr. Grant, which is not one of the UNIX Concurrency
Mechanisms?- AMain memory
- BPipes
- CMessages
- DShared Memory
- ESemaphores
100According to Dr. Grant’s deadlock pdf file on canvas, which of the following is a deadlock prevention strategy?
- AMutual Exclusion
- BResource Allocation Denial
- CProcess Initiation Denial
- DSwappable space
- EMain memory
101According to Dr. Grant’s deadlock.pdf file on canvas, which of the following is true about Banker's Algorithm?
- ABanker's Algorithm is a method used in resource allocation denial. It is used to determine if a given process might lead to a deadlock.
- BBanker's algorithm can be described as a combination of 4 different algorithms.
- CBanker's algorithm can only be used to detect a deadlock.
- DBanker's algorithm can only be used to recover from a deadlock.
102According to memory_management.pdf and Dr. Grant's lecture on 11/1/2022, which memory management technique has the weakness of external fragmentation?
- ASimple Segmentation
- BFixed Partitioning
- CDynamic Partitioning
- DVirtual Memory Paging
103According to 'deadlock.pdf', which of the following is a method of deadlock avoidance?
- AProcess Initiation Denial - stating max resource requirements for each process in advance and having a fixed number of processes to allocate.
- BMutual exclusion - allowing resource access to one process at a time.
- CHold and Wait - processes must request all of their required resources at one time and will be blocked unless the resources can be granted simultaneously.
- DNo preemption - if a process is denied denied a further request, it must release its original resources and request them again.
- ECircular wait - define a linear ordering of resource types.
104According to deadlocks.pdf, which of the following is NOT a characteristic of spinlocks?
- ALocked-out threads will stop executing in a busy-waiting mode
- BLocked-out threads will continue to execute in a busy-waiting mode
- CBuilt on an integer location in memory that is checked by each thread before it enters its critical section
- DBest used when the wait time for acquiring a lock is expected to be very short
105According to deadlock.pdf from Week 11, which of the following is NOT a deadlock avoidance restriction?
- AIt is necessary to preempt and rollback processes
- BMaximum resource requirement for each process must be stated in advance
- CProcesses under consideration must be independent and with no synchronization requirements
- DThere must be a fixed number of resources to allocate
- ENo process may exit while holding resources
106which of the following is an incorrect description of a deadlock?
- AOnly one process can use resources at a time
- BA permanent blocking of processes
- CEach blocked process can only be activated by an event from another blocked process
- DNone of the events is ever triggered
- ENo efficient solution in the general sense
107According to ZyBooks CS3113: Introduction to Operating Systems Chapter 10, Section 9 (Allocating kernel memory), which of the following possible states mean that "[a]ll objects in the slab are marked as free." (ZyBooks Chapter 10.9)?
- AEmpty
- BPartial
- CFull
- DFree
- EPartially-Full
108According to zyBooks CS3113: Introduction to Operating Systems, Chapter 10 Section 1, which of the following is NOT true about Virtual Memory?
- ABefore a process can execute, it requires that an entire process is in memory.
- BPrograms can be larger than physical memory.
- CThis technique allows for processes to share files and libraries.
- DDoes not require an entire process to be in memory before it can execute.
- EIt provides an efficient way of creating processes.
109According to Dr. Grant's Lecture 22b: (Pre-recorded Deadlock part 2) and slides deadlock.pdf, when grouping resources into classes to find an appropriate strategy of preventing deadlock in the integrated deadlock strategy, which group of resource is "assignable to processes in pages or segments"?
- AMain memory
- BSwappable space
- CProcess resource
- DInternal resources
- EExternal resources
110According to ZyBooks CS3113: Introduction to Operating Systems Chapter 10, Section 5 (Page Replacement), which is the correct order of steps in basic page replacement?
A. Find a free frame.
B. Continue the process from where the page fault occurred.
C. Find the location of the desired page on secondary storage.
D. Read the desired page into the newly freed frame; change the page and frame tables.- A3, 1, 4, 2
- B2, 4, 1, 3
- C1, 2, 3, 4
- D4, 3, 2, 1
- E3, 2, 1, 4
111According to Dr. Grant's Lecture in Week 11 and the Deadlock slide deck, which of the following is not an example of a reusable resource?
- AMessages
- BProcessors
- CI/O Channels
- DMain memory
112According to zyBooks CS3113: Intro to Operating Systems Chapter 10 Section 3, which of the following best describes a page fault?
- Aa fault which results from referencing a non-memory-resident page of memory
- Ba demand paging screen where no no page is brought into memory until it is referenced
- Csecondary storage backing-store used to store pages that are paged outside of memory
- Dmemory not associated with a file
- Ethe writing of zeros into a page before it is made available to a process
113According to the virtual-memory.pdf file in week 12, what is an advantage of smaller page sizes?
- ALesser amount of internal fragmentation
- BMore pages are required which means larger page tables
- CSome page tables must be stored in virtual memory
- DSecondary-memory devices are more efficient with larger pages
- EMemory is more likely to get paper cuts dealing with smaller page sizes
114Which of the following is correct concerning shared memory?
- AIt is the fastest form of interprocess communication
- BIt's a common block of virtual memory shared by at most two processes.
- CPermission is just read-only.
- DMutual exclusion constraints are a large part of the shared-memory facility.
- EPermission is remove-only.
115According to Dr. Grant's lecture on 11/10/2022 (virtual-memory.pdf), what is the definition of a Resident Set?
- APortion of process that is in main memory.
- BThe range of memory addresses available to a process.
- CGenerated when an address is needed that is not in main memory.
- DAllows for effective multiprogramming and relieves the user of tight constraints of main memory.
- EProgram and data references within a process tend to cluster.
116According to Dr.Grant's Lecture 24(Virtual Memory) in Week 12 (November 10, 2022), what is the difference between internal and external fragmentation?
- AExternal fragmentation is between the allocations - when a process is removed from the main memory and internal fragmentation occurs when you take up the whole memory but don't necessarily use all of it - the process uses less space than the allotted memory block.
- BInternal Fragmentation doesnt use virtual memory, but external Fragmentation does.
- CExternal segmentation takes up the whole form but doesnt assign all of it, but internal is between the pages/allocation.
- DInternal fragmentation occurs before External fragmentation.
- EInternal Fragmentation occurs inside the system, and external fragmentation occurs outside the system.
117According to section 9.4 Structure of the Page Table of our book Operating System Concepts, which of the following is NOT included in each entry of an Inverted Page Table?
- AFrame number
- BPage number
- CProcess identifier
- DControl bits
- EChain pointer
118According to Dr. Grant's lecture on November 10th, 2022, and virtual-memory.pdf, which of the following options is defined as "the virtual storage assigned to a process"?
- AVirtual address space
- BAddress space
- CVirtual memory
- DVirtual address
- EReal Address
119which of the following is NOT a advantage of segmentation?
- ACombines the user program into a single segment
- BLends itself to protection
- CAllows programs to be altered and recompiled independently
- DLends itself to sharing data among processes
- ESimplifies handling of growing data structures
120According to the virtual-memory.pdf in Week 12, what does global and local replacement strategies have in common?
- AActivated by a page fault when there are no free page frames.
- BChooses only among the resident pages of the process that generated the page fault
- CConsiders all unlocked pages in main memory
- DBoth B & C
121According to zyBooks CS3113: Introduction to Operating Systems, Chapter 8 Section 5, which of the following is NOT a method to handle deadlocks?
- AMutual exclusion
- BDeadlock prevention
- CDeadlock avoidance
- DIgnore deadlock
- EAllow deadlock
122According to the virtual-memory.pdf in Week 12, which of the following statements is not true regarding operating system policies for virtual memory?
- APlacement policies determine when a page should be brought into memory.
- BFetch policies determine when a page should be brought into memory.
- CPlacement policies determine where a process piece is to reside in real memory.
- DReplacement policies deal with selecting a page in main memory to be replaced.
- ECleaning policies deal with determining whether a modified page should be written out to secondary memory.
123According to virtual-memory.pdf and Dr. Grant's lecture on 11-10-2022, what is the best definition of thrashing?
- AA state in which the system spends most of its time swapping process pieces rather than executing instructions
- BTranslating a page number from a virtual address to get its proper page number for its physical address
- CSimultaneously interrogating multiple entries in the Translation Lookaside Buffer
- DIncreasing the locality of references in a program
- EMoving in a violent and convulsive way
124According to zyBooks CS3113: Introduction to Operating Systems Chapter 10 Section 4, The paging system in a memory management system provides for dynamic mapping between a virtual address used in a program and what?
- AReal address in main memory
- BVirtual address in main memory
- CA real address in a program
- DNone of the above
125According to Dr.Grant's virtual-memory.pdf, and more specifically the Windows Paging part of it, a process' allocated space is divided into fixed-size pages managed in contiguous regions. Which of the following is not a state the region may be in?
- AReady
- BReserved
- CCommitted
- DAvailable
126According to Dr. Grant's lecture on 11/10/2022 (virtual-memory.pdf), which of the definition for the elements in a page table best matches that for the control bits?
- AFlags and protection and locking information
- BIs the page number portion of the virtual address
- CThe process that owns this page
- DThe index value of the next entry in the chain
- ESegmentation
127According to the virtual memory.pdf from module week 12 by Dr.Grant, which of the choice does not belong to the Simple
Paging/Virtual Memory Paging?- AMain memory not partitioned
- BProgram borken by the compiler
- CIt must contain a page table
- DIt has internal fragmentation but not external
- EProcessor uses page number
128According to the virtual-memory.pdf in Week 12, which of the following are the two main types of fetch policy?
- ADemand Paging and Prepaging
- BPlacement Policy and Replacement Policy
- CCleaning Policy and Load Control
- DClock Policy and Page Buffering
129According to ZyBooks CS3113: Introduction to Operating Systems Chapter 10, Section 5 (Page Replacement), which of the following describes Belady's anomaly?
- AFor "some" page replacement algorithms, the page-fault rate may increase as the number of allocated frames increases
- BFor "all" replacement algorithms, the page-fault rate may increase as the number of allocated frames increases
- CFor "some" page replacement algorithms, the page-fault rate may decrease as the number of allocated frames increases
- DFor "all" replacement algorithms, the page-fault rate may decrease as the number of allocated frames increases
- EFor "some" page replacement algorithms, the page-fault rate may stay the same as the number of allocated frames increases
130According to Dr. Grant's lecture on deadlocks and the PowerPoint presentation titled "deadlock.pdf", what semaphore command is used to initialize the dynamically created semaphore with a count of 0 (initially locked)?
- Avoid init MUTEX LOCKED (struct semaphore *sem)
- Bvoid init MUTEX (struct semaphore *sem)
- Cvoid sema init (struct semaphore *sem, int count)
- Dvoid down(struct semaphore *sem)
- Evoid up (struct semaphore *sem)
131According to Dr. Grant's lecture on November 10th, 2022, what memory organization method can prevent thrashing?
- APrinciple of Locality
- BBestfit Allocation
- CPaging
- DFixed Memory Table
- EInternal Fragmentation
132According to Dr. Grant's lecture 24 on 11/10/2022 (Virtual Memory), which characteristic(s) is (are) fundamental to memory management?
- ABoth C and D
- BNeither C or D
- CProcesses can be broken up into noncontiguous locations in main memory during execution
- DAll memory addresses are dynamically translated from logical to physical at runtime
133According to Dr. Grant's lecture in Week 11 on deadlock; which of the following is NOT a type of kernel semaphore?
- AVirtual semaphore
- BBinary semaphore
- CCounting semaphore
- DReader-Writer semaphore
134 According to Dr. Grant's lecture 24, why do we want to avoid long memory lookup times?
- AThey happen constantly
- BTo save memory
- CMemory lookup usually takes a super long time
- DIt is bad for your computer
- Ethey are scary
135According to Dr. Grant's lecture on Virtual Memory, what are the two requirements for virtual memory to be "practical and effective"?
- AHardware that supports paging and segmentation, and an operating system that includes software for managing the movement between secondary and main memory.
- BMain memory must be smaller than 8GB and secondary memory must be larger than 16 GB.
- CVirtual Memory must only be used when the secondary memory is a solid state drive, and the process must be larger than the size of main memory.
- DThe process must be split into segments, not pages, and all segments need to be in secondary memory.
- EThe process must be split into pages, not segments, and all pages must not be partially in main and secondary memory.
136According to Dr. Grant's lecture on November 10 over virtual memory, what is the main characteristic of demand paging?
- AOnly brings paging into memory when a reference is made to a location on that page.
- BPages other than the ones demanded are brought in.
- CExploits the pages of a secondary memory device
- DIs closely correlated to frame locking
- EWhere you must demand pages or segmentation faults occur.
137According to Operating System Concepts, section 10.2 (Demand Paging), which of the following is a benefit of virtual memory explained by demand paging?
- ABy loading only the portions of programs that are needed, memory is used more efficiently.
- BDemand paging lowers the execution time of all processes, increasing performance.
- CIf a process tries to access a page that was not brought into memory, demand paging prevents an error from occurring.
- DPages can be shared during process creation with the fork() system call, thus speeding up process creation.
- EUsage of virtual memory has no benefits.
138According to virtual-memory.pdf slide #68, from Week 12. Which of the following statements about Load Control is NOT true?
- AIf there is too few processes, it will lead to thrashing.
- BDetermines the number of processes that will be resident in main memory.
- CIt is critical in effective memory management.
- DIf there are too few processes, there will be many occasions when all processes will be blocked and much time will be spent in swapping.
- EToo many processes will lead to thrashing.
139According to Dr.Grant's Lecture in Week 12 (November 10, 2022) over virtual-memory.pdf, which of the following is the correct definition of FRAME in memory?
- AA fixed-length block of main memory
- BA fixed-length block of data that resides in secondary memory
- CA variable-length block of data that resides in secondary memory
- DA variable-length block of data that resides in main memory
- Ea rigid structure that surrounds or encloses something such as a door or window
140According to virtual-memory.pdf from week 12, which of the following is NOT a characteristic of Prepaging?
- ACould also be called "swapping"
- BIneffective if extra pages are not referenced
- CExploits the characteristics of most secondary memory devices
- DPages other than the one demanded by a page fault are brought in
141According to "virtual-memory.pdf", which of the following is not true about page sizes?
- AThe TLB contains every page table number, but doesn't contain any of the page table entries.
- BFor large programs in a multi programmed environment, some portion of page tables must be in virtual memory rather than main memory.
- CThe lesser the page size the lesser the amount of internal fragmentation.
- DLarger page sizes are favored by most secondary-memory devices.
- EHaving more pages per process means having larger page tables.
142According to the virtual memory slides, Which of the following is NOT true reguarding Virtual Memory segmentation?
- AAll of the segments of a process must be in main memory for process to run, unless overlays are used.
- BNo internal fragmentation.
- CProcessor uses segment number, offset to calculate absolute address.
- DReading a segment into main memory may require writing 1+ segments to disk.
143According to virtual-memory.pdf from Week 12, the Variable-Interval Sampled Working Set (VSWS) is driven by three parameters. Which of these answers is not one of those three parameters?
- AA use bit to be associated with each page in memory
- BThe minimum duration of the sampling interval
- CThe maximum duration of the sampling interval
- DThe number of page faults that are allowed to occur between sampling instances
144According to virtual-memory.pdf, what algorithm for page replacement is best described by Replacing the page that has not been referenced for the longest time?
- ALeast Recently Used
- BFirst In First Out
- CClock
- DOptimal
- ELast Out
145According to Dr. Grant's virtual-memory.pdf from Week 12, which of the following cannot bebe said about the organization of segmentation?
- AIn organizing segmentation, it is not possible to offset the starting address of a segment
- BEach segment table entry contains the starting address of the
corresponding segment in main memory and the length of the
segment - CA bit is needed to determine if the segment is already in main
memory - DAnother bit is needed to determine if the segment has been
modified since it was loaded in main memory
146According to Dr. Grant's Lecture posted on 11/03/22 (Lecture 22b: Pre-recorded Deadlock part 2) and deadlock.pdf, which of the following is defined as the most common technique for protecting a critical section in Linux where it is built on integer location in memory that is checked by each thread before it enters its critical section?
---- ASpinlocks
- BReaders/ Writer Lock
- CAtomic Operations
- DSemaphores
147According to Dr. Grant's prerecorded lecture, "Deadlock Pt. 2," and deadlock.pdf, there are multiple strategies that may be employed to prevent deadlock and starvation of all processes across classes based on the circumstances. Which of the following strategies best fit a case where a process must allocate all resources it requires all at once, as in the hold-and-wait prevention strategy?
- ASwappable space
- BInternal resources
- CProcess resources
- DMain memory
- EEnforced deadlock
148According to the virtual-memory.pdf, when a process is suspended, if the degree of multiprogramming is to be reduced, one or more of the current resident processes must be swapped out. There are six possible swaps to make, which of these options is NOT a possibility listed in our notes?
- AHighest priority process
- BLowest priority process
- CLargest process
- DProcess with the largest remaining execution window
- EFaulting process
149According to ZyBooks CS3113: Introduction to Operating Systems Chapter 10, Section 9 (Allocating kernel memory), what is a slab?
- AA section of memory made up of one or more contiguous pages
- BA temporary copy of data stored in a reserved memory area to improve performance
- CAn instance of a class or an instance of a data structure
- DPairs of equal size
- Ean allocator that satisfies memory requests, in units sized as a power of 2, from a fixed-sized segment consisting of contiguous pages
150According to Dr. Grant's virtual-memory.pdf, which of the following is NOT a fundamental area of choice in the design of the memory management portion of an operating system.
- AThe size allocation of memory within a machine.
- BWhether or not to use virtual memory techniques
- CThe algorithms employed for various aspects of
memory management - DThe use of paging or segmentation or both
151According to virtual-memory.pdf, which of these describes a chain pointer in an inverted page table entry?
- AA chain pointer is the index value of the next entry in the chain.
- BA chain pointer is the page number portion of the virtual address.
- CA chain pointer is the process that owns this page.
- DA chain pointer includes flags and protection and locking information
- EA chain pointer is the number of chains in each entry.
152According to Dr. Grant's lecture on 11/10/22 reference to virtual-memory.pdf on the Clock Policy Slide.
Which of the following is not true about Clock Policy?- AGives a process a fixed number of frames in main memory within which to execute
- BRequires the association of an additional bit with each frame
- CWhen a page is first loaded in memory or referenced, the use bit is set to 1
- DAny frame with a use bit of 1 is passed over by the algorithm
153According to virtual-memory.pdf from Week 12, what is transparent to the programmer in a combined paging/segmentation system?
- APaging
- BSegmentation
- CInternal fragmentation
- DFrame locking
- EThrashing
154In the C programming language which of the following would cause a segmentation fault error?
- AAttempting to access a NULL pointer
- BLeaving a bracket open
- CDividing by zero
- DMaking a loop without an ending condition
- EReusing variable names in different functions
155According to Zybooks Chapter 10 section 9, Non-uniform memory access (NUMA) _____
- AExists when memory access times can vary
- BRefers to the hierarchy of memory from registers through main memory to secondary storage
- COccurs when page references are resolved in the TLB without having to access the page table
- DExists when memory access times can not vary
156According to Dr. Grant's deadlock.pdf from week 11, Spinlocks are the most common technique for protecting critical sections of the linux kernel. What is the major disadvantage of this technique?
- AThreads which are waiting aren't just standing-by, they are busy waiting.
- BEach thread has to check an integer location in memory, and memory is slow to access.
- CAccess can only be granted to one thread at a time.
- DThe expected wait time is very long so the threads might be stuck waiting.
- EThe API to use them is very difficult to understand.
157According to virtual-memory.pdf in canvas, what is true about the global scope of variable allocation?
- AIt is the easiest to implement
- BThere will be a high page fault rate if the allocation is too small
- Cconsiders all unlocked pages in main memory
- Dchooses only among the resident pages
- Ecan allocate variables from one computer to another, unconnected, computer
158According to ZyBooks CS3113: Introduction to Operating Systems 10.6 (Thrashing), what situation causes thrashing?
- AAttempting to maximize CPU utilization through multiprogramming. The CPU will always try to increase utilization, even when utilization is low because there are not enough frames to run more processes.
- BThrashing occurs when CPU utilization is low for too long.
- CThrashing occurs when there is an error in memory and a process tries to access that memory.
- DThrashing occurs when there is not enough memory for all processes.
- EThrashing occurs when CPU utilization is high for too long.
159According to deadlock.pdf, what is NOT a class of a resource?
- AHardware Resources
- BSwappable Space
- CProcess Resources
- DMain Memory
- EInternal Resources
160According to zyBooks chapter 10.10: Other considerations, which of the following is related to TLB?
- Aresolution
- Bhit ratio
- CTLB reach
- Dcontiguous bit
- Eassociative memory
161According to Dr. Grant's lecture over virtual memory, what is the difference between Real Memory and Virtual Memory
- AReal memory is on the actual RAM while Virtual memory is saved on the disk.
- BReal memory is on the actual RAM while Virtual memory is on a virtual machine
- CReal memory is on the actual RAM while Virtual memory is on the cloud
- DReal memory is saved to the disk while Virtual memory is saved on the RAM.
- EReal memory is non volatile while Virtual memory is volatile.
162According to Dr.Grant's Lecture in Week 12 (November 10, 2022) on virtual memory which of the following is not a characteristic of virtual memory paging?
- AOperating system must maintain a list of free holes
in main memory - BNo external fragmentation
- CThe operating system must maintain a free frame list
- DReading a page into main memory may require writing a page out to disk
- EMain memory is partitioned into small fixed-size chunks called frames
- AOperating system must maintain a list of free holes
163According to virtual-memory.pdf, which is not a part of execution of a process?
- ARelaunch Code
- BAn interrupt is generated when an address is needed that is not in main memory
- COperating system places the process in a blocking state
- DResident set
- EOperating system brings into main memory a few pieces of the program
Information
- Description
- Computer Science Quiz on ssss, created by Kevin T on 15/11/2022.
- Author
- Kevin T
- Language
- English
- Views
- 18
- Tags
- Rating
- No ratings yet Rate this quiz