thread: Properly protect 'all_list' around insertion.

[pintos-anon] / ta-advice / HW4

diff --git a/ta-advice/HW4 b/ta-advice/HW4
index c1c0c60d15231d183bc76c2195e6ea7a3127464f..225c08b223241f3fa3f15f96f679821ccfa67d1a 100644 (file)
--- a/ta-advice/HW4
+++ b/ta-advice/HW4
@@ -448,7 +448,7 @@ B6:
 C1:
 
     struct inode should drop inode_disk; if it doesn't, then take off
-    points.  Take off a lot of points if they This might have been mentioned in A1 instead.
+    points.  This might have been mentioned in A1 instead.
 
     Expect to see a cache entry structure containing the following
     members:
@@ -497,8 +497,7 @@ C2:
 
     Many schemes are possible.  For full credit, students must use an
     algorithm that is at least as good as the second-chance (clock)
-    algorithm, and they must take the difference between data and
-    metadata into account in some way.
+    algorithm.
 
     Some implementations I've seen, with comments: