In a science experiment, result X is expected to occur 25% of the time and result Y is expected to occur theremaining 75% of the time. The following code segment is intended to simulate the experiment if there are100 trials.Line 1: xCount 0Line 2:yCount ← 0Line 3:REPEAT 100 TIMESLine 4:{Line 5:IF(RANDOM (1, 4) = 1)Line 6:{Line 7:xCountxCount + 1Line 8:}Line 9:IF(RANDOM (1, 4) > 1)Line 10:{Line 11:yCountyCount + 1Line 12: }Line 13: }Line 14: DISPLAY ("Result X occurred")Line 15: DISPLAY (xCount)Line 16: DISPLAY ("times and result Y occurred")Line 17: DISPLAY (yCount)Line 18: DISPLAY("times.")A programmer runs the code segment, and the following message is displayed.Result X occurred 24 times and result Y occurred 70 times.The result shows that 94 trials were counted, rather than the intended 100 trials. Which of the followingchanges to the code segment will ensure a correct simulation of the experiment?AReplacing line 9 with IF (RANDOM (1, 4) ≥ 2)BReplacing line 9 with ELSECInterchanging lines 5 and 9D Interchanging lines 7 and 11

The Issue:- The total number of trials counted (xCount + yCount) is 94, instead of 100. This…

Answered: In a science experiment, result X is…

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 14E

See similar textbooks

Similar questions

SPIM simulator (QtSpim). Simulation: Write a MIPS program that computes the expression; y = A * B + C * D Where A, B, C, and D are integers
Algorithm Analysis Start with 102 coins on a table, 98 showing heads and 4 showing tails. There are two ways to change the coins: • flip over any ten coins, or • place n+ 1 additional coins, all showing tails, on the table where n is the number of heads currently showing on the table. For example, you might begin by flipping nine heads and one tail, yielding 90 heads and 12 tails, then add 91 tails, yielding 90 heads and 103 tails. (a) Model this situation as a state machine, carefully defining the set of states, the start state, and the possible state transitions. (b) Optionally, explain how to reach a state with exactly one tail showing. (c) Consider the following derived variables: C ::= the number of coins on the table H ::= the number of heads on the table T::= the number of tails on the table C, ::= parity (C) H2 ::= parity(H) T2 ::= parity(T) Here the parity : Z → {0,1} function is defined as parity(n) = 0 when n is even and 1 otherwise. Which of these variables is strictly…
A fish-finder is a device used by anglers to find fish in a lake. If the fish-finder finds a fish, it will sound an alarm. It uses depth readings to determine whether to sound an alarm. For our purposes, the fish-finder will decide that a fish is swimming past if:there are four consecutive depth readings which form a strictly increasing sequence (such as 3 4 7 9) (which we will call "Fish Rising"), orthere are four consecutive depth readings which form a strictly decreasing sequence (such as 9 6 5 2) (which we will call "Fish Diving"), orthere are four consecutive depth readings which are identical (which we will call "Constant Depth").All other readings will be considered random noise or debris, which we will call "No Fish."Create a Python program called "fishfinder_firstname_lastname" that takes 1 input of string of 4 numbers separated with comma. Your program must display "Fish Rising", "Fish Diving.", "Fish At Constant Depth" or "No Fish".Example:30,10,20,20 Must display No…
Consider the following code: int sum = 0; int i = 0; while (i < 6) { sum = sum + i; i++;} Convert while loop to for loop a. for (int i = 1; i < 7; i++) sum = sum + i; b. for (int i = 0; i <= 6; i++) sum = sum + i; c. for (int i = 1; i <= 6; i++) sum = sum + i; d. for (int i = 0; i < 6; i++) sum = sum + i; e. for (int i = 2; i < 6; i++) sum = sum + i;
Find error
Eulers number e is used as the base of natural logarithm. It may be approximated using the formula e=1/0!+1/1!+1/2!…1/(n-1)!+1/n! When n is sufficiently large. Write a program that approximates e using a loop that terminates when the difference between the two successive values of e is less than 0.0000001.
Children often play a memory game in which a deck of cards containing matching pairs is used. The cards are shuffled and placed face down on a table. The players then take turns and select two cards at a time. If both cards match, they are left face up; otherwise, the cards are placed face down at the same positions. Once the players see the selected pair of cards and if the cards do not match, then they can memorize the cards and use their memory to select the next pair of cards. The game continues until all the cards are face up. Write a program to play the memory game. Use a two dimensional array of 4 rows and 4 columns to use a deck of 16 cards with 8 matching pairs and you can use numbers 1 to 8 to mark the cards. (If you use a 6 by 6 array, then you will need 18 matching pairs, and so on.) Use random number generators to randomly store the pairs in the array. Use appropriate functions in your program, and the main program should be merely a call to functions. Extra credit:…
For the DO WHILE AND GOTO loop below, generate an assembly language version of each DO WHILE loop int sumDoWhileLoop(int start, int end) { int sum = 0; int i = start; do { sum += i; i++; } while (i <= end); return sum;} GOTO loop int sumGotoLoop(int start, int end) { int sum = 0; int i = start; loop: sum += i; i++; if (i <= end) goto loop; return sum;} IS THE ASSEMBLY LANGUAGE VERSION OF EACH LOOP THE SAME OR DIFFERENT. COMPARE BASED ON No of registers used, jumps and total no of operations
In number theory, a happy number is a number which eventually reaches 1 when replaced by the sum of the square of each digit. For instance, 13 is a happy number because 12 + 3? = 10 and 1² + o² = 1. On the other hand, 4 is not a happy number because the sequence starting with 4 = 16 and 12 + 62² = 37 and eventually reaches to 4 that is the number that started the sequence, and so the process continues in an infinite cycle without ever reaching 1. Write, Compile and Execute a Java method that computes whether a given number is happy or sad.
E=(55)(0.009)+(60)(0.021)+(65)(0.132)+(70)(0.338)+(75)(0.338)+(80)(0.132)+(85)(0.021)+(90)(0.009)=
comment what each line does in the program
Children often play a memory game in which a deck of cards containing matching pairs is used. The cardsare shuffled and placed face down on a table. The players then take turns and select two cards at a time.If both cards match, they are left face up; otherwise, the cards are placed face down at the same positions.Once the players see the selected pair of cards and if the cards do not match, then they can memorize thecards and use their memory to select the next pair of cards. The game continues until all the cards areface up. Write a program to play the memory game. Use a two-dimensional array of 4 rows and 4 columnsfor a deck of 16 cards with 8 matching pairs. You can use numbers 1 to 8 to mark the cards. (If you use a6 by 6 array, then you will need 18 matching pairs, and so on.) Use random number generators torandomly store the pairs in the array. Use appropriate functions in your program, and the main programshould be merely a call to functions. I need to figure out how to do…

SEE MORE QUESTIONS

Recommended textbooks for you

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

Programming with Microsoft Visual Basic 2017

Computer Science

ISBN:

9781337102124

Author:

Diane Zak

Publisher:

Cengage Learning

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

C++ for Engineers and Scientists

Computer Science

ISBN:

9781133187844

Author:

Bronson, Gary J.

Publisher:

Course Technology Ptr

Programming with Microsoft Visual Basic 2017

Computer Science

ISBN:

9781337102124

Author:

Diane Zak

Publisher:

Cengage Learning

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

SEE MORE TEXTBOOKS