1 10 11 12 13 14 Consider the following class instances in a C++ program: static myClass A; int main() { myClass B; myClass* C = new myClass(); foo (); delete C; return 0; void foo () { myClass D = new myClass (); myClass E; 1. What is the storage allocation (static/stack/heap) for the objects of type myClass associated with the objects A, B, C, D and E? 2. Consider one execution of the program above. The execution trace, a sequence of program statements executed at run time, of this program is 3 4 5 6 12 13 78 For each object associated with A, B, C, D and E, write down its lifetime using a subset of the above execution trace (e.g., "4 5 6 12 13"). Note, the answer subset might be non-strict, i.e., the whole trace.

1 10 11 12 13 14 Consider the following class instances in a C++ program: static myClass A; int main() { myClass B; myClass* C = new myClass(); foo (); delete C; return 0; void foo () { myClass D = new myClass (); myClass E; 1. What is the storage allocation (static/stack/heap) for the objects of type myClass associated with the objects A, B, C, D and E? 2. Consider one execution of the program above. The execution trace, a sequence of program statements executed at run time, of this program is 3 4 5 6 12 13 78 For each object associated with A, B, C, D and E, write down its lifetime using a subset of the above execution trace (e.g., "4 5 6 12 13"). Note, the answer subset might be non-strict, i.e., the whole trace.

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

for c++ thank you Error Testing The DynIntStack and Dyn IntQueue classes shown in this chapter are abstract data types using a dynamic stack and dynamic queue, respectively. The classes do not cur- rently test for memory allocation errors. Modify the classes so they determine whether new nodes cannot be created by handling the bad_alloc exception. here is the extention.h file please use it #ifndef DYNINTQUEUE_H #define DYNINTQUEUE_H class DynIntQueue { private: // Structure for the queue nodes struct QueueNode { int value; // Value in a node QueueNode *next; // Pointer to the next node }; QueueNode *front; // The front of the queue QueueNode *rear; // The rear of the queue int numItems; // Number of items in the queue public: // Constructor DynIntQueue(); // Destructor ~DynIntQueue(); // Queue operations void enqueue(int); void dequeue(int &); bool isEmpty() const; bool isFull() const; void…
Write a C++ program to implement the Stack operations using array.The class Stack with the following attributes. Data type Attributes int size int* elements int* popElements int top Create default constructor and a parameterized constructor with size as an argument Stack(int size) In the constructor allocate the memory for elements[] array by the given size and for popElements[] by 100 then initialize the top as -1.In the class Stack define the following methods. Method Description isEmpty() This method returns true if the stack is empty. Otherwise returns false. push() The method pushes the given data to the elements stack. popToPush() This method pop the data from the elements stack and pushes it to the popElements stack. If the elements stack becomes empty print "Stack is empty" and display the data of the popElements stack. display() This method displays the data of the popElements stack. In the main method get the data for the stack from the user.…
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.//
IntroductionWrite a program that simulates managing jobs sent to a printer. The jobs are stored in a linked-list of pointers. Print jobs arrive at time specified by month/day/year plus hour/minute. The jobs are printed on a first come first serve basis. Here is the rest of the specification.Your solutionWrite a C++ program that has the following and does the following:• Write a struct that will represent a node in the linked list (This struct should be declared outside the LinkedLisst class). The data members of the struct should be:a) sequence number: type integerb) document_name: type stringc) month: type integerd) day: type integere) year: type integerf) hour: type integerg) minute: type integerh) owner: type stringi) service_required: type stringj) next: pointer to a node • Write a class whose data members are a head pointer to a node and a pointer to the last node. DO NOT USE C++11 STL containers such as list, dequeuer, queue, stack. The head will represent the start of a linked…
Modify the C++ class for the abstract stack type shown belowto use a linked list representation and test it with the same code thatappears in this chapter. #include <iostream.h>class Stack {private: //** These members are visible only to other//** members and friends (see Section 11.6.4)int *stackPtr;int maxLen;int topSub;public: //** These members are visible to clientsStack() { //** A constructorstackPtr = new int [100];maxLen = 99;topSub = -1;}~Stack() {delete [] stackPtr;}; //** A destructorvoid push(int number) {if (topSub == maxLen)cerr << "Error in push--stack is full\n";else stackPtr[++topSub] = number;}void pop() {if (empty())cerr << "Error in pop--stack is empty\n";else topSub--;}int top() {if (empty())cerr << "Error in top--stack is empty\n";elsereturn (stackPtr[topSub]);}int empty() {return (topSub == -1);} }
Write a C++ program to perform the Queue operation. Note:Use the following class template for Queue creation. template <class T>class Queue{ private: int front,rear; T *queue; int maxsize;}; Define the following function in the class Queue class Method name Description int isFull() The method is used to check whether the queue is full or not. void insert(T) The method is used to display the rear element in the queue (if the queue is stored with the element(s)). void deletion() The method is used to delete the front element from the queue. void atFront() The method is used to display the front element in the queue (if the queue is stored with the element(s)). void atRear() The method is used to add data to the rear end of the queue. void display() The method is used to display all the data in the queue. int isEmpty() The method is used to check whether the queue is empty or not. Input and Output Format:The first line of input…
Write a C++ program that creates an integer class Vector which represents an array of N integers allocated on the heap . The class should contain the following member data and member/friend functions: Data: Integer pointer that points where the data is stored on the heap Size of the vector (i.e. #of valid data points) Capacity of the vector (total #of data points available) Member functions Default constructor – defines size(0), capacity = size + 5 & allocates memory on heap Parametrized constructor – defines size(N), capacity = N + 5, allocates memory on heap and initializes all data to a default value X or 0 Copy constructor Destructor which removes data from heap Overloaded assignment operator=( ) Overloaded multiply operator*( ) which multiplies pairwise all the elements of two vectors; V1*V2 Overloaded scalar multiply operator*(int scalar) that multiplies all elements of a vector by scalar; V1*scalar friend function operator(int scalar, Vector…
Consider the following C++ code: static long z = 5 ; int d = 10 ; int *ptr1 = new int[2] ; void myfun ( int param1 ){ static int x = 100 ; float y = 50; int *ptr2 = new int ; // . . .; delete ptr2 ; delete ptr1 ; } void fun2() { static int num =5; int var = 10; } Identify the storage bindings types, storage locations and lifetime of each variable. Select one for storage binding types: static, stack dynamic, explicit heap dynamic, implicit dynamic Select one for storage locations: static segment, stack, heap. Select one for lifetimes: Entire program, Execution of funct1, From Line ... to Line ...
In PriorityQueue.java, write code for the following new functions:1. public boolean add( PriorityQueueNode x )This function adds a new node x to the priority queue. The node is added tothe heap by comparison of the rating attribute. It involves the “percolateup” process and returns true when finished. 2. public PriorityQueueNode remove( )This function removes the minimum element of the priority queue and returnsit. It involves a call to percolateDown( int hole ). 3. private void percolateDown( int hole )This function takes the position of the next available hole in the priority queueand uses it to bubble the elements through the heap until the heap property isrestored. 4. public void display( )This function prints out a formatted tree representation of the priority queueshowing only the rating of each node. The output should resemble that of atree. Tip: you may use the StringBuilder class and the Stringformat( ) method. Empty nodes in the tree can be replaced with “--”.Example output…
1. In a linked stack the bottom of the stack is in the beginning of the list and the top of the stack is at the end of the list. 2. In the worst case a sequential search of an array with N elements is O(N). 3. In the best case, a sequential search of an array with 1,000 elements requires this many comparisons: ________________. 4. Java programmers can define their own exception classes. A. True B. False 5. If a recursive method does not have a base case: A. a syntax error is identified.B. an exception will be thrown. C. it will operate more efficiently.D. it will run forever.
I need answer question pls Project Operations Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: 1) Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) 2) Delete any person details by a given phone number. 3) Update telephone number by providing person first name. 4) Display all details of persons from a phone directory. 5) Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) 6) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory) Project Outputs The output has to display a menu of choices. Then the…
java: Implement the class Node public class Node { private char data; private Node nextNode; //implements default constructor //implements parameterize constructor take integer as input in parameter a assign that integer to data and assign null to nextNode //implement setters and getters } Implement the class Stack having one member having type Node public class Stack { private Node top; public void push (); public Node pop (); public Boolean isEmpty(); return true if stack is empty // implements all its function and write time complexity of its function