
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Using arrays in java, create a program
that takes two integer command-line arguments n and trials and performs the following experiment, trials times:
- Come up with a birthday for the next person, uniformly at random between 0 and n−1.
- make it so that that person enters the room.
- If that person shares a birthday with someone else in the room, stop; if not, repeat it.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images

Knowledge Booster
Similar questions
- Write a program called Guests.java that prompts a user to enter how many guests he will host. Next, reads a series of the names into an array of Strings using Scanner, and then prints back "Welcome" to all of those guests.arrow_forwardGiven an array below, write a Java program to take input an integer n from the user and print the "True" or "False" depending upon the number n is present twice in the array or not. int [Jarr = {12,-67,13, 15, 12, 15, -67, 0, 1,1}arrow_forwardConsider an array of length n containing unique integers in random order and in the range 1 to n + 1. For example, an array of length 5 would contain 5 unique integers selected randomly from the integers 1 through 6. Thus, the array might contain 3 6 5 1 4. Of the integers 1 through 6, notice that the 2 was not chosen and is not in the array. Write Java code that finds the integer that does not appear in such an array. Your solution should use a. O(n²) operationsarrow_forward
- Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain fewer than 20 words. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey 1 hi 2 Mark 1 hi 2 mark 1 Hint: Use two arrays, one array for the strings and one array for the frequencies. 453086.3222312.qx3zqy7 LAB ACTIVITY HN356 10.16.1: LAB: Word frequencies 1 import java.util.Scanner; 3 public class LabProgram { 2 public static void main(String[] args) { Type your code here. */ LabProgram.java 0/10 Load default template...arrow_forwardWrite the Java method averageOfDoubles that is passed an array of double values, and returns the average of the array values.You can assume the array length is a positive integer.arrow_forwardWrite a method which does the following:a. Ask the user to enter a size of array between 2 to 10.b. Based on the size entered, write a loop which asks the user to fill values into an integer array. Printthe array contents using Arrays.toString().c. For this integer array, write a logic that returns true if there exists a place to split the array such thatthe sum of the numbers on one side is equal to the sum of the numbers on the other. Otherwisereturn false.d. Examples:If the array is {1, 1, 1, 2, 1} then return true.If the array is {2, 1, 1, 2, 1} then return falseIf the array is {10, 10} then return true must include a try catch statementarrow_forward
- Given two sorted arrays, your task is to merge them in a new sorted array. Write a complete program in Java that takes two stored arrays of integers, and then calls a method that merges the two sorted arrays into one array that is sorted. The method returns a new array made by merging the two input sorted arrays. Note that the input arrays can be of different sizes. Assume that the size of each input array is given. You can NOT write a sorting algorithm or apply sorting. To clarify: You cannot merge the two arrays into one and then just sort it using a sorting algorithm. Examples: Input : arr1 = { 1, 3, 4, 5} arr2 = {2, 4, 6, 8} Output : arr3 = {1, 2, 3, 4, 5, 6, 7, 8} Input : arr1 = { 5, 8, 9} arr2 = {4, 7} Output : arr3 = {4, 5, 7, 8, 9}arrow_forwardWrite a java program that prompts user for 10 numbers of any type and stores them in an array. Then print the following: All the values in the array. The sum of all values in the array. The average of all values in the array. The largest value in the array. The smallest value in the array. All the positive numbers in array. All the negative numbers in array. All the odd numbers in array. All the even numbers in array.arrow_forwardNeeds to be written in java and completed using "for loops" or "nested for loops" and in one program just seperate methods: Write a program that calls these three methods. method 1 should print: 5 4 3 2 1 4 3 2 1 3 2 1 2 1 1 method 2 should print: 1 2 3 4 5 1 2 3 4 1 2 3 1 2 1 method 3 should create and array and store 10 multiples of 5 and print it out. Use for loop to generate the multiples and then print them out using a second for loop.arrow_forward
- java a. A method named contains exists that takes an array of Strings and a single String, in that order, as arguments and returns a boolean value that is true if the array contains the given String. Assume that an array of Strings named names is already declared and initialized. Call the method to see if the array contains the name "Fred", and save the result in a new variable named fredIsHere. b. Given a method named printMessage that takes a String argument and returns nothing, call the method to print out "I love Java!".arrow_forwardI need help with creating a Java program described below: Minesweeper.Write a program that reads three numbers, m, n, and p and produces an m-by-n Booleanarray where each element is occupied with probability p. In the minesweeper game, occupiedcells represent bombs and empty cells represent safe cells.Print out the array using an asterisk for bombs and a period for safe cells.Then, create an integer two-dimensional array with the number of neighboring bombs (above,below, left, right, or diagonal). * * . . . * * 1 0 0. . . . . 3 3 2 0 0 . * . . . 1 * 1 0 0Write your code so that you have as few special cases as possible to deal with, by using an(m+2)-by-(n+2) Boolean array.arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY

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 Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science

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
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning

Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education

Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY