ExamGecko
Question list
Search
Search

Related questions











Question 137 - 212-81 discussion

Report
Export

Created by D. H. Lehmer. It is a classic example of a Linear congruential generator. A PRNG type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The basic algorithm is Xi+1=(aXi + c) mod m, with 0 Xi m.

A.
Lehmer Random Number Generator
Answers
A.
Lehmer Random Number Generator
B.
Lagged Fibonacci Generator
Answers
B.
Lagged Fibonacci Generator
C.
Linear Congruential Generator
Answers
C.
Linear Congruential Generator
D.
Blum Blum Shub
Answers
D.
Blum Blum Shub
Suggested answer: A

Explanation:

Lehmer Random Number Generator

https://en.wikipedia.org/wiki/Lehmer_random_number_generator

The Lehmer random number generator (named after D. H. Lehmer), sometimes also referred to as the Park--Miller random number generator (after Stephen K. Park and Keith W. Miller), is a type of linear congruential generator (LCG) that operates in multiplicative group of integers modulo n. The general formula is:

where the modulus m is a prime number or a power of a prime number, the multiplier a is an element of high multiplicative order modulo m (e.g., a primitive root modulo n), and the seed X0 is coprime to m.

Other names are multiplicative linear congruential generator (MLCG) and multiplicative congruential generator (MCG).

asked 18/09/2024
Troy Borders
31 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first