CSE120: Principles of Operating Systems Final Review Session

Kevin Webb Click to edit Master subtitle style University of California, San Diego March 21, 2012

4/22/12

2012 by Joseph

11

Plan for Tonight

General exam info Brief list of topics we covered

Not exclusive Generate discussion

Top 5 missed midterm questions

4/22/12 2012 by Joseph 22

Final Exam

Thursday, March 22, 3:00pm

Cumulative Roughly 1/3 pre-midterm, 2/3 postmidterm ~60 questions Same format as midterm

Bring:
SCANTRON 2012 by JosephX-101864-PAR-L 4/22/12 33 ParSCORE

Processes

What is a process? Scheduling Synchronization Inter-process communication

4/22/12

2012 by Joseph

44

Memory

Memory management Physical vs. logical vs. virtual Segmentation, paging Page replacement

4/22/12

2012 by Joseph

55

File Systems

File system interface Name space, directories File system structure Block allocation and management Block cache

4/22/12

2012 by Joseph

66

I/O

Structure of I/O system software

Functionality of layers Interoperation

Device drivers Buffering

Why (and why not) buffer Where to buffer

2012 by Joseph 77

4/22/12

Protection/Security

General domain/resource protection model Capability lists vs. access control lists Protected subsystems Attacks on security Cryptography

4/22/12

2012 by Joseph

88

Networks/Distributed Systems

What is a protocol? Network protocol layers The Internet Distributed systems vs. centralized systems Fundamental distributed algorithms Problems: Byzantine Generals, Black/Red hats
4/22/12 2012 by Joseph 99

Programming Assignments

Context switching Scheduling policies Synchronization Threads

4/22/12 2012 by Joseph 1010

#5 (49%)

The advantage of kernel-level threads over user-level threads is that:

(A) the kernel doesnt need to know about kernel-level threads (B) kernel-level threads use less resources than user-level threads (C) kernel-level threads can be assigned to difference CPUs kernel-level threads share 1111 same the 2012 by Joseph

(D) 4/22/12

#5 (49%)

The advantage of kernel-level threads over user-level threads is that:

(A) the kernel doesnt need to know about kernel-level threads (B) kernel-level threads use less resources than user-level threads (C) kernel-level threads can be assigned to different CPUs kernel-level threads share 1212 same the 2012 by Joseph

(D) 4/22/12

#4 (37%)

Given a page-based logical address (p, i) of 32 bits, if the size of the page table for each process is 8 MB (assume page table entries use 4 bytes), how many bits are there in the offset i?

(A) 10 (B) 11 (C) 12

2012 by Joseph (D) None ofthe above 1313

4/22/12

#4 (37%)

Given a page-based logical address (p, i) of 32 bits, if the size of the page table for each process is 8 MB (assume page table entries use 4 bytes), how many bits are there in the offset i?

(A) 10 (B) 11 (C) 12

2012 by Joseph (D) None ofthe above 1414

4/22/12

#3 (34%)

The advantage of Earliest Deadline First over Rate Monotonic Scheduling is that Earliest Deadline First:

(A) is more efficient (B) can guarantee a higher sum of CPU utilizations is met (C) relies only on information about process expected utilizations (D) none of the above
2012 by Joseph 1515

4/22/12

#3 (34%)

The advantage of Earliest Deadline First over Rate Monotonic Scheduling is that Earliest Deadline First:

(A) is more efficient (B) can guarantee a higher sum of CPU utilizations is met (C) relies only on information about process expected utilizations (D) none of the above
2012 by Joseph 1616

4/22/12

#2 (28%)

Given proportional-share scheduling with a quantum of 1 time unit and 3 processes X = (0, 10, 25%), Y = (1, 5, 25%), Z = (3, 2, 50%), where (a, s, f) specifies a process's arrival time, service time, and fractional share of CPU time, which process should get the CPU at time 4:

(A) X, (B) Y, (C) Z more than oneJoseph deserving 2012 by are 1717

(D) 4/22/12

#2 (28%)

Given proportional-share scheduling with a quantum of 1 time unit and 3 processes X = (0, 10, 25%), Y = (1, 5, 25%), Z = (3, 2, 50%), where (a, s, f) specifies a process's arrival time, service time, and fractional share of CPU time, which process should get the CPU at time 4:

(A) X, (B) Y, (C) Z more than oneJoseph deserving 2012 by are 1818

(D) 4/22/12

#2 (28%)

X = (0, 10, 25%), Y = (1, 5, 25%), Z = (3, 2, 50%) T0: Run X, (X @ 100%) T1: Run Y, (X @ 50%, Y @ 100%) T2: Run X, (X @ 66%, Y @ 50%) T3: Run Z, (X @ 50%, Y @ 33%, Z @ 100%) T4: Xs ratio: 50/25 = 2, Ys ratio: 4/22/12 2012 by ratio: 1919 33/25 = 1.32, Zs Joseph 100/50 = 2.

#1 (16%)

Which of the following causes the monitor lock to be released:

(A) if a process calls Wait from within the monitor (B) if a process calls Signal from within the monitor (C) if the last process inside the monitor is unblocked (D) all of the above
2012 by Joseph 2020

4/22/12

#1 (16%)

Which of the following causes the monitor lock to be released:

(A) if a process calls Wait from within the monitor (B) if a process calls Signal from within the monitor (C) if the last process inside the monitor is unblocked (D) all of the above
2012 by Joseph 2121

4/22/12

#1 (16%)

4/22/12

2012 by Joseph

2222

Q&A

4/22/12

2012 by Joseph

2323