A plays B in a tournament. The one who wins three games first gets the tournament trophy. In each game, A's chance of winning is 0.75. Both A and B perform independently from game to game and there is no draw for any game.

a) Use a negative binomial distribution to calculate the probability that A gets the tournament trophy

b) Use a binomial distribution to calculate the probability that A gets the tournament trophy.

Dice Game

Rules:

2 - 4 players

Each player has 5 Dice. The dice have 6 sides.

Each player rolls their dice, and the dice statistics are reported:

Sum, number of pairs (and of what), and "straights" - (all dice in order - e.g. 1,2,3,4,5 or 2,3,4,5,6)

Player 1 might roll 2,2,3,4,4 so the results would be:
Sum: 15, 1 pair (2), 1 pair (4)

Player 2 might roll 1, 1, 4, 6, 6 so the results would be:

Sum: 18, 1 pair (1), 1 pair (6)

Player 3 might roll 3, 3, 3, 5, 6 so the results would be:

Sum: 20, 1 triple (3)

Player 4 might roll 1, 2, 3, 5, 6

Sum: 17

Only one player wins per turn. Points are awarded as follows (only the highest possible point, not a sum of possibles):

The higher pairs beat the lower pairs. (If no other winner, then player 2 beats player 1 because a pair of 6 beats a pair of 4).

Ties re-roll between themselves.

First player to 50 points wins.

If you have built your program properly, you should be able to change the number of players, the number of dice sides, the number of dice, and the win point condition (50 points to something higher) and no changes should be needed to any of the rest of your code.

PS: NetBeans/Java Pls.

A single mass m₁ = 3.5 kg hangs from a spring in a motionless elevator. The spring is extended x = 15 cm from its unstretched length. Spring constant is 228.9

2) What is the distance the lower spring is stretched from its equilibrium length?

3) Now the elevator is moving downward with a velocity of v = -2.7 m/s but accelerating upward with an acceleration of a = 5.5 m/s². (Note: an upward acceleration when the elevator is moving down means the elevator is slowing down.)

What is the force the bottom spring exerts on the bottom mass?

is the elevator speeding up? slowing down? moving at a constant speed?

6) Rank the distances the springs are extended from their unstretched lengths:

The goal of this assignment is to give you some experience writing code with control structures in Java.

You will create a number guessing game program. The program will randomly choose a number between 0 and 100 that the user will try to guess. The user will be given a maximum number of tries (10 max) to guess the number. The user wins only when they guess the randomly chosen number before the maximum number of tries expires. Otherwise, the user loses the game. During the course of playing the game, you need to let the user know whether the guess was too high or too low.

The program should display instructions on how to play the game, number of wins, losses, and the total number of guesses.

I want you to use the Java API or other online resources to find out how to generate a random number.

SciTools Incorporated, a company that specializes in scientific instruments, has been invited to make a bid on a government contract. The contract calls for a specific number of these instruments to be delivered during the coming year. The bids must be sealed (so that no company knows what the others are bidding), and the low bid wins the contract. SciTools estimates that it will cost $5000 to prepare a bid and $95,000 to supply the instruments if it wins the contract. On the basis of past contracts of this type, SciTools believes that the possible low bids from the competition, if there is any competition, and the associated probabilities are those shown in the table below. In addition, SciTools believes there is a 30% chance that there will be no competing bids.

Based on the data in the table above, SciTools will limit its choices for bids to $115,000, $120,000, and $125,000.

a) Draw a decision tree for this scenario

b) Solve this decision tree using EMV

c) Draw the risk profiles for all decision strategies

d) Draw the cumulative risk profile for this scenario. Is there dominance?

e) Construct a tornado diagram for this scenario, if we assume the following ranges for the

variables:

a. Probability of no competing bids: 0 to 0.6

b. Cost to supply the instruments: $85,500 to $105,400

c. Bid cost: $4,500 to $5,500

Following are the number of victories for the Blue Sox and the hotel occupancy rate for the past eight years. You have been asked to test three forecasting methods to see which method provides a better forecast for the Number of Blue Sox Wins.

For the following, you are to provide all forecasts to one decimal place (example, 93.2)

You are asked to forecast the Number of Blue Sox Wins for Year 9. Although you believe there might be a linear regression relationship, your boss has told you to only consider the following three forecasting methods:

• 3-period moving average
• 3-period weighted moving average given the weights of 0.7 for the most recent period and 0.2 for the next most recent period, and the remaining weight (s) consistent with this method as we have used in class, and
• exponential smoothing with α = 0.25 and the best forecast available for the Number of Blue Sox Wins is for Year 2 which is 66.0.

a) What is the forecast from each of these methods for Year 9?

b) Which forecasting method provides the better forecast for Year 9? Why? Your selection criteria must be based on one of the numerical evaluation methods we have used on the homework this term using the forecast results for Year 5 through Year 8.

In C++ please:

In this lab we will creating two linked list classes: one that is a singly linked list, and another that is a doubly linked list ( This will be good practice for your next homework assignment where you will build your own string class using arrays and linked list ) .

These LinkedList classes should both be generic classes. and should contain the following methods:

• Print

• Add - Adds element to the end of the linked list.

• IsEmpty

• Push - Adds element to the beginning of the linked list

• InsertAt - Inserts an element at a given position

• Clear - Removes all elements from the linked list

• Contains - Returns true if element is in the linked list

• Get - Returns a value at a specific position

• IndexOf - Returns the first position where an element occurs, -1 if not

• LastOf - Returns the last position where an element occurs, -1 if not

• Remove - Removes the last item added to the list

• RemoveAt - Removes an element at a specific position

• RemoveElement - Removes the first occurrence of a specific element

• Size

• Slice - Returns a subset of this linked list given a beginning position start and end position stop.

You will also count the number of operations that is performed in each method and will calculate the RUN-TIME of each method, as well as calculating the BIG O, OMEGA and THETA notation of each method. This information should be written in a comment block before each method ( you may count the number of operations on each line if you want ).