Consider the following incomplete method that shuffles a list of Card objects, so that any card can end up at any index in the list with equal prob= public void shuffle(List cards) { int n = cards.size(); while(n > 1) { Card temp = cards.set(k, cards.get(n - 1)); cards.set(n - 1, temp); n--; Which of the following can replace ? int k = (int) (Math.random() * (n - 1)); int k = (int) ((n + 1) * Math.random(); int k = Math.random() * (n - 1); int k = Math.random() * n; int k = (int) (n * Math.random());

Consider the following incomplete method that shuffles a list of Card objects, so that any card can end up at any index in the list with equal prob= public void shuffle(List cards) { int n = cards.size(); while(n > 1) { Card temp = cards.set(k, cards.get(n - 1)); cards.set(n - 1, temp); n--; Which of the following can replace ? int k = (int) (Math.random() * (n - 1)); int k = (int) ((n + 1) * Math.random(); int k = Math.random() * (n - 1); int k = Math.random() * n; int k = (int) (n * Math.random());

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...

See similar textbooks

Related questions

Q: FOR JAVA Consider rewriting the method max() given below such that it gives the correct answer even…

A: Given: FOR JAVA Consider rewriting the method max() given below such that it gives the correct…

Q: Write a method evensum that returns the sum of the values in even indices in a list of integers.…

A: front is storing the first node address and then through this we can iterate till last node by…