update quartz

2025-12-24 13:24:05 -06:00 · 2022-05-10 22:41:59 +12:00 · 2022-05-10 22:41:59 +12:00 · 6d928b5569
commit 6d928b5569
parent f7100cd958
84 changed files with 426 additions and 220 deletions
--- a/content/_index.md
+++ b/content/_index.md
@ -3,14 +3,12 @@ title: "Jet Hughes"
 ---
 # 1 Papers
 - [cosc-201](notes/cosc-201.md)
 - [cosc-202](notes/cosc-202.md)
 - [info-201](notes/info-201.md)
 - [info-203](notes/info-203.md)
 # 2 Other
 - [templates](notes/templates.md)
 - [bash-tricks](cheatsheets/bash-tricks.md)
 - [git-cheat-sheet](cheatsheets/git-cheat-sheet.md)
@ -21,7 +19,6 @@ title: "Jet Hughes"
 - 
 # 5 Independent Learning
 - [networks](notes/networks.md)
 - random
 	- [propogation-of-ideas](notes/propogation-of-ideas.md)
--- a/content/daily_notes/2022-03-11.md
+++ b/content/daily_notes/2022-03-11.md
@ -27,4 +27,4 @@
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-12.md
+++ b/content/daily_notes/2022-03-12.md
@ -21,4 +21,4 @@ brief notes
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-14.md
+++ b/content/daily_notes/2022-03-14.md
@ -18,4 +18,4 @@
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-15.md
+++ b/content/daily_notes/2022-03-15.md
@ -28,4 +28,4 @@
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#:)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-16.md
+++ b/content/daily_notes/2022-03-16.md
@ -38,4 +38,4 @@
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-17.md
+++ b/content/daily_notes/2022-03-17.md
@ -41,4 +41,4 @@
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-18.md
+++ b/content/daily_notes/2022-03-18.md
@ -37,4 +37,4 @@
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-19.md
+++ b/content/daily_notes/2022-03-19.md
@ -30,7 +30,7 @@
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
 - [ ] python ai weekly review
 - [ ] my own password manager
 - [ ] 
--- a/content/daily_notes/2022-03-20.md
+++ b/content/daily_notes/2022-03-20.md
@ -29,7 +29,7 @@
 ## Links
 cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.pdf)
 info 201 [tiddlywiki](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket:%5B%5B%2FLabs%2FLab%2002%2FLab%202%3A%20Git%20and%20GitBucket%5D%5D)
-![[Pasted image 20220311102444.png]]
+![[ ]]
 - [ ] 
 - [ ] 
 - [ ] python ai weekly review
--- a/content/daily_notes/2022-03-21.md
+++ b/content/daily_notes/2022-03-21.md
@ -39,4 +39,4 @@ cosc 202 [lab book](https://cosc202.cspages.otago.ac.nz/lab-book/COSC202LabBook.
 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)
-![[Pasted image 20220311102444.png]]
+![[ ]]
--- a/content/daily_notes/2022-03-22.md
+++ b/content/daily_notes/2022-03-22.md
@ -45,7 +45,7 @@
 - [ ] my own password manager
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
 ### cosc 202 
--- a/content/daily_notes/2022-03-23.md
+++ b/content/daily_notes/2022-03-23.md
@ -50,7 +50,7 @@
 - [ ] 
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
 ### cosc 202 
--- a/content/daily_notes/2022-03-24.md
+++ b/content/daily_notes/2022-03-24.md
@ -45,7 +45,7 @@
 - [ ] my own password manager
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
 ### cosc 202 
--- a/content/daily_notes/2022-03-25.md
+++ b/content/daily_notes/2022-03-25.md
@ -44,7 +44,7 @@
 - [ ] my own password manager
 ## 5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 6 Links
 ### 6.1 cosc 202 
--- a/content/daily_notes/2022-03-27.md
+++ b/content/daily_notes/2022-03-27.md
@ -39,7 +39,7 @@
 - [ ] 
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
 ### cosc 202 
--- a/content/daily_notes/2022-03-28.md
+++ b/content/daily_notes/2022-03-28.md
@ -45,7 +45,7 @@
 - [ ] my own password manager
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
 ### cosc 202 
--- a/content/daily_notes/2022-03-29.md
+++ b/content/daily_notes/2022-03-29.md
@ -45,7 +45,7 @@
 - [ ] my own password manager
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
 ### cosc 202 
--- a/content/daily_notes/2022-03-30.md
+++ b/content/daily_notes/2022-03-30.md
@ -46,7 +46,7 @@
 - [ ] my own password manager
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
 ### cosc 202 
--- a/content/daily_notes/2022-03-31.md
+++ b/content/daily_notes/2022-03-31.md
@ -42,7 +42,7 @@
 - [ ] my own password manager
 ## 5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 6 Links
 ### 6.1 cosc 202 
--- a/content/daily_notes/2022-04-01.md
+++ b/content/daily_notes/2022-04-01.md
@ -40,7 +40,7 @@
 - [ ] my own password manager
 ## 5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 6 Links
 ### 6.1 cosc 202 
--- a/content/daily_notes/2022-04-02.md
+++ b/content/daily_notes/2022-04-02.md
@ -35,7 +35,7 @@
 - [ ] python ai weekly review
 - [ ] my own password manager
 ## 5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 6 Links
 ### 6.1 cosc 202 
