CS3013 Practice Final Exam

Consider the StartUsingProcessTable() function for the Simple Operating System that we looked at in class. Is there busy waiting? If so, why is it ok here? If not, what kind of waiting is it?
Basic memory management:
1. What is the role of the Memory Management Unit (MMU)?
2. If a relocation register had a value of 1200 and a limit register had a value of 1000, give the physical addresses for a logical address of: 20, 850, 1100.
Consider a paging system with the page table stored in memory:
1. If the effective memory access time is 200 nanoseconds with paging, how long is the physical (raw) memory access time?
2. If we add associative registers, and we have a 96 percent hit-ratio what is the effective memory access time? Assume access to the associative registers takes 10 nanoseconds.
3. What is the worst-case effective memory access time we could have (using the associative registers from (b))? What is the best effective memory access time we could have (again, using the associative registers from (b))?
Fragmentation:
1. What kind of fragmentation do we have with fixed sized partitions? Given N processes each in size M memory partitions how much fragmentation do we have?
2. What kind of fragmentation do we have with variable-sized partitions? Given N processes in memory, how much fragmentation do we have?
Consider a system with a 10 bit physical address space divided into 128 frames. The logical address space for each process has 8 pages:
1. How many bits are required for the frame number?
2. How many bits are required for the page number?
3. How many bits are in the offset?
4. How many bits are required for a logical memory address?
5. How big is the page table (in bits) for each process?
Consider a system with 32 bits for a memory access. Assume a 2 level paging scheme with 8 bits for the outer page table and 12 bits for the inner page table. How big is each page?
Assume pure demand paging. Consider a process with 3 frames of memory and a reference string of 1 2 3 4 1 2 3 4
1. How many page faults would a FIFO page replacement algorithm have?
2. How many page faults would an LRU page replacement algorithm have?
3. How many page faults would the optimum page replacement algorithm have?
4. Using a working set model with a past reference time of 4, explain why the process is thrashing. What steps might the OS take to help?
Suppose that the head of a disk with 20 tracks, numbered 0-19, is currently serving a request at track 14 and has just finished a request at track 12. The queue of requests is kept in FIFO order:
```
   8, 14, 9, 17, 9, 15, 9, 17, 13
```
What is the total number of head movements needed to satisfy these requests for the following disk-scheduling algorithms?
1. First-Come First-Served (FCFS) scheduling?
2. Shortest Seek Time First (SSTF) scheduling?
3. SCAN (elevator) scheduling?
Assume in your project 2 (Hide) assignment you stored a field named isHidden to the struct task_struct to indicate whether or not a process was hidden. Place the following pseudo-system calls and statements:
```
  p = find_task_by_pid(pid)
  if (!p->isHidden)
  if (p->isHidden)
  unhide(pid)
  proc_register()
  sys_unhide(pid)
  hide(pid)
  p->isHidden = 1
  for_each_task(p)
  p->isHidden = 0
  pids[nr_pids] = pid
  sprintf(buff, "%d\t", p->pid)
  sys_hide(pid)
  pid = getpid()
  proc_unregister()
  
```
Into the following user files: radar.c (the module), hide.c (the system calls), test-hide.c (the user level testing of hide-ing), root.c (the proc filesystem). The calls may be used more than once, as needed.
Consider your project 3 (Remote Shell). For each of the client and server programs separately, place the following system calls in the right order. The calls may be used more than once, as needed.
```
  fork()
  connect()
  accept()
  while (!done)
  end /* while */
  close()
  send()
  if (child)
  end /* if */
  exec()
  recv()
  
```

Return to the CS3013 Home Page