commit 30a6238322105e052274853be375cf481f6630c5
parent a2aeb33018acbda34f3ac8b604146e26fa9d0ab0
Author: Andrew <andrewlaack1@gmail.com>
Date: Tue, 30 Apr 2024 12:58:27 -0500
Took notes about cs202 lecture
Diffstat:
7 files changed, 48 insertions(+), 1 deletion(-)
diff --git a/CS202.md b/CS202.md
@@ -14,3 +14,5 @@ This is the index for my cs 202 notes.
[[BinaryTree.md]]
[[DepthFirstSearch.md]]
[[BreadthFirstSearch.md]]
+[[Rvalue.md]]
+[[Lvalue.md]]
diff --git a/CS331.md b/CS331.md
@@ -8,3 +8,4 @@ This is the index for my CS 332 notes.
[[Unity.md]]
[[Blender.md]]
[[MathConceptsCS331.md]]
+
diff --git a/EquivalenceClass.md b/EquivalenceClass.md
@@ -0,0 +1,9 @@
+# Equivalence Class
+
+AM W14 Video
+
+## Notes
+
+**Definition:** An equivalence class is a subset of a set relation that describes a given output and all elements of the sort denoted by [X].
+
+A simple example of this is the mod 5 relation. There are only five values that can result from mod 5 for the set $\Z$ being 0,1,2,3, and 4. Each of these can be defined as its own equivalence class denoted by [0], [1], [2], [3], and [4]. For a class to be an equivalence class, the relation must be an equivalence relation. Additionally we know [0] = [5] = [10] and no two sets are equivalent to each other. The final interesting thing is that the intersection between any of these sets is always the null set.
diff --git a/Lvalue.md b/Lvalue.md
@@ -0,0 +1,16 @@
+:cs202: :c++:
+# lvalue
+
+cs202 W14 L16
+
+## Notes
+
+**Definition:** An lvalue is a value that is not temporary and cannot be moved.
+
+An example of an lvalue is as follows:
+
+```cpp
+
+int x = 5; // x is an lvalue
+
+```
diff --git a/Partition.md b/Partition.md
@@ -7,3 +7,6 @@ AM W14 Reading
**Definition:** A partition of a set A is a set of non-empty subsets of A, such that the union of all the subsets equals A, and the intersection of any two different subsets is the null set.
Basically, a partition is the subsets of a set where all subsets together make the original set and all subsets are unique in their elements where any intersection between them is the null set. Keep in mind the partition is the combination of all of them not simply a singular one of the subsets which is where this diverges from the computational term "partition".
+
+This relates to [[EquivalenceClass.md]] as certain partitions are equivalence classes when considering equivalence relation sets.
+
diff --git a/Rvalue.md b/Rvalue.md
@@ -0,0 +1,17 @@
+:cs202: :c++:
+# rvalue
+
+cs202 W14 L16
+
+## Notes
+
+**Definition:** An rvalue is a temporary value that can be moved.
+
+These values can't be on the left side of an assignment think
+
+```cpp
+
+int y = 4 + 7; // 4 + 7 is an rvalue
+int z = x + y; // x + y is an rvalue
+
+```
diff --git a/index.md b/index.md
@@ -20,4 +20,3 @@ This is the index for my main note classifications. I will maintain this as a ho
- [ ] "The Structure of Scientific Revolutions" - Thomas Kuhn
- [ ] "Introduction to Computing Systems" - Patt and Patel
-
