Seal from the 80's
CS 232: Computer Organization
(Spring 2014)

Syllabus

Teachers
Brendan
Dan
Lanya
Victoria
Matt
Hieu
Jacob
Scott
Hieu

Assignments



Other Pages
    Homework 20
    Due: Wed May 07 2014

  1. 100 points: Professor Bluthers creates a new generational garbage collector that uses the Copy Algorithm for both generations. They claim this solves the problem of the generational collector discussed in class, because the garbage collecting of the Mark-and-Compact algorithm can take extra time. You are not as confident about this design. Why doesn't this solve the problem(s) of the non-generational scheme (so only one piece) using only the Copy Algorithm?

  2. Total Points: 100