Using C, make a stack [ push() and pop() ] of ints. At first, the stack should be able to hold 5 items. If you try to push() onto a full stack, you should allocate a new block of memory for the stack then move over the items from the old stack, reassign the pointers, and then deallocate the old stack. You should try doubling the stack when you reach the limit. Don't allocate unnecessary amounts of memory, so if you had allocated 10 spaces and you only used 2, you should reallocate the stack size to 5. When reallocating, keep track by printing 'increasing/decreasing size from a to b.

Using C, make a stack [ push() and pop() ] of ints. At first, the stack should be able to hold 5 items. If you try to push() onto a full stack, you should allocate a new block of memory for the stack then move over the items from the old stack, reassign the pointers, and then deallocate the old stack. You should try doubling the stack when you reach the limit. Don't allocate unnecessary amounts of memory, so if you had allocated 10 spaces and you only used 2, you should reallocate the stack size to 5. When reallocating, keep track by printing 'increasing/decreasing size from a to b.

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

You may only operate on the stacks WORK and TEMP, supporting their ADT operations of PUSH (S, X), POP (S, X), and EMPTYSTACK (S), where X is an element or variable to be pushed into or popped out of the stack and S denotes the stack itself. If necessary to complete the procedures, you may also utilise one variable.i i) I How can you determine the least element that was put into Work given n different random numbers? You may employ a single variable. ii) Given n distinct random numbers that are to be pushed into WORK, how canyou find the maximum element that was pushed into it, all the while ensuring thatthe elements stored in WORK are in their descending order with the maximumelement beginning at the bottom of stack? You are permitted to use a lone variableand a temporary stack TEMP.
If you have a stack that contains 3000 integers, and you need to see if it contains the number 5678, what is the worst case scenario in terms of the number of operations you would have to do? You can use a second stack. Count every peek, push, pop and comparison, and assume you need to ensure that the integers in the collection maintain their order in the original stack.
Write a program for Stack (Array-based or linked list-based) in Python. Test the scenario below with the implementation and with the reasoning of the answer. Make comments with a short description of what is implemented. Include source codes and screen-captured outputs. Stack: Given an empty stack in which the values A, B, C, D, E, F are pushed on the stack in that order but can be popped at any time, give a sequence of push and pop operations which results in pop()ed order of BADECF
Write a program for Stack (Array-based or linked list-based) in Python. Test the scenario below with the implementation and with the reasoning of the answer. Make comments with a short description of what is implemented. Include source codes and screen-captured outputs. Stack: A letter means doing a push operation and an asterisk means doing a pop operation in the below sequence. Give the sequence of letters that are returned by the pop operations when this sequence of operations is performed on an initially empty stack. A*BCE**F*GH***I*
Consider the following operations performed on a stack of size 5. Push(1);Pop();Push(2);Push(3);Pop();Push(4);Pop();Push(5); After the completion of all operations, the number of elements in the stack is:
Write a program that implement a stack of characters using a linked list as its underlying physical data structure. The program must check empty stack when it pops. Your Main method should test your stack. In particular, use your stack to check if a string of user input is a Palindrome or not. A palindrome is a word, phrase, or sequence that reads the same backward as forward, e.g., madam. (Note, do not include linkedlist methods that will not be used by your program)
Write a program that implement a stack of characters using a linked list as its underlying physical data structure. The program must check empty stack when it pops. Your Main method should test your stack. In particular, use your stack to check if a string of user input is a Palindrome or not. A palindrome is a word, phrase, or sequence that reads the same backward as forward, e.g., madam. (Note, do not include linkedlist methods that will not be used by your program)... Use main.java file and palindrome.java file.
You are allowed to operate on a stack WORK and a temporary stack TEMP (ifneeded) supporting their ADT operations of PUSH (S,X), POP (S, X) andEMPTYSTACK (S) only, where X represents an element/variable to be pushed in orpopped out of the stack and S represents a stack. You are also permitted to use onevariable if needed to carry out the operations.i) Given n distinct random numbers that are to be pushed into WORK, how canyou find the minimum element that was pushed into it? You are permitted to use alone variable.ii) Given n distinct random numbers that are to be pushed into WORK, how canyou find the maximum element that was pushed into it, all the while ensuring thatthe elements stored in WORK are in their descending order with the maximumelement beginning at the bottom of stack? You are permitted to use a lone variableand a temporary stack TEMP.iii) Given an array A[1: n] of distinct random numbers how can you obtain thesorted list in the array, making use of stacks alone?
For this project, you will read an infix expression, convert it to postfix, evaluate the postfix expression, and print out the answer. You will need to define and implement your own Stack class and a Calculator class. Your Stack class should support standard stack operations, which you can implement with either a linked list or an array. You should use a class template Stack in C++, but an integer Stack class would work as well since a character would be considered a subset of integers. Your Calculator class stores an infix operation and it provides the public operations below. Feel free to add private operations and data. The Calculator class should use a character stack to convert infix to postfix (storing operators) and then uses an integer stack to evaluate the expression (storing operands). C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++ C++…
Whereas the unbounded stack has no such limits, could you perhaps elaborate on how this works?
For our first example of using a stack, we’ll examine a very simple task: reversing aword. When you run the program, it asks you to type in a word. When you press Enter, itdisplays the word with the letters in reverse order.A stack is used to reverse the letters. First the characters are extracted one by one fromthe input string and pushed onto the stack. Then they’re popped off the stack and displayed. Because of its last-in-first-out characteristic, the stack reverses the order of thecharacters. shows the code for the reverse.cpp program.
You are allowed to operate on a stack WORK and a temporary stack TEMP (ifneeded) supporting their ADT operations of PUSH (S,X), POP (S, X) andEMPTYSTACK (S) only, where X represents an element/variable to be pushed in orpopped out of the stack and S represents a stack. You are also permitted to use one variable if needed to carry out the operations. i) Given n distinct random numbers that are to be pushed into WORK, how canyou find the maximum element that was pushed into it, all the while ensuring thatthe elements stored in WORK are in their descending order with the maximumelement beginning at the bottom of stack? You are permitted to use a lone variableand a temporary stack TEMP.ii) Given an array A[1: n] of distinct random numbers how can you obtain thesorted list in the array, making use of stacks alone?