3305 Final Exam Review

1. To select a process to run in a multiprocessor architecture, the scheduler will assign processes to a core from
2. Suppose a program can run 10% serial and 90% parallel. Using Amdahl's Law, calculate the expected performance gain by adding 16 cores.
3. Multiple pages with similar code and data structures are known as
4. A differential backup can also be known as
5. Which of the following is a reason for a file system to not use indexed allocation?
6. Another name for a virtual machine manager is
7. A backup that is held off-site and/or disconnected from any network is known as
8. Applying labels to objects and domains and permitting the action when the labels match is known as
9. Which of the following is a benefit to virtualization
10. If the operating system cannot find a free frame in the free frame list, the operating system will
11. Which of the following is a reason for a file system to not use contiguous allocation?
12. Unlike forking, if the parent thread of a multithreaded process exits, all of its 'child' threads will also exit.
13. A context switch consumes CPU time
14. To notify a process that a particular event has occurred, one would send the process
15. A worm requires user input to propagate
16. Assigning more memory to all the guest VMs than the host system physically has is known as
17. It is sometimes a good idea to keep a task assigned to a specific core rather than re-balance it to another core
18. In Round-Robin CPU scheduling, if there are 10 processes in the ready queue and the time quantum is 3ms, then no process waits more than
19. Which of the following is not a factor to consider when deciding which storage medium to use
20. The TLB holds a copy of the page table.
21. Which of the following methods are not used to keep track of frame usage?
22. When two processes communicate using an unbounded buffer, the consumer may need to wait before reading from the buffer.
23. Swap space is assigned to
24. Which of the following is the best definition of a virtual file system?
25. Main memory is an example of Nonvolatile storage (NVS)
26. Before a user can use the files in a file system, the file system must be
27. Main memory is an example of Nonvolatile storage (NVS)
28. Which of the following is not a service commonly provided by an operating system?
29. Message passing is typically faster than shared memory.
30. If using a valid/invalid bit in a demand paging strategy, every page will generate a page fault at least once.
31. Validating a username and password is known as
32. A file system should have good performance with many features without sacrificing reliability
33. A CPU may have multiple layers of caching
34. Consider the following processes in the ready queue with the following CPU burst times. Match the following scheduling algorithms with the order of processes
35. In the context of file systems, FUSE stands for
36. Most modern operating systems use a nonpreemptive scheduling scheme
37. For efficiency, modern disks often maintain their own list of disk requests and act on them using built-in algorithms
38. The size of the memory allocated for a process is stored in
39. The list of free frames is maintained by
40. Pages can be labelled as read-only
41. When two processes communicate using an unbounded buffer, the producer may need to wait before writing to the buffer.
42. A common approach used by most modern operating systems to manage process synchronization is to temporarily disable interrupts
43. Which of the following is not a service commonly provided by an operating system?
44. If an operating system is permitting multiple processes to write to a locked file, this is an example of
45. If a program declares a variable before a fork() the child and the parent can communicate with one another using that variable.
46. A parent and child process always share the same block of memory
47. Using a first-fit algorithm on fixed partitions, match the following process blocks with the following partitions (*None of the Above* means this partition is not used) Process Size P1 20 P2 400 P3 150 P4 175 Partition Size 1 100 2 200 3 200 4 300 5 400 6 500 7 500
48. A parent process must wait for its child processes to finish before it can execute instructions.
49. Message passing is typically faster than shared memory.
50. If the CPU wants to use memory address 256, and the relocation register holds the value 256, and the limit register holds the value 512, then the physical address in memory is (assume contiguous memory allocation)
51. In a nonpreemptive scheduling scheme, the next process to run is
52. An area of memory containing process information such as process state, CPU registers, I/O status information, etc. is known as a
53. All modern operating system employ a layered operating system structure only
54. Symmetric and asymmetric encryption/decryption are roughly equivalent in terms of computation power required
55. When an interrupt is signaled, the CPU will finish its current task and address the interrupt when the task is complete.
56. If an application fails, the operating system can sometimes generate a
57. Higher page faults usually means higher effective memory access time
58. Interrupts are:
59. A process is by definition a program in execution
60. Which storage medium certain process data is stored on does not influence process speed
61. A parent process must wait for its child processes to finish before it can execute instructions.
62. The greater the serial portion of a task, the greater the expected performance gains by adding parallelism.
63. Shared data that is always read-only does not necessarily need to be used in a critical section.
64. The primary purpose of an operating system is:
65. Which storage medium certain process data is stored on does not influence process speed
66. In Round-Robin CPU scheduling, if there are 10 processes in the ready queue and the time quantum is 3ms, then no process waits more than
67. Rank the following locations on a hard drive disk from 1 (most specific/smallest block) to 4 (most generic/largest block) 1. Sector 2. Track 3. Platter/Cylinder
68. A stack is an example of a data structure with good locality
69. The valid/invalid bit in the page table is used to indicate whether the page is mapped to a free frame or not.
70. Sort the following storage mediums from fastest to slowest 1. Registers 2. Main memory 3. Hard drive 4. Cache
71. A semaphore can be implemented as a mutex lock
72. With a Multilevel Feedback Queue scheduling algorithm, once the scheduler has placed the process in a queue, it could be moved to a different queue later.
73. A context switch consumes CPU time
74. One drawback to Priority scheduling is
75. Consider a logical address space of 12 bits. If each page size is 8 bits, how many pages are there in the logical address? (Assume the entire address space is dedicated to the page number and offset. Do not consider other bits like the valid/invalid or protection bit)
76. Which storage medium certain process data is stored on does not influence process speed
77. Which of the following file system types are common in UNIX/Linux systems
78. Suppose a program can run 20% serial and 80% parallel. Using Amdahl's Law, calculate the expected performance gain by adding 4 cores.
79. Which of the following is not a component of a process
80. On a DFS, all the actions performed by a client between the open() and the close() call is known as
81. A context switch consumes CPU time
82. Binding the address of data to physical addresses in memory occurs at
83. Forcing programs to run inside a limited environment is known as
84. To balance tasks across multicores, an operating system may employ which strategy?
85. Windows has been used as a desktop operating system only
86. Which of the following is the best definition of a translation look-aside buffer
87. Consider the following processes in the ready queue with the following CPU burst times. Match the following scheduling algorithms with the order of processes
88. An area of memory containing process information such as process state, CPU registers, I/O status information, etc is known as
89. If an application fails the operating system can sometimes generate a
90. Main memory is an example of Nonvolatile storage (NVS)
91. The first computers used a very basic operating system
92. Which of the following is not a component of a process?
93. Windows has been used as a desktop operating system only
94. For performance reasons, operating systems will usually let the free-frame list reach zero and use a page-out/page-in strategy when frames are needed.
95. In a nonpreemptive scheduling scheme, the next process to run is
96. The greater the serial portion of a task, the greater the expected performance gains by adding parallelism.
97. Which of the following is not a factor to consider when deciding which storage medium to use
98. In the event of disk failure, data loss is likely to occur in which RAID configuration?
99. Which of the following is the best definition for security?
100. Emulation and Virtualization are identical terms
101. Which of the following is the best definition for a WAN
102. Context switching is managed by the
103. A system is using virtual memory if
104. A backup that only contains the changed files from the previous backup is known as
105. The CPU cache is storage space built into the CPU itself
106. Changing from one user to a user with higher privileges is known as
107. Only permitting programs to run if they have been approved by the vendor is known as
108. A process is by definition a program in execution
109. In Multilevel queue scheduling, which of the following is not true?
110. A trap to the operating system when a page is invalid is known as
111. Virtualization and emulation are synonymous
112. Which of the following is not a basic file operation that an operating system needs to provide functionality for?
113. Which of the following is a reason why two processes may want to cooperate
114. DLLs are loaded when requested by a process and are not shared with other processes
115. Which of the following is not a page replacement algorithm?
116. With a Multilevel Feedback Queue scheduling algorithm, once the scheduler has placed the process in a queue, it could be moved to a different queue later.
117. Consider a page size of 1024 bytes, what is the internal fragmentation on a process using 15,616 bytes
118. Contiguous memory allocation is also commonly referred to as
119. One drawback to Priority scheduling is
120. In the context of file systems, a contiguous set of sectors that can be assigned to parts of a file is known as a
121. The master boot record typically contains all the code necessary to boot the operating system
122. In modern computing, multithreading an application is no longer a common strategy
123. Which of the following is a possible reason to load only part of a program in memory?
124. Main memory is an example of Nonvolatile storage
125. A child may share which resources with a parent?
126. The core operating system files (eg. Kernel, libraries) are found in which partition?
127. Managing what is in memory and when is the responsibility of the running process
128. In a one-to-one multithreading model, the developer can use only single-threading.
129. A software-generated interrupt is known as a
130. An operating system must have a user interface
131. Processes that need more frames will use one from their own list of free frames
132. If a process has multiple threads and one of the threads calls fork(), the child process will also be multithreaded.
133. Which of the following is not an on-storage file system structure discussed in class?
134. Most modern operating systems provide an abstraction between the logical files and the physical addresses of the files on disk
135. Consider a logical address space of 2^16. If there are 32 pages in the logical address, what is the size of each page? (Assume the entire address space is dedicated to the page number and o"set. Do not consider other bits like the valid/invalid bit)
136. Linux represents the system state and other attributes under which directory?
137. Which of the following is not a necessary criterion for a solution to the critical section problem?
138. Most modern operating systems employ which type of directory structure?
139. Before the data in a file can be used by a process, that data must first be loaded into memory.
140. Which of the following is not a factor to consider when deciding which storage medium to use
141. To prevent a process from running too long, the operating system uses a ____ to limit CPU time
142. Peterson's solution is a common strategy employed by modern operating systems to solve the critical section problem
143. If the developer does not write a handler for a signal, the kernel has a default handler for the signal
144. When a process changes from one to another, the operating system must perform a
145. Which of the following is a reason why two processes may want to cooperate?
146. Consider a logical address space of 4 bytes (32 bits). If the page size is 1 byte (8 bits), how many pages can be used? (Assume the entire address space is dedicated to the page number and offset. Do not consider other bits like the valid/invalid or protection bit)
147. With asymmetric cryptography, the same key is used for both encryption and decryption
148. Using dynamic partitions for contiguous memory allocation suffers from
149. Which of the following is a reason why two processes may want to cooperate?
150. Which of the following is not a benefit of multithreading?
151. Which of the following is not true about ordinary pipes?
152. Round-Robin scheduling ensures that starvation cannot occur
153. A process is, by definition, a program in execution
154. Unlike forking, if the 'parent' thread of a multithreaded process exits, all of its 'child' threads will also exit.
155. If a program declares a variable before a fork() the child and the parent can communicate with one another using that variable
156. Operating systems require that all files on a file system follow one of these three structures: Free-form Simple record Complex record
157. If an application fails, the operating system can sometimes generate a
158. Most modern operating systems will implement techniques to ensure the CPU does not update areas of memory it should not update.
159. If an application fails the operating system can sometimes generate a
160. For efficiency, NVM devices typically write data at low level pages.
161. Using data in registers is faster than using data in memory
162. The operating system kernel is:
163. If a program declares a variable before a fork(), the child and the parent can communicate with one another using that variable.
164. A parent and child process always share the same block of memory
165. Direct communication message passing is an example of which type of communication model?
166. A process whose parent process has already terminated is known as a
167. Consider the relationship between pages and frames. For any operating system which of the following statements is not a reasonable implementation?
168. Managing what is in memory and when is the responsibility of the running process
169. A parent process must wait for its child processes to finish before it can execute instructions
170. One drawback to Priority scheduling is
171. Mutex locks and semaphores are identical concepts. Programmers choose one or the other as a matter of style.
172. To prevent a process from running too long the operating system uses a
173. What is the average wait time for these processes if using the SJF scheduling algorithm
174. A process whose parent process that does not wait on it is known as a
175. If the data required by a process is only found on disk, the CPU must always ask the operating system to handle retrieving the data
176. Asymmetric multiprocessing is the most common multiprocessing strategy used by operating systems.
177. Consider a system with swap space held on an HDD with an access time of 10,000,000 microseconds and a memory access time of 1 microseconds. Suppose a page fault occurs 1/1000 accesses, the effective memory access time is
178. Which of the following is a benefit of using a many-to-one multithreading model?