(1) Write a function laggedfib(j,k,m,initlist,n) to compute a sequence of n pseudorandom numbers using the lagged Fibonacci method, where initlist is a list of k initial values, and j, k, m are as in the notes. (Note that the function should return a list comprising only the n new numbers you have generated; the entries of initlist should not be included.) (2) Using your function with (j, k, m) = (7, 10, 2³²) and initlist = [1,1,1,..., 1], generate 2000 pseudorandom numbers x; in the range [0, 2³2). Plot x; against ï¿-1 as a scatter plot. (The plot should appear when the programme is run.)

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
(1) Write a function laggedfib(j,k,m,initlist, n) to compute a sequence of n pseudorandom
numbers using the lagged Fibonacci method, where initlist is a list of k initial values, and j, k, m are as
in the notes. (Note that the function should return a list comprising only the n new numbers you have
generated; the entries of initlist should not be included.)
(2) Using your function with (j, k, m) = (7, 10, 2³²) and initlist [1,1,1,..., 1], generate 2000
pseudorandom numbers x; in the range [0, 2³2). Plot x; against ï¿–1 as a scatter plot. (The plot should
appear when the programme is run.)
=
Transcribed Image Text:(1) Write a function laggedfib(j,k,m,initlist, n) to compute a sequence of n pseudorandom numbers using the lagged Fibonacci method, where initlist is a list of k initial values, and j, k, m are as in the notes. (Note that the function should return a list comprising only the n new numbers you have generated; the entries of initlist should not be included.) (2) Using your function with (j, k, m) = (7, 10, 2³²) and initlist [1,1,1,..., 1], generate 2000 pseudorandom numbers x; in the range [0, 2³2). Plot x; against ï¿–1 as a scatter plot. (The plot should appear when the programme is run.) =
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY