[Homework 1] adaptive radix tree (due 11/4) about cs431 HOT 7 CLOSED

The skeleton code has now been completed. The skeleton code will be explained in class, 7th of October.

from cs431.

• The skeleton code is updated: 6f2698e
• But it's not yet completed (omitting only one function, NodeBox::enlarge()). I'll update the skeleton and specification soon.

from cs431.

The skeleton code is updated. A bug is fixed. Please update your code to base on the updated version of skeleton.

from cs431.

IMPORTANT: a bug was fixed: 7fa2a29 Please update your code to base on the updated version of skeleton.

from cs431.

• Submit here: https://gg.kaist.ac.kr/assignment/1/
• The "due at" fields are strange in the submission page, but it's 9pm, 11/4 (Mon), KST.

from cs431.

• Homework 1 is graded: https://gg.kaist.ac.kr/course/2/
• You get 70 points if your implementation is correct, and additional 30 points if you implement path compression. (100 points in total.)
• You can claim on homework 1, 2, 3 together (TBA).

from cs431.

• I slightly updated the scores. It should have increased or remained the same.
• Criteria:
  • A: correctness1 (30pts). stress test with a small number of inputs (address sanitizer on).
  • B: correctness2 (40pts). stress test with a large number of inputs (address sanitizer on).
  • C: path compression (30pts). check whether path compression is implemented.

from cs431.