Data Structures

Question 1

Dictionary

Answer 1

Abstract data type that permits access to data items by content (key)

Question 2

Container

Answer 2

Abstract data type that permits storage and retrieval of data items, independent of content (without needing to know anything about them)

Question 3

Priority Queue

Answer 3

An abstract data type that allows for insertion of data with a key (priority), and retrieval of the item with the highest/lowest key

Question 4

Heap

Answer 4

Simple data structure to support Priority Queue ops (insert, findMin, extractMin)