commit 518434132b7271419464440da4a526fe8a1f636a
parent 4363194e243cbec5874ac3ee0f4feab9ccb24ce1
Author: Andrew <andrewlaack1@gmail.com>
Date: Fri, 6 Sep 2024 20:20:07 -0500
Took some notes
Diffstat:
6 files changed, 32 insertions(+), 4 deletions(-)
diff --git a/Algorithms.md b/Algorithms.md
@@ -12,11 +12,16 @@ This is an index for links to notes taken about algorithms. These are CS related
#### CSCI 303 (DS&A)
+Questions to ask:
+
+Given our definition of a task, would it be a task to generate a pseudorandom number between 0 and some input value? There could in theory be infinite outputs for a given input, assuming you have a computer with infinite precision, and thus that would not be a well-defined function obviously if we are discussing multi valued functions it would be a function, but I don't think that is what we are discussing.
+
Ch 0 (algorithms):
- [[Algorithm.md]]
- [[Task.md]]
- [[TimeComplexity.md]]
- [CountingPrinciple](CountingPrinciple.md)
+ - [MultiValuedFunction](MultiValuedFunction.md)
Ch 1 (stacks and queues):
- [AbstractDataType](AbstractDataType.md)
@@ -31,7 +36,7 @@ Ch 2 (Big-O and Asymptotic Complexity):
Ch 3 (state analysis):
- [StateAnalysis](StateAnalysis.md)
- - StirlingsFormula
+ - [StirlingsFormula](StirlingsFormula.md)
#### Intro To Algorithms (MIT)
diff --git a/Assembly.md b/Assembly.md
@@ -5,6 +5,7 @@ Main Links For Assembly Language
---
-Arm Assembly Language 2nd Edition Notes:
-
+Assembly Language CS 224
+Week 1:
+- [TwosComplement](TwosComplement.md)
diff --git a/Calculus.md b/Calculus.md
@@ -25,6 +25,7 @@ Unit 1:
Unit 2:
- [usubstitution](usubstitution.md)
+ - ExponentialRule
Calculus Early Transcendentals JS:
diff --git a/DiscreteMath.md b/DiscreteMath.md
@@ -106,6 +106,10 @@ Unit 2.4 (integers and division):
- [LinearCombination](LinearCombination.md)
- [LinearCongruence](LinearCongruence.md)
+Unit 2.4 (Sequences and Summations 8th edition)
+ - [RecurrenceRelation](RecurrenceRelation.md)
+ -
+
Unit 6.1 (The Basics of Counting 8th edition)
- [Combinatorics](Combinatorics.md)
- [SumRule](SumRule.md)
@@ -116,4 +120,3 @@ Unit 6.1 (The Basics of Counting 8th edition)
Unit 6.2 (Pigeonhole principle)
- [PigeonholePrinciple](PigeonholePrinciple.md)
- -
diff --git a/MultiValuedFunction.md b/MultiValuedFunction.md
@@ -0,0 +1,10 @@
+:algorithms: :math:
+# Multivalued Function
+
+Ch 0
+
+## Notes
+
+**Definition:** Multivalued functions are functions such that there exists two or more values in the codomain for at least one value in the domain.
+
+These are not strictly functions, unless specified, as functions must map to only one value in the codomain for each value in the domain.
diff --git a/StirlingsFormula.md b/StirlingsFormula.md
@@ -0,0 +1,8 @@
+:math: :algorithms: :discrete:
+# Stirling's Formula
+
+Ch 3
+
+## Notes
+
+**Definition:** Stirling's formula is a closed form approximation for factorials.
