Given two sorted stacks stack1 and stack2, write a function MergeStacks that merges the contents of stack1 and stack2 into a new stack Result such that the Result stack is also sorted. Example (1): stack1 contains the following items: 10 20 35 40 and stack2 contains the following items: 45 50 65 80 then Result will contain the following items: 10 20 35 40 45 50 65 80 Example (2): stack1 contains the following items: 10 20 35 40 and stack2 contains the following items: 30 38 45 80 then Result will contain the following items: 10 20 30 35 38 40 45 80

Given two sorted stacks stack1 and stack2, write a function MergeStacks that merges the contents of stack1 and stack2 into a new stack Result such that the Result stack is also sorted. Example (1): stack1 contains the following items: 10 20 35 40 and stack2 contains the following items: 45 50 65 80 then Result will contain the following items: 10 20 35 40 45 50 65 80 Example (2): stack1 contains the following items: 10 20 35 40 and stack2 contains the following items: 30 38 45 80 then Result will contain the following items: 10 20 30 35 38 40 45 80

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 3PE

See similar textbooks

Similar questions

Suppose a node of a linked list is defined as follows in your program: typedef struct{ char data; struct Node* link; } Node; Write the definitions of two functions (i) Node* pop(Node* top) – which removes the top element of the stack, and (ii) bool compare(Node* topA, Node* topB) - which returns true if the both stacks have identical data. The function returns false if the data in both stacks are not identical. In the function definitions, top, topA, and topB point the top elements of corresponding stacks. You must use the following function definitions in your answer. The peek function has already been defined. You need to write the definition of pop and compare functions. You are not allowed to modify the parameters and/or return types of the functions. Node* pop(Node* top){ //write the function definition } char peek(Node* top){ return top->data; } bool compare(Node* topA, Node* topB){ //write the function definition } Write the time complexity in Big-O notation…
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++
Design a function bool validateStackSequences(const std::vector<int>& v) that takes an int vector with distinct values, and returns if values in v could be a valid sequence of stack operations You may assume the input values are always{1, 2, 3, 4, 5}. #include <vector> #include <stack> #include <iostream> // TODO: implement this function bool validateStackSequences(const std::vector<int>& v) { if (v.size() % 2 != 0) return false; std::stack<int> s; int i = 0; int j = v.size() - 1; while (i <= j) { if (v[i] == v[j]) { i++; j--; } else if (!s.empty() && s.top() == v[j]) { s.pop(); j--; } else { s.push(v[i]); i++; } } return s.empty(); } int main(){ // use following code snippet for testing // expected output: // true // false // true // false // true std::cout << std::boolalpha << validateStackSequences({5, 4, 3, 2, 1}) << std::endl; std::cout <<…
For the following problems, you need to submit a python code that performs the required functions. Q1: (Stack & Queue) 1. Write a program that utilizes the LinkedStack class and LinkedQueue class to perform the following function. Input :empty stack and a Queue Required: reverse the order of the queue. // you must use the methods of the stack and queue class // Q2) Write a member functions to the class ( CircularQueue ) that performs the followings: 1. Sum-even(CQ) : Print the sum of all even numbers stored in CircularQueue. 2. Perform the followings: a. Create two circular linked lists ( CQ1, CQ2). b. Merge the two circular linked lists in one →CQ1. //Remember: you need to use the class ( CircularQueue ) methods.//
Use a stack to reverse the input integer values. Check the stack grows as more elements are pushed. Use with and without function pointer in each of the problem (Please give correct answer with explanation)
Given a stack, switch_pairs function takes a stack as a parameter and thatswitches successive pairs of numbers starting at the bottom of the stack.For example, if the stack initially stores these values:bottom [3, 8, 17, 9, 1, 10] topYour function should switch the first pair (3, 8),the second pair (17, 9), ...:bottom [8, 3, 9, 17, 10, 1] topif there are an odd number of values in the stack, the value at the top of thestack is not moved: For example:bottom [3, 8, 17, 9, 1] topIt would again switch pairs of values, but the value at thetop of the stack (1)would not be movedbottom [8, 3, 9, 17, 1] topNote: There are 2 solutions:first_switch_pairs: it uses a single stack as auxiliary storagesecond_switch_pairs: it uses a single queue as auxiliary storage""".
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.
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)
Consider the following segment of code:procedure Mvar x: integer;procedure A (c: integer)var a, b: integer;procedure Bvar b, c, d: integer;begin {B}….a := c – d;….end B;begin {A}….x := b + c;….B()….end A;begin {M}….A(3)….end M;Assuming the definition of M is at static nesting level 0. Draw the runtime stack that will be ineffect at the execution of “a := c – d;”. Show the static and dynamic links, and the currentpositions of the EP and SP pointers.What is the static distance to x’s environment of definition and the offset within the environmentwhen “a := c – d;” is executed?
Solve the code much needed. Given a stack, a function is_consecutive takes a stack as a parameter and thatreturns whether or not the stack contains a sequence of consecutive integersstarting from the bottom of the stack (returning true if it does, returningfalse if it does not). For example:bottom [3, 4, 5, 6, 7] topThen the call of is_consecutive(s) should return true.bottom [3, 4, 6, 7] topThen the call of is_consecutive(s) should return false.bottom [3, 2, 1] topThe function should return false due to reverse order. Note: There are 2 solutions:first_is_consecutive: it uses a single stack as auxiliary storagesecond_is_consecutive: it uses a single queue as auxiliary storage"""import collections def first_is_consecutive(stack): storage_stack = [] for i in range(len(stack)): first_value = stack.pop() if len(stack) == 0: # Case odd number of values in stack return True second_value = stack.pop() if first_value - second_value != 1: # Not…
struct Faculty { int id; char name[30]; char status[10]; //status permanent or visiting Faculty next; }; Assume we have three stacks S, V and P. S is a stack having mix data of visiting and permanent faculty members, V is empty and for visiting faculty memebrs and P is also empty for permanent faculty members. Using primitive functions of stack write a C++ code which reads entire data from S and write on respective stack V or P.
Implement a program in C++ that has the following three parts and each does the following: Implements in C++ a Stack ADT (save the file as StackADT.h) Implements all the necessary methods (behavior) of a Stack (save the file as StackADT.cpp) Implements in C++ a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). This main function should be able to do the following: It should be able to read a given text file as input, It should be able to get each input value from the input file (one word at a time) and store it (push) on the Stack object until it stores all the words from the input file. It should be able to retrieve an item from the stack and display it on the screen, and then delete (pop) that item from the stack, and repeat until it retrieves all the items from the stack object. NOTE: Please make sure you debug, run, test and see the program working correctly before submitting. Submit the files…