Add past week of notes.
parent
74aa5e16d9
commit
1efb669e7b
|
@ -299,7 +299,7 @@
|
||||||
"posix/awk/regexp.md": "46ceac3d5225ea3f3a375d74c2e2e0e9",
|
"posix/awk/regexp.md": "46ceac3d5225ea3f3a375d74c2e2e0e9",
|
||||||
"posix/awk/index.md": "cac4a1db94f9fc39c5e63ff6994b76aa",
|
"posix/awk/index.md": "cac4a1db94f9fc39c5e63ff6994b76aa",
|
||||||
"x86-64/assembly.md": "6c4905468f3936ae260b281e2acd7ffc",
|
"x86-64/assembly.md": "6c4905468f3936ae260b281e2acd7ffc",
|
||||||
"x86-64/index.md": "db0441c243487fc070837596351ba34a",
|
"x86-64/index.md": "112891852e2a260ceaeb916207a1568f",
|
||||||
"_journal/2024-03-21.md": "a2572d2d5be0ee7c7f066d846e2f3e77",
|
"_journal/2024-03-21.md": "a2572d2d5be0ee7c7f066d846e2f3e77",
|
||||||
"_journal/2024-03/2024-03-20.md": "0a73ce399d275fe6ee3134a812f3f4f9",
|
"_journal/2024-03/2024-03-20.md": "0a73ce399d275fe6ee3134a812f3f4f9",
|
||||||
"_journal/2024-03-22.md": "8da8cda07d3de74f7130981a05dce254",
|
"_journal/2024-03-22.md": "8da8cda07d3de74f7130981a05dce254",
|
||||||
|
@ -307,14 +307,19 @@
|
||||||
"x86-64/declarations.md": "75bc7857cf2207a40cd7f0ee056af2f2",
|
"x86-64/declarations.md": "75bc7857cf2207a40cd7f0ee056af2f2",
|
||||||
"x86-64/instructions.md": "240b4ceddf174f48207ba6bed4d25246",
|
"x86-64/instructions.md": "240b4ceddf174f48207ba6bed4d25246",
|
||||||
"git/refs.md": "954fc69004aa65b358ec5ce07c1435ce",
|
"git/refs.md": "954fc69004aa65b358ec5ce07c1435ce",
|
||||||
"set/trees.md": "56ef76493abcbfdb0256a54dc2d72ba3",
|
"set/trees.md": "d25bd5b839fd961f99c54526a827fa4d",
|
||||||
"_journal/2024-03-24.md": "1974cdb9fc42c3a8bebb8ac76d4b1fd6",
|
"_journal/2024-03-24.md": "1974cdb9fc42c3a8bebb8ac76d4b1fd6",
|
||||||
"_journal/2024-03/2024-03-23.md": "ad4e92cc2bf37f174a0758a0753bf69b",
|
"_journal/2024-03/2024-03-23.md": "ad4e92cc2bf37f174a0758a0753bf69b",
|
||||||
"_journal/2024-03/2024-03-22.md": "a509066c9cd2df692549e89f241d7bd9",
|
"_journal/2024-03/2024-03-22.md": "a509066c9cd2df692549e89f241d7bd9",
|
||||||
"_journal/2024-03-25.md": "e8edd82e6416c558204a321b1d866058",
|
"_journal/2024-03-25.md": "e8edd82e6416c558204a321b1d866058",
|
||||||
"_journal/2024-03-26.md": "c21d80f07a8056a5a0a31ade8f2f6f65",
|
"_journal/2024-03-26.md": "c21d80f07a8056a5a0a31ade8f2f6f65",
|
||||||
"_journal/2024-03/2024-03-25.md": "458bce81efc28130478309b847fa197c",
|
"_journal/2024-03/2024-03-25.md": "458bce81efc28130478309b847fa197c",
|
||||||
"_journal/2024-03/2024-03-24.md": "1974cdb9fc42c3a8bebb8ac76d4b1fd6"
|
"_journal/2024-03/2024-03-24.md": "1974cdb9fc42c3a8bebb8ac76d4b1fd6",
|
||||||
|
"_journal/2024-03-28.md": "93656f36909d69a77f20ce62e1acd63f",
|
||||||
|
"_journal/2024-03/2024-03-27.md": "42cb4031f290972be2a43172e80b280a",
|
||||||
|
"_journal/2024-03/2024-03-26.md": "c21d80f07a8056a5a0a31ade8f2f6f65",
|
||||||
|
"_journal/2024-03-29.md": "714957f5f770ff79ff011b4fa6f44cd6",
|
||||||
|
"_journal/2024-03/2024-03-28.md": "95f213c78825abf4a2d8c75dce59688e"
|
||||||
},
|
},
|
||||||
"fields_dict": {
|
"fields_dict": {
|
||||||
"Basic": [
|
"Basic": [
|
||||||
|
|
|
@ -0,0 +1,11 @@
|
||||||
|
---
|
||||||
|
title: "2024-03-27"
|
||||||
|
---
|
||||||
|
|
||||||
|
- [x] Anki Flashcards
|
||||||
|
- [x] KoL
|
||||||
|
- [ ] Sheet Music (10 min.)
|
||||||
|
- [ ] Go (1 Life & Death Problem)
|
||||||
|
- [ ] Korean (Read 1 Story)
|
||||||
|
- [ ] Interview Prep (1 Practice Problem)
|
||||||
|
- [ ] Log Work Hours (Max 3 hours)
|
|
@ -0,0 +1,13 @@
|
||||||
|
---
|
||||||
|
title: "2024-03-28"
|
||||||
|
---
|
||||||
|
|
||||||
|
- [x] Anki Flashcards
|
||||||
|
- [x] KoL
|
||||||
|
- [ ] Sheet Music (10 min.)
|
||||||
|
- [ ] Go (1 Life & Death Problem)
|
||||||
|
- [ ] Korean (Read 1 Story)
|
||||||
|
- [ ] Interview Prep (1 Practice Problem)
|
||||||
|
- [ ] Log Work Hours (Max 3 hours)
|
||||||
|
|
||||||
|
* Most of the day was spent working on the hide and seek application.
|
|
@ -0,0 +1,13 @@
|
||||||
|
---
|
||||||
|
title: "2024-03-29"
|
||||||
|
---
|
||||||
|
|
||||||
|
- [x] Anki Flashcards
|
||||||
|
- [x] KoL
|
||||||
|
- [ ] Sheet Music (10 min.)
|
||||||
|
- [ ] Go (1 Life & Death Problem)
|
||||||
|
- [ ] Korean (Read 1 Story)
|
||||||
|
- [ ] Interview Prep (1 Practice Problem)
|
||||||
|
- [ ] Log Work Hours (Max 3 hours)
|
||||||
|
|
||||||
|
* Work I did do revolved around getting hide and seek polished up.
|
|
@ -0,0 +1,14 @@
|
||||||
|
---
|
||||||
|
title: "2024-03-30"
|
||||||
|
---
|
||||||
|
|
||||||
|
- [x] Anki Flashcards
|
||||||
|
- [x] KoL
|
||||||
|
- [ ] Sheet Music (10 min.)
|
||||||
|
- [ ] Go (1 Life & Death Problem)
|
||||||
|
- [ ] Korean (Read 1 Story)
|
||||||
|
- [ ] Interview Prep (1 Practice Problem)
|
||||||
|
- [ ] Log Work Hours (Max 3 hours)
|
||||||
|
|
||||||
|
* Primarily worked on getting Looped back up and running.
|
||||||
|
* Became a blue man group trainee.
|
|
@ -0,0 +1,13 @@
|
||||||
|
---
|
||||||
|
title: "2024-03-31"
|
||||||
|
---
|
||||||
|
|
||||||
|
- [x] Anki Flashcards
|
||||||
|
- [x] KoL
|
||||||
|
- [ ] Sheet Music (10 min.)
|
||||||
|
- [ ] Go (1 Life & Death Problem)
|
||||||
|
- [ ] Korean (Read 1 Story)
|
||||||
|
- [ ] Interview Prep (1 Practice Problem)
|
||||||
|
- [ ] Log Work Hours (Max 3 hours)
|
||||||
|
|
||||||
|
* Mostly continued working on getting Looped back up and running. In particular, nixifying the various packages.
|
|
@ -0,0 +1,13 @@
|
||||||
|
---
|
||||||
|
title: "2024-04-01"
|
||||||
|
---
|
||||||
|
|
||||||
|
- [x] Anki Flashcards
|
||||||
|
- [x] KoL
|
||||||
|
- [ ] Sheet Music (10 min.)
|
||||||
|
- [ ] Go (1 Life & Death Problem)
|
||||||
|
- [ ] Korean (Read 1 Story)
|
||||||
|
- [ ] Interview Prep (1 Practice Problem)
|
||||||
|
- [ ] Log Work Hours (Max 3 hours)
|
||||||
|
|
||||||
|
* Continued working on the hide and seek application.
|
|
@ -201,7 +201,7 @@ END%%
|
||||||
%%ANKI
|
%%ANKI
|
||||||
Basic
|
Basic
|
||||||
What does it mean for node $y$ to be an ancestor of node $x$ in a rooted tree?
|
What does it mean for node $y$ to be an ancestor of node $x$ in a rooted tree?
|
||||||
Back: $y$ is in the simple path from the root to $x$.
|
Back: The simple path from the root to $x$ contains $y$.
|
||||||
Reference: Thomas H. Cormen et al., _Introduction to Algorithms_, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
Reference: Thomas H. Cormen et al., _Introduction to Algorithms_, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||||
<!--ID: 1711136844980-->
|
<!--ID: 1711136844980-->
|
||||||
END%%
|
END%%
|
||||||
|
@ -209,7 +209,7 @@ END%%
|
||||||
%%ANKI
|
%%ANKI
|
||||||
Basic
|
Basic
|
||||||
What does it mean for node $y$ to be a descendent of node $x$ in a rooted tree?
|
What does it mean for node $y$ to be a descendent of node $x$ in a rooted tree?
|
||||||
Back: $x$ is in the simple path from the root to $y$.
|
Back: The simple path from the root to $y$ contains $x$.
|
||||||
Reference: Thomas H. Cormen et al., _Introduction to Algorithms_, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
Reference: Thomas H. Cormen et al., _Introduction to Algorithms_, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||||
<!--ID: 1711136844983-->
|
<!--ID: 1711136844983-->
|
||||||
END%%
|
END%%
|
||||||
|
@ -447,7 +447,7 @@ END%%
|
||||||
%%ANKI
|
%%ANKI
|
||||||
Basic
|
Basic
|
||||||
Let $T$ be a rooted tree of height $h$. Which nodes have depth $h$?
|
Let $T$ be a rooted tree of height $h$. Which nodes have depth $h$?
|
||||||
Back: The external nodes.
|
Back: The external nodes on the longest simple paths from the root to said nodes.
|
||||||
Reference: Thomas H. Cormen et al., _Introduction to Algorithms_, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
Reference: Thomas H. Cormen et al., _Introduction to Algorithms_, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
|
||||||
<!--ID: 1711136845150-->
|
<!--ID: 1711136845150-->
|
||||||
END%%
|
END%%
|
||||||
|
|
Loading…
Reference in New Issue