From 2eda827bf34d49535152211104e78d3c0dad5c59 Mon Sep 17 00:00:00 2001 From: owengavi2 Date: Mon, 9 Mar 2026 13:59:17 -0400 Subject: [PATCH] completed checkpoint 3 --- questions.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/questions.md b/questions.md index 83a1915..c39aed1 100644 --- a/questions.md +++ b/questions.md @@ -116,4 +116,4 @@ An integer + its negative should be 0. Since 0 is already 0, nothing needs to ch Make a hypothesis about how this could work. - +The fist byte or bytes store how to find a character. If they are all 0s, the decoder can move to the next bit and just read that. if it contains 10000000, it needs 2 bytes, 11000000 it needs 3, etc. If there is just one byte that determines length, we can have characters up to 255 bits long (not including location byte). This gives 255 x 8 = 2040 which allows for 2^2040 characters. This seems to be a plausable amount of room to encode every character from every langauge.