notes

commit b6f3873f96d40d763178d7f0257f852787ee86b2
parent 0e49800914d94add1757ca6f7a88a429710a1a2f
Author: Andrew <andrewlaack1@gmail.com>
Date:   Fri, 13 Sep 2024 17:11:20 -0500

Took some notes

Diffstat:
M
Assembly.md
 | 
12
+++++++-----
M
DiscreteMath.md
 | 
8
--------
A
HalfWord.md
 | 
8
++++++++
A
IntegerOverflow.md
 | 
8
++++++++
A
SignedExtension.md
 | 
13
+++++++++++++
A
Word.md
 | 
8
++++++++
A
ZeroExtension.md
 | 
10
++++++++++

7 files changed, 54 insertions(+), 13 deletions(-)
diff --git a/Assembly.md b/Assembly.md
@@ -9,11 +9,11 @@ Assembly Language CS 224
 
 Week 1:
 - [TwosComplement](TwosComplement.md) 
-- IntegerOverflow
-- ZeroExtension
-- SignedExtension
-- Word
-- HalfWord
+- [IntegerOverflow](IntegerOverflow.md)
+- [ZeroExtension](ZeroExtension.md)
+- [SignedExtension](SignedExtension.md)
+- [Word](Word.md)
+- [HalfWord](HalfWord.md)
 
 Week 2:
 
@@ -22,3 +22,5 @@ Week 2:
 - [String](String.md) (zero terminated, this is the c standard but we will use it in assembly)
 - [Microprocessor](Microprocessor.md) 
 - [Microcontroller](Microcontroller.md) 
+
+
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -123,11 +123,3 @@ Unit 6.2 (Pigeonhole principle)
 	- [GeneralizedPigeonholePrinciple](GeneralizedPigeonholePrinciple.md)
 	- [Subsequence](Subsequence.md)
 	- [RamseyNumbers](RamseyNumbers.md)
-
-Questions:
-
-Ask about the generalized php problem where we find that in a month of 30 days if the team plays at least one game per day and less than 45 games there is at least one sequence a_i through a_j such that a_j - a_i = 14.
-
-Is there a genralizable process to make determinations about sequences with php?
-
-I am confused about ramsey numbers. Is there a visualization for them or another way to state the idea?
diff --git a/HalfWord.md b/HalfWord.md
@@ -0,0 +1,8 @@
+:cs: :assembly:
+# Half Word
+
+W1
+
+## Notes
+
+**Definition:** This is half the size of a CPU's word.
diff --git a/IntegerOverflow.md b/IntegerOverflow.md
@@ -0,0 +1,8 @@
+:cs: :assembly:
+# Integer Overflow
+
+W1
+
+## Notes
+
+**Definition:** An integer overflow is where we carry a 1 past the end of an integer thus causing it to be 'lost'.
diff --git a/SignedExtension.md b/SignedExtension.md
@@ -0,0 +1,13 @@
+:cs: :assembly:
+# Signed Extension
+
+W1
+
+## Notes
+
+**Definition:** Signed extension is used to extend the size of a signed value.
+
+
+-3:
+
+101 -> 11111101
diff --git a/Word.md b/Word.md
@@ -0,0 +1,8 @@
+:cs: :assembly:
+# Word
+
+W1
+
+## Notes
+
+**Definition:** A word is the number of bits processed by a cpu this is typically 64/32. 
diff --git a/ZeroExtension.md b/ZeroExtension.md
@@ -0,0 +1,10 @@
+:cs: :assembly:
+# Zero Extension
+
+W1
+
+## Notes
+
+**Definition:** Zero extension is the process of extending an unsigned integer to take up more bits but still maintain the same value.
+
+101 -> 00000101