Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / naresh lingampally
Stack is a data structure ,a last in, first out (LIFO)
abstract data type.
A stack can have any abstract data type as an element, but
is characterized by only two fundamental operations: push
and pop. The push operation adds to the top of the list,
hiding any items already on the stack, or initializing the
stack if it is empty. The pop operation removes an item from
the top of the list, and returns this value to the caller. A
pop either reveals previously concealed items, or results in
an empty list.
| Is This Answer Correct ? | 5 Yes | 0 No |
Post New Answer View All Answers
Explain 'bit masking'?
What is this infamous null pointer, anyway?
Is c pass by value or reference?
Explain the properties of union. What is the size of a union variable
Why doesnt the call scanf work?
What is the difference between far and near ?
What are the different types of linkage exist in c?
What does p mean in physics?
What are structure types in C?
What are the types of pointers?
Explain how can a program be made to print the line number where an error occurs?
What is the advantage of using #define to declare a constant?
How can I open a file so that other programs can update it at the same time?
Write a program in "C" to calculate the root of a quadratic equation ax^2+bx+c=0, where the value of a,b & c are known.
Write a code on reverse string and its complexity.
