Data Types (36%)

Question 1

A data structure for implementing a list ADT, where each node has data and a pointer to the next node. The list structure typically has pointers to the list’s first node and last node.

Answer 1

Singly linked list

Question 2

A data structure for implementing a list ADT, where each node has data, a pointer to the next node, and a pointer to the previous node.

Answer 2

Doubly-linked list

Question 3

A data structure that stores unordered items by mapping (or hashing) each item to a location in an array (or vector). Dictionaries and arrays.

Answer 3

Hash table

Question 4

Data structure where each node has up to two children, known as a left child and a right child. “Binary” means two, referring to the two children.

Answer 4

Binary tree

Question 5

A complete binary tree that maintains the simple property that a node’s key is greater than or equal to the node’s children’s keys.
(Actually, a max-heap may be any tree, but is commonly a binary tree).

Answer 5

Max-heap

Question 6

Is similar to a max-heap, but a node’s key is less than or equal to its children’s keys.

Answer 6

Mini-heap

Question 7

A common ADT for holding ordered data, also known as a sequence. created by using brackets []. Array and linked list.

Answer 7

List ADT

Question 8

ADT that stores a collection of data, like a list, but is immutable. Created using () with elements seperated by commas.

Answer 8

Tuple ADT

Question 9

ADT that has an unordered collection of unique elements. Empty ADT can only be created using (). Binary search tree and hash table.

Answer 9

Set ADT

Question 10

ADT Python container used to describe associative relationships. Empty created using {}. Elelements are added using key:value pairs. Hash table and binary search tree.

Answer 10

Dictionary ADT

Question 11

ADT in which items are only inserted on or removed from the top of a stack. (Last in, first out). Linked list or array.

Answer 11

Stack ADT

Question 12

ADT in which items are inserted at the end and removed from the front. Linked list or array.

Answer 12

Queue ADT

Question 13

ADT in which items can be inserted and removed at both the front and back. Linked list or array.

Answer 13

Dequeue ADT

Question 14

ADT where each item has a priority, and items with higher priority are closer to the front than the items with lower priority. Heap

Answer 14

Priority queue ADT

Question 15

An ADT for holding ordered data and allowing indexed access. Array.

Answer 15

Dynamic array ADT.