Skip to content

Commit

Permalink
spelling fixes
Browse files Browse the repository at this point in the history
  • Loading branch information
@avipars
avipars authored Sep 19, 2024
1 parent d75d56f commit 3fa14be
Show file tree
Hide file tree
Showing 8 changed files with 26 additions and 26 deletions.
2 changes: 1 addition & 1 deletion DigitalSystems/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -24,7 +24,7 @@ Quine-McCluskey:

Boolean Algebra:

* [boolean-algebra.com/](https://www.boolean-algebra.com/) - also does kmaps
* [boolean-algebra.com/](https://www.boolean-algebra.com/) - also does k-maps

* [wolframalpha](https://www.wolframalpha.com/input/?i=Z++XOR+%28V*X%29)

Expand Down
4 changes: 2 additions & 2 deletions data_struct2/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -196,7 +196,7 @@ Topological Sort in DAG
* as each vertex finishes, add to front of linked list
* return linked list of vertices
- Insertion is O(1), `|V|` vertices to add
- Usually we would want to reverse the linked list to get our prefered order
- Usually we would want to reverse the linked list to get our preferred order


B tree:
Expand Down Expand Up @@ -241,7 +241,7 @@ B tree:

- With chaining specifically (part of open addressing):
- each spot has a linked list (empty by default), upon insertion, element becomes the new head of the list
- upon collision, the newer item gets put at the head of the list for the respestive spot and the previous item in the list becomes the node after the head.
- upon collision, the newer item gets put at the head of the list for the respective spot and the previous item in the list becomes the node after the head.
- Open addressing allows your key to go to almost (if not all) of the slots by using a probe/step function
- i.e. for linear/quadratic probing we have a step function in addition to the original hash function, with a coefficient i/i^2 respective to the type of probe. Initially it will be 0, but after every collision we will increment by 1

Expand Down
14 changes: 7 additions & 7 deletions databases/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -95,19 +95,19 @@ Schema
| Binary | Cartesian product | X | | m\*n (rxt) | | tuple for each pair of tuples from two input relations, # of tuples is product of # of tuples in R and in S. | |
| Union | U | max(m,n) | n+m | no duplicated values in end result | Combine 2 tables, only works for comptible relations (with same schema), # of rows doesn't matter | Contains all tuples that are in at least one of the relations | |
| Difference | \- | n-m, unless m > n then = 0 | n (ie if 2nd set is empty) | | Only for compatible relations (same schema) | Result contains all tuples in R that are not in S | |
| Intersection | ∩ | 0 (disjoint) | min(n,m) | | Needs to be forcompatible relations R - (R-S) = R ∩ S | returns all touples in both R and S | |
| Intersection | ∩ | 0 (disjoint) | min(n,m) | | Needs to be for compatible relations R - (R-S) = R ∩ S | returns all tuples in both R and S | |
| Conditional Join | ⋈c | | | | Boolean condition over pairs of attributes from R and S - cartesian product with condition…. Selection of … join - CJ | |
| Natural Join | ⋈ bowtime | 0 - nothing matches | n\*m | | condition is there automatically - if one col = same it looks at it .same schema , same columns | |
| Division | ÷ | 0 - can be empty table (no results) | | Scema of 2nd relation must be subset of the first R/S | Result contains tuples (a1,….,an) st for all (b1,…bm) in S, (a1,..an,b1,..,bm) is in R | |
| Natural Join | ⋈ bowtie | 0 - nothing matches | n\*m | | condition is there automatically - if one col = same it looks at it .same schema , same columns | |
| Division | ÷ | 0 - can be empty table (no results) | | Schema of 2nd relation must be subset of the first R/S | Result contains tuples (a1,….,an) st for all (b1,…bm) in S, (a1,..an,b1,..,bm) is in R | |
| | | | | | | | | |
| | Equivelence | ≡ | | | | For all instances of the relations in E1and E2, they return the same result | |
| | Equivalence | ≡ | | | | For all instances of the relations in E1and E2, they return the same result | |

| Relational algebra | SQL |
| ------------------------------------------------ | ------------------------------------------ |
| set of tuples | multiset of tupils |
| set of tuples | multiset of tuples |
| no null - no unknown values | Can have null values |
| | |
| 2 valued logic for conditions true/false (logic) | unknown, true, falae |
| 2 valued logic for conditions true/false (logic) | unknown, true, false |
| not turing complete - limited | turing complete (many additional features) |


Expand Down Expand Up @@ -153,7 +153,7 @@ Actions with or about Nulls and return values
Parent VARCHAR(20)
);

INSERT INTO Parents VALUES ('avraham', 'yitz');
INSERT INTO Parents VALUES ('sarah', 'yitz');
-- QUERY database
SELECT * FROM Parents;

Expand Down
2 changes: 1 addition & 1 deletion intro_sec/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -21,7 +21,7 @@ sitemap:
Basic understanding of Python, and Linux will help a lot...
Install a virtual machine manager such as virtual box for windows, download ISO files for an OS you want to use such as windows, ubuntu, or kali... and get that set up!

Prerequesites for the cousre:
Prerequisites for the course:

1. [Workshop in C/C++](https://cs.aviparshan.com/cpp_workshop/)

Expand Down
4 changes: 2 additions & 2 deletions math/calculus/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -106,10 +106,10 @@ from khan academy
* [General Limit Laws](https://www.milefoot.com/math/calculus/limits/GenericLimitLawProofs04.htm)


* [Tangent, Cotangent, Secant, and Cosecant with derivitives](https://math.dartmouth.edu/opencalc2/cole/lecture17.pdf)
* [Tangent, Cotangent, Secant, and Cosecant with derivatives](https://math.dartmouth.edu/opencalc2/cole/lecture17.pdf)


* [Derivitive calculator](https://www.derivative-calculator.net/)
* [Derivatives calculator](https://www.derivative-calculator.net/)


* [Integration calculator](https://www.integral-calculator.com/)
Expand Down
4 changes: 2 additions & 2 deletions math/discrete/README.MD
View file
Original file line number Diff line number Diff line change
Expand Up @@ -160,7 +160,7 @@ tags:

* R ∘ R = R<sup>2</sup> is a relation composed with itself

* (R ∘ S) ∘ T = R ∘ (S ∘ T) i.e it is associative (but not communitive)
* (R ∘ S) ∘ T = R ∘ (S ∘ T) i.e it is associative (but not commutative)

* Ia ∘ R = R

Expand Down Expand Up @@ -225,7 +225,7 @@ Let f,g be two functions, (f:A -> B) , (g:B -> A)
| Invertibility | Right invertible | Left Invertible | Invertible | Invertible |
| G is - inverse of f | f ∘ g = Ib | g ∘ f = Ia | g ∘ f = Ia, f ∘ g = Ib | f ∘ Ia = f = Ib ∘ f |
| Definition | `{f(a) | a ∈ A} ` = B every element in range (B) has a source | if a1 != a2 then f(a1) != f(a2) or contrapositive if f(a1) = f(a2) then a1 = a2 | f⁻¹ = g | f(a) = a |
| English | function that maps one or more elements of A to the same element of B | function that always maps the distinct element of its domain to the distinct element of its codomain | function that is both injective and surjective | function that always returns the value that was used as its argument, unchanged |
| English | function that maps one or more elements of A to the same element of B | function that always maps the distinct element of its domain to the distinct element of its co-domain | function that is both injective and surjective | function that always returns the value that was used as its argument, unchanged |

- Notation for function composition

Expand Down
2 changes: 1 addition & 1 deletion math/linearalgebra/README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -55,7 +55,7 @@ row(A) = Row space of A (span of its column vectors)

rank(A) = The rank of A (dimension of row space)

adj(A) = Adjugate matrix (transpose of cofactor matrix)
adj(A) = Adjugate matrix (transpose of co-factor matrix)

##### Let A,B denote 2 vectors

Expand Down
Loading

0 comments on commit 3fa14be

Please sign in to comment.