A)Write C++ program that create class called (equation) have two variableprivate (stack S[7] and top). The object is S and Do the following operation :fill locations (0, 1 and 2) by values (20,40,60)Y=x^5/2+X^7/3+...+x^N/Nfill locations between 3 to 6 by using the following equation:where values of X is (22,33,44,55)print the elements of stackCompute the factorial value for last value in the stack and delete the factorialvalue if greater than 700

#include <iostream> #include <cmath> using namespace std; class Equation { private: int…

A)Write C++ program that create class called (equation) have two variable private (stack S[7] and top). The object is S and Do the following operation : fill locations (0, 1 and 2) by values (20,40,60) fill locations between 3 to 6 by using the following equation: Y=x^5/2+X^7/3+...+x^N/N where values of X is (22,33,44,55) print the elements of stack Compute the factorial value for last value in the stack and delete the factorial value if greater than 700

A)Write C++ program that create class called (equation) have two variable private (stack S[7] and top). The object is S and Do the following operation : fill locations (0, 1 and 2) by values (20,40,60) fill locations between 3 to 6 by using the following equation: Y=x^5/2+X^7/3+...+x^N/N where values of X is (22,33,44,55) print the elements of stack Compute the factorial value for last value in the stack and delete the factorial value if greater than 700

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 11SA

See similar textbooks

Similar questions

3.) Write a C++ program that will prompt the user for the size of a list of integers. Your program will 1. dynamically allocate an array of that size and allow the user to enter the values. 2. Your program will then go through the list and copy all even numbers to another dynamically allocated array. The functionality of 1 and 2 need to be accomplished by separate functions. 4.) Redo question number 3 with these changes. Instead of dynamically allocating an array to store the data, your program will will an STL array. Even numbers will also be copied to an STL array. The input of the data and copying of even numbers will require the program to start at the beginning of the array and walk thorugh the values to the end. This must be done using iterators.
Consider the following C++ code: int* length = new int; int* height = new int; *height = 12; *length = *height; Length = Height; delete height; Provide detailed explanations of the effect of each statement. After this code has completed, there is an inaccessible object on the heap and a dangling pointer. What is the inaccessible object and how did it become inaccessible? What is the dangling pointer in this example? Briefly explain the danger associated with dangling pointers?
Please write a full C++ code and provide code and output Two stacks of the same type are the same if they have the same number of elements and their elements at the corresponding positions are the same. Overload the relational operator == for the class linkedStackTypethat returns true if two stacks of the same type are the same; it returns false otherwise. Also, write the definition of the function template to overload this operator.
Can someone solve the following problem in C++ Write a function named checkBalance that accepts a string of source code and uses a stack to check whether the braces/parentheses are balanced. Every ( or { must be closed by a } or ) in the opposite order. Return the index at which an imbalance occurs, or -1 if the string is balanced. If any ( or { are never closed, return the string's length. Here are some example calls: // index 0123456789012345678901234567890checkBalance("if (a(4) > 9) { foo(a(2)); }") // returns -1 because balancedcheckBalance("for (i=0;i<a(3};i++) { foo{); )") // returns 14 because } out of ordercheckBalance("while (true) foo(); }{ ()") // returns 20 because } doesn't match any {checkBalance("if (x) {") // returns 8 because { is never closed Constraints: Use a single stack as auxiliary storage.
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, wherelength(TAM) is the number of letters of TAM. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used…
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
Problem Statement: Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only…
Can anyone convert this c++ code to python? //THIS PROGRAM IS CREATED TO DEMONSTRATE THE OPERATIONS PERFORMED ON STACK & ITS IMPLEMENTATION USING ARRAYS #include <iostream>#include <stdio.h>#include <conio.h>#include <stdlib.h>#include <process.h> //Defining the maximum size of the stack#define MAXSIZE 7 using namespace std; //A class initialized with public and private variables and functionsclass STACK_ARRAY { int stack[MAXSIZE]; int Top; public: //constructor is called and Top pointer is initialized to -1 when an object is created for the class STACK_ARRAY() { Top = -1; } void push(); void pop(); void traverse(); }; //This function will add/insert an element to Top of the stackvoid STACK_ARRAY::push(){ int item; //if the top pointer already reached the maximum allowed size then we can say that the stack is full or overflow if (Top == MAXSIZE-1) { cout << "\nThe Stack Is Full"; }…
Can anyone convert this c++ code to python? //THIS PROGRAM IS CREATED TO DEMONSTRATE THE OPERATIONS PERFORMED ON STACK & ITS IMPLEMENTATION USING ARRAYS #include <iostream>#include <stdio.h>#include <conio.h>#include <stdlib.h>#include <process.h> //Defining the maximum size of the stack#define MAXSIZE 7 using namespace std; //A class initialized with public and private variables and functionsclass STACK_ARRAY { int stack[MAXSIZE]; int Top; public: //constructor is called and Top pointer is initialized to -1 when an object is created for the class STACK_ARRAY() { Top = -1; } void push(); void pop(); void traverse(); }; //This function will add/insert an element to Top of the stackvoid STACK_ARRAY::push(){ int item; //if the top pointer already reached the maximum allowed size then we can say that the stack is full or overflow if (Top == MAXSIZE-1) { cout << "\nThe Stack Is Full"; }…
Problem 8. What is the correct syntax of declaring array of pointers of integers of size 10 in C++? a) int arr = new int[10]; b) int **arr = new int*[10]; c) int *arr = new int[10]; d) int *arr = new int*[10];
In C, write a function that gets 3 pointers int* a, int* b, int* c, and rotates the values in their addresses to the left. That is, a gets the value of b, b gets the value of c, and c gets the value of a. void rotate3 (int* a, int* b, int* c); For example, if we have int x=1, y=2, z=3, then after calling rotate3 (&x, &y, &z) we should have x==2, y==3, and z==1. if we have int x=7, y=1, z=6, then after calling rotate3 (&x, &y, &z) we should have x==1, y==6, and z==7.
C. Consider the following function headers and type contracts:def aragorn(x: int, y: str, z: float) -> str:def gandalf(x: list) -> list:def elrond(x: list, y: bool) -> bool:If the following code runs without errors, what is a header and type contractfor treebeard?a = aragorn(11, 'good', 2.0)b = treebeard(5, gandalf([1, 2, 3]), a)print(elrond(gandalf([4, 5]), b))Write the header and type contract for treebeard.