cse120 review (2)

Upload: j9sun

Post on 05-Apr-2018

217 views

Category:

Documents


0 download

TRANSCRIPT

  • 8/2/2019 CSE120 Review (2)

    1/23

    Click to edit Master subtitle style

    4/22/12 2012 by Joseph

    CSE120: Principles ofOperating Systems

    Final Review SessionKevin WebbUniversity of California, San DiegoMarch 21, 2012

    2012 by Joseph 11

  • 8/2/2019 CSE120 Review (2)

    2/23

    4/22/12 2012 by Joseph

    Plan for Tonight

    General exam info

    Brief list of topics we covered Not exclusive

    Generate discussion

    Top 5 missed midterm questions

    2012 by Joseph 22

  • 8/2/2019 CSE120 Review (2)

    3/23

    4/22/12 2012 by Joseph

    Final Exam

    Thursday, March 22, 3:00pm

    Cumulative

    Roughly 1/3 pre-midterm, 2/3 post-midterm

    ~60 questions

    Same format as midterm

    Bring:

    SCANTRON ParSCORE X-101864-PAR-L 2012 by Joseph 33

  • 8/2/2019 CSE120 Review (2)

    4/23

    4/22/12 2012 by Joseph

    Processes

    What is a process?

    Scheduling

    Synchronization Inter-process communication

    2012 by Joseph 44

  • 8/2/2019 CSE120 Review (2)

    5/23

    4/22/12 2012 by Joseph

    Memory

    Memory management

    Physical vs. logical vs. virtual

    Segmentation, paging Page replacement

    2012 by Joseph 55

  • 8/2/2019 CSE120 Review (2)

    6/23

    4/22/12 2012 by Joseph

    File Systems

    File system interface

    Name space, directories

    File system structure Block allocation and management

    Block cache

    2012 by Joseph 66

  • 8/2/2019 CSE120 Review (2)

    7/23

    4/22/12 2012 by Joseph

    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

  • 8/2/2019 CSE120 Review (2)

    8/23

    4/22/12 2012 by Joseph

    Protection/Security

    General domain/resource protectionmodel

    Capability lists vs. access control lists Protected subsystems

    Attacks on security

    Cryptography

    2012 by Joseph 88

  • 8/2/2019 CSE120 Review (2)

    9/23

    4/22/12 2012 by Joseph

    Networks/DistributedSystems

    What is a protocol?

    Network protocol layers

    The Internet Distributed systems vs. centralized

    systems

    Fundamental distributed algorithms

    Problems: Byzantine Generals,Black/Red hats

    2012 by Joseph 99

  • 8/2/2019 CSE120 Review (2)

    10/23

    4/22/12 2012 by Joseph

    Programming Assignments

    Context switching

    Scheduling policies

    Synchronization

    Threads

    2012 by Joseph 1010

  • 8/2/2019 CSE120 Review (2)

    11/23

    4/22/12 2012 by Joseph

    #5 (49%)

    The advantage of kernel-levelthreads over user-level threads isthat:

    (A) the kernel doesnt need to knowabout kernel-level threads

    (B) kernel-level threads use less

    resources than user-level threads (C) kernel-level threads can be assigned

    to difference CPUs

    (D) kernel-level threads share the same 2012 by Joseph 1111

  • 8/2/2019 CSE120 Review (2)

    12/23

    4/22/12 2012 by Joseph

    #5 (49%)

    The advantage of kernel-levelthreads over user-level threads isthat:

    (A) the kernel doesnt need to knowabout kernel-level threads

    (B) kernel-level threads use less

    resources than user-level threads (C) kernel-level threads can be

    assigned to different CPUs

    (D) kernel-level threads share the same 2012 by Joseph 1212

  • 8/2/2019 CSE120 Review (2)

    13/23

    4/22/12 2012 by Joseph

    #4 (37%)

    Given a page-based logical address(p, i) of 32 bits, if the size of the pagetable for each process is 8 MB

    (assume page table entries use 4bytes), how many bits are there inthe offset i?

    (A) 10 (B) 11

    (C) 12

    (D) None of the above 2012 by Joseph 1313

  • 8/2/2019 CSE120 Review (2)

    14/23

    4/22/12 2012 by Joseph

    #4 (37%)

    Given a page-based logical address(p, i) of 32 bits, if the size of the pagetable for each process is 8 MB

    (assume page table entries use 4bytes), how many bits are there inthe offset i?

    (A) 10 (B) 11

    (C) 12

    (D) None of the above 2012 by Joseph 1414

  • 8/2/2019 CSE120 Review (2)

    15/23

    4/22/12 2012 by Joseph

    #3 (34%)

    The advantage of Earliest DeadlineFirst over Rate Monotonic Schedulingis that Earliest Deadline First:

    (A) is more efficient

    (B) can guarantee a higher sum of CPUutilizations is met

    (C) relies only on information aboutprocess expected utilizations

    (D) none of the above

    2012 by Joseph 1515

  • 8/2/2019 CSE120 Review (2)

    16/23

    4/22/12 2012 by Joseph

    #3 (34%)

    The advantage of Earliest DeadlineFirst over Rate Monotonic Schedulingis that Earliest Deadline First:

    (A) is more efficient

    (B) can guarantee a higher sum ofCPU utilizations is met

    (C) relies only on information aboutprocess expected utilizations

    (D) none of the above

    2012 by Joseph 1616

  • 8/2/2019 CSE120 Review (2)

    17/23

    4/22/12 2012 by Joseph

    #2 (28%)

    Given proportional-share schedulingwith a quantum of 1 time unit and 3processes 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 getthe CPU at time 4:

    (A) X, (B) Y, (C) Z

    (D) more than one are deserving 2012 by Joseph 1717

  • 8/2/2019 CSE120 Review (2)

    18/23

    4/22/12 2012 by Joseph

    #2 (28%)

    Given proportional-share schedulingwith a quantum of 1 time unit and 3processes 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 getthe CPU at time 4:

    (A) X, (B) Y, (C) Z

    (D) more than one are deserving 2012 by Joseph 1818

  • 8/2/2019 CSE120 Review (2)

    19/23

    4/22/12 2012 by Joseph

    #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:

    33/25 = 1.32, Zs ratio: 100/50 = 2. 2012 by Joseph 1919

  • 8/2/2019 CSE120 Review (2)

    20/23

    4/22/12 2012 by Joseph

    #1 (16%)

    Which of the following causes themonitor lock to be released:

    (A) if a process calls Wait from within themonitor

    (B) if a process calls Signal from within themonitor

    (C) if the last process inside the monitor isunblocked

    (D) all of the above

    2012 by Joseph 2020

  • 8/2/2019 CSE120 Review (2)

    21/23

    4/22/12 2012 by Joseph

    #1 (16%)

    Which of the following causes themonitor lock to be released:

    (A) if a process calls Wait from withinthe monitor

    (B) if a process calls Signal from within themonitor

    (C) if the last process inside the monitor isunblocked

    (D) all of the above

    2012 by Joseph 2121

  • 8/2/2019 CSE120 Review (2)

    22/23

    4/22/12 2012 by Joseph

    #1 (16%)

    2012 by Joseph 2222

  • 8/2/2019 CSE120 Review (2)

    23/23

    4/22/12 2012 by Joseph

    Q & A

    2012 by Joseph 2323