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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In c++ by stacks Thank you in advance
4. Sort elements in an array-based stack in ascending order, i.e. make the smallest element to be the top element of the stack. E.g. given the stack elements (from bottom to top): 90, 70, 80, 10, sort the elements to make the stack elements become (from bottom to top): 90, 80, 70, 10. The only data structure you can use is array-based stack. In addition to the given stack, you can use only one extra stack to store some temporary data. Given a stack st, use one extra stack, tmpst, to store temporary data. Here are some hints of the idea. Pop out the top element of st to a variable tmp. If the stack tmpst is empty, push tmp onto tmpst; if tmpst is not empty, pop out its top element and push that element onto st until the top element of tmpst is smaller than tmp, then push tmp onto tmpst .. a. Write a program to implement the stack based sorting. b. Take the input (90, 70, 80, 10) as an example. c. Print all the push and pop operations in proper format. d. At the end, print the sorted…
Using the PEP 8 machine. Create a function that takes 2 arguments and returns a result. When I say function I mean that the parameters and the return value are passed on the stack . You code must have a function and a main program that calls the function using the stack. Assignment will not be accepted if you are not passing parameters and return value in the stack. Please note a complete "pass by stack" example is below. The function adds two numbers. Feel free to use that as starter code. The function you do should be one of three operations: 1) multiply - return the product of the two factors 2) divide - return the quotient ( integer arithmetic ) 3) remainder / modulo - return the remainder of the division of the two factors.
Can i get some help with this code in C++ It is to: Request the entry of student data (Name, Final Grade)Sort the note in descending order using STACKS.Enter the students ordered in the STACK to a QUEUE(FIFO) in ascending order.Show printout of the ordered STACK and the QUEUE(FIFO) of students.
Write a C++ program with multiple files to include the following: Functional Requirements: Create a type of story game by implementing three dynamic stacks that hold words. The first stack will hold nouns, the second stack will hold verbs and the third stack will hold adjectives. Then we will use the words to fill in the blanks of a story we have already created. Your story (create your own story) must be at least 2 sentences long and it must have at least 6 blanks. You will pull either a noun, verb or an adjective from the appropriate stack as needed for your story. The story must utilize all three stacks, at least one word from each stack. You will be creating a linked list to implement this, using pointers. Programming Requirements: Create a looping menu-driven program to demonstrate your code so that the user has the choice of: 1. Push Noun (push a noun onto the Noun Stack) 2. Pop Noun (pop a noun off of the Noun Stack) 3. Push Verb (push a verb onto…
First write the algorithmic steps for your solution and then write the code.
Q2: Stack stores elements in an ordered list and allows insertions and deletions at one end.The elements in this stack are stored in an array. If the array is full, the bottom item is dropped from the stack. In practice, this would be equivalent to overwriting that entry in the array. And if top method is called then it should return the element that was entered recently Please do it in C++ and use stack class(header file), not premade function
5. fast please Convert the following infix expression into its prefix and postfix equivalents: a / b - (c + d * e) / f * g For any postfix, show the final transformed expression using the stack method for transformation as explained in class showing all the relevant steps. For the prefix, show any needed reversion and the final transformed expression using the stack method for transformation as explained in class showing all the relevant steps. Draw and sequence your diagrams clearly
using file handling
Complete the following ():a. A stack is used by the system when a function call is madeb. A stack can become full during program execution
Give correct answer. Don't copy other's work.
stacks and queues. program must be able to handle all test cases without causing an exception Note that this problem does not require recursion to solve (though you can use that if you wish).