In the figure, a 0.24 kg block of cheese lies on the floor of a 920 kg elevator cab that is being pulled upward by a cable through distance d1 = 2.1 m and then through distance d2 = 10.6 m. (a) Through d1, if the normal force on the block from the floor has constant magnitude FN = 2.97 N, how much work is done on the cab by the force from the cable? (b) Through d2, if the work done on the cab by the (constant) force from the cable is 91.92 kJ, what is the magnitude of FN?
In: Physics
Use Ge = 9.8 m/s and Gm = Ge/6 for the Earth and Moon’s acceleration of gravity.
1. What is the apparent weight (or force on the scale from
the
person) of this 60 kg person in this elevator with the
following
locations and accelerations?
(a) On Earth accelerating up at 9.8 m/s
(b) On the Moon accelerating up at 9.8 m/s
(c) On Earth accelerating down at 9.8 m/s
(d) On the Moon accelerating down at 9.8 m/s
Also describe what is going on in parts (c) and (d).
In: Physics
*in Java
1.Create a card class with two attributes, suit and rank.
2.In the card class, create several methods:
a. createDeck – input what type of deck (bridge or pinochle) is to be created and output an array of either 52 or 48 cards.
b.shuffleDeck – input an unshuffled deck array and return a shuffled one.
+ Create a swap method to help shuffle the deck
c. countBridgePoints – inputs a 13-card bridge ‘hand’-array and returns the number of high-card points
d. writeHandOutput – input a bridge-hand and prints it out on the monitor
e. writeDeckOuput – inputs a deck of bridge cards and prints it out on the monitor
a. Ask the user what kind of deck he/she wants to create (pinochle or bridge). For this project, have the user input ‘bridge’.
b. Create the user-asked-for deck
c. Print out the unshuffled deck
d. Shuffle the deck
e. Create 4 Bridge hands of 13 cards each, call them North, South, East and West.
+ Deal every fourth card to each of the hands
f. Calculate the high-card-points in each hand
g. Print out each hand and the number of high-card-points associated with each hand
h. Sort the hands from highest to lowest number of points – use Insertion Sort we did before
i. Print out each hands points from highest to lowest.
In: Computer Science
C PROGRAMMING LANGUAGE
Problem title : Bibi's Array
Bibi also has an array containing N elements. Like Lili, Bibi wants to know the highest frequency (most occurrences) and all elements which have that frequency.
Format Input
The first line contains an integer T stating the number of test cases. For each test case, the first line contains a single integer N which indicate the number of element in the array. The next line contains N integers Xi (1≤ i ≤ N ) which indicate i^th element in the array.
Format Output
Consist of T lines where each line has the format "Case #X:Y" , where X is the test case number starting at 1 and Y is the highest frequency. Next line contains all elements which have that frequency sorted in ascending order.
Constraints
¶ 1≤ T ≤ 20
¶ 2 ≤ N ≤ 20.000
¶ 1 ≤ Xi ≤ 2 x 10^5
Sample Input (standard input)
3
8
1 1 2 2 3 4 5 5
8
5 5 4 3 2 2 1 1
4
1 1 1 3
Sample Output (standard output)
Case #1: 2
1 2 5
Case #2: 2
1 2 5
Case #3: 3
1
In: Computer Science
USING PYTHON PROGRAM ONLY (cannot use list, max, or index function because have not learned about it in class yet)
Part C builds on parts A and B, so just need the final code from part C.
USING PYTHON PROGRAM
Part 4a: Addition Table
Write a program that prompts the user for two integers that are greater than or equal to zero. Ensure that the first integer is less than the second integer. Next, write a program that generates an "addition table" using these numbers that computes the sums of all possible values - use the output below as a guide:
Lowest number: -5 Lowest number must be 0 or greater Lowest number: 0 Highest number: 0 Highest number must be larger than lowest number! Highest number: 5 + 0 1 2 3 4 5 ---------------------------- 0 | 0 1 2 3 4 5 1 | 1 2 3 4 5 6 2 | 2 3 4 5 6 7 3 | 3 4 5 6 7 8 4 | 4 5 6 7 8 9 5 | 5 6 7 8 9 10
Here are some hints to get you started:
Lowest number: 9999 Highest number: 10004 + 9999 10000 10001 10002 10003 10004 ------------------------------------------------- 9999 | 19998 19999 20000 20001 20002 20003 10000 | 19999 20000 20001 20002 20003 20004 10001 | 20000 20001 20002 20003 20004 20005 10002 | 20001 20002 20003 20004 20005 20006 10003 | 20002 20003 20004 20005 20006 20007 10004 | 20003 20004 20005 20006 20007 20008
Lowest number: 9999999
Highest number: 10000004
+ 9999999 10000000 10000001 10000002 10000003 10000004
----------------------------------------------------------------------
9999999 | 19999998 19999999 20000000 20000001 20000002 20000003
10000000 | 19999999 20000000 20000001 20000002 20000003 20000004
10000001 | 20000000 20000001 20000002 20000003 20000004 20000005
10000002 | 20000001 20000002 20000003 20000004 20000005 20000006
10000003 | 20000002 20000003 20000004 20000005 20000006 20000007
10000004 | 20000003 20000004 20000005 20000006 20000007 20000008Part 4b: Addition Table
Next, add in a feature that asks the user if they want to identify 'Prime' numbers in their table. If the user elects to show prime numbers you can print a lowercase 'p' character after each prime number. Ensure that your table displays correctly, as described above.
Lowest number: 0 Highest number: 10 Would you like to identify Prime numbers in your table? (y/n): pikachu Invalid command, try again Would you like to identify Prime numbers in your table? (y/n): y + 0 1 2 3 4 5 6 7 8 9 10 ------------------------------------------------ 0 | 0 1 2p 3p 4 5p 6 7p 8 9 10 1 | 1 2p 3p 4 5p 6 7p 8 9 10 11p 2 | 2p 3p 4 5p 6 7p 8 9 10 11p 12 3 | 3p 4 5p 6 7p 8 9 10 11p 12 13p 4 | 4 5p 6 7p 8 9 10 11p 12 13p 14 5 | 5p 6 7p 8 9 10 11p 12 13p 14 15 6 | 6 7p 8 9 10 11p 12 13p 14 15 16 7 | 7p 8 9 10 11p 12 13p 14 15 16 17p 8 | 8 9 10 11p 12 13p 14 15 16 17p 18 9 | 9 10 11p 12 13p 14 15 16 17p 18 19p 10 | 10 11p 12 13p 14 15 16 17p 18 19p 20
Part 4c: Addition Table
Expand your program to support ALL of the arithmetic operators (+, -, *, /, // and %) - prompt the user for an operator to use and then display the desired table. Validate your data accordingly. Ensure that your tables print out using the expected formatting. Note that negative numbers are not considered Prime for the purpose of this part of the assignment.
In: Computer Science
Cosider x+y independent trials with success probability p.
Let J be the number of total successes in the x+y trials and X be the number of success in first x trial
find the expectation of X
In: Statistics and Probability
Your math professor receives several student emails each day. The probability model shows the number of emails your professor receives from students in a given day. Feel free to use StatCrunch or other technology to find your solutions. Enter only the solutions into the spaces provided.
| # student emails | 0 | 1 | 2 | 3 | 4 | 5 |
| Probability | 0.30 | 0.20 | 0.10 | 0.05 | 0.05 | 0.30 |
Mean:
Standard Deviation:
In: Statistics and Probability
Using MIL STD 105 E, probability of accepting a lot acceptance number when the lot size is 600,000 units, the inspection is normal general level I. Acceptance quality level is 0.025% and the proportion of defective product in the lots is 0.4%.
This is the question: what is the probability of accepting.
In: Statistics and Probability
Using MIL STD 105 E, probability of accepting a lot acceptance number when the lot size is 50,000 units, the inspection is normal general level II. Acceptance quality level is 0.065% and the proportion of defective product in the lots is 0.1%
FIND Pa ( prop of acceptance)?
PLEASE SHOW WORK!
In: Advanced Math
Using MIL STD 105 E, probability of accepting a lot acceptance number when the lot size is 600,000 units, the inspection is normal general level I. Acceptance quality level is 0.025% and the proportion of defective product in the lots is 0.4%.
The correct answer is: 0.606.
In: Statistics and Probability