Mark True or False for each statement below. 1. Preemptive scheduling allows the currently running process to continue executing without interruption until it finishes. 2. Shortest Remaining Time First (SRTF) is an example of a preemptive scheduling algorithm. 3. In Round Robin scheduling, each process runs until it completes without being preempted. 4. Real-time scheduling is divided into Static and Dynamic scheduling, where Static schedules tasks before execution and Dynamic schedules them as they arrive. 5. Lottery scheduling can ensure fairness. If each process receives an equal number of tickets they will have an equal chance to be selected based on a random draw of tickets.

Evaluate the following statements about memory and storage: The closer a type of memory is to the CPU, the faster it is but also the smaller in size.   L1 cache is typically farther from the CPU than SSDs.   The cost of memory typically increases the farther it is from the CPU.   Strictly speaking, a kilobyte is equal to 1,000 bytes. But, sometimes, like in this course, we will use kilobytes to refer to 1024 bytes.   A kibibyte is larger than 1000 bytes by 24 bytes.  

Mark True or False for the Following Questions Hardware interrupts are used by devices to signal the OS that an operation, such as reading from a disk, is complete. The interrupt controller uses interrupt masks to manage multiple interrupt requests and ensures that only one interrupt is processed at a time. The interrupt controller sends the IRQ# to the CPU via the Bus so that it can be treated. Precise interrupts are treated after the current instruction is completed and before the next instruction begins, while imprecise interrupts may interrupt the execution of ongoing instructions. When servicing an interrupt, the CPU does not enter kernel mode; instead, it continues executing the current user-space instruction until the interrupt is finished.

Mark True or False for the Following Questions In the first generation of operating systems, computers were highly reliable and did not require frequent maintenance. The Altair 8800’s Operating System implemented automated program loading. Multiprogramming allows the CPU to be less idle, for example by loading a new program while another is executing. During the second generation, computational systems were characterized by transistors and batch processing. Real-time operating systems are optimized for user interaction and feedback rather than strict timing constraints.

Listed below are general rules that help establish a suitable testing environment for the test taker and for the proctor. Testing environment: A desk area that is free of papers and clutter. Uniform lighting and avoidance of strong lighting (electric light or sunlit window) in the direction the camera is pointing. Test Taker No headphones or ear plugs. No cell phones, tablets, or unauthorized materials (blank scratch paper is OK) No head gear or hair that obscures the eyes. No sound from radio or TV during the exam. No other persons in the room.  Question: Which of the following situations provides the best testing environment for both the test taker and the proctor?

Select which of the following operations always require switching to Kernel Mode for execution. Handling Interrupts.  Opening a web browser. Disk I/O operations. Memory Allocation.

Which of the following are TRUE for TCP: TCP is connection less. Lost data is retransmitted. Packets may arrive out of order, but once received, are re-ordered before delivery to the receiving application. Data is delivered as datagram. Built on top of IP.  

Select True or False for the following statements. The Short Term Scheduler is responsible for maintaining memory load.  The Long Term Scheduler prevents Batch systems from being overloaded.  The Medium Term Scheduler selects which process will be allocated to the CPU. 

Identify whether each of the following layers belongs to IP, OSI, or Both: Network Layer. Access Layer. Presentation Layer. Physical Layer.  Application Layer.

Match the page eviction algorithm to the description. 1. This algorithm proceeds in a round-robin fashion. On page fault, if the current page’s reference bit is set, it is cleared and the next page is chosen, this repeats until a page whose reference bit is not set is found. That page is then evicted. 2. This algorithm uses a referenced and modified bit for each page to approximate the least recently used algorithm. 3. This algorithm tracks the number of times a page is used, evicting the least recently used page. 4. This algorithm uses a time window to define a working set of pages that are the most active. It then attempts to evict a page that is not in the working set, only evicting the oldest page if all pages are in the working set.