Question 1: All of the following are operating systems in general use today EXCEPT:
Answer: IOCS
Question 2: What is one restriction of a 32-bit kernel?
Answer: The maximum size of an individual process
Question 3: Fill in the blank. The following figure shows an example of a(n) __.
Answer: Instruction cycle
Question 4: What is concurrency?
Answer: The ability of an operating system to handle multiple tasks simultaneously
Question 5: Fill in the blank. When processes communicate with one another, this is often done through the use of __.
Answer: Shared memory
Question 6: What are requirements pertaining to the order of events in an operating system called?
Answer: Synchronization constraints
Question 7: A process is considered to be preemptive when it can be forced to give up the CPU. Which of the following statements about a nonpreemptive process is true?
Answer: It runs until it terminates or willingly gives up control.
Question 8: Let’s assume that we have the following processes, arrival times and burst times: Process Arrival Time CPU Burst
Answer: First Come First Served
Question 9: All of the following are CPU scheduling algorithms EXCEPT:
Answer: Shortest Job Last
Question 10: While hardware memory management is most concerned with electronic devices, such as RAM, that actually store data, operating system memory management is concerned with which of the following?
Answer: How to allocate memory to processes and reallocate it when it is no longer needed
Question 11: Fill in the blank. When allocating memory, holes left over which are not big enough to satisfy any requests are called __.
Answer: Fragments
Question 12: Fill in the blank. Translating memory references in code to actual physical memory is called ___.
Answer: Relocation
Question 13: Fill in the blank. While physical sectors are a reality of hardware, these are abstracted in the file system to __.
Answer: Named files
Question 14: All of the following are file system components EXCEPT:
Answer: Page table
Question 15: Where is the starting block and length of each file stored?
Answer: File allocation table
Question 16: Which of the following is an access control method that assigns privileges to users, programs, or roles as appropriate?
Answer: Role-based access control
Question 17: Fill in the blank. While protocols are used to communicate between nodes, _ contain data encoded using a protocol.
Answer: Packets
Question 18: The OSI reference model has how many layers?
Answer: 7
Question 19: Fill in the blank. One form of broadcast transmission, unicast, sends a message from one node to another. Another type of transmission that sends a message from one node to many is called ___.
Answer: Multicast
Question 20: The TCP/IP reference model has how many layers?
Answer: 4
Question 21: What is wrong with this diagram?
Answer: The operating system is missing.
Question 22: Which of the following statements accurately compares threads to processes?
Answer: Processes are independent, while threads are part of the same process and cooperate closely.
Question 23: While paging makes each process think that it has more memory than it really has, segmentation goes one step further by doing which of the following?
Answer: Allowing each process to have multiple simulated memories
Question 24: Assume that the disk head is currently at 50. We have the following disk cylinder requests from processes (assume that they have all arrived at the same time).
110,18,21,98,112,150,190
Using the Shortest Seek Time algorithm, how many cylinders would the disk arm move across in total to accommodate all requests?
Answer: 204
Question 25: Which of the following statements best describes the Banker’s Algorithm?
Answer: The Banker’s Algorithm allocates resources dynamically to prevent deadlock.
Question 26: The 64-bit logical address range is equal to which of the following?
Answer: 4 billion 32-bit address ranges
Question 27: Fill in the blank. Executable threads contained in a queue maintained by the scheduler are called ____.
Answer: Ready threads
Question 28: Fill in the blank. While a process can be defined as a unit of resource ownership and pertains to the execution of a single program, a thread is a(n) _______.
Answer: Unit of execution which belongs to a process
Question 29: All of the following are reasons for a context switch EXCEPT:
Answer: A running thread is stuck in a loop.
Question 30: A process can be defined as a unit of execution characterized by all of the following EXCEPT:
Answer: Exclusive control of one computer component.
Question 31: Fill in the blank. A block of code where shared resources are accessed is called a(n) __.
Answer: Critical section
Question 32: In the readers-writers problem, any number of readers can be in the critical section simultaneously. Which of the following statements is true about writers?
Answer: Writers must have exclusive access to the critical section.
Question 33: Fill in the blank. A lock with zero or more conditional variables to manage concurrent access to shared data is called a(n) ___.
Answer: Monitor
Question 34: Choose the best answer to fill in the blanks. With share memory, interprocess communication is _, whereas it is __ for message passing.
Answer: Implicit, explicit
Question 35: Fill in the blank. The amount of time that a process can execute is called a(n) ___.
Answer: CPU burst
Question 36: All of the following are places where scheduling decisions may take place EXCEPT:
Answer: When a process is deadlocked.
Question 37: The diagram shows what kind of condition?
Answer: A deadlock condition
Question 38: In the diagram shown below, assume that the circles are processes and the rectangles are instances of a resource. Also, assume that a line from a process to a resource (i.e. the arrowhead is on the resource side) indicates that a process is requesting a resource. A line from a resource to a process (i.e. the arrowhead is on the process side) indicates that a resource has been allocated to a process. Why does this diagram show a deadlock?
Answer: Process P1 is waiting on resource R1, which has been allocated to process P2. Process P2 is waiting for resource R3, which is currently allocated to process P1. Thus, there is a circular wait condition.
Question 39: Fill in the blank. A system is in a safe state when deadlock is avoided even if the system ____.
Answer: Allocates resources up to the maximum for each process
Question 40: While the best fit algorithm scans the free memory list to find the best free hole to use for a memory request, the first fit algorithm does which of the following?
Answer: It finds the first free space that can accommodate the request.
Question 41: All of the following are ways to access a file EXCEPT:
Answer: Parallel access
Question 42: Of all of the computer security threats, which would be the hardest for an organization to control?
Answer: Loss of physical and infrastructure support
Question 43: Two nodes on a network communicate via which of the following?
Answer: Protocol