PP 12.4 The array implementation in this chapter keeps the top variable pointing to the next array position above the actual top of the stack. Rewrite the array implementation such that stack[top] is the actual top of the stack. PP 12.5 There is a data structure called a drop-out stack that behaves like a stack in every respect except that if the stack size is n, when the n + 1 element is pushed, the first element is lost. Implement a drop-out stack using an array. (Hint: A circular array implementation would make sense.)

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.

solution for subpart 3

Project Overview: This project is for testing the use and understanding of stacks. In this assignment, you will be writing a program that reads in a stream of text and tests for mismatched delimiters. First, you will create a stack class that stores, in each node, a character (char), a line number (int) and a character count (int). This can either be based on a dynamic stack or a static stack from the book, modified according to these requirements. I suggest using a stack of structs that have the char, line number and character count as members, but you can do this separately if you wish.Second, your program should start reading in lines of text from the user. This reading in of lines of text (using getline) should only end when it receives the line “DONE”.While the text is being read, you will use this stack to test for matching “blocks”. That is, the text coming in will have the delimiters to bracket information into blocks, the braces {}, parentheses (), and brackets [ ]. A string…