Autosave: 2024-10-19 10:00:02
This commit is contained in:
parent
e80b332060
commit
0f1a5f5664
8 changed files with 19 additions and 9 deletions
|
@ -2,6 +2,8 @@
|
||||||
tags: [algorithms]
|
tags: [algorithms]
|
||||||
---
|
---
|
||||||
|
|
||||||
|
# Algorithmic complexity
|
||||||
|
|
||||||

|

|
||||||
_Summary of the main classes of algorithmic complexity_
|
_Summary of the main classes of algorithmic complexity_
|
||||||
|
|
||||||
|
|
|
@ -3,7 +3,7 @@ tags:
|
||||||
- typescript
|
- typescript
|
||||||
---
|
---
|
||||||
|
|
||||||
## Function overloads
|
# Function overloads
|
||||||
|
|
||||||
Function overloading is not a feature of JavaScript but something close to it
|
Function overloading is not a feature of JavaScript but something close to it
|
||||||
can be achieved with TypeScript. It proceeds by defining multiple function types
|
can be achieved with TypeScript. It proceeds by defining multiple function types
|
||||||
|
|
|
@ -3,6 +3,8 @@ tags:
|
||||||
- prealgebra
|
- prealgebra
|
||||||
---
|
---
|
||||||
|
|
||||||
|
# Rules for operations on like and unlike terms
|
||||||
|
|
||||||
## Addition
|
## Addition
|
||||||
|
|
||||||
### Like terms
|
### Like terms
|
||||||
|
|
|
@ -3,6 +3,8 @@ tags:
|
||||||
- shell
|
- shell
|
||||||
---
|
---
|
||||||
|
|
||||||
|
# Shell sessions
|
||||||
|
|
||||||
## **Types of shell session**
|
## **Types of shell session**
|
||||||
|
|
||||||
Shell sessions can be one of or several instances of the following types:
|
Shell sessions can be one of or several instances of the following types:
|
||||||
|
|
|
@ -4,7 +4,7 @@ tags: []
|
||||||
created: Friday, April 26, 2024
|
created: Friday, April 26, 2024
|
||||||
---
|
---
|
||||||
|
|
||||||
# Single_file_Python_scripts
|
# Single file Python scripts
|
||||||
|
|
||||||
## Basic architecture
|
## Basic architecture
|
||||||
|
|
||||||
|
|
|
@ -2,11 +2,13 @@
|
||||||
tags: [algebra]
|
tags: [algebra]
|
||||||
---
|
---
|
||||||
|
|
||||||
|
# Solving equations
|
||||||
|
|
||||||
## Use inversion of operators
|
## Use inversion of operators
|
||||||
|
|
||||||
When solving equations we frequently make use of the
|
When solving equations we frequently make use of the
|
||||||
[ operator inversion rules](Inversion%20of%20operators.md) to find
|
[ operator inversion rules](Inversion%20of%20operators.md) to find the
|
||||||
the solutions.
|
solutions.
|
||||||
|
|
||||||
### Example: inversion of addition
|
### Example: inversion of addition
|
||||||
|
|
||||||
|
|
|
@ -3,6 +3,8 @@ tags: [literature, computer-history]
|
||||||
created: Friday, August 23, 2024
|
created: Friday, August 23, 2024
|
||||||
---
|
---
|
||||||
|
|
||||||
|
# History of Computing (Swade, 2022 )
|
||||||
|
|
||||||
| Title | Author | Publication date | Resource type |
|
| Title | Author | Publication date | Resource type |
|
||||||
| --------------------------------------------------- | ----------- | ---------------- | ------------- |
|
| --------------------------------------------------- | ----------- | ---------------- | ------------- |
|
||||||
| The History of Computing: A Very Short Introduction | Doron Swade | 2022 | Book |
|
| The History of Computing: A Very Short Introduction | Doron Swade | 2022 | Book |
|
||||||
|
|
|
@ -2,12 +2,12 @@
|
||||||
tags: [CPU]
|
tags: [CPU]
|
||||||
---
|
---
|
||||||
|
|
||||||
## The Little Man Computer
|
# The Little Man Computer
|
||||||
|
|
||||||
The [Little Man Computer]() is a simplified
|
The [Little Man Computer]() is a simplified computer that works on Von Neuman
|
||||||
computer that works on Von Neuman principles. It has all the CPU components we
|
principles. It has all the CPU components we have detailed above. It is
|
||||||
have detailed above. It is programmed in machine code but for simplicity it uses
|
programmed in machine code but for simplicity it uses the denary rather than the
|
||||||
the denary rather than the binary number system.
|
binary number system.
|
||||||
|
|
||||||

|

|
||||||
|
|
||||||
|
|
Loading…
Add table
Reference in a new issue