Discrete Math Test 1 Questions with Correct Answers

Discrete Math Test 1 Questions with Correct
Answers
In what memory location should we store the records for the customer with social

security 022112736 number if the

hashing function is h(k) = k mod 113 is used and records for customers with social

security numbers 022134997,

022114542, 024545737, and 024520540 have already been assigned locations in the order

given? We assign the first free location following the location computed by the hash

function to a record assigned an already occupied location.

107

To generate pseudorandom numbers using the linear congruential method, we choose

four integers:

the (BLANK 1) m, the (BLANK 2) a, the (BLANK 3) c, and the (BLANK 4) x0, with 2 ≤

a < m, 0 ≤ c < m, and 0 ≤ x0 < m. We then generate a sequence of pseudorandom

numbers {xn}, with 0 ≤ xn < m for all n, by successively using the recursively defined

function: xn+1 = (axn + c) mod m.

Blank 1: modulus

Blank 2: multiplier

Blank 3: increment

Blank 4: seed

, Given a bit string, we add a parity check bit at its end where the parity check bit is the

sum of the bits in the string mod 2. Determine whether each of these strings is a bit

string with a correct parity check bit added.

111111110

1010110011

The process of transforming a plaintext message into a (BLANK 1) message is called

(BLANK 2) .The process of recovering the plaintext message from its transformed

version is called (BLANK 3).

Blank 1: ciphertext, cipher-text, secret, or encrypted

Blank 2: encryption, enciphering, or encipherment

Blank 3: decryption or deciphering

Match the plaintext with the corresponding cipher text when encryption is done using

the affine cipher f(p) = 7p + 17 mod 26.

PAWN

matches

Choice, SRPE



ROOK

matches

Choice, GLLJ



KING

matches