Flashcards
Dictionaries trees prqueues
Cards in this deck (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
Information
- Description
- Exam Algorithms & Software Concepts (Exam Questions) Flashcards on Dictionaries trees prqueues, created by Finnegan Fischer on 29/04/2021.
- Created by
- Finnegan Fischer
- Views
- 0
- Rating