mirror of
https://github.com/jackyzha0/quartz.git
synced 2025-12-24 05:14:06 -06:00
auto update
This commit is contained in:
Jet Hughes
parent
7ded6ab3a0
commit
b29e682bbc
15
content/cheatsheets/latex-cheat-sheet.md
Normal file
15
content/cheatsheets/latex-cheat-sheet.md
Normal file
@ -0,0 +1,15 @@
|
||||
---
|
||||
title: "latex-cheat-sheet"
|
||||
tags:
|
||||
- cheatsheet
|
||||
---
|
||||
|
||||
https://wch.github.io/latexsheet/latexsheet-0.png
|
||||
https://wch.github.io/latexsheet/latexsheet-1.png
|
||||
|
||||
|
||||
$\theta$
|
||||
|
||||
$\leq \geq$
|
||||
|
||||
|
||||
@ -4,20 +4,7 @@
|
||||
|
||||
# 2022-04-07
|
||||
|
||||
<% tp.user.getAOTD() %>
|
||||
|
||||
| # | task | P | A | e time | r time |
|
||||
|---| ------------------------|---|---|--------| ------ |
|
||||
| 1 | | | | | |
|
||||
| 2 | | | | | |
|
||||
| 3 | | | | | |
|
||||
| 4 | | | | | |
|
||||
| 5 | | | | | |
|
||||
| 6 | | | | | |
|
||||
| 7 | | | | | |
|
||||
| 8 | | | | | |
|
||||
|
||||
> SCORE:
|
||||
Screamadelica - Primal Scream - spotify:album:3Kkocxhs4Ek537j67DFNd7
|
||||
|
||||
## 1 Todos
|
||||
- [ ] 12:00 Cosc201 lab
|
||||
@ -29,48 +16,26 @@
|
||||
|
||||
## 2 Lecture/Labs
|
||||
|
||||
<%*
|
||||
const d = new Date().getDay()
|
||||
switch(d){
|
||||
case 1:
|
||||
tR+="- [ ] 11:00 Cosc202 Lecture\n- [ ] 12:00 Cosc201 lab"
|
||||
break;
|
||||
case 2:
|
||||
tR+="- [ ] 10:00 Info203 Lecture\n- [ ] 11:00 Cosc201 Lecture\n- [ ] 13:00 Info201 Lecture\n- [ ] 14:00 Cosc202 Lab"
|
||||
break;
|
||||
case 3:
|
||||
tR+="- [ ] 10:00 Info203 Lecture\n- [ ] 14:00 Info203 Tutorial\n- [ ] 16:00 Cosc201 Tutorial"
|
||||
break;
|
||||
case 4:
|
||||
tR+="- [ ] 11:00 Cosc202 Lecture\n- [ ] 12:00 Cosc201 Lab\n- [ ] 16:00 Info201 Lecture"
|
||||
break;
|
||||
case 5:
|
||||
tR+="- [ ] 09:00 Cosc202 Lab\n- [ ] 11:00 Cosc201 Lecture\n- [ ] 12:00 Info201 Lab"
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
%>
|
||||
- [ ] 11:00 Cosc202 Lecture
|
||||
- [ ] 12:00 Cosc201 Lab
|
||||
- [ ] 16:00 Info201 Lecture
|
||||
|
||||
## 3 Assignments
|
||||
|
||||
- [ ] 203 Assignment 3
|
||||
- [ ] Decide individual or not
|
||||
|
||||
## 4 Projects
|
||||
|
||||
- python ai weekly review
|
||||
- CI notes site
|
||||
- my own password manager
|
||||
|
||||
## 5 Timetable
|
||||
## 5 Links
|
||||
### 5.1 cosc 202
|
||||
- [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
|
||||
|
||||
![[Pasted image 20220311102444.png]]
|
||||
### 5.2 info 201
|
||||
|
||||
## 6 Links
|
||||
|
||||
### 6.1 cosc 202
|
||||
|
||||
[lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
|
||||
|
||||
### 6.2 info 201
|
||||
|
||||
[tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#)
|
||||
|
||||
[Assignments](https://isgb.otago.ac.nz/info201/shared/assignments_release/raw/master/output/INFO201_Assignments.html)
|
||||
- [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#
|
||||
- [Assignments](https://isgb.otago.ac.nz/info201/shared/assignments_release/raw/master/output/INFO201_Assignments.html)
|
||||
@ -2,6 +2,7 @@
|
||||
title: "06-business-functions-and-use-cases"
|
||||
tags:
|
||||
- info201
|
||||
- lecture
|
||||
---
|
||||
|
||||
[[notes/approaches-to-systems-development]]
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "07-business-process-modelling"
|
||||
tags:
|
||||
- info201
|
||||
- lecture
|
||||
---
|
||||
|
||||
- understand core onepts realted to business process mondelling
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "07-heuristic-evaluation-cont"
|
||||
tags:
|
||||
- info203
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "07-testing"
|
||||
tags:
|
||||
- cosc202
|
||||
- lecture
|
||||
---
|
||||
|
||||
- [[notes/testing]]
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "08-business-patterns"
|
||||
tags:
|
||||
- info201
|
||||
- lecture
|
||||
---
|
||||
|
||||
[[notes/entity-relationship-diagrams]]
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "08-debugging"
|
||||
tags:
|
||||
- cosc202
|
||||
- lecture
|
||||
---
|
||||
|
||||
[[notes/debugging]]
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "08-personas-and-scenarios"
|
||||
tags:
|
||||
- info203
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "09-data-modelling-and-normalisation"
|
||||
tags:
|
||||
- info201
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "09-documentation"
|
||||
tags:
|
||||
- cosc202
|
||||
- lecture
|
||||
---
|
||||
|
||||
[[documentation]]
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "09-paper-prototypes-wiz-of-oz-video-prototypes"
|
||||
tags:
|
||||
- info203
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "10-continuous-integration-1"
|
||||
tags:
|
||||
- cosc202
|
||||
- lecture
|
||||
---
|
||||
|
||||
[[continuous-integration]]
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "10-design-heuristics-1"
|
||||
tags:
|
||||
- info203
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -1,5 +1,8 @@
|
||||
---
|
||||
title: "10-heaps-and-heapsort"
|
||||
sr-due: 2022-04-08
|
||||
sr-interval: 3
|
||||
sr-ease: 250
|
||||
tags:
|
||||
- cosc201
|
||||
- lecture
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "10-oop-concepts-and-uml"
|
||||
tags:
|
||||
- info201
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -1,7 +1,11 @@
|
||||
---
|
||||
title: "11-class-diagrams"
|
||||
sr-due: 2022-04-08
|
||||
sr-interval: 3
|
||||
sr-ease: 250
|
||||
tags:
|
||||
- info201
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "11-continuous-integration-2"
|
||||
tags:
|
||||
- cosc202
|
||||
- lecture
|
||||
---
|
||||
|
||||
1. apprecitae that gitlab is a xomplex software
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "11-design-heuristics-2"
|
||||
tags:
|
||||
- info203
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
@ -2,6 +2,7 @@
|
||||
title: "12-design-heuristics-3"
|
||||
tags:
|
||||
- info203
|
||||
- lecture
|
||||
---
|
||||
|
||||
|
||||
|
||||
28
content/notes/aymptotic-notation.md
Normal file
28
content/notes/aymptotic-notation.md
Normal file
@ -0,0 +1,28 @@
|
||||
---
|
||||
title: "asymptotic-notation"
|
||||
tags:
|
||||
- cosc201
|
||||
- analysis-of-algorithms
|
||||
---
|
||||
|
||||
Asymptotic notations are used in computer science to classify algorithms based how its space and time requirements grow as the input grows.
|
||||
|
||||
|
||||
# big O notation
|
||||
|
||||
Big O defines a bound for the *upper limit* of the running time (or space) of a algorithm. However, it is possible that the actual running time is much less as it does not take into account special cases
|
||||
|
||||
|
||||
## 1 Formal definition
|
||||
|
||||
$f(n) = O(g(n))$ if there is some constant $A$ such that $f(n) < A \times g(n)$
|
||||
|
||||
|
||||
# big theta notation
|
||||
|
||||
Big theta defines an upper and a lower bound for a the running time (or space) of an algorithm.
|
||||
|
||||
|
||||
## 2 Formal definition
|
||||
|
||||
$f(n) = \theta(g(n))$ if there are some constants $A$ and $B$ where $0 < B < A$ such that for all sufficiently large $n$, $B \times g(n) \geq f(n) \leq A \times g(n)$
|
||||
@ -1,16 +0,0 @@
|
||||
---
|
||||
title: "big-o"
|
||||
tags:
|
||||
- cosc201
|
||||
---
|
||||
|
||||
>Big O means $f(n) = O(g(n))$ if there is some constant $A > 0$ such that for all sufficiently large n, $f(n) ≤ A × g(n).$
|
||||
|
||||
- Big O provides *upper bounds* only. (usually on worst case runtimes)
|
||||
- sometimes cost will be much less
|
||||
- does not take special cases into account
|
||||
- upper bound
|
||||
- $O$ says that $g(n)$ provides an upper bound for $f(n)$
|
||||
- "Insertion sort is $O(n^2)$" -> the maximum number of basic operations in never more than some constanct times $n^2$
|
||||
- if $f(n) =O(g(n))$ then the opposite is also true
|
||||
- usually $f(n)$ is complex but $g(n)$ is very simple
|
||||
@ -1,14 +1,17 @@
|
||||
---
|
||||
title: "big-theta"
|
||||
title: "big-theta-notation"
|
||||
tags:
|
||||
- cosc201
|
||||
---
|
||||
|
||||
|
||||
|
||||
|
||||
>Big theta means $f(n) = \Theta(g(n))$ if there are constants 0 < B < A such that for all sufficiently large n, ==$B × g(n) ≤ f(n) ≤ A × g(n)$==
|
||||
|
||||
- Upper and lower bound
|
||||
- $Θ$ says that $g(n)$ provides **upper** and **lower** bound for $f(n)$
|
||||
- "selection sort is $\Theta(n^2)$" -> the maximum number of operations will be bounded bothh above and below by some constant times $n^2$
|
||||
- "selection sort is $\Theta(n^2)$" -> the maximum number of operations will be bounded both above and below by some constant times $n^2$
|
||||
- $f(n) = \Theta(g(n))$ means that f and g have similar growth rates
|
||||
- if $f(n) = \Theta(g(n))$ then the opposite is also true
|
||||
- usually $f(n)$ is complex but $g(n)$ is very simple
|
||||
@ -5,8 +5,8 @@ tags:
|
||||
- outline
|
||||
---
|
||||
|
||||
- [[notes/big-o]]
|
||||
- [[notes/big-theta]]
|
||||
- [[notes/aymptotic-notation]]
|
||||
- [[notes/big-theta-notation]]
|
||||
- [[notes/induction]]
|
||||
- [[notes/analysis-of-recursive-algorithms]]
|
||||
- [[notes/union-find]]
|
||||
|
||||
@ -39,7 +39,7 @@ unknown users can fork then add a feature/bug then do a merge request which can
|
||||
|
||||
## 3 git repos
|
||||
|
||||
[[notes/git-cheat-sheet|Repositories]] maintain code history
|
||||
[[cheatsheets/git-cheat-sheet|Repositories]] maintain code history
|
||||
can be conceptualised as a graph
|
||||
|
||||
```mermaid
|
||||
|
||||
@ -15,3 +15,8 @@ tags:
|
||||
- [[notes/approaches-to-systems-development]]
|
||||
- [[notes/business-functions]]
|
||||
- [[notes/use-case-diagrams]]
|
||||
- [[notes/business-process]]
|
||||
- [[notes/business-process-model]]
|
||||
- [[notes/business-process-model-and-notation]]
|
||||
- [[notes/UML]]
|
||||
- [[notes/entity-relationship-diagrams]]
|
||||
@ -16,7 +16,7 @@ E.g., [[git]]
|
||||
- not restrict workflow
|
||||
|
||||
## 2 Terms
|
||||
[[notes/git-cheat-sheet]]
|
||||
[[cheatsheets/git-cheat-sheet]]
|
||||
|
||||
## 3 Discipline
|
||||
- Pull/Push Regularly
|
||||
|
||||
Loading…
Reference in New Issue
Block a user