Question 1: Write a C++ program that checks every two consecutive elements in a stack, that is passed to the function as a reference parameter and subtract the small one from the larger one. For example, if the stack S contains the elements 2,1,3,4,5,3,0. Where 2(left) is the top element of stack. CheckEach2Consecutive(S) must return the elements as 1,1,1,3,2,3,0. Note: You may use two different stacks, one for original elements and other for the elements after applying CheckEach2Consecutive(S) functions.

Question 1: Write a C++ program that checks every two consecutive elements in a stack, that is passed to the function as a reference parameter and subtract the small one from the larger one. For example, if the stack S contains the elements 2,1,3,4,5,3,0. Where 2(left) is the top element of stack. CheckEach2Consecutive(S) must return the elements as 1,1,1,3,2,3,0. Note: You may use two different stacks, one for original elements and other for the elements after applying CheckEach2Consecutive(S) functions.

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 1TF

See similar textbooks

Similar questions

Create a stack program in c++ wherein there should be a following expression for -(A+B)+(C-D -(A+B)+(C-D) (A+B)+[C-D] -((A+B]+[C-D]} and determine if this expression are valid in stack or not and put an error at the end if the stack is not empty
Write a Java public static general function which doesn't belong to the Stack class, isGreaterThan that determines if one stack is greater than another stack. If the summation of every other item(starting at the top) from one stack is greater than the summation of every other item(starting at the top) from another, return true, otherwise, return false. After you call this method, both stacks should stay the same as they are called before. Receives: a Stack type argument S1 and another Stack type argument S2 Postcondition: If the summation of every other item (starting at the top) from S1 is greater than the summation of every other item (starting at the top) from S2, return true, otherwise, return false. Both S1 and S2 should stay the same as they are called before. public static boolean isGreaterThan(Stack S1, Stack S2)
write a function that takes a pointer to the top of a stack <double> and creates and returns a new stack double where the new stack contains all nodes from the original stack with data == 0 c++
For this project, you will read an infix expression, convert it to postfix, evaluate the postfix expression, and print out the answer. You will need to define and implement your own Stack class and a Calculator class. Your Stack class should support standard stack operations, which you can implement with either a linked list or an array. You should use a class template Stack in C++, but an integer Stack class would work as well since a character would be considered a subset of integers. Your Calculator class stores an infix operation and it provides the public operations below. Feel free to add private operations and data. The Calculator class should use a character stack to convert infix to postfix (storing operators) and then uses an integer stack to evaluate the expression (storing operands). C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++…
Write a code in c++ that will determine which value in stack is the largest and remove and return that value while leaving the remainder of the stack in its original order.
Write a function (in c++ )called copystack that copies the contents of one stack to another .The function must have two arguments of type stack one for source stack and other for destination stack. The order of the stack must be identical.
Write a program in C that implements a stack data structure with the following functionalities: Push an element onto the stack. Pop an element from the stack. Peek at the top element of the stack without removing it. Check if the stack is empty. Display the elements of the stack. Your program should use dynamic memory allocation to create the stack and should not use any pre-built stack libraries or functions. To test your program, write a main function that creates a stack, pushes some elements onto it, pops some elements from it, peeks at the top element, checks if the stack is empty, and displays the elements of the stack. Make sure to handle any potential errors that may occur, such as trying to pop from an empty stack or trying to push onto a full stack.
the Program in C++, Write a program that evaluates a valid postfix expression such as: 6 2 + 5 * 8 4 / -The program should read a postfix expression consisting of digits and operators into a string. Using modified versions of the stack functions implemented earlier in this chapter, the program should scan the expression and evaluate it. The algorithm is as follows: 1-While you have not reached the end of the string, read the expression from left to right. If the current character is a digit, Push its integer value onto the stack (the integer value of a digit character is its value in the computer’s character set minus the value of '0' in the computer’s character set). Otherwise, if the current character is an operator, Pop the two top elements of the stack into variables x and y. Calculate y operator x. Push the result of the calculation onto the stack. 2-When you reach the end of the string, pop the top value of the stack. This is the result of the postfix expression. [Note: In Step…
Code in C Using the Project Name – StackLink which includes Stack.h, Stack.c, main.c. Implement a Stack using a Linked-list A Stack is a last-in-first-out (LIFO data Structure)// data structure LIFOtypedef char stackItem;Stack newStack();void freeStack(Stack s);void push(Stack s,stackItem item); // insert at the top - pushvoid pop(Stack s); // deleting the top element - popstackItem stackTop(Stack s); // returns the top itemint isEmpty(Stack s);void display(Stack s);1. Implement a Stack using a linked-list.2. Use the stack in making a program that will check whether a string containsbalance symbols [], {}, (). The algorithm works like this – an open symbol -- ( , { , [-- is pushed on the stack. When a closed symbol -- ], }, ) – is encountered, checkthe top of the stack to see if the matching open symbol is there, if yes, pop thestack, otherwise, mismatch. At the end of the string, the stack should be empty.
Given a stack that stores one character with every node, Write a program in C++ that checks whether the characters form a palindrome. You may use a second stack, but no other data structures. You do not need to preserve the input. (Note that the stack should be implemented using Link-list)
Suppose that you have the following declaration:stackType<double> stack(50);double num;and the input is25 64 -3 6.25 36 -4.5 86 14 -12 9Write a C++ code that processes this input as follows: If the number is nonnegative, it pushes the square root of the number onto the stack; otherwise it pushes the square of the number onto the stack. After processing these numbers write a C++ code that outputs the elements of the stack.
Question#3.Write a Python program to reverse a stack using recursion. Problem Solution Hints: 1. Create a class Stack with instance variable items initialized to an empty list. 2. Define methods push, pop, is_empty and display inside the class Stack. 3. The method push appends data to items. 4. The method pop pops the first element in items. 5. The method is_empty returns True only if items is empty. 6. The method display prints the elements of the stack from top to bottom. 7. Define function insert_at_bottom which takes a stack and a data item as arguments. 8. The function insert_at_bottom adds the data item to the bottom of the stack using recursion. 9. Define function reverse_stack which takes a stack as argument. 10. The function reverse_stack reverses the stack using recursion. 11. Create an instance of Stack, push data to it and reverse the stack.