Data Rep

Question 1

6PMT

Question 2

resources -tuition •courses

Question 3

other such objects.

Question 4

Weighted Graphs: A graph where each edge/arc has an associated value (known as its

Question 5

weight).

Question 6

2.5 Trees (Including Binary Trees)

Question 7

Binary Trees: A rooted tree in which each node has

Answer 7

at most

Question 8

Rooted Trees: A tree in which one node has been designated as the root. +

Question 9

Root Node: The only node in a rooted tree without a parent. +

Question 10

Trees: A connected

Answer 10

undirected graph with no cycles. +

Question 11

2.6 Hash Tables

Question 12

Collisions: The phenomenon when two key values compute to the same hash.+

Question 13

Hashing Algorithms: An algorithm that calculates a value to determine the unique index

Question 14

where a data item is to be stored in a hash table.

Question 15

Rehashing: The process of rerunning the hashing algorithm in the event of a collision.

Question 16

2.8 Vectors

Question 17

Convex Combination of two Vectors: Any vector that can be expressed as a linear

Question 18

combination of the two vectors.

Question 19

Dot/Scalar Product of two Vectors: The sum of the products of components with the same

Question 20

index of two vectors.

Question 21

Scalar-Vector Multiplication: An operation that multiplies all the components of a vector by

Question 22

the same scalar quantity.

Question 23

Vector Addition: An operation that adds two vectors by component-wise addition

Answer 23

resulting

Question 24

in another vector as the output.