a) Draw diagrams representing the following code and track the values of p1, p2, &var1, &var2, *p1, *p2, var1, and var2 at every checkpoint throughout the program. Clarify in your diagrams whether the storage is on the stack or heap. Assume initial addresses. int main() { int *p1; int *p2 = new int; int var1 =3; int var2= 6; *p1 = var1; p2 = new int; *p2 = 10; //CHECKPOINT1 var2 = 11; *p2 = var2; //CHECKPOINT2 p1 = p2; var2 = 30; //CHECKPOINT3 *p1 = 25; p2= &var1; *p2 = 16; //CHECKPOINT4 delete p1; p1 = nullptr; p2 = nullptr; return 0; }

a) Draw diagrams representing the following code and track the values of p1, p2, &var1, &var2, p1, p2, var1, and var2 at every checkpoint throughout the program. Clarify in your diagrams whether the storage is on the stack or heap. Assume initial addresses. int main() { int p1; int p2 = new int; int var1 =3; int var2= 6; p1 = var1; p2 = new int; p2 = 10; //CHECKPOINT1 var2 = 11; p2 = var2; //CHECKPOINT2 p1 = p2; var2 = 30; //CHECKPOINT3 p1 = 25; p2= &var1; *p2 = 16; //CHECKPOINT4 delete p1; p1 = nullptr; p2 = nullptr; return 0; }

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

void fun1() { float a; void fun2() { int b, c; The calling sequence for this program for execution to reach fun2 is main calls fun3 void fun3() { float d; fun3 calls funl funl calls funl funl calls fun2 void main() { char e, f, g; Assume that the above program is implemented using the shallow-access method using a stack for each variable name. Show the stacks for the time of the execution of fun2, assuming execution found its way to that point through the sequence of calls shown above
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
2 Coding DESCRIPTION Problem Statement There is a producer who manufactures chocolate and a consumer who consumes that chocolate. Both producer and consumer maintains a stack. The stack on producer side keeps the track of variety of chocolate produced by the producer. The stack on consumer side keeps the track of particular variety of chocolate consumed by the consumer. Write a program which print '1' if the producer produces more chocolate of a particular variety than consumer consumes it and print '0' if any variety of chocolate produced is less than the consumption by the consumer for that particular variety. Input Format: • First-line contains producer's and consumer's stack length. . Second-line producer stack values. . Third line consumer stack values. Output Format: • Print 1 if any variety produced by producer is more than being consumed by the consumer. • Print 0 if any variety produced by producer is less than being consumed by the consumer. Evaluation Parameters Sample Input…
Data Structure Using C++ Queue Project You can Use STL with the queue just please look at picture 1 to write a code please need a full code without errors and like the question need please We can use a queue to simulate the flow of customers through a check-out line in a store. In this simulation we will have the following details: one check-out line the expected service time for each customer is one minute (However, they may have to wait in line before being serviced) between zero and two customers join the line every minute We can simulate the flow of customers through the line during a time period n minutes long using the following algorithm: Initialize the queue to empty. for ( minute = 0 ; minute < n ; ++minute ) { if the queue is not empty, then remove the customer at the front of the queue. Compute a random number k between 0 and 3. If k is 1, then add one customer to the line. If k is 2, then add two customers to the line. Otherwise (if k is 0…
Knowledge of Stack Data Structure is a must. Create a stack data structure that can hold at most 10 items. Operations: Push, adds a new item on top of the stack. Pop, removes the item on top of the stack Top, returns the top item on top of the stack To add item on top of the stack, enter PUSH followed by the value ex. PUSH 20 To remove the item on top of the stack, enter POP ex. POP To print the value on top of the stack, enter TOP and it will print the top value and exit the loop. ex. TOP Rest assured that the input will not generate IndexOutOfBoundsException Input 1. Operation e.g. PUSH 10, POP, TOP Description PUSH operation always comes first. Number of POP operations is equal to number of PUSH operations TOP will be the last. Sample PUSH·10 PUSH·20 POP TOP Output Enter·PUSH·N·to·add·value,·N·is·int·value Enter·POP·to·remove·value Enter·TOP·to·print·final·result: PUSH·10 PUSH·20 POP TOP 10
Expression Conversion Design a program which can tansfer an infix expression into a postfix expression and compute its result. Suppose the infix expression only includes’ *’, ‘/’, ‘+’, ‘-‘, ‘(‘, ‘)’ and the numbers are all integers. [Basic Requirements] 1) You are required to use stack. 2) The infix expression is inputted from keyboard as a string. If the input is legal, please convert the infix expression into postfix expression, calculate the result, and finally output the postfix expression and its value. 3) If the infix expression entered is illegal, the program can prompt the user to input incorrectly and prompt the user to re-enter. Please do the program according to the requirements above and it should be in C language...also after the code i want a report that the algorithm explanations of the code plesse don't just copy other student program and give me back please please please
Expression Conversion Design a program which can tansfer an infix expression into a postfix expression and compute its result. Suppose the infix expression only includes’ *’, ‘/’, ‘+’, ‘-‘, ‘(‘, ‘)’ and the numbers are all integers. [Basic Requirements] 1) You are required to use stack. 2) The infix expression is inputted from keyboard as a string. If the input is legal, please convert the infix expression into postfix expression, calculate the result, and finally output the postfix expression and its value. 3) If the infix expression entered is illegal, the program can prompt the user to input incorrectly and prompt the user to re-enter.   I want the program to be written in C language and want explanation for the algorithm of this program
Data Structure Using C++ (Queue) C++ code (NOT JAVA C++ JUST) C++ PROGRAMMING LANGUAGE PLEASE :: We can use a queue to simulate the flow of customers through a check-out line in a store. In this simulation we will have the following details: one check-out line the expected service time for each customer is one minute (However, they may have to wait in line before being serviced) between zero and two customers join the line every minute We can simulate the flow of customers through the line during a time period n minutes long using the following algorithm: Initialize the queue to empty. for ( minute = 0 ; minute < n ; ++minute ) {       if the queue is not empty, then remove the customer at the front of the queue.       Compute a random number k between 0 and 3.       If k is 1, then add one customer to the line.       If k is 2, then add two customers to the line.       Otherwise (if k is 0 or 3), do not add any customers to the line. } In addition, the algorithm will keep track…
C++ ProgrammingActivity: Linked List Stack and BracketsExplain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS int main(int argc, char** argv) {     SLLStack* stack = new SLLStack();     int test;     int length;     string str;     char top;     bool flag = true;     cin >> test;     switch (test) {         case 0:             getline(cin, str);              length = str.length();              for(int i = 0; i < length; i++){                 if(str[i] == '{' || str[i] == '(' || str[i] == '['){                     stack->push(str[i]);                 } else if (str[i] == '}' || str[i] == ')' || str[i] == ']'){                     if(!stack->isEmpty()){                         top = stack->top();                         if(top == '{' && str[i] == '}' || top == '(' && str[i] == ')' ||…
C++ Programming, TOPIC: Stack queue and dequeImprove the error code below. See attached photo for the instructions and some of the errors. main.cpp #include <iostream> #include <cstring> #include "sllstack.h" using namespace std; int main(int argc, char** argv) { SLLStack* stack = new SLLStack(); int test; string str; cin >> test; switch (test) { case 0: bool ispar(string x); string x=str; stack<char> s; for(int i=0;i<x.length();++i) { if(x[i]=='(' or x[i]=='{' or x[i]=='[') s.push(x[i]); else if (x[i]==')' and !s.empty()) { if(s.top()!='(') return false; s.pop(); } else if(x[i]=='}' and s.empty()!=1) { if(s.top()!='{') return false; s.pop(); } else…
10) When the subroutine is called_ A) PC is pulled from the stack B) SP is incremented by 2 incremented by 1 D) A&C E) None of the above C) SP is 11) When the RTS is executed_ A) PC is pushed to the stack decremented by 2 D) A&C B) SP is incremented by 2 E) None of the above C) SP is 12) When you execute this JSR ADDFCN_ A) PC is pushed to the stack incremented by 1 D) A&C B) SP is incremented by 2 E) None of the above C) SP is 13) If SP contains $01FC and the address of BSR $30 is $8234, after BSR $30 is executed, the content of $01FB is_ A) B2 B) 34 C) B4 D) 36 E) None of the above 14) If SP contains $01FC and the address of BSR $30 is $B234, after BSR $30 is executed, the content of $01FA is A) B2 B) 34 C) B4 D) 36 E) None of the above 15) If SP contains $01FC and the address of BSR $30 is $8234, after BSR $30 is executed, the address of the subroutine is A) B234 above B) B264 C) B236 D) B266 E) None of the
Programming Assignment # 3 Objective: To use stacks to solve a programming problem Write a Java program to evaluate infix expression (not necessarily fully parenthesized) using stacks. The priority of operators shall be taken into account. See https://en.wikipedia.org/wiki/Infix_notation for an example of an infix notation. Tip: You would probably need two stacks (a stack for numbers and stack for characters). Input: The program should ask the user to input the infix expression Output: The result of the calculation Assumptions: • You can use the Stack implementation of the Java API, or use one of the ones we have covered in class. • Assume that the input expressions contain only positive integer values, and that the output is always an integer. • The input that the user types can contain any string with the following characters: ( , ) , numbers operators, where numbers is any positive integer and operators are any of +, -, * , / • Your program assumes that the expression is…