notes

commit f18f73d953af76408aa9a7b102ec5e3b769a9cc0
parent c88178742007f7829876591f920b52743ffeebb9
Author: Andrew <andrewlaack1@gmail.com>
Date:   Wed,  6 Nov 2024 08:49:28 -0600

Took some notes

Diffstat:
M
Algorithms.md
 | 
4
+++-
A
BinaryCode.md
 | 
10
++++++++++
M
DiscreteMath.md
 | 
13
+++++++++++++
A
InformationContent.md
 | 
8
++++++++

4 files changed, 34 insertions(+), 1 deletion(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -77,7 +77,9 @@ Ch 5 (Hashing)
 Ch 6 (Information Theory and Data Compression)
 	- InformationTheory
 	- Codeword
-	- 
+	- [BinaryCode](BinaryCode.md)
+	- Entropy
+	- [InformationContent](InformationContent.md)
 
 #### Other Stuff To Look At
 
diff --git a/BinaryCode.md b/BinaryCode.md
@@ -0,0 +1,10 @@
+:data-structures: :cs:
+# Binary Code
+
+Ch 6
+
+## Notes
+
+**Definition:** A binary code for S is a function from S -> {0,1} * .
+
+Basically, this is the function to encode elements of S to binary.
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -192,3 +192,16 @@ Unit 10.1 (Graphs)
 	- [Loop](Loop.md)
 	- PseudoGraphs (multi edges + multi loop + undirect)
 	- MixedGraph (undirected + directed)
+
+Unit 10.2 (Graph Terms)
+	- Coplanar
+	- Neighborhood
+	- DegreeOfVertex
+	- Isolated (deg(a) = 0)
+	- Pendant (deg(a) = 1)
+	- HandshakingTheorem
+	- InDegree
+	- OutDegree
+	- UnderlyingUndirectedGraph (directed -> undirected)
+	- CompleteGraph (fully connected)
+	- Wheel (add vertex connected to all elements of a cycle)
diff --git a/InformationContent.md b/InformationContent.md
@@ -0,0 +1,8 @@
+:data-structures: :cs:
+# Information Content
+
+Ch 6
+
+## Notes
+
+**Definition:** Information content is the amount of data (eg. bits) needed to represent an arbitrary element of a finite set, S.