Fixup flashcards.

c-declarations
Joshua Potter 2024-05-23 12:46:32 -06:00
parent 8f161f4f52
commit adb805b61f
6 changed files with 21 additions and 16 deletions

View File

@ -332,7 +332,7 @@
"_journal/2024-03-22.md": "8da8cda07d3de74f7130981a05dce254",
"_journal/2024-03/2024-03-21.md": "cd465f71800b080afa5c6bdc75bf9cd3",
"x86-64/declarations.md": "75bc7857cf2207a40cd7f0ee056af2f2",
"x86-64/instructions.md": "ceb9709b7fb4155a36b6f504f0079c58",
"x86-64/instructions.md": "c9ae5dedaa22fbcdc486663877fc1c1e",
"git/refs.md": "e20c2c9b14ba6c2bd235416017c5c474",
"set/trees.md": "c29347ec0ac2e8d5339514c869ecaedf",
"_journal/2024-03-24.md": "1974cdb9fc42c3a8bebb8ac76d4b1fd6",
@ -423,7 +423,7 @@
"_journal/2024-05/2024-05-04.md": "866af1876896a343e7a7d9d09d0c24bb",
"data-structures/intrusive.md": "e43c435136c5de92a094e4e49af9f436",
"data-structures/linked-lists.md": "a68e7709791e449bee7875ad9680dd96",
"data-structures/arrays.md": "bb6b8609d16f9f2565d5238c0f9b8566",
"data-structures/arrays.md": "5c320855d1955e897820053a7c3c065b",
"abstract-data-types/stacks.md": "d4324db19a88211dc6bf4f0e56c74cec",
"abstract-data-types/queues.md": "db668234b6c6051635321730b7176dcb",
"_journal/2024-05-12.md": "ca9f3996272152ef89924bb328efd365",
@ -452,7 +452,7 @@
"_journal/2024-05-18.md": "c0b58b28f84b31cea91404f43b0ee40c",
"hashing/direct-addressing.md": "7ffaa27c01130d21aa32cf3b1c407785",
"hashing/index.md": "c870cf66e0224db58315ac0ba43b9cb1",
"set/classes.md": "bd3821b98c0893e1e13c06ff4def81ca",
"set/classes.md": "18a09731868070e0c24a42bf0f582619",
"_journal/2024-05-19.md": "fddd90fae08fab9bd83b0ef5d362c93a",
"_journal/2024-05/2024-05-18.md": "c0b58b28f84b31cea91404f43b0ee40c",
"_journal/2024-05/2024-05-17.md": "fb880d68077b655ede36d994554f3aba",
@ -460,9 +460,10 @@
"_journal/2024-05/2024-05-19.md": "fc14fc23d4ddca3628df7eec71a07e27",
"_journal/2024-05-21.md": "7028d18a55f0a1f65dc0753af431ca42",
"_journal/2024-05/2024-05-20.md": "d58a4ecd3bf9621cbe688f043be61239",
"_journal/2024-05-22.md": "da0364a086746087236eb8afd5770ca3",
"_journal/2024-05-22.md": "5b4473b7c6483f3aa8727ad0a12f0408",
"_journal/2024-05/2024-05-21.md": "f20e4dd94ea22fcb26049de128bc944e",
"set/algebra.md": "a6877ceca952c417b52ea637716addbf"
"set/algebra.md": "a6877ceca952c417b52ea637716addbf",
"_journal/2024-05-23.md": "a615207d43991ed0fa09fe0d913567b9"
},
"fields_dict": {
"Basic": [

View File

@ -0,0 +1,11 @@
---
title: "2024-05-23"
---
- [x] Anki Flashcards
- [x] KoL
- [ ] Sheet Music (10 min.)
- [ ] Go (1 Life & Death Problem)
- [ ] Korean (Read 1 Story)
* Watched [Lecture #10 - Sorting & Aggregation Algorithms](https://www.youtube.com/watch?v=CMzf9Az1vl4) on databases.

View File

@ -10,4 +10,5 @@ title: "2024-05-22"
* Read "Chapter 8. The Trouble with Distributed Systems" in "Designing Data-Intensive Applications".
* Begin taking notes/creating flashcards on the [[algebra|algebra of sets]].
* Additional flashcards on git branching.
* Additional flashcards on git branching.
* Slight progress on Hide and Seek flutter app.

View File

@ -81,7 +81,7 @@ END%%
%%ANKI
Basic
What is the runtime of prepending an element to a large enough array?
What is the runtime of prepending an element to an array (assuming capacity)?
Back: $O(n)$
Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).
<!--ID: 1715534735214-->

View File

@ -334,14 +334,6 @@ Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Pre
<!--ID: 1716237736505-->
END%%
%%ANKI
Basic
Let $B = \{x \in A \mid x \not\in x\}$. What biconditional proves $B \in A$?
Back: N/A.
Reference: Herbert B. Enderton, *Elements of Set Theory* (New York: Academic Press, 1977).
<!--ID: 1716237736510-->
END%%
%%ANKI
Basic
Which paradox is used in the proof of "no set contains all sets"?

View File

@ -1144,7 +1144,7 @@ END%%
%%ANKI
Basic
Which register are shift operations limited to?
Which register do shift operations refer to?
Back: `%cl`
Reference: Bryant, Randal E., and David O'Hallaron. *Computer Systems: A Programmer's Perspective*. Third edition, Global edition. Always Learning. Pearson, 2016.
<!--ID: 1716226827740-->