odulo & Division Maranga um that will take as inputs 2 integers, x determine if x is divisible by y without ulo operator (%) and division. It will divisible by y, otherwise e. ontains x while the second line contains main.c Custom Input Enter custom

odulo & Division Maranga um that will take as inputs 2 integers, x determine if x is divisible by y without ulo operator (%) and division. It will divisible by y, otherwise e. ontains x while the second line contains main.c Custom Input Enter custom

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
Blackout Math is a math puzzle in which you are given an incorrect arithmetic equation. The goal of the puzzle is to remove two of the digits and/or operators in the equation so that the resulting equation is correct. For example, given the equation 6 - 5 = 15 ^ 4/2we can remove the digit 5 and the / operator from the right-hand side in order to obtain the correct equality 6 - 5 = 1 ^ 42. Both sides of the equation now equal to 1. Observe how removing an operator between two numbers (4 and 2) causes the digits of the numbers to be concatenated (42). Here is a more complicated example: 288 / 24 x 6 = 18 x 13 x 8 We can remove digits and operators from either side of the equals sign (either both from one side, or one on each side). In this case, we can remove the 2 from the number 24 on the left-hand side and the 1 from the number 13 on the right-hand side to obtain the correct equality 288 / 4 x 6 = 18 x 3 x 8 Both sides of the equation now equal to 432. Here is another puzzle for you…
Computer Science Practice Task : Write a program in phyton language . Implement Water Jug Problem using DFS in Python, initial stage (0,0) and final stage (2,Y). A Water Jug Problem: You are given two jugs, a 4-gallon one and a 3- gallon one, a pump which has unlimited water which you can use to fill the jug, and the ground on which water may be poured. Neither jug has any measuring markings on it. How can you get exactly 2 gallons of water in the 4-gallon jug?
Finish code in Mathematica: The representations of HMMs is also the same. Here's what a call to readHMM[] would look like: hmmObject = readHMMFile["Test/humanMalaria.hmm"]= hmmObject$4958, hmmObject["states"]={"M", "H"} hmmObject["initialStateProbs"]={0.5, 0.5} hmmObject["transitionMatrix"]={{0.5, 0.5}, {0.5, 0.5}} hmmObject["alphabet"]={"A", "C", "G", "T"} hmmObject["emissionMatrix"]={{0.3, 0.25}, {0.2, 0.25}, {0.2, 0.25}, {0.3, 0.25}} observationSeq_ is like: {1, 4, 3, 1, 4, 4, 4, 3, 3, 2, 3, 2, 2, 3, 2} You will have two: buildForwardMatrix and buildBackwardMatrix. You will then combine them inside posteriorProbabilities. posteriorDecode calls posteriorProbabilities and uses the result to find the posterior path and output the corresponding state names. Finish the following four functions in Mathematica: buildForwardMatrix[observationSeq_, hmm_] := Module[{numberOfObservations, numberOfStates, forwardMatrix, observationIndex}, (* Put your code for bulding the forward matrix here.…
in phython langauge: Write a program which reads the number of blocks the builders have,and outputs the height of the pyramids that can be built using these blocks.
'''Given code (copy-paste): Problem (see pic): def createList(n): #Base Case/s #ToDo: Add conditions here for base case/s #if <condition> : #return <value> #Recursive Case/s #ToDo: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once all ToDo is completed return [] def removeMultiples(x, arr): #Base Case/s #TODO: Add conditions here for your base case/s #if <condition> : #return <value> #Recursive Case/s #TODO: Add conditions here for your recursive case/s #else: #return <operation and recursive call> #remove the line after this once you've completed all ToDo return [] def Sieve_of_Eratosthenes(list): #Base Case/s if len(list) < 1 : return list #Recursive Case/s else: return [list[0]] + Sieve_of_Eratosthenes(removeMultiples(list[0], list[1:])) if __name__ == "__main__": n =…
PYTHON CHALLENGE ACTIVITY 6.7.2: Function with branch: Popcorn. Define function print_popcorn_time() with parameter bag_ounces. If bag_ounces is less than 3, print "Too small". If greater than 10, print "Too large". Otherwise, compute and print 6 * bag_ounces followed by "seconds". End with a newline. Remember that print() automatically adds a newline.Sample output with input: 742 seconds ''' Your solution goes here ''' user_ounces = int(input())print_popcorn_time(user_ounces)
Write this uing java Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. slope = 0 slope > 0 slope < 0 slope = 1 slope > 1 swap the rolls of x and y slope < 1 slope = infinity ( needs special test case) Include appropriate tests for ‘special case’ conditions. Insteadof “WritePixel” write to the screen the coordinates of the pixel that would be drawn.
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…
NEED HELP ASAP PLEASE! THANK YOU! Consider a game with three dice, namely, A, B and C. Each die, when rolled, generates a number between 1 and 6 (inclusive) independently and uniformly at random. In each play, the three dice are rolled, then a monetary return is computed according to the values for dice A, B and C, using the following algorithm. ThreeDice(A, B, C) { money = -9; if (A == B and B == C) { money = money + 81; } else if (A == B or B == C or C == A) { money = money + 21; } return money; } Analyze this game by answering the following questions: (a) What is the largest possible return value of ThreeDice? (b) What is the probability of ThreeDice returning the largest possible value? Choose one from below. A. 1/18 B. 1/3 C. 1/216 D. 1/2 E. 1/6 F. none of these is correct G. 1/36 H. 1/12 (c) What is the smallest possible return value of ThreeDice? (d) What is the probability of ThreeDice returning the smallest possible value? Choose one from below. A. 5/54 B. 1/18 C. 5/9 D. 4/9…
Program in C++ or Java Simple simulation to estimate your likelihood of winning in a game of poker. Assume the game has 6 players.• Repeatedly (500-1000 times):◦ Shuffle the 52-card deck, and deal yourself a 5-card hand.◦ Repeatedly (500-1000 times): ▪ Using the remaining 47 cards, deal the other 5 players their hands ▪ Determine if you would win or lose that hand; that is, if your hand would rank highest.2 Update some counters accordingly. ▪ Reshuffle the deck of 47 cards ◦ Record the proportion of the above hands which you won.• For each rank of hand, report the percentage of hands having that rank, and the average winning percentage (average of the averages) for each rank. Produce 2 output files• A session log output as a CSV (comma-separated value) file, with each hand on a separate line. For each hand: the cards in the hand; what the hand was evaluated as; and its winning percentage.• A summary showing the percentage of hands falling into each rank, and the overall win…