Chap. 10 (Tuples)

Question 1

Define Comparable

Answer 1

A type where one value can be checked to see if it is greater than, less than, or equal to another value of the same type. Types that are comparable can be put in a list and sorted.

Question 2

Define Data Structure

Answer 2

A collection of related values, often lists, dictionaries, or tuples.

Question 3

Define DSU

Answer 3

The abbreviation of “decorate-sort-decorate” is a pattern that involves building a list of tuples, sorting, and extracting part of the result.

Question 4

Define Gather

Answer 4

The operation of assembling a variable-length argument tuple.

Question 5

Define Hashable

Answer 5

A type that has a hash function. Immutable types, like integers, floats, and strings, are hashable; mutable types like lists or dictionaries are not.

Question 6

Define Scatter

Answer 6

The operation of treating a sequence as a list of arguments.

Question 7

Define Shape

Answer 7

(of a data structure) , A summary of the size, type, and composition of a data structure.

Question 8

Define Singleton

Answer 8

A list (or other sequence) with a single element.

Question 9

Define Tuple

Answer 9

An immutable sequence of elements.

Question 10

Define Tuple Assignment

Answer 10

An assignment with a sequence on the right side and a tuple of variables on the left. The right side is evaluated, and then its elements are assigned to the variables on the left.