c++ using simple parallel arrays and a random number generator. one string should have [rock, paper, scissors] in it and I guess I can use a parallel string with numbers [0, 1, 2] in order to generate a random nnumber 0-2 that correlates to the string with the words in it... Assignment 5B: Keeping Score. Now that we know about arrays, we can keep track of whenevents occur during our program. To prove this, let's create a game of Rock-Paper-Scissors.For those not familiar with this game, the basic premise is that each player says "Rock-Paper-Scissors!" and then makes their hand into the shape of one of the three objects. Winners aredetermined based on the following rules:Rock beats ScissorsScissors beats PaperPaper beats RockAt the start of the program, it will ask the player how many rounds of Rock-Paper-Scissors they want to play. After this, the game will loop for that many number of times.Each loop, it will ask the player what item they want to use – Rock, Paper, or Scissors.The computer will randomly generate its own item, and a winner will be determined.The game will then save the result as an element of an array, and the next round willbegin.Once all the rounds have been played, the program will say "Game Over" and display alist of who won each round, in order.Hints: While the random functions we've discussed thus far can't generate words, wecan associate numbers with them instead. For example, we might treat the computerrandomly generating 0 as if it threw Rock. We could then use that number to access apredefined String array with “Rock", “Paper", and "Scissors" stored inside it.SampleOutput#1. Sample Output #1:How many games do you want to play?: 3Round 1: What do you want to throw?: RockComputer threw SCISSORS!Round 2: What do you want to throw?: PaperComputer threw PAPER!Round 3: What do you want to throw?: RockComputer threw PAPER!Game Over...Here's the recap:Player won Round 1Tied on Round 2Computer won Round 3Sample Output #2:How many games do you want to play?: 2Round 1: What do you want to throw?: ScissorsComputer threw ROCK!Round 2: What do you want to throw?: PaperComputer threw SCISSORS!Game Over...Here's the recap:Computer won Round 1Computer won Round 2

Code: #include <iostream>using namespace std; // Constant variablesconst char roCK =…

c++ using simple parallel arrays and a random number generator. one string should have [rock, paper, scissors] in it and I guess I can use a parallel string with numbers [0, 1, 2] in order to generate a random nnumber 0-2 that correlates to the string with the words in it...

c++ using simple parallel arrays and a random number generator. one string should have [rock, paper, scissors] in it and I guess I can use a parallel string with numbers [0, 1, 2] in order to generate a random nnumber 0-2 that correlates to the string with the words in it...

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 30SA

See similar textbooks

Similar questions

