Introduction to Abstract Data Types

Question 1

Abstract Data Type

Answer 1

a data type described by predefined user operations

Question 2

List

Answer 2

ADT for holding ordered data

Question 3

Dynamic Array

Answer 3

ADT for holding ordered data and allowing indexed access

Question 4

Stack

Answer 4

ADT in which items are only inserted on or removed from the top of a stack

last in, first out

Question 5

Queue

Answer 5

ADT in which items are inserted at the end of the queue and removed from the front of the queue

Question 6

Deque

Answer 6

ADT in which items can be inserted and removed at both the front and back

Question 7

Bag

Answer 7

ADT for storing items in which the order does not matter and duplicate items are allowed

Question 8

Set

Answer 8

ADT for a collection of distinct items

Question 9

Priority Queue

Answer 9

A queue where each item has a priority, and items with higher priority are closer to the front of the queue than items with lower priority

Question 10

Dictionary (Map)

Answer 10

ADT that associates (or maps) keys with values

Question 11

Python’s Common Supported ADTs

Answer 11

list, set, dict, queue

Question 12

C++’s Common Supported ADTs

Answer 12

vector, list, deque, queue, stack, set, map

Question 13

Java’s Common Supported ADTs

Answer 13

Collection, Set, List, Map, Queue, Deque

Question 14

realloc definition

Answer 14

re-allocates an original pointer’s memory block to be the newly-specified size (either increase or decrease)

Question 15

realloc function

Answer 15

(type)realloc(pointerVariable, numElementssizeof(type));

Question 16

dynamic set

Answer 16

set that can change after being constructed

Question 16

information hiding

Answer 16

Internal implementation of the data and operations are hidden from the ADT user