notebook/notes/set/index.md

title	TARGET DECK	FILE TAGS	tags
Set	Obsidian::STEM	set	set

Overview

%%ANKI Basic How does Knuth define a dynamic set? Back: As a set that can change over time. Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022). Tags: adt::dynamic_set

END%%

%%ANKI Basic How does Knuth distinguish mathematical sets from dynamic sets? Back: The former is assumed to be unchanging. Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022). Tags: adt::dynamic_set

END%%

%%ANKI Basic How does Knuth define a dictionary? Back: As a dynamic set that allows insertions, deletions, and membership tests. Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022). Tags: adt::dynamic_set

END%%

%%ANKI Basic Which of dynamic sets and dictionaries are more general? Back: The dynamic set. Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022). Tags: adt::dynamic_set

END%%

%%ANKI Basic Is a dynamic set a dictionary? Back: Not necessarily. Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022). Tags: adt::dynamic_set

END%%

%%ANKI Basic Is a dictionary a dynamic set? Back: Yes. Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022). Tags: adt::dynamic_set

END%%

%%ANKI Cloze A dictionary supports {insertions}, {deletions}, and {membership testing}. Reference: Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022). Tags: adt::dynamic_set

END%%

%%ANKI Basic Define the set of prime numbers less than 10 using abstraction. Back: \{x \mid x < 10 \land x \text{ is prime}\} Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

%%ANKI Basic Define the set of prime numbers less than 5 using set-builder notation. Back: \{x \mid x < 5 \land x \text{ is prime}\} Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

%%ANKI Basic Define the set of prime numbers less than 5 using roster notation. Back: \{2, 3\} Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

%%ANKI Basic Define the set of prime numbers less than 5 using abstraction. Back: \{x \mid x < 5 \land x \text{ is prime}\} Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

%%ANKI Basic What term describes the expression to the right of \mid in set-builder notation? Back: The entrance requirement. Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

%%ANKI Basic What term refers to \_\_\; x\; \_\_ in \{x \mid \_\_\; x\; \_\_\}? Back: The entrance requirement. Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

%%ANKI Basic The term "entrance requirement" refers to what kind of set notation? Back: Set-builder/abstraction. Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

%%ANKI Basic What name is given to set notation in which members are explicitly listed? Back: Roster notation. Reference: Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).

END%%

Bibliography

• Herbert B. Enderton, Elements of Set Theory (New York: Academic Press, 1977).
• Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).