Homework question Given the code: 10 void f1(int n) { 11 cout << n; 12 } 13 int f2(int x) { 14 f1(x); 15 } 16 17 int main() { 18 f1(5); 19 f2(6); 20 return 0; 21 } 1. Write the line number in the main function where the runtime stack is most complex. 2. Create a simple diagram of the runtime stack for this program when it is the most complex. Clearly state what is top and bottom of the stack.

Homework question Given the code: 10 void f1(int n) { 11 cout << n; 12 } 13 int f2(int x) { 14 f1(x); 15 } 16 17 int main() { 18 f1(5); 19 f2(6); 20 return 0; 21 } 1. Write the line number in the main function where the runtime stack is most complex. 2. Create a simple diagram of the runtime stack for this program when it is the most complex. Clearly state what is top and bottom of the stack.

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

Question 1 (20 marks)Refer to the operations below:Add (10 + 5)Add (4+8)Add (7*2)Add (90 – 3)Print listPrint peekRemove an item from the listPrint list1.1 Implement the operations above into a Queue structure called q1. (10)1.2 Implement the operations above into a Stack structure called s1. (10)Question 2 (20 marks)Create a complete java program called Week_Report. The program must include two array structures, astring array called DaysOfWeek and a double array called Temp_Values. Store in the DaysOfWeek arraythe following values (Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday). Store in theTemp_Values array the following (23.5, 34.0, 20.9, 45.7, 29.3, 34.5, 32.5). Using a for loop structure outputthe values for the two arrays.Day of the Week Temperature ValuesMonday 23.5Tuesday 34.0Wednesday 20.9Thursday 45.7Friday 29.3Saturday 34.5Sunday 32.5
Q1: Write a java application for the stack operations with Linked List. Q2: Write java program to take the order from the customer and display the ordered items and total payment. If customer is entering the wrong name or not following the order to enter the menu it has to display error messages. (Find in the sample code) Sample Output:
Task3: Some of the scientific calculators are capable of identifying errors based on the imbalance of parentheses used in mathematical equations. (4+6)*[7/(9-3)] ==> ()[()] ==> BALANCED (4+6)*7/(9-3)] ==> ()()] ==> IM-BALANCED From the above-mentioned example, we can clearly see that the checking of balance in an equation is simple, which is comparing opening parentheses with the closing ones. As a developer, you are required to write a code that checks an equation for being balanced or not.(HINT: use stack) in c++
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.//
Compulsory Task Follow these steps: ● For this task, you are required to refactor the badly written program RPN.java. This program is a Reverse-Polish Notation calculator which uses a stack. A Reverse-Polish Notation calculator is a calculator that will calculate equations where the operator follows the operands. Therefore, instead of inputting an equation as “1 + 2”, a Reverse-Polish Notation calculator would take the following input “ 1 2 +”. A stack is a data structure in which items are added to the top of the stack and removed from the top of the stack. It is therefore known as a last-in, first-out (LIFO) data structure. Stack terminology: ○ Push — is an operation that adds an item to the top of a stack. ○ Pop — is an operation that removes an item from the top of a stack. The pseudocode for this program is: ○ Get an equation (e.g. 2 3 +) from the user as input. ○ Loop through the string value input by the user. ■ When you encounter a number (remember that numbers can include…
A Stack is a data structure for storing a list of elements in a LIFO (last in, first out) fashion. Design a class called Stack with three methods. void Push(object obj)object Pop()void Clear() We should be able to use this stack class as follows:var stack = new Stack();stack.Push(1);stack.Push(2);stack.Push(3);Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop());Console.WriteLine(stack.Pop()); The output should be 3, 2, 1
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
Please provide code in C language. I need code for staticsemantic.c and staticsemantic.h Please provide code according to local option: You may process all variables using local scope rules, or process variables before program as global and all other variables as local. Software support Implement a stack adapter according to the following Stack item type is String or whatever was your identifier token instance - the stack will process identifiers. You may also store line number or the entire token for more detailed error messaging You can assume no more than 100 items in a program and generate stack overflow if more Interface void push(String); just push the argument on the stack void pop(void); just remove int find(String); the exact interface may change, see below find the first occurrence of the argument on the stack, starting from the top and going down to the bottom of the stack return the distance from the TOS (top of stack) where the item was found (0 if at TOS) or -1 if 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.
Hello i need help with this code. this is the problem: In Listing 11.10, MyStack is implemented using composition. Define a new stack class that extends ArrayList.Draw the UML diagram for the classes then implement MyStack. Write a test pro-gram that prompts the user to enter five strings and displays them in reverse order. and this was the solution i got import java.util.Scanner; public class Exercise11_10 { public static void main(String[] args) { Scanner input = new Scanner(System.in); MyStack stack = new MyStack(); for (int i = 0; i < 5; i++) stack.push(input.nextLine()); System.out.println(stack.getSize() + " strings are: "); while (!stack.isEmpty()) System.out.println(stack.pop()); }} // MyStack.java: Implementing a stack using inheritanceclass MyStack extends java.util.ArrayList<Object> { public boolean isEmpty() { return super.isEmpty(); } public int getSize() { return size(); } public Object peek() { return…
Please solve specialy i need important and i will rate you. In JAVA (not javascript) Build a class and implement the Stack Data structure of the problem below. (dont copy the other chegg answers they are incorrect) The ADT in this case is a Stack. Write the code for this stack. You are hired to help design software to help with a key train operation: processing food orders on a trip. Once the manager says that it is ok, train staff to walk from the back of the plane to the front taking everyone’s order. When they reach the front, they begin preparing those orders. Food orders are prepared in groups of 10, that being the number of cups that can fit onto a carrying tray. The first group whose food orders are prepared are those in the front of the plane (first class). The second group is the next 10 people further back in the plane and so on. You are in charge of developing a new application that will let train staff take food orders and then display…
Read the following program project1.cpp carefully. Complete the missing code as indicated by the comments. Then compile, debug and test your program using the command lines below before your submission: c++ -o project1 project1.cpp <enter> ./project1 n m k <enter> Where n is the size of the stack, m is the modular of the real part and imagination part of a random complex number, and k is the number of elements displayed per line. In the main function, you need to 1. Get the values n, m, and k from the command line. 2. Declare a complex number stack of size n, generate n random complex numbers and push them into the stack. Meantime display all these numbers, k numbers per line. 3. Display all elements of the stack, k elements per line. 4. Create two random complex numbers c1 and c2, display c1, c2 and the results of the addition c1+c2, the subtraction c1-c2, the multiplication c1*c2, and the division c1/c2. // project1.cpp #include <iostream> #include…