7. Write a client program that uses Stack abstract data to compile a simple arithmetic expression without parentheses. For example, the expression a + b * c - d should be compiled according to the following table:The table shows the order in which the operations are performed ( * , +, -) and operands for each operator. The result column gives the name of an identifier (working backward from z) chosen to hold each result. Assume that the operands are the letters a through m and the operators are (+,-,*,/). Your program should read each character and process it as follows: If the character is blank, ignore it. If the character is neither blank nor an operand nor an operator, display an error message and terminate the program. If it is an operand, push it onto the operand stack. If it is an operator, compare its precedence to that of the operator on top of the operator stack. If the current operator has higherprecedence than the one currently on top of the stack (or if the stack is empty), it should be pushed onto the operator stack. If the current operator has the same or lower precedence, the operator on top of the operator stack must be evaluated next. This is done by popping that operator off the operator stack along with a pair of operands from theoperand stack and writing a new line in the output table. The character selected to hold the result should then be pushed onto the operand stack. Next, the current operator should be compared to the new top of the operator stack. Continue to generate output lines until the top of the operator stack has lower precedence than the current operator or until it is empty. At this point, push the current operator onto the top of the stack and examine the next character in the data string. When the end of the string is reached, pop any remaining operator along with its operand pair just described. Remember to push the result character onto the operand stack after each table line is generated.Do problem 7 on pp 355-356. Do not worry about parenthesis, just use letters and +,-,/,*. Follow the guidelines the problem gives you on how to handle the operators and operands. Use single digit numbers instead of letters and show the result of the formula you use. Make it so I can enter a group of about 7 - 12 operators and operands in an expression. Print out the stack at every change, at the beginning and the end also.
Main Page Exercise: hw5.1 Python Solve an Exercise: 3 - binary_search_numbers Language/Type: Related Links: Given the following sorted lists of integers: - What indexes will be examined as the middle element by a binary search for the target value 8 when the search is run on the following input lists? - What value will the binary search algorithm return? (Notice that the input list e isn't in sorted order. What can you say about the binary search algorithm's result?) a. Indexes examined: a. Value returned: b. Indexes examined: b. Value returned: c. Indexes examined: c. Value returned: d. Indexes examined: d. Value returned: e. Indexes examined: e. Value returned: You passed 5 of 10 tests. Try again. MainPageExerciseshw51 Python Solve an Exercise 3 binarysearchnumbers LanguageType Related Original price was: $10.00.Current price is: $5.00.
Title: Card Game Simulation using Stack and Deck Description: Create a program that simulates a simple card game using a stack and a deck of cards. The objective of the game is to implement basic card manipulation operations using stacks and to showcase the fundamental principles of a deck-based game. Suggested list of data structures: 1. Use a struct or class to store data about each card: struct Card { string suit; string rank; } 2. Use the following arrays or an alternative data structure for each of the following: a. Deck: An array to store the initially created deck of cards Card deck[52] b. Suits: An array to store the list of suits e.g., string suits[] = {"Hearts", "Diamonds", "Clubs", "Spades"} c. Ranks: An array to store the following ranks: string ranks[] = {"2", "3", "4", "5", "6", "7", "8","9","10","Jack","Queen","King", "Ace"} d. A stack to store the cards to be dealt. Struct cardsStack {} e. An array named hand that tracks 5 cards (handSize) given to the player. 3. You may also need to declare the following integer values: a. numberOfCards = 52 b. numberOfRanks = 13 c. numberOfSuits = 4 d. handSize = 5 Include the following functions: 1. Create an array of type Card, which holds a deck of standard playing cards (52 cards: 4 suits - hearts, diamonds, clubs, spades; each suit with cards 2 through 10, Jack, Queen, King, Ace). 2. Shuffle: randomly shuffle the deck of cards. 3. Store the cards in a stack using push. 4. DealCards: pop 5 cards from the deck of cards into an array of cards (hand) e.g., Hand[handSize] 5. Create a function to evaluate the user's hand by adding the corresponding values: The total value for a hand of 5 cards is between 11 and 69. 6. Generate a random number between 11 and 69 to represent the value of 5 cards played by the computer. 7. Compare the randomly generated value that represents the computer's score to the total value of cards held in the player's hand. The higher score wins. Output: 1. Print the deck of cards before shuffling 2. Print the deck of cards after shuffling 3. Print the player's hand and the randomly generated score for the computer 4. Evaluate and print the winner. Title Card Game Simulation using Stack and Deck Description Create a program that simulates a Original price was: $10.00.Current price is: $5.00.
Sale!