--- a/content/daily_notes/2022-04-03.md
+++ b/content/daily_notes/2022-04-03.md
@ -36,7 +36,7 @@
 - [ ] my own password manager
 ## 5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 6 Links
 ### 6.1 cosc 202 
--- a/content/daily_notes/2022-04-04.md
+++ b/content/daily_notes/2022-04-04.md
@ -31,7 +31,7 @@
 - continuously integrate obsidian notes to website
 ## 5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 6 Links
 ### 6.1 cosc 202 
--- a/content/daily_notes/2022-04-06.md
+++ b/content/daily_notes/2022-04-06.md
@ -39,7 +39,7 @@ Raw Power - The Stooges - spotify:album:6mxbG8KrOTZIxlP4gzaliM
 - my own password manager
 ## 5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 6 Links
 ### 6.1 cosc 202 
--- a/content/daily_notes/2022-04-08.md
+++ b/content/daily_notes/2022-04-08.md
@ -31,7 +31,7 @@ Autobahn - Kraftwerk - spotify:album:0DzC0tyowMi2O9QfkDRvfJ
 ## 1.5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 1.6 Links
--- a/content/daily_notes/2022-04-09.md
+++ b/content/daily_notes/2022-04-09.md
@ -32,7 +32,7 @@ Toys In The Attic - Aerosmith - spotify:album:36IxIOGEBAXVozDSiVs09B
 ## 1.5 Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## 1.6 Links
--- a/content/daily_notes/2022-04-10.md
+++ b/content/daily_notes/2022-04-10.md
@ -27,7 +27,7 @@ Bryter Layter - Nick Drake - spotify:album:7w9Og10Tdkh3nqrVD1D5IW
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-11.md
+++ b/content/daily_notes/2022-04-11.md
@ -32,7 +32,7 @@ Layla And Other Assorted Love Songs - Derek &amp; The Dominos - spotify:album:5i
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-12.md
+++ b/content/daily_notes/2022-04-12.md
@ -35,7 +35,7 @@ Synchronicity - The Police - spotify:album:28eOriEfl7IGbQDNvWIWXK
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-13.md
+++ b/content/daily_notes/2022-04-13.md
@ -33,7 +33,7 @@ Listen Without Prejudice Vol. 1 - George Michael - spotify:album:4lGS8HxU3NYaQxf
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-14.md
+++ b/content/daily_notes/2022-04-14.md
@ -35,7 +35,7 @@ Happy Sad - Tim Buckley - spotify:album:20CYfxjKvqXkCXBhAgOE39
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-15.md
+++ b/content/daily_notes/2022-04-15.md
@ -35,7 +35,7 @@ Smile - Brian Wilson - spotify:album:4Uc6YCjpfyjj02rZfg2EUv
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-16.md
+++ b/content/daily_notes/2022-04-16.md
@ -36,7 +36,7 @@ No Sleep 'Til Hammersmith (Live) - Mot<6F>rhead - spotify:album:6DJEPyUk9Vqvq5Rh8
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-18.md
+++ b/content/daily_notes/2022-04-18.md
@ -36,7 +36,7 @@ Tonight's The Night - Neil Young - spotify:album:5FTx6W84UUU14n29QV4saY
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-19.md
+++ b/content/daily_notes/2022-04-19.md
@ -28,7 +28,7 @@ Giant Steps - The Boo Radleys - spotify:album:6347aGYak5Dsi0hwPMMpmj
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-20.md
+++ b/content/daily_notes/2022-04-20.md
@ -28,7 +28,7 @@ Giant Steps - The Boo Radleys - spotify:album:6347aGYak5Dsi0hwPMMpmj
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-04-23.md
+++ b/content/daily_notes/2022-04-23.md
@ -19,7 +19,7 @@
 ## Timetable
-![[Pasted image 20220311102444.png]]
+![[ ]]
 ## Links