THIS NEEDS TO BE DONE IN C#!! The Tourtise and The Hair In this lab, we will be simulating the classic race of the tourtise and the hare. The race will take place on two paths of 70 tiles, which spans from left to right. The path will have two lanes, one for each animal. The path will be represented as an array of 70 characters, where each character will be the following: · A dash(i.e, “-“), which represents an empty tile. · An “h”, which represents the hare on the hare lane. · A “t”, which represents the tourtise on the tortise lane. All tiles will be “empty” (i.e. set to the dash) with the exception of the tiles that are occupied by the animals. As the animals move, the previous tile the animal was on will be set to empty, and the new tile will be changed to either “h” or “t”. Tile 70 will be the finishing tile, and the first animal to that tile will be declared the winner of the race. We will use randomization to determine how far each animal will move. Since this race will be…
an int variable k, an int array currentMembers that has been declared and initialized, an int variable nMembers that contains the number of elements in the array, an int variable memberID that has been initialized, and a bool variable isAMember, Write code that assigns true to isAMember if the value of memberID can be found in currentMembers, and that assigns false to isAMemberotherwise. Use only k, currentMembers, nMembers, and isAMember.
. Now take any name from the user, find whether that name is present in that array or not, and print the position of that name in the array if found. Write a search method to sequentially search the name from the array. Invoke the search method from the main method. The array and the name to be searched should be passed into the search method as parameters.Now write a Java program to implement binary search for the above problem.[Hint: You can use equals() and compareTo() methods of String class.]
In this program you will take two tables using python cars = ["Buick","Ford","Honda"]colors = ["Red","Blue","Black","White","Green"] aType = ["Sedan","SUV","Sports","Coupe","Truck"] and place them in a two-dimensional array. as follows:Buick Red Sedan Buick Blue SUV Buick Black Sports Buick White Coupe Buick Green Truck Ford Red Sedan Ford Blue SUV Ford Black Sports Ford White Coupe Ford Green Truck Honda Red Sedan Honda Blue SUV Honda Black Sports Honda White Coupe Honda Green Truck how would the flow chart be structured for this as well?
A minimax or saddle point in a two-dimensional array is an element that is the minimum of its row and the maximum of its column, or vice verse. For example, in the following array11 22 33 33 99 55 66 77 77 44 99 22the element 33 is a minimax because it is the maximum of row 0 and the minimum of column 2. The element 55 is another minimax because it is the minimum of row 1 and the maximum of column 1.Write a program that reads a 4-by-3 matrix, and then prints the location and value of each minimax in the matrix. For example, it would printa[0][2] = 33 is a minimax a[1][1] = 55 is a minimaxfor the matrix shown above.
Python: In this program you will take two tables cars = ["Buick","Ford","Honda"]colors = ["Red","Blue","Black","White","Green"] aType = ["Sedan","SUV","Sports","Coupe","Truck"] and place them in a two-dimensional array. as follows:Buick Red SedanBuick Blue SUVBuick Black SportsBuick White CoupeBuick Green TruckFord Red SedanFord Blue SUVFord Black SportsFord White CoupeFord Green TruckHonda Red SedanHonda Blue SUVHonda Black SportsHonda White CoupeHonda Green Truck
3. Write a program to find intersection of two sorted array.For example, if the two sorted arrays as input are {21, 34, 41, 22, 35} and {61, 34, 45, 21, 11}, it should returnan intersection array with numbers {34, 21}. For the sake of this Problem, you can assume that numbers ineach integer array are unique.
Code in C++ Language As a cashier, you would always hate those times when customers choose to take back their order since you'd always summon your manager and yell, "Ma'am pa-void!" No matter how you hate it, you always have to do it since you have no other choice. Given (1) an array of prices of the items, (2) another array of the items the customer wishes to take back, and (3) the customer's payment, print the change of the customer. Input: The first number indicates the number of items "n" brought to the cashier. The next "n" numbers are the prices of the items. The next number indicates the number of items "m" that the customer wants to take back and not proceed. It is assured that 0 <= m <= n. The next "m" numbers are the items to be void that ranges from item 1 to item "n". The final number is the customer's payment. It is also assured that the given payment >= final price of items. INPUT: 5 103.65 650.95 10.25 1067.30 65.18 2 1 5 2000.00 Output: The change…
JAVA PROGRAMMING Two words (spelt in uppercase) are similar if and only if all letters in the 1st word are in the 2nd word and all letters in the 2nd word are in the 1st word; including the same number of duplications. For example, ABBA and BABA are similar; however, BABA and BAAA are not similar. To check two words which are similar, we can use two integer arrays, each has 26 elements (as we have 26 letters), you can assume that 1st array element stores the number of letter ‘A’, 2nd array element stores the number of letter ‘B’, and so on. What you need to do now is to check whether the two integer arrays are equal to decide whether the two words are similar. We propose following UML for this question: The class TwoWords has two String instance variables. In this class, other than the constructors, accessor and mutator methods; we have two important methods: the countInfo method receives a String parameter (a word, for example) counts and stores the letters’ info in an integer…
You’re given an array of integers and another array of three distinct integers. The first array is guaranteed to only contain integers that are in the second array, and the second array represents a desired order for the integers in the first array. For example, a second array of [x, y, z] represents a desired order of [x, x,…,x, y, y,…,y, z, z,…,z] in the first array. Write a program that sorts the first array according to the desired order in the second array. The program should perform this in place (i.e.., it should mutate the input array), and it shouldn’t use any auxiliary space. Note that the desired order won’t necessarily be ascending or descending and that the first array won’t necessarily contain all three integers found in the second array-it might only contain one or two. Please Don't Use Chat GPT Answers Sample input array = [1,0,0,-1,-1,0,1,1] order = [0,1,-1] Sample output [0,0,0,1,1,1-1,-1] Requirements: 1. Implement the above problem statement using C Programming. 2.…
The bank will store a record for each account consisting of a customer number (an integer) representing the owner of the account, an account type (a single char: C for chequing, S for savings, and M for mutual fund), and the balance of the account (a double). These are kept in three arrays-an array of customer numbers, an array of types, and an array of balances. A sample of what this might look like appears below: Customer Array 102241 992944 992944 Type Array C S C Balance Array 1.29 22.50 1.24 The entries in the array correspond to one another-for example, the first slot in all three arrays represent the fact that customer number 102241 has a chequing account with $1.29 in it. As is shown, the same customer number can appear several times, as customers can have more than one account. These are called parallel arrays, because the slots in each correspond, and the really important thing about parallel arrays is that if you shuffle around anything in one array, you have to…
The bank will store a record for each account consisting of a customer number (an integer) representing the owner of the account, an account type (a single char: C for chequing, S for savings, and M for mutual fund), and the balance of the account (a double). These are kept in three arrays-an array of customer numbers, an array of types, and an array of balances. A sample of what this might look like appears below: Customer Array 102241 992944 992944 Type Array C S C Balance Array 1.29 22.50 1.24 The entries in the array correspond to one another-for example, the first slot in all three arrays represent the fact that customer number 102241 has a chequing account with $1.29 in it. As is shown, the same customer number can appear several times, as customers can have more than one account. These are called parallel arrays, because the slots in each correspond, and the really important thing about parallel arrays is that if you shuffle around anything in one array, you have to…