Please complete the following Java program using the math.random function. DO NOT USE arrays, random function. (i.e keep the program simple using while loops, if/else, for loops, etc) 1. Player guesses the number computer picked (shouldguess in 7 or less tries)Range : Between 1 and 100 [Use Math.Random() forcomputer picking a secret number]• Display number-of-tries in the end if won or 'Lose' after 7tries

Java code for above : import java.util.Scanner; import java.util.Random; class Prog{…

1. Player guesses the number computer picked (should guess in 7 or less tries) • Range : Between 1 and 100 [Use Math.Random() for computer picking a secret number] Display number-of-tries in the end if won or 'Lose' after 7 tries

1. Player guesses the number computer picked (should guess in 7 or less tries) • Range : Between 1 and 100 [Use Math.Random() for computer picking a secret number] Display number-of-tries in the end if won or 'Lose' after 7 tries

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

Given code: int s=0; for ( int i=1; i<5; i++ ){ s = s + i ; } Which one is correct, after running the code. Group of answer choices s=1 s=15 s=10 s=5
cse
Hello. Please answer the attached Algorithms question correctly. You don't have to give a long explanation.*If you answer the question correctly, I will give you a thumbs up. Thanks.
Bisection method only octave/math lab
Lucky Pairs Richie and Raechal are participating in a game called "Lucky pairs" at the Annual Game Fair in their Company. As per the rules of the contest, two members form a team and Richie initially has the number A and Raechal has the number B.There are a total of N turns in the game, and Richie and Raechal alternatively take turns. In each turn, the player's number is multiplied by 2. Richie has the first turn. Suppose after the entire N turns, Richie’s number has become C, and Raechal’s number has become D, the final score of the team will be the sum of the scores (C+D) of both the players after N turns. Write a program to facilitate the quiz organizers to find the final scores of the team. Input and Output Format:The only line of input contains 3 integers A, B, and N.Output a single line that contains the integer that gives the final score of the team which will be the sum of the scores of both the players after N turns.Refer sample input and output for formatting specifications.…
Best Race DayIn this last problem, we will identify which of the three stages the rider was the fastest. You will read the rider's name, three distance-time pairs and output in which stage the rider rode the fastest.Hint: Review the Math class's operations before starting this problem.InputYou will read from the user the following (in order):• The rider's name as a String. The name can have spaces• 3 distance-time pairs, one for each stageOutputThe rider's name followed by the fastest average speed:"{Name}" fastest speed among the three stages was: {speed}km/hExample: Input OutputContador "Contador" fastest speed among the three 198 6.0 stages was: 33.0km/h250 9.5178 9.0
(Learning Objective: students will be able to apply their knowledge of the built-in random package to generate simulations of simple phenomena.) Write a function: • dicesim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured. Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.dicesim(6,6,10000)) resulted in: [0. 0. 0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281] or displayed using the code from Section 16.1.1.: PMF of X Note: you should submit a file with only the standard comments at the top and the function. The grading scripts will then import the file for testing.
python: numpy def not_stealing(items): """ While you're shopping, you notice that some items you've picked up do not have a price tag. Do you steal them? NO! Instead, you decide to be a good person and replace them with another item that does have a price. - Items with no price will have a value of np.nan. - Replace np.nan values with a random price between $5 and $9, inclusive. - Return the average of the new prices in the array, rounded to 2 decimal places. - DO NOT REMOVE random.seed(1) Args: items (np.array) Returns: float >> items = np.array([4.63, np.nan, 3.78, 7.12, 12.35, 7.19, np.nan, 1.50, 2.41]) >> not_stealing(items) 5.66 """ #DO NOT REMOVE# random.seed(1) ############## # items = np.array([4.63, np.nan, 3.78, 7.12, 12.35, 7.19, np.nan, 1.50, 2.41]) # print(not_stealing(items)) # items = np.array([np.nan, np.nan, 6.18, np.nan, 18.42, 2.67, 9.14, np.nan, 14.32]) #…
WATERSORT PROGRAM - JAVA •The aim of Part 2 is to set up the puzzle for the player to solve in Part 3. IMPORTANT NOTE: We are not going to start with 2 empty bottles, but rather with 8 empty slots spread over the 5 bottles as explained in the intro video. Start with 5 empty bottles. Use a random number generator to fill bottles one slot at a time with the colours while keeping 8 slots empty – there is a total of 5*4 = 20 slots – so if we will 12 slots, 8 are free. •Advantage: Easy to create a puzzle with a good mix •Disadvantage: With more colours and bottles and only 2 open bottles for more advanced versions of the game, the result might not be solvable. Start with three sorted bottles. In the strategy the idea is to load three bottles with uniform colour and then move ink around for a number of moves until the bottles are mixed up. •Advantage: Result is always solvable since the bottles are created in a reversed-game strategy. •Disadvantage: It is hard to develop an algorithm which…
Celebrity problem A celebrity among a group of n people is a person who knows nobody but is known by everybody else. The task is to identify a celebrity by only asking questions to people of the form: ”Do you know him/her?” Solution Select two people from the group given, say, A and B, and ask A whether A knows B. If A knows B, remove A from the remaining people who can be a celebrity; if A doesn’t know B, remove B from this group. Solve the problem recursively for the remaining group of people who can be a celebrity Which design strategy does the following solution use? A-)Decrease-by-a-constant factor algorithm B-)Variable-size-decrease algorithm C-)Decrease-by-a-constant algorithm D-)Divide-and-Conquer
1. Astronomy Board Game In an astronomy board game, N planets in an imaginary universe do not follow the normal law of gravitation. All the planets are positioned in a row. The planetary system can be in a stable state only if the sum of the mass of all planets at even positions is equal to the sum of the mass of planets at the odd positions. Initially, the system is not stable, but a player can destroy one planet to make it stable. Find the planet that should be destroyed to make the system stable. If no such planet exists, then return -1. If there are multiple such planets, then destroy the planet with the smallest index and return the index of the destroyed planet. Example Let N=5 and planets = [2,4,6,3,4]. Destroying the fourth planet of mass 3 will result in planets= [2,4,6,4], and here, the sum of odd positioned planets is (2+6)=8, and the sum of even positioned planets is (4+4)=8, and both are equal now. Hence, we destroy the fourth planet. Function Description Complete the…
Hermite Polynomial: (THERE ARE NO CALCULATIONS IN THIS QUESTION – ALGORITHM BASED ANSWERS!) The Hermite Polynomial is an extension of the LaGrange Polynomial Interpolation, designed to reduce the runtime of LaGrange while also reducing the degree of error. a) What is the runtime and error associated with LaGrange Polynomial Interpolation? Explain your answer! b) How does the Hermite Polynomial Hi(x) improve on Li(x)? Be specific in your answer.