commit dd366547e4c0bf5d0a35fc7573b2ea01fb94baa2
parent 90dd47fc26306f67901ccca617a30b653619c2c1
Author: Andrew <andrewlaack1@gmail.com>
Date: Tue, 10 Sep 2024 05:35:07 -0500
Took some notes
Diffstat:
6 files changed, 26 insertions(+), 2 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -21,7 +21,6 @@ Ch 0 (algorithms):
- [Collection](Collection.md)
- [FunctionNotation](FunctionNotation.md)
- [OperatorNotation](OperatorNotation.md)
- -
Ch 1 (stacks and queues):
- [AbstractDataType](AbstractDataType.md)
diff --git a/Assembly.md b/Assembly.md
@@ -17,3 +17,8 @@ Week 1:
Week 2:
+- Unicode (2 bytes)
+- Ascii (1 byte)
+- String (zero terminated, this is the c standard but we will use it in assembly)
+- Microprocessor (core / no memory in processor)
+- Microcontroller (core + memory / the memory is with the core but can work with external memory)
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -108,7 +108,6 @@ Unit 2.4 (integers and division):
Unit 2.4 (Sequences and Summations 8th edition)
- [RecurrenceRelation](RecurrenceRelation.md)
- -
Unit 6.1 (The Basics of Counting 8th edition)
- [Combinatorics](Combinatorics.md)
@@ -117,6 +116,9 @@ Unit 6.1 (The Basics of Counting 8th edition)
- [SubtractionRule](SubtractionRule.md)
- [DivisionRule](DivisionRule.md)
- [SumOfGeometricSeries](SumOfGeometricSeries.md)
+ - [CountingPrinciple](CountingPrinciple.md) - Also referred to as product rule.
Unit 6.2 (Pigeonhole principle)
- [PigeonholePrinciple](PigeonholePrinciple.md)
+ - [GeneralizedPigeonholePrinciple](GeneralizedPigeonholePrinciple.md)
+ - [Subsequence](Subsequence.md)
diff --git a/GeneralizedPigeonholePrinciple.md b/GeneralizedPigeonholePrinciple.md
@@ -0,0 +1,8 @@
+:discrete:
+# Generalized Pigeonhole Principle
+
+Ch 6.2
+
+## Notes
+
+**Definition:** The generalized pigeonhole principle is \ceil{N/k} where N is the number of elements and k the number of groups. This gives us the maximally filled group given equitable distribution.
diff --git a/Subsequence.md b/Subsequence.md
@@ -0,0 +1,8 @@
+:discrete:
+# Subsequence
+
+Ch 6.2
+
+## Notes
+
+**Definition:** A subsequence is a selection, or all, elements of a sequence kept in order.
diff --git a/Task.md b/Task.md
@@ -8,3 +8,5 @@ Ch 0
**Definition:** A task is a function from I to O where I is the set of all valid inputs and O is the set of all valid outputs.
In this definition we are using the formal definition of a function from math.
+
+This does not define how to go from input to output just the expected outputs.
