PRG-2.Rewrite program 5 (reversing a stack) using an array. Program 5 Reversing a string using a stack (continued)45 #include "stack.cpp"678910111213141516171819202122232425**************int main (){262728293031 }// Instantiation of a stack object and two string objectsStack stack;string origin;string reversed;// Input a stringcout << "Enter a string to be reversed:";getline (cin, origin);// Pushing the copy of characters in the origin string into the stackfor (int i = 0; i < origin.size(); i++){stack.push (origin [i]);}// Popping the stack and adding characters to the reversed stringwhile (!stack.empty()){reversed.push_back (stack.top());stack.pop();}// Printing both string for comparisoncout << "Original string: " << origin << endl;cout << "Reversed string: " << reversed;return 0;

Array: array is a set of similar data types which are stored in consecutive memory locations. In a…

Answered: PRG-2. Rewrite program 5 (reversing a…

Engineering

Computer Science

PRG-2. Rewrite program 5 (reversing a stack) using an array.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

4. Sort elements in an array-based stack in ascending order, i.e. make the smallest element to be the top element of the stack. E.g. given the stack elements (from bottom to top): 90, 70, 80, 10, sort the elements to make the stack elements become (from bottom to top): 90, 80, 70, 10. The only data structure you can use is array-based stack. In addition to the given stack, you can use only one extra stack to store some temporary data. Given a stack st, use one extra stack, tmpst, to store temporary data. Here are some hints of the idea. Pop out the top element of st to a variable tmp. If the stack tmpst is empty, push tmp onto tmpst; if tmpst is not empty, pop out its top element and push that element onto st until the top element of tmpst is smaller than tmp, then push tmp onto tmpst .. a. Write a program to implement the stack based sorting. b. Take the input (90, 70, 80, 10) as an example. c. Print all the push and pop operations in proper format. d. At the end, print the sorted…
Q2: Stack stores elements in an ordered list and allows insertions and deletions at one end.The elements in this stack are stored in an array. If the array is full, the bottom item is dropped from the stack. In practice, this would be equivalent to overwriting that entry in the array. And if top method is called then it should return the element that was entered recently Please do it in C++ and use stack class(header file), not premade function
Select the statements that apply to the use of the frame pointer. EBP is often called the base pointer or frame pointer because it holds the base address of the stack frame. EBP does not changes value during the procedure. EBP need not be restored to its original value when a procedure returns. A procedure can explicitly access stack parameters using constant offsets from EBP.
code for this in C: Create an array of N items. Implement these using array initializers in the variable declaration. Print each item in the array list. At the end, print the sum of all nos. in the array and their average.
Write a C++ program that declare arrays a and b and use initializer list to initialize the arrays with the Test Grades as shown in the table below. Create an array c that stores the results of addition of array a to array b Array Test Gradesa 45, 60, 90, 70, 82b 92, 56, 72, 64, 50
Create a computer programme to arrange objects in a stack so that the smallest ones are on top. Although you are allowed to utilise an extra temporary stack, you are not allowed to transfer the components into another data structure (such an array). The following operations are supported by the stack: push, pop, peek, and is Empty.
Develop a Java function that returns the index of a value in a sorted array. It should return -1 if the value does not exist in the array.
B) Write a recursive function to find summation of the first n positive numbers (for example, if n=5 then summation of 1+2+3+4+5=15). Then, trace its execution by showing stack contents.
PART 1: ONE-DIMENSIONAL ARRAY Instruction: There are two lists of numbers. Create a resultant list whose elements are the product of the elements of the two lists. Example: List A 21 List B List C 630 500 30 50 10 Write a Java program using a one-dimensional array that accepts as input an integer value asking for the number of elements for each list. This will be used to generate random numbers (5 to 69) for the one-dimensional arrays (List A and List B). The program will compute for the product and store it in another array (List C). Display the result similar to the Example above. Sample Input/Output: Depicted below are sample outputs when the program is executed (the items in bold characters are input from the user, while the items in bold italic are generated, calculated and printed by the program): Input the number of elements: 3 List A List B List C 630 500 250 21 30 50 10 25 10 Input the number of elements: 5 List A List B List C 31 13 403 21 30 630 500 50 10 60 41 2460 25 10…
Write C++ program, you will work on inserting, searching and how many comparisons are needed for that searching on a 5X5 board. Complete the countingNumOfComparison() function that counts the number of comparisons that are done in binary search. We don't use a board array in this problem. The function countingNumOfComparison() gets candidateWord and string vector dictionary as parameters and doing binary search. You have to fill up the code in which how many comparisons are needed for searching candidateWord in dictionary. Sample: Enter the word :world The item is found and the number of comparisons : 3
Solve the following codes below and discuss how array, stack, and queues are used in each problem. Must have comments. 1. Write a python program that ask the user the size of an array. The program will askintegers from the user to fill-in the elements of an array of size N as specifiedpreviously. The input numbers must be printed in a right-triangle manner. 2. Given N-element array, write a python program to get the minimum element from thesaid array. 3. Write a python program to implement a stack using two queues.
Please help me find the C CODE for this problem. Thank you! 4. Arraying 102 by CodeChum Admin We've already made arraying/listing the easy way, but how about arraying/listing and printing the list in reverse order? Make a program that will input an integer and then using loops, add items on an array/list one by one for the same number of times as that of the first inputted integer. Then, print out the array/list in reverse order, that is, starting from the last item on the array/list down to the first one, each in separated lines. Input The first line contains the size of the array/list. The next lines contains the items of the array/list (integers). 5 1 64 32 2 11 Output Multiple lines containing integers. 11 2 32 64 1