2.1 KiB
| title | TARGET DECK | FILE TAGS | tags | |
|---|---|---|---|---|
| Set | Obsidian::STEM | 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%%
Bibliography
- Thomas H. Cormen et al., Introduction to Algorithms, Fourth edition (Cambridge, Massachusett: The MIT Press, 2022).