0
What else can I help you with?
Define stack.discuss push and pop operation?
A stack is a region of memory that you store things, and retrieve them in the reverse order of storage. Think of it as a stack of papers. You write something down on a piece of paper, and then you put that paper in a stack, specifically on the top of the stack. This is called a push operation. If you want to go and do something else, such as service an interrupt or call another function, you create more pieces of paper and you push them onto the top of the stack as well. Under normal conditions, you cannot access anything on the stack below the top. I say "normal" because the architecture of the processor allows you to access chunks of memory contained within the stack, relative to the base pointer BP, allowing you to pass arguments and store temporary variables in what is called a stack frame. The reverse of push is called pop, and it is equivalent to taking a piece of paper off of the top of the stack and throwing it away - or using it, whatever you want - but that action exposes the next piece of paper, which is now the new "top of stack".
Can stack be called fifo data structure?
No. A stack is a LIFO (Last In First Out) data structure.A queue is a FIFO (First In First Out) data structure.
Why insert operation in stack called as push operation?
Consider an array used as a stack. Align this array vertically. When an element is inserted into the stack, it is pushed all the way down despite the space availability at the top. Hence it is called push operation. Here's an illustration:Stack initially:|_||_||_||5|Stack after the insertion of 6:|_||_||6| - element pushed down as much as possible|5|
What is a stack frame?
The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty, and a method to search the stack for an item and discover how far it is from the top.When a stack is first created, it contains no items.Methods:empty() - Returns boolean - Used to check if the stack is emptypeek() - Returns Object - Take a look at the top most element in the stack without popping itPop() - Returns Object - Returns the top most element from the stackpush(Object o) - Pushes the object at the top of the stacksearch(Object o) - Returns int - Returns the index location of the searched object. Returns -1 if the object is not found.Stack is a data structure it allows data to be inserted and removed in a push and a pop operation . stack also support a peek operation which reads data without removing it. A stack is a LIFO-queue, meaning that the last data to be inserted will be the first data to be removed
What is implicit stack?
A stack created by the user or a programmer is an implicit stack
What is a stack of 24 or 25sheets called?
24 or 25 sheets of paper can be called a quire of paper.
What do you call a group of paper?
Usually a group of paper is called a ream. This would be around 500 sheets. Otherwise it is referred to as a stack of paper.
Define stack.discuss push and pop operation?
A stack is a region of memory that you store things, and retrieve them in the reverse order of storage. Think of it as a stack of papers. You write something down on a piece of paper, and then you put that paper in a stack, specifically on the top of the stack. This is called a push operation. If you want to go and do something else, such as service an interrupt or call another function, you create more pieces of paper and you push them onto the top of the stack as well. Under normal conditions, you cannot access anything on the stack below the top. I say "normal" because the architecture of the processor allows you to access chunks of memory contained within the stack, relative to the base pointer BP, allowing you to pass arguments and store temporary variables in what is called a stack frame. The reverse of push is called pop, and it is equivalent to taking a piece of paper off of the top of the stack and throwing it away - or using it, whatever you want - but that action exposes the next piece of paper, which is now the new "top of stack".
What is a group of paper?
Group of A4 sheet is called as ream.......
How many pieces of paper are in a stack?
Historically a stack of paper would be up to the ceiling - so how high is the ceiling?
If 0.15 is a stack of paper how many stacks of paper would be equal to 6.5?
43 stacks and one third of a stack.
Why do you shuffle paper?
Most of us shuffle paper to introduce a bit of air between the sheets. This air lets the paper sheets shift some with respect to each other, and we can then get them "lined up" by grasping the stack of papers and tapping the stack on an edge. In commercial printing, a stack of paper is sometimes called a lift of paper, and the pressman will fan the lift of paper to line it up before loading it into the in-feed end of a press. The printer fans that lift of paper to get it to line up and them stacks it on the in-feed table.
A stack of 150 sheets of paper fell 30 feet and landed in a perfect stack How could this be?
MAGIC!
What is a group of pancakes called?
A group of pancakes is called a stack.
How do you estimate the number of sheets of paper in a stack?
You can estimate the number of sheets of paper in a stack by measuring the thickness of a single sheet and then dividing the total thickness of the stack by the thickness of one sheet. This will give you an approximate number of sheets in the stack. Keep in mind that this method is an estimation and may not be completely accurate due to variations in paper thickness and density.
Why is a stack of paper not very smart?
A stack of paper is not very smart because it lacks the ability to think, reason, or make decisions. Paper is an inanimate object that cannot process information or respond to stimuli in a meaningful way.
What is a support for a hay stack called?
the support for a stack of hay
