Flashcards
Dictionaries trees prqueues
Flashcards do conjunto (3)
- 1There are multiple machines working on a set of problems with unequal importance. What data structure can be used in their communication to easily ensure the execution of the largest sum importance given a time budget?Priotity queue, since we want to maximize the sum importance
- 2What is the operation on trees with the highest worst-case complexity?finding a given node by it's property
- 3Utilizing hash based dictionaryusually guarantees fast key based lookup
Informações
- Descrição
- Exam Algorithms & Software Concepts (Exam Questions) FlashCards sobre Dictionaries trees prqueues, criado por Finnegan Fischer em 29-04-2021.
- Criado por
- Finnegan Fischer
- Visualizações
- 0
- Avaliação