Write a program using stacks that will do the following: 1. Ask the user for a number then push in the stack. 2. Ask the user if he/she wants to add another number 3. Once the user inputs "N", pop and dislpay all numbers Refer to sample output: Enter a Number: 5 Enter Another Number? [Y/N]: Y Enter a Number: 4 Enter Another Number? [Y/N]: Y Enter a Number: 3 Enter Another Number? [Y/N]: Enter a Number: 2 Y Enter Another Number? [Y/N]: Y Enter a Number: 1 Enter Another Number? [Y/N]: N The numbers are: 1 2 3 4 5

Write a program using stacks that will do the following: 1. Ask the user for a number then push in the stack. 2. Ask the user if he/she wants to add another number 3. Once the user inputs "N", pop and dislpay all numbers Refer to sample output: Enter a Number: 5 Enter Another Number? [Y/N]: Y Enter a Number: 4 Enter Another Number? [Y/N]: Y Enter a Number: 3 Enter Another Number? [Y/N]: Enter a Number: 2 Y Enter Another Number? [Y/N]: Y Enter a Number: 1 Enter Another Number? [Y/N]: N The numbers are: 1 2 3 4 5

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

Write a program that will read a string and display the string in reverse order. Use the codesnippet given below to solve the problem.Hint. Push each character of a string onto the stack and then pop and display each character from the stack.import osclass Stack: def __init__(self, size): self.stack = [0] * size self.top = 0 self.size = size def push(self,item): if (self.top < self.size): self.stack[self.top] = item self.top += 1 else: print("Stack Overflow") def pop(self):if (self.top > 0):self.top -= 1return self.stack[self.top]else:print("Stack Underflow")def is_empty(self):return (self.top == 0)def is_full(self):return (self.top == self.size)def makenull(self):self.top = 0def peek(self):if (self.top > 0):return self.stack[self.top - 1]else:print("Stack Underflow")string = input("Enter a string: ")# write code here to display the string in reverse order Sample Run:Enter a string:…
.) The following stack stores a stack of integers. Draw the stacks and determine what is the output of the following program? import java.util.*; public class TestStack1 { public static void main(String ... args) { Stack<Integer> s = new Stack< >( ); s.push(-54); s.push(27); s.push(31); System.out.println(s.pop( )); Integer v = s.pop( )+ s.pop( ) % 3; s.push(v); s.push(21); int w = s.pop( ); int x = s.pop( ); s.push(x % w - v); System.out.println(s.pop( )); Integer a=-2, b=5, c=22, d=4; s.push(a); s.push(b); s.push(c); s.push(d); s.push(s.pop( ) + s.pop( )); s.push(s.pop( ) * s.pop( )); while(!s.empty()) {System.out.println(s.pop( ));} } }
Draw a stack: We start with an empty stack and then execute the following commands: push 4 push 7 pop push 5 push 5 push 8 push 7 push 8 pop pop pop push 7 push 6 pop pop push 8
For our first example of using a stack, we’ll examine a very simple task: reversing aword. When you run the program, it asks you to type in a word. When you press Enter, itdisplays the word with the letters in reverse order.A stack is used to reverse the letters. First the characters are extracted one by one fromthe input string and pushed onto the stack. Then they’re popped off the stack and displayed. Because of its last-in-first-out characteristic, the stack reverses the order of thecharacters. shows the code for the reverse.cpp program.
Use a stack to reverse the words of a sentence. Keep reading words until you have a word that ends in a period, adding them onto a stack. When you have a word with a period, pop the words off and print them. Stop when there are no more words in the input. For example, you should turn the inputMary had a little lamb. Its fleece was white as snow.intoLamb little a had mary. Snow as white was fleece its.Pay attention to capitalization and the placement of the period. This is what I have so far: import java.util.Scanner;import java.util.Stack; /** Class for reversing the order of a sentence.*/public class SentenceReverser{ /** Reverses the given sentence. @param sentence Sentence to be reversed. @return Reversed sentence. */ public static String reverse(String sentence) { String reversed = ""; Scanner scanner = new Scanner(sentence); Stack<String> stack = new Stack<String>(); // put your work below // ... return…
Write a program that uses a stack to test input strings to determine whether theyare palindromes. A palindrome is a sequence of words that reads the same as thesequence in reverse: for example, noon. Use this Python Example : class Stack:'''TODO: Remove the "pass" statements and implement each methodAdd any methods if necesssaryDON'T use any builtin stack class to store your items'''def __init__(self): # Constructor functionpassdef isEmpty(self): # Returns True if the stack is empty or False otherwisepassdef len(self): # Returns the number of items in the stackpassdef peek(self): # Returns the item at the top of the stackpassdef push(self, item): # Adds item to the top of the stackpassdef pop(self): # Removes and returns the item at the top of the stackpassdef palindrome(input_str):isPalindrome = False#TODO: Your work here# Return if input_str is palindrome or notreturn isPalindromeif __name__ == "__main__":my_str = "noon"print(palindrome(my_str)) # Correct Output: True#TODO…
java /* Practice Stacks and ourVector Write a java program that creates a stack of integers. Fill the stack with 30 random numbers between -300 and +300. A)- With the help of one ourVector Object and an additional stack, reorganize the numbers in the stack so that numbers smaller than -100 go to the bottom of the stack, numbers between -100 and +100 in the middle and numbers larger than +100 in the top (order does not matter) B)- (a little harder) Solve the same problem using only one ourVector object for help C)- (harder) Solve the same problem using only one additional stack as a helper */ public class HWStacks { public static void main(String[] args) { // TODO Auto-generated method stub } }
in java starting with an empty stack mimic the functionality of the back and forward button on modern browsers that is, at any point that the stack is not empty,allow a back function to display to previous page.also if you viewing a back page allow a forward button to go to the forward pages stack =[] go to page 1 - display page 1 - stack [page 1] go to page 2 - display page 2 -stack [page1,page 2] go back- display 1 - stack[ page1] go forward - display2 - [page 1 ,page 2] go to page 5- display page 5 -stack[page1,[age2,page5]
examine a very simple task: reversing a word. When you run the program, it asks you to type in a word. When you press Enter, it displays the word with the letters in reverse order. A stack is used to reverse the letters. First the characters are extracted one by one from the input string and pushed onto the stack. Then they’re popped off the stack and displayed. Because of its last-in-first-out characteristic, the stack reverses the order of the characters.
In C++, Write a program which is menudriven ( i) Push, ii) POP, iii) Peek iv) Print). It will create a stack ofinteger type data. You have to implement the following operations.a. Push (Insert a data to the stack)b. Pop (Print the data at the TOP and remove thedata)c. Peek (Print the data at the TOP)d. Print (Print the whole stack)
Write a program that displays the first 100 primenumbers in descending order. Use a stack to store the prime numbers.
can you please get my code to run and send the corrected code: import java.util.ArrayDeque; import java.util.Queue; public class TileGame { public static int tileGame(ArrayDeque<Integer> stack, Queue<Integer> q) { int turns = 0; while (!stack.isEmpty()) { int top = stack.pop(); if (top == 1) { if (!stack.isEmpty()) { stack.pop(); } } else if (top == 2) { if (stack.size() >= 2) { stack.pop(); stack.pop(); } } else if (top == 3) { if (!q.isEmpty()) { stack.push(q.poll()); } if (!q.isEmpty()) { stack.push(q.poll()); } if (!q.isEmpty()) { stack.push(q.poll()); } } turns++; } return turns; } }