COP 4600 UF Final Exam Questions With
Correct Answers
What |is |paging? |- |CORRECT |ANSWER✔✔-Divides |memory |into |into |fixed-size |blocks |called |
pages, |mapped |between |physical |and |virtual |memory |using |a |page |table.
T |or |F: |The |Translation |Lookaside |Buffer |(TLB) |speeds |up |memory |access |by |caching |frequently
|used |page |table |entries. |- |CORRECT |ANSWER✔✔-True
T |or |F: |When |main |memory |is |full, |a |page |replacement |algorithm |decides |which |page |to |evict |
to |load |a |new |one. |- |CORRECT |ANSWER✔✔-True
What |are |the |three |types |of |memory |involved |in |virtual |memory |paging, |and |how |does |their |
access |cost |vary? |- |CORRECT |ANSWER✔✔-TLB |cache, |main |memory, |and |disk. |Access |cost |
increases |from |TLB |cache |(lowest/fastest) |-> |main |memory |-> |disk |(highest/slowest)
T |or |F: |A |refrence |string |tracks |how |large |a |page |is |- |CORRECT |ANSWER✔✔-False- |A |refrence |
string |tracks |the |order |and |frequency |of |page |accesses |in |main |memory
How |does |parallel |memory |access |improve |efficiency |in |cache |systems? |- |CORRECT |
ANSWER✔✔-Both |cache |and |main |memory |reads |are |initiated |in |parallel. |If |the |data |is |found |
in |the |cache, |the |main |memory |read |is |canceled; |otherwise, |the |main |memory |read |proceeds.
T |of |F: |The |Non-Frequently |Used |algorithm |is |optimal |for |changing |workloads |- |CORRECT |
ANSWER✔✔-False- |It |is |not |optimal |for |changing |workloads |as |it |doesn't |reset |usage |counters.
|It |evicts |the |least |used |page.
, T |or |F: |The |aging |algorithm |uses |reference |and |modified |bits |in |the |page |table, |periodically |
clearing |reference |bits |to |simulate |"forgetting," |which |ensures |adaptability |to |changing |
workloads. |- |CORRECT |ANSWER✔✔-True
T |or |F: |The |aging |algorithm |is |more |efficient |than |the |non |frequently |used |algorithm |- |
CORRECT |ANSWER✔✔-True
How |does |the |Clock |(or |Second |Chance) |algorithm |handle |page |replacement |- |CORRECT |
ANSWER✔✔-Follows |a |round-robin |approach, |giving |pages |a |"second |chance" |by |clearing |
their |reference |bit |if |its |set, |and |evicting |the |first |page |with |an |unset |reference |bit
T |or |F: |The |working |set |algorithm |defines |a |window |to |encapsulate |the |working |set |of |pages, |
and |evicts |the |least |used |page |outside |it |or |in |it |if |all |pages |are |in |it |- |CORRECT |ANSWER✔✔-
True
T |or |F: |A |page |fault |is |handled |entirely |in |user |space |- |CORRECT |ANSWER✔✔-False- |The |MMU
|signals |the |CPU, |triggering |the |kernel's |page |fault |handler
How |does |segmentation |differ |from |paging |in |virtual |memory |systems? |- |CORRECT |
ANSWER✔✔-Segmentation- |Programmers |explicitly |define |segments, |allowing |for |logical |
partitioning |and |shared |segments
Paging- |Managed |transparently |by |the |OS, |with |no |need |for |explicit |definitions |by |the |
programmer
T |or |F: |Segmentation |is |handled |entirely |by |the |OS |- |CORRECT |ANSWER✔✔-False. |Paging |is |
handled |entirely |by |the |OS
What |is |a |DLL |(Dynamically |Linked |Library)? |- |CORRECT |ANSWER✔✔-A |small |program |
containing |specific |instructions |that |can |be |shared |among |larger |programs. |It |is |mapped |into |
virtual |memory |to |allow |different |processes |to |access |it |efficiently |without |repeatedly |
converting |virtual |to |physical |memory |addresses
Correct Answers
What |is |paging? |- |CORRECT |ANSWER✔✔-Divides |memory |into |into |fixed-size |blocks |called |
pages, |mapped |between |physical |and |virtual |memory |using |a |page |table.
T |or |F: |The |Translation |Lookaside |Buffer |(TLB) |speeds |up |memory |access |by |caching |frequently
|used |page |table |entries. |- |CORRECT |ANSWER✔✔-True
T |or |F: |When |main |memory |is |full, |a |page |replacement |algorithm |decides |which |page |to |evict |
to |load |a |new |one. |- |CORRECT |ANSWER✔✔-True
What |are |the |three |types |of |memory |involved |in |virtual |memory |paging, |and |how |does |their |
access |cost |vary? |- |CORRECT |ANSWER✔✔-TLB |cache, |main |memory, |and |disk. |Access |cost |
increases |from |TLB |cache |(lowest/fastest) |-> |main |memory |-> |disk |(highest/slowest)
T |or |F: |A |refrence |string |tracks |how |large |a |page |is |- |CORRECT |ANSWER✔✔-False- |A |refrence |
string |tracks |the |order |and |frequency |of |page |accesses |in |main |memory
How |does |parallel |memory |access |improve |efficiency |in |cache |systems? |- |CORRECT |
ANSWER✔✔-Both |cache |and |main |memory |reads |are |initiated |in |parallel. |If |the |data |is |found |
in |the |cache, |the |main |memory |read |is |canceled; |otherwise, |the |main |memory |read |proceeds.
T |of |F: |The |Non-Frequently |Used |algorithm |is |optimal |for |changing |workloads |- |CORRECT |
ANSWER✔✔-False- |It |is |not |optimal |for |changing |workloads |as |it |doesn't |reset |usage |counters.
|It |evicts |the |least |used |page.
, T |or |F: |The |aging |algorithm |uses |reference |and |modified |bits |in |the |page |table, |periodically |
clearing |reference |bits |to |simulate |"forgetting," |which |ensures |adaptability |to |changing |
workloads. |- |CORRECT |ANSWER✔✔-True
T |or |F: |The |aging |algorithm |is |more |efficient |than |the |non |frequently |used |algorithm |- |
CORRECT |ANSWER✔✔-True
How |does |the |Clock |(or |Second |Chance) |algorithm |handle |page |replacement |- |CORRECT |
ANSWER✔✔-Follows |a |round-robin |approach, |giving |pages |a |"second |chance" |by |clearing |
their |reference |bit |if |its |set, |and |evicting |the |first |page |with |an |unset |reference |bit
T |or |F: |The |working |set |algorithm |defines |a |window |to |encapsulate |the |working |set |of |pages, |
and |evicts |the |least |used |page |outside |it |or |in |it |if |all |pages |are |in |it |- |CORRECT |ANSWER✔✔-
True
T |or |F: |A |page |fault |is |handled |entirely |in |user |space |- |CORRECT |ANSWER✔✔-False- |The |MMU
|signals |the |CPU, |triggering |the |kernel's |page |fault |handler
How |does |segmentation |differ |from |paging |in |virtual |memory |systems? |- |CORRECT |
ANSWER✔✔-Segmentation- |Programmers |explicitly |define |segments, |allowing |for |logical |
partitioning |and |shared |segments
Paging- |Managed |transparently |by |the |OS, |with |no |need |for |explicit |definitions |by |the |
programmer
T |or |F: |Segmentation |is |handled |entirely |by |the |OS |- |CORRECT |ANSWER✔✔-False. |Paging |is |
handled |entirely |by |the |OS
What |is |a |DLL |(Dynamically |Linked |Library)? |- |CORRECT |ANSWER✔✔-A |small |program |
containing |specific |instructions |that |can |be |shared |among |larger |programs. |It |is |mapped |into |
virtual |memory |to |allow |different |processes |to |access |it |efficiently |without |repeatedly |
converting |virtual |to |physical |memory |addresses