begintabularcccc hline Operator Operandi Operand2 Result hline b c z

Original price was: $10.00.Current price is: $5.00.

-50%

Download button will appear immediately after successful payment.

Full support will be provided with necessary files installation.

Get impeccable customized solution within 24 hours, hassle-free.

(2 customer reviews)

Free worldwide shipping on all orders over $50

  • 30 days easy returns
  • Order yours before 2.30pm for same day dispatch
Guaranteed Safe Checkout

7. Write a client program that uses Stack abstract data to compile a simple arithmetic expression without parentheses. For example, the expression a + b * c - d should be compiled according to the following table:The table shows the order in which the operations are performed ( * , +, -) and operands for each operator. The result column gives the name of an identifier (working backward from z) chosen to hold each result. Assume that the operands are the letters a through m and the operators are (+,-,*,/). Your program should read each character and process it as follows: If the character is blank, ignore it. If the character is neither blank nor an operand nor an operator, display an error message and terminate the program. If it is an operand, push it onto the operand stack. If it is an operator, compare its precedence to that of the operator on top of the operator stack. If the current operator has higherprecedence than the one currently on top of the stack (or if the stack is empty), it should be pushed onto the operator stack. If the current operator has the same or lower precedence, the operator on top of the operator stack must be evaluated next. This is done by popping that operator off the operator stack along with a pair of operands from theoperand stack and writing a new line in the output table. The character selected to hold the result should then be pushed onto the operand stack. Next, the current operator should be compared to the new top of the operator stack. Continue to generate output lines until the top of the operator stack has lower precedence than the current operator or until it is empty. At this point, push the current operator onto the top of the stack and examine the next character in the data string. When the end of the string is reached, pop any remaining operator along with its operand pair just described. Remember to push the result character onto the operand stack after each table line is generated.Do problem 7 on pp 355-356. Do not worry about parenthesis, just use letters and +,-,/,*. Follow the guidelines the problem gives you on how to handle the operators and operands. Use single digit numbers instead of letters and show the result of the formula you use. Make it so I can enter a group of about 7 - 12 operators and operands in an expression. Print out the stack at every change, at the beginning and the end also.
begintabularcccc hline Operator Operandi Operand2 Result hline b c z
$10.00 Original price was: $10.00.$5.00Current price is: $5.00.

7. Write a client program that uses Stack abstract data to compile a simple arithmetic expression without parentheses. For example, the expression a + b * c – d should be compiled according to the following table:The table shows the order in which the operations are performed ( * , +, -) and operands for each operator. The result column gives the name of an identifier (working backward from z) chosen to hold each result. Assume that the operands are the letters a through m and the operators are (+,-,*,/). Your program should read each character and process it as follows: If the character is blank, ignore it. If the character is neither blank nor an operand nor an operator, display an error message and terminate the program. If it is an operand, push it onto the operand stack. If it is an operator, compare its precedence to that of the operator on top of the operator stack. If the current operator has higherprecedence than the one currently on top of the stack (or if the stack is empty), it should be pushed onto the operator stack. If the current operator has the same or lower precedence, the operator on top of the operator stack must be evaluated next. This is done by popping that operator off the operator stack along with a pair of operands from theoperand stack and writing a new line in the output table. The character selected to hold the result should then be pushed onto the operand stack. Next, the current operator should be compared to the new top of the operator stack. Continue to generate output lines until the top of the operator stack has lower precedence than the current operator or until it is empty. At this point, push the current operator onto the top of the stack and examine the next character in the data string. When the end of the string is reached, pop any remaining operator along with its operand pair just described. Remember to push the result character onto the operand stack after each table line is generated.Do problem 7 on pp 355-356. Do not worry about parenthesis, just use letters and +,-,/,*. Follow the guidelines the problem gives you on how to handle the operators and operands. Use single digit numbers instead of letters and show the result of the formula you use. Make it so I can enter a group of about 7 – 12 operators and operands in an expression. Print out the stack at every change, at the beginning and the end also.

SKU: 4894 Category: Tags: , , , , , , , , , , , , , , , , , , , ,

Related products

Customers also bought