--- a/content/daily_notes/2022-05-10.md
+++ b/content/daily_notes/2022-05-10.md
@ -0,0 +1,30 @@
 [2022-05-09](daily_notes/2022-05-09) << [daily-notes](notes/daily-notes.md) >> [2022-05-11](daily_notes/2022-05-11)
 ---
 # 10-05-22
 [The Modern Lovers - The Modern Lovers](spotify:album:5BPCP7WSGBG4br2o4WRmd8)
 ![Hey! No running in the back-arc basin!](https://imgs.xkcd.com/comics/deep_end.png)
 ## Todos
 - [ ] 12:00 Info201 Lab 8
 - [ ] Info201 Lecture 14
 - [ ] Info201 Lecture 18
 - [ ] info 202 api's lecture
 - [ ] 11:00 Cosc202 Lecture
 - [ ] 12:00 Cosc201 lab
 ## Lecture/Labs
 - [ ] 10:00 Info203 Lecture
 - [x] 11:00 Cosc201 Lecture
 - [ ] 13:00 Info201 Lecture
 - [ ] 14:00 Cosc202 Lab
 ## Projects
 - python ai weekly review
 - spotify clone
 ## Links
 - [202 lab book](C:\Users\Jet%20Hughes\Documents\Personal\COSC202LabBook-2.pdf)
 - [i201 cousework](https://isgb.otago.ac.nz/infosci/INFO201/labs_release/raw/master/output/info201_labs.html#)
 - [i201 Assignments](https://open.spotify.com/album/23DJ3KNE5JXi61G31T2Kni?si=-zZEHXIxT2qOEN6_Ns5C5Ql)
--- a/content/notes/07-business-process-modelling.md
+++ b/content/notes/07-business-process-modelling.md
@ -3,8 +3,8 @@ title: "07-business-process-modelling"
 tags: 
 - info201 
 - lecture
-sr-due: 2022-05-11
+sr-due: 2022-05-16
-sr-interval: 3
+sr-interval: 6
 sr-ease: 270
 ---
--- a/content/notes/07-testing.md
+++ b/content/notes/07-testing.md
@ -3,8 +3,8 @@ title: "07-testing"
 tags: 
 - cosc202 
 - lecture
-sr-due: 2022-05-11
+sr-due: 2022-05-18
-sr-interval: 3
+sr-interval: 8
 sr-ease: 270
 ---
@ -12,7 +12,7 @@ sr-ease: 270
 - [test-driven-development](notes/test-driven-development.md)
 - [unit-testing](notes/unit-testing.md)
- undnerstand that testing is useful for detecting bugs
+- understand that testing is useful for detecting bugs
 - contrast different types of testting
 - descrive the principle of test driven development
 - explain how unit tests ar developed
--- a/content/notes/09-data-modelling-and-normalisation.md
+++ b/content/notes/09-data-modelling-and-normalisation.md
@ -11,5 +11,3 @@ sr-ease: 250
 - [redundancy-and-anomalies](notes/redundancy-and-anomalies.md)
 - [dependencies](notes/dependencies.md)
 - [normalisation](notes/normalisation.md)
--- a/content/notes/09-stacks-queues-heaps.md
+++ b/content/notes/09-stacks-queues-heaps.md
@ -3,8 +3,8 @@ title: "09-stacks-queues-heaps"
 tags: 
 - cosc201 
 - lecture
-sr-due: 2022-05-10
+sr-due: 2022-05-12
-sr-interval: 1
+sr-interval: 2
 sr-ease: 210
 ---
--- a/content/notes/10-continuous-integration-1.md
+++ b/content/notes/10-continuous-integration-1.md
@ -3,8 +3,8 @@ title: "10-continuous-integration-1"
 tags: 
 - cosc202 
 - lecture
-sr-due: 2022-05-11
+sr-due: 2022-05-17
-sr-interval: 3
+sr-interval: 7
 sr-ease: 250
 ---
--- a/content/notes/10-heaps-and-heapsort.md
+++ b/content/notes/10-heaps-and-heapsort.md
@ -8,7 +8,7 @@ tags:
 - lecture
 ---
-[heaps-and-heapsort](notes/heaps-and-heapsort.md)
+[heapsort](notes/heapsort.md)
 # 1 Overview
--- a/content/notes/13-design-heuristics-4.md
+++ b/content/notes/13-design-heuristics-4.md
@ -9,7 +9,7 @@ sr-interval: 3
 sr-ease: 250
 ---
-aesthetic and minimalist
+# aesthetic and minimalist
 - signal to noise ratio
 - what are you core functionality
 - how can you best use your screen space
@ -19,7 +19,7 @@ recognise diagnore recover from errors
 - e.g., username or password is wrong vs username is wrong
 - provide a solution and inform users (treat the users as adults
-help
+# help
 - guide the way and show steps
 - online help
 	- transition from built in help to links to online help
@ -28,12 +28,12 @@ help
 - help clearly and transparently
 	- e.g., privacy and terms/conditions
-anti design heuristics
+# anti design heuristics
 [](https://i.imgur.com/BHJ5iQU.png)
 [](https://i.imgur.com/DrqSSK5.png)
 [](https://i.imgur.com/KPW6h19.png)
-dark patterns
+## dark patterns
 turniing patterns against the user. 
 all the dsign heuristics can be used against the user
--- a/content/notes/14-balancing-bsts.md
+++ b/content/notes/14-balancing-bsts.md
@ -11,6 +11,6 @@ sr-ease: 250
 [balancing-binary-search-trees](notes/balancing-binary-search-trees.md)
- [avl-trees](notes/avl-trees.md) 
+- [avl-tree](notes/avl-tree.md) 
- [red-black-trees](notes/red-black-trees.md)
+- [red-black-tree](notes/red-black-tree.md)
- [treaps](notes/treaps.md)
+- [treap](notes/treap.md)
--- a/content/notes/16-distributing-cognition-and-visual-design-typography.md
+++ b/content/notes/16-distributing-cognition-and-visual-design-typography.md
@ -4,11 +4,11 @@ aliases:
 tags: 
 - info203
 - lecture
-sr-due: 2022-05-10
+sr-due: 2022-05-31
-sr-interval: 8
+sr-interval: 21
 sr-ease: 250
 ---
 - [representation-and-distributing-cognition](notes/representation-and-distributing-cognition.md)
- [typography](notes/typography.md)]
+- [typography](notes/typography.md)
 - [visual-design](notes/visual-design.md)
--- a/content/notes/18-build-tools.md
+++ b/content/notes/18-build-tools.md
@ -0,0 +1,100 @@
 ---
 title: "18-build-tools"
 aliases: 
 tags: 
 - cosc202
 - lecture
 sr-due: 2022-05-13
 sr-interval: 3
 sr-ease: 252
 ---
 - understnad the purpose of build tools
 - sketch how make's rules (re)build software
 - explain why ant better suits java projects
 - sketch how maven seeks to improve on ant
 - appreciated that there are many build tools
 # Build tools
 Tools that automate the construction of software,.
 ## C
 if you recompile C you get an object file which can be linked. Automation tools will do the linking for you. 
 what they do:
 - run [compiler](notes/compiler.md)
 - run [linker](notes/linker.md)
 - automatically download depencies ([libraries](notes/13-code-librarires.md))
 	- this can also be done using [containers](notes/containers.md) e.g., a docker container
 - possibly some form of [testing](notes/testing.md)
 # History of build tools
 ## Make
 > check whether targets are older than sources
 Has:
 - set of targets
 - set of source files
 - A list of commands that build the target from the source
 - internal variables
 	- \$@ - the rules source(s)
 	- \$< - the rules tartet
 - 
 Build things in the correct order (*topologically*. e.g., will run compiler before linker if needed. 
 Limitations
 - doesn't handle subprojects
 - doesn't handle directories
 	- when make look for changes, it usually only looks in the current dir
 	- big projects will have call make is sub projects, this can get complicated quick
 - Internal variables do not match with typical shell variables
 	- use \$\$ to use make shell variables
 - no real constraints or conventions: can \betaused for a lot of things 
 ## Java programs
 dont really need the linking step: java can load class files on the fly. The java compiler is more flexible. 
 Still needs some automation:
 - cleaing uneeded .class files
 - bulding Java archive files (JAR)
 ## Ant
 Written to handle build tasks, e.g., build a JAR, clean up files. Uses an XML file: build.xml. (XML sucks)
 improves upon make by
 - better at scanning sub dirs
 - calls javac on many files at once not one at a time
 ## Maven
 maven has conventions:
 - e.g., file structure:
 	- main app as src/main/java
 	- support resources at src/main/resources
 	- test sources at src/test/java
 - Support non java languages
 Still XML files: pom.xml
 Colour in output. 
 ## Gradle
 speed and flexibility
 - does not use xml
 - has its own domain specific language
 - more complex than maven
 - faster than maven
 	- particularly in incremental build
 		- i.e. not re-building when it doesn't need to
 - Support non java languages
 ## Others
 - rake - ruby's version of Make
 - SCons - builds database about build state
 - CMake - cross platorm building; uses existing tools/IDEs
 - SBT scala
 - languge built in tools
 	- go - Go build
 	- rust - Cargo
--- a/content/notes/18-hash-examples.md
+++ b/content/notes/18-hash-examples.md
@ -0,0 +1,11 @@
 ---
 title: "18-hash-examples"
 aliases: 
 tags: 
 - info203
 - lecture
 sr-due: 2022-05-13
 sr-interval: 3
 sr-ease: 250
 ---
--- a/content/notes/analysis-of-recursive-algorithms.md
+++ b/content/notes/analysis-of-recursive-algorithms.md
@ -116,7 +116,6 @@ $P(n) = P(n-1) +D$
 where C and D are some positive constants
 #theorem 
 > ## $P(n) = C+D\times(n-1)$
 > in particular, $P(n) = \theta(n)$
--- a/content/notes/assignment-02.md
+++ b/content/notes/assignment-02.md
@ -0,0 +1,9 @@
 ---
 title: "assignment-02"
 aliases: 
 tags: 
 - cosc201
 - assignment
 ---
--- a/content/notes/avl-trees.md
+++ b/content/notes/avl-trees.md
@ -1,5 +1,5 @@
 ---
-title: "avl-trees"
+title: "avl-tree"
 aliases: AVL
 tags: 
 - cosc201
--- a/content/notes/aymptotic-notation.md
+++ b/content/notes/aymptotic-notation.md
@ -3,7 +3,6 @@ title: "asymptotic-notation"
 aliases: Big O, Big Theta, Algorithm Analysis
 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. 
--- a/content/notes/business-process-model-and-notation.md
+++ b/content/notes/business-process-model-and-notation.md
@ -1,5 +1,6 @@
 ---
 title: "business-process-model-and-notation"
 aliases: BPMN
 tags: 
 - info201
 ---
--- a/content/notes/continuous-integration.md
+++ b/content/notes/continuous-integration.md
@ -34,19 +34,18 @@ Most CI frameworks use YAML for configuration. YAML  has a structured text based
 The CI config (in gitlab it is named `.gitlab-ci.yaml`) file goes in the top level of the repo, and is version-managed. This file specifies the stages and jobs of a pipeline, as well as indicating where the output should go.
 # 8 Debugging
 [debugging](notes/debugging.md) concepts should be applied
-1. check yaml file
+1st check yaml file
-commands run from shell generate an exit code. This is stored in a variable called *$?
+commands run from shell generate an exit code. This is stored in a variable called *$?*
 If $? is non-zero, then the previous command failed. Your shell script can choose to hide this is the command is expected to fail
 # 9 Secrets
 If you need the CI script to log in to something, your repo hosting service can store and pass *secrets* to scripts using shell environment variables. When doing this, you need to make sure the CI script is secure, other wise someone could simply change the scripts to `echo` these variables.
 # 10 Other tools can have CI-like functionality
 e.g.,
 - IDEs the compile code in background
 - latexmk to auto build latex files when they change
@ -56,10 +55,5 @@ e.g.,
 	- pre-populate git messages
 	- carry out post-update cleanup tasks
 #unfinished 
 [10-continuous-integration-1](notes/10-continuous-integration-1.md)
 [11-continuous-integration-2](notes/11-continuous-integration-2.md)
--- a/content/notes/cosc-201.md
+++ b/content/notes/cosc-201.md
@ -12,24 +12,35 @@ links: [_index](_index.md)
 - [[notes/assignment-01]]
 - [[notes/assignment-02]]
-# Outline
+# Analysis
 - [aymptotic-notation](notes/aymptotic-notation.md)
 - [induction](notes/induction.md)
 - [analysis-of-recursive-algorithms](notes/analysis-of-recursive-algorithms.md)
- [union-find](notes/union-find.md)
+
- [heap](notes/heap.md)
+# Paradigms
 - [heaps-and-heapsort](notes/heaps-and-heapsort.md)
 - [mergesort](notes/mergesort.md)
 - [[quicksort](notes/quicksort.md)]
 - [divide-and-conquer](notes/divide-and-conquer.md)
- [unite-and-conquer](notes/unite-and-conquer.md)
+	- [unite-and-conquer](notes/unite-and-conquer.md)
 - [avl-trees](notes/avl-trees.md)
 - [red-black-trees](notes/red-black-trees.md)
 - [treaps](notes/treaps.md)
 - [balancing-binary-search-trees](notes/balancing-binary-search-trees.md)
 - [dynamic-programming](notes/dynamic-programming.md)
 - [memoization](notes/memoization.md)
 # Data Structues
 - [union-find](notes/union-find.md)
 - [priority-queue](notes/priority-queue.md)
 - [stacks-and-queues](notes/stacks-and-queues.md)
 - [heap](notes/heap.md)
 - [treap](notes/treap.md)
 - [hash-map](notes/hash-map.md)
 - [set](notes/set.md)
 - [tree](notes/tree.md)
 	- [avl-tree](notes/avl-tree.md)
 	- [red-black-tree](notes/red-black-tree.md)
 # Algorithms
 - [mergesort](notes/mergesort.md)
 - [heapsort](notes/heapsort.md)
 - [[quicksort](notes/quicksort.md)]
 - [balancing-binary-search-trees](notes/balancing-binary-search-trees.md)
 # Lectures
 - [07-mergesort-1](notes/07-mergesort-1.md)
 - [08-mergesort-2](notes/08-mergesort-2.md)
@ -42,3 +53,4 @@ links: [_index](_index.md)
 - [15-dynamic-programming](notes/15-dynamic-programming.md)
 - [16-hasing-maps-sets](notes/16-hasing-maps-sets.md)
 - [17-collision-resolution-probing](notes/17-collision-resolution-probing.md)
 - [18-hash-examples](notes/18-hash-examples.md)
--- a/content/notes/debugging.md
+++ b/content/notes/debugging.md
@ -13,16 +13,14 @@ a human process
 debuggers are tools to help debugging
 ## 1 common approaches
-temporarily add output of diagnostic info
+- temporarily add output of diagnostic info -> "printf" debugging
- "printf" debugging
+- permanently include calls to logging system -> route to terminal, log files etc
 permanently include calls to logging system
 - route to terminal, log files etc
 ## 2 debugging machine code
 - cpu runs code instruction by instruction
 	- thus debugger can intervene between instructions
 	- most cpus help debugger interrupt and resume programs
- cpu reached current code via a sequence on callers
+- cpu reached current code via a sequence of calls
 	- called **stack trace** , aka back frame, stack frame etc
 - may reach point where it cannot continue
 	- e.g., integer division by zero, program execution must stop
@ -46,7 +44,6 @@ These are language that are executed in a step-wise, sequentail manner.
 - continue  --> go back to running code continuously
 ### 4.2 controlling debugger execution
 Can run normally --> debugger wil run when program crashes
 Set Breakpoint --> debugger will stop program when/if that line is reached
@ -55,7 +52,6 @@ Set Breakpoint --> debugger will stop program when/if that line is reached
 Watch point --> program is suspended when some data changes (e.g., variables)
 ## 5 debugging non imperative languages
 e.g, spreadsheet (Dataflow programming)
 - no breakpoints
 - must step through _iterations of computations_
--- a/content/notes/direct-manipulation-video.md
+++ b/content/notes/direct-manipulation-video.md
@ -3,7 +3,7 @@ title: "direct-manipulation-video"
 aliases: Direct Manipulation
 tags: 
 - info203
- video
+- scott-video
 ---
 e.g., better measuring cup
--- a/content/notes/dynamic-programming.md
+++ b/content/notes/dynamic-programming.md
@ -3,6 +3,7 @@ title: "dynamic-programming"
 aliases: dynamic programming, DP
 tags: 
 - cosc201
 - paradigm
 ---
 A method of designing algorithms, where a higher amount of space is used, in order to gain reduction in time. This usually done by *remembering previous calculations*. Typically these algorithms are done *bottom-up* i.e., by computing the "base case" first. 
--- a/content/notes/heap.md
+++ b/content/notes/heap.md
@ -30,3 +30,71 @@ How deep is the tree?
 - to store n elements we use k layers where $k = lg n$
 - so we need ϴ(lg n) layers
 - So any algorithm that 'walk along a branch' in while or in part will have Ο(n) complexity (assuming constant time work at each node)
 # 1 Overview
 [[notes/heap]]
 # 2 Operations
 ## 2.1 Add element
 Assumptions
 - access first vacant position
 - set (or find) the value $H.q$ stored in any (occupied) position $q$
 - access parent of any given position
 - identify when we're at the root
 (all in constant time)
 Outcome: Change $H$ by adding x to it, while maintaining the heap conditions
 ```
 p <- first vacancy, H.p <- x
 while p is not the root and H.parent(p) < H.p do
 	swap H.parent(p) and H.p
 	p <- parent(p)
 end while
 ```
 ## 2.2 Remove the maximum
 Outcome: Change H by removing its maximum (i.e., root) value wile maintaining the heap conditions
 ```
 v <- H.root
 set H.root to be the value stored in the last occupied position
 p <- root
 while p has children
 	if the largest value, H.c of a child of p is greater than H.p then
 		swap H.c and H.p, p <-c
 	else
 		Break
 	end if
 end while
 return v
 ```
 ## 2.3 Complexity
 In addition, we move along a branch from an added element up to the root, fixing violations as we go
 In removal, we move from the root down through some branch until all violations are fixed (can only occur if node has children)
 So both loops do most Ο(lg n)
 ## 2.4 Storage
 ![](https://i.imgur.com/04qVrGQ.png#invert)
 - Array
 - root at position 0 and children at 1 and 2
 - children of 1 to in 3 and 4, children of 2 go in 5 and 6
 - first vacant pos --> heap[n]
 - value at pos q --> heap[q]
 - get parent of q --> parent(q) = (q-1)/2
 - get children of q --> (2 * q) ± 2
 - identify if q is root --> q == 0
 ## 2.5 Implementation
 Use java.util.PriorityQueue
--- a/content/notes/heaps-and-heapsort.md
+++ b/content/notes/heaps-and-heapsort.md
@ -1,95 +0,0 @@
 ---
 title: "heaps-and-heapsort"
 aliases:
 tags: 
 - cosc201
 ---
 ## 0.1 Overview
 [[notes/heap]]
 ## 0.2 Operations
 ### 0.2.1 Add element
 Assumptions
 - access first vacant position
 - set (or find) the value $H.q$ stored in any (occupied) position $q$
 - access parent of any given position
 - identify when we're at the root
 (all in constant time)
 Outcome: Change $H$ by adding x to it, while maintaining the heap conditions
 ```
 p <- first vacancy, H.p <- x
 while p is not the root and H.parent(p) < H.p do
 	swap H.parent(p) and H.p
 	p <- parent(p)
 end while
 ```
 ### 0.2.2 Remove the maximum
 Outcome: Change H by removing its maximum (i.e., root) value wile maintaining the heap conditions
 ```
 v <- H.root
 set H.root to be the value stored in the last occupied position
 p <- root
 while p has children
 	if the largest value, H.c of a child of p is greater than H.p then
 		swap H.c and H.p, p <-c
 	else
 		Break
 	end if
 end while
 return v
 ```
 ### 0.2.3 Complexity
 In addition, we move along a branch from an added element up to the root, fixing violations as we go
 In removal, we move from the root down through some branch until all violations are fixed (can only occur if node has children)
 So both loops do most Ο(lg n)
 ### 0.2.4 Storage
 ![](https://i.imgur.com/04qVrGQ.png#invert)
 - Array
 - root at position 0 and children at 1 and 2
 - children of 1 to in 3 and 4, children of 2 go in 5 and 6
 - first vacant pos --> heap[n]
 - value at pos q --> heap[q]
 - get parent of q --> parent(q) = (q-1)/2
 - get children of q --> (2 * q) ± 2
 - identify if q is root --> q == 0
 ### 0.2.5 Implementation
 Use java.util.PriorityQueue
 ## 0.3 Heap Sort
 In place and ϴ(n lg n)
 - start with array
 - using itself as a heap, add the elements one at a time until all been added
 - Then remove them one at a time - the largest elements gets removed first and the place where is needs to be put gets freed from the map
 ## 0.4 Heap vs Merge
 heap --> in place, ϴ(n lg n)
 merge --> not in place, Ο(n lg n)
 Merge is preferred because
 - MS can take advantage of partially sorted data (hence ϴ() vs Ο())
 - MS memory accesses are good fast
 - overwrites allow for optimizations that swaps do not
 extra memory cost of merge sort is negligible
 ∴ Merge sort is faster
--- a/content/notes/heapsort.md
+++ b/content/notes/heapsort.md
@ -0,0 +1,28 @@
 ---
 title: "heaps-and-heapsort"
 aliases:
 tags: 
 - cosc201
 ---
 # 3 Heap Sort
 In place and ϴ(n lg n)
 - start with array
 - using itself as a heap, add the elements one at a time until all been added
 - Then remove them one at a time - the largest elements gets removed first and the place where is needs to be put gets freed from the map
 # 4 Heap sort vs Merge sort
 heap --> in place, ϴ(n lg n)
 merge --> not in place, Ο(n lg n)
 Merge is preferred because
 - MS can take advantage of partially sorted data (hence ϴ() vs Ο())
 - MS memory accesses are good fast
 - overwrites allow for optimizations that swaps do not
 extra memory cost of merge sort is negligible
 ∴ Merge sort is faster
--- a/content/notes/heuristic-evaluation.md
+++ b/content/notes/heuristic-evaluation.md
@ -2,6 +2,7 @@
 title: "heuristic-evaluation"
 tags: 
 - info203
 - scott-video
 ---
 >"Heuristics are strategies derived from previous experiences with similar problems"
--- a/content/notes/law-of-closure.md
+++ b/content/notes/law-of-closure.md
@ -3,7 +3,7 @@ title: "law-of-closure"
 aliases: closure
 tags: 
 - info203
- visual design
+- visual-design
 ---
 Another law is the law of closure. Where our brain tries to "autocomplete" things
--- a/content/notes/mental-models-video.md
+++ b/content/notes/mental-models-video.md
@ -3,7 +3,7 @@ title: "mental-models-video"
 aliases: 
 tags: 
 - info203
- video
+- scott-video
 ---
 The users mental model is how the user thinks the interface works.
--- a/content/notes/mergesort.md
+++ b/content/notes/mergesort.md
@ -2,7 +2,7 @@
 title: "mergesort"
 tags: 
 - cosc201
- algorithm
+- sorting-algorithm
 ---
 Mergesort is a [divide-and-conquer](notes/divide-and-conquer.md) algorithm. It works by recursively splitting the array in half then merging the two (sorted) halfs together . It has three main steps. These are:
--- a/content/notes/programatic-evolution.md
+++ b/content/notes/programatic-evolution.md
@ -0,0 +1,21 @@
 ---
 title: "programatic-evolution"
 aliases: 
 tags: 
 - video
 - inbox
 ---
 5 condiditons for evolution
 - self-replication
 - blueprint
 	 - "genome"
 	 - stored in us in DNA and RNA
 - inherit blueprint
 - mutation
 - selection 
 whatever reproduces, reproduces
 whatever doesn't, doesn't
 evolutution converts randomness into order and complexity. Mutatations are required for survival
--- a/content/notes/quicksort.md
+++ b/content/notes/quicksort.md
@ -3,7 +3,7 @@ title: "quicksort"
 aliases: Quicksort
 tags: 
 - cosc201
- algorithm
+- sorting-algorithm
 ---
 pre ⇒ select pivot and split the array
--- a/content/notes/red-black-trees.md
+++ b/content/notes/red-black-trees.md
@ -1,6 +1,6 @@
 ---
-title: "red-black-trees"
+title: "red-black-tree"
-aliases: Red Black Trees
+aliases: Red Black Tree
 tags: 
 - cosc201
 - datastructure
--- a/content/notes/redundancy-and-anomalies.md
+++ b/content/notes/redundancy-and-anomalies.md
@ -1,17 +1,18 @@
 ---
 number headings: first-level 1, max 6, 1.1
 title: "redundancy-and-anomalies"
 aliases: redundancy and anomalies
 tags: 
 - info201
 ---
-### 0.1 Redundancy
+# Redundancy
 when values are stored repetitively in database relations
 - usually in poorly designed relations
 - - potential for anomalous data to be stored
 e.g., ![](https://i.imgur.com/8RdSNZt.png)
-#### 0.1.1 How it arises
+## How it arises
 - ad hoc database
 	- flat file
 	- spreadsheet (no contraints)
@ -22,19 +23,19 @@ e.g., ![](https://i.imgur.com/8RdSNZt.png)
 	- "bolting on" new attributes
 	- schema evolution over time
-### 0.2 Anomalies
+# Anomalies
-#### 0.2.1 Update anomaly
+## Update anomaly
 An anomaly that occurs follows an UPDATE operation
 e.g., 
 ![](https://i.imgur.com/fBMd8W3.png)
-#### 0.2.2 Delete anomaly
+## Delete anomaly
 An anomly that occurs following a DELETE operation
 e.g., 
 ![](https://i.imgur.com/fUGVR98.png)
 ![](https://i.imgur.com/yp6KdYg.png)
-#### 0.2.3 Insert anomaly
+## Insert anomaly
 An anomly that occurs following a INSERT operation
 e.g., 
 ![](https://i.imgur.com/hM1VlGs.png)
--- a/content/notes/representation-and-distributing-cognition.md
+++ b/content/notes/representation-and-distributing-cognition.md
@ -14,19 +14,16 @@ memory games make finding pairs hard by introducing rules. This often happens in
 depeding on how you represent a problem, you can make is easy or hard. 
 ## Working memory
 users have a working memory (2±2 limit). You shouldn't require users to remember anything that you could put on a screen. 
 If something takes a lot of time. You wil get distracted, and forget something.
 ## Naturalness principle
 - experiemental cognition is raised when the properties of the representation match the properties of the thing being represented
 - 
 # Dist cognition
 when interfaces help people disribute cognition it can
 - exourage experimentsation
 - scaffold learning and reuce errors through reduncdancy
--- a/content/notes/storyboards-mockups-paper-prototypes.md
+++ b/content/notes/storyboards-mockups-paper-prototypes.md
@ -2,6 +2,7 @@
 title: "storyboards-mockups-paper-prototypes"
 tags: 
 - info203
 - scott-video
 ---
 Fidelity will increase over time.
--- a/content/notes/treaps.md
+++ b/content/notes/treaps.md
@ -1,5 +1,5 @@
 ---
-title: "treaps"
+title: "treap"
 aliases: Treaps
 tags: 
 - cosc201
--- a/content/notes/typography.md
+++ b/content/notes/typography.md
@ -1,4 +1,4 @@
---
+ ---
 title: "typography"
 aliases: Typography
 tags: 
--- a/content/notes/union-find.md
+++ b/content/notes/union-find.md
@ -147,10 +147,8 @@ for larger k -> the set must have been formed by the union of two sets of rank k
 --> min size of set of rank k is $2^k$
 #theorem
 >a set of rank k must contain at least $2^k$ elements
-
+> $\therefore$ The maximum rank of an element is $\log_2(n)$  -> $lg(n)$
 $\therefore$ The maximum rank of an element is $\log_2(n)$  -> $lg(n)$
 since the time for $Find$ is big-$\theta$ of the rank of the representative found we get $O(lg n)$ bounds for both find and union
--- a/content/notes/unit-testing.md
+++ b/content/notes/unit-testing.md
@ -17,14 +17,14 @@ tags:
 	- can run tests if parallel
 	- may need to build environment in which tests run
-### 0.1 supports useful principles
+# 1 supports useful principles
 can support complementary work by team members
 early discovery of problems
 can help with documentation and specification
 - unit tests can be a form of executable specification
 - helps team members understand requirements
-### 0.2 Test environment
+# 2 Test environment
 consider code that interacts with a database
 - you cant let that code write to a real database
 - but you want to check that writes were performed
@ -38,7 +38,7 @@ mock up the database with a pretend model that returns fixed results to query
 can be a pre-recorded interaction
-### 0.3 Test life cycle
+# 3 Test life cycle
 - set up test environment
 - run test code
 - check results
@ -49,7 +49,7 @@ tests may chack that code fails appropriately
 - crash when expected
 - exceptions are generated
-### 0.4 Language support
+# 4 Language support
 language may have bilt in testing support
 - e.g., Go and Rust have command line tools to run tests
@ -61,7 +61,7 @@ External tools can often work well too
 we want to distinguish between tests and normal code
 - also should support for sqapping in/out mocking code
-### 0.5 JUnit
+# 5 JUnit
 test classes have a particular filename pattern
 annotate test methods with @Test
@ -73,8 +73,7 @@ other annotations
 JUnit 5 also supports dynamically generated tests
-### 0.6 TestNG
+# 6 TestNG
 based off JUnit and fixes some it it's problems
 - provides control over threading
--- a/content/notes/unite-and-conquer.md
+++ b/content/notes/unite-and-conquer.md
@ -3,6 +3,7 @@ title: "unite-and-conquer"
 aliases: unite and conquer
 tags: 
 - cosc201
 - paradigm
 ---
 5 | 8 | 2 | 3 | 4 | 1 | 7 | 6
--- a/content/notes/video-prototyping.md
+++ b/content/notes/video-prototyping.md
@ -2,6 +2,7 @@
 title: "video-prototyping"
 tags: 
 - info203
 - scott-video
 ---
 ## 1 benefits
--- a/content/notes/visual-design-video.md
+++ b/content/notes/visual-design-video.md
@ -3,7 +3,7 @@ title: "visual-design-video"
 aliases: 
 tags: 
 - info203
- video
+- scott-video
 ---
 whitespace conveys grouping
--- a/content/notes/wizard-of-oz.md
+++ b/content/notes/wizard-of-oz.md
@ -2,6 +2,7 @@
 title: "wizard-of-oz"
 tags: 
 - info203
 - scott-video
 ---
--- a/content/private/dr.k-reckless.md
+++ b/content/private/dr.k-reckless.md
@ -0,0 +1,37 @@
 ---
 title: "dr.k-reckless"
 aliases: 
 tags: 
 - video
 - psycology
 - inbox
 link: https://www.youtube.com/watch?v=cbSwhMeYqtQ
 ---
 - There is a contract between the therapist and the patient. 
 - The parameters should be defined before treatent begins. 
 - Set boundaries
 - If you're not qualified, redirect them to someone who is
 - 
 - Informed consent
 	- the patient doesn't know where something is going : how can they agree to this
 	- the therapist needs to inform them, then ask for their informed consent. 
 diagnostic terms should not beused outside of a patient therapist relationship
 - patient should know when they are being "operated" on. This is not possible in a "blurry relationship"
 in a proper  relationship, the doctor has access to information that could be critical.
 confidentiality
 the doctors obligation not to reveal personal information. the patient can waive confidentiality. However the doctor often knows better e.g., kids wanting picture in paper.
 pro bono - no exchange on money - doctor tends to be "looser". Doctor might think it ok to take some other form of gain. this is a slippery slope.
 a therapy relationship needs to be focused on the needs of the patient. If it switches, you ender unethical territory. 
 If there is an attempt at suicide, the patient should be commited.
 purpose of licensing board is to minimise harm.
--- a/content/private/templates/note-header.md
+++ b/content/private/templates/note-header.md
@ -2,7 +2,7 @@
 title: "<% tp.file.cursor(1) %><% tp.file.title %>"
 aliases: <% tp.file.cursor(2) %>
 tags: 
- <% tp.file.cursor(3) %>
+<% tp.file.cursor(3) %>
 ---
 <% tp.file.cursor(4) %>