Interested to Buy Any Domain ? << Click Here >> for more details...
what is a stack
- 6 Answers
- 6182 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / srilatha
STACK IS A COLLECTION R HEAP OF ELEMENTS IN FIRST IN LAST
OUT METHOD.
| Is This Answer Correct ? | 17 Yes | 2 No |
Answer / 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 |
Answer / nashiinformaticssolutions
A linear data structure that executes operations in Last In First Out (LIFO) order is referred to as a stack.
Only the topmost element in a stack can be accessed, followed by the bottom element.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / glibwaresoftsolutions
A linear data structure that executes operations in Last In First Out (LIFO) order is referred to as a stack.
Only the topmost element in a stack can be accessed, followed by the bottom element.
| Is This Answer Correct ? | 0 Yes | 0 No |
A linear data structure that executes operations in Last In First Out (LIFO) order is referred to as a stack.
Only the topmost element in a stack can be accessed, followed by the bottom element.
| Is This Answer Correct ? | 0 Yes | 0 No |
FIND THE OUTPUT IF THE INPUT IS 5 5.75 void main() { int i=1; float f=2.25; scanf("%d%f",&i,&f); printf("%d %f",,i,f); } ANSWER IS 5 AND 2.25 WHY?
Give basis knowledge of web designing ...
What would happen to X in this expression: X += 15; (assuming the value of X is 5)
What is hash table in c?
What is a class?
main() { inta=10,b=20; a>=5?b=100:b=200; printf("%d ",b); }
Differentiate between new and malloc(), delete and free() ?
Write a program for print infinite numbers
how to determine the complexity of an algorithm as log(n)
Can you please compare array with pointer?
An application package has been provided to you without any documents for the following application. The application needs to be tested. How will you proceed?
How can I access an I o board directly?
C 
