4. In the exponential average formula presented in lecture, if the parameters were assigned the values a = 0.000001 and T, = 200 milliseconds, what does this mean for the estimate calculated by the formula? What if the parameters were assigned values a = 0.999999 and t, = 300 milliseconds? 5. For the processes shown below, with their arrival times and CPU burst lengths, give the schedule of these processes if the algorithm used is Shortest-remaining-time-first. (You can use the format: [t1, t2] Pi means process Pi is scheduled from time t1 to time t2. For example, [0, 2] P1, [2, 5] P2, [5, 6] P3 means P1 is scheduled from time 0 to 2, P2 is scheduled from time 2 to 5, and P3 is scheduled for time 5 to 6.) Process Arrival Time Burst Time 9 P2 2 8 P3 4 6. P. 6. 1 6. We have two processes P, and P, with p, = 40, t, = 15, p, = 80, t, = 30. The deadline for each process requires that it complete its CPU burst by the start of its next period (the same as in examples shown in lecture). Is it possible to schedule these two processes using rate-monotonic scheduling? If so, give the schedule. (Use the same format as in the previous question.) 7. Can you describe an example scenario in which the same frame numbers appear in the page tables of different processes? 8. Suppose a system has a logical address space that consists of 2048 pages and each page has size 8 KB. The physical memory has 1024 frames. (a) The logical address has how many bits? (b) The physical address has how many bits? 9. Suppose a system has a 36-bit logical address and 8 KB page size, and has 1 GB (or 1024 MB) of physical memory. (a) If it uses the regular single-level page table, the table will have how many entries? (b) If it uses an inverted page table, the table will have how many entries? 3. LO