How does the overhead memory consumption differ between arrays and linked lists?

Describe the modifications made to the stack when it is limited as opposed to when it is unbounded.

Stack: push(x) adds x to top of stack pop() removes top element of stack and returns it size() returns number of elements in stack Select all options that allow for an efficient implementation based on the discussions from class. For any array implementation, you can assume the array is large enough so that making a larger one is not needed when pushing an item to the stack. Using an array with the top at the front of the array. Using an array with the top at the back of the array. Using a singly linked list with the top at the head of the list. Using a singly linked list with the top at the tail of the list. None of these choices allows for an efficient implementation of all methods.

Look at this stack frame:   Fill in the data types for the following procedure:   SomeSub PROC,   LOCAL val1:           ,   LOCAL val2:           ,   LOCAL val3:           ,   LOCAL val4:

4. Explain about singly linked lists with example. Write algorithm for various operations.

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.

Q. What are the advantages of a linked list over an array?   Note: Do it fast

Learn how effective the stack is when allowed to function as itself.

Determine the stack's effectiveness when allowed to function independently.

Discover how efficiently the stack works when it is allowed to function in line with the inherent characteristics that it has.