Describe stack operation
Briefly describe the term stack operation?
Expert
Stack is a data structure which follows Last in First out strategy.
Stack Operations:-
• Push – Pushes (inserts) the element in stack. The location is specified by pointer. • Pop – Pulls (removes) the element out of stack. The location is specified by pointer • Swap: - the two top most elements of stack can be swapped • Peek: - Returns top element on stack but doesn’t remove it from the stack • Rotate: - the topmost (n) items can be moved on stack in a rotating fashion
A stack has a fixed location in the memory when a data element is pushed in stack, pointer points to the current element.
Define how to implement queue by using stack?
Give a small description of the term Arrays?
By using a declaration statement how is memory reserved?
State the difference between the Stack and Array?
What are the areas wherein data structures are applied extensively?
Describe the Quick sort algorithm.
Define the term data structure? Describe the types of data structures?
Illustrates the use of semaphores for the critical sections of a task?
Explain the uses of Linked list.
How is different type of element insert in a stack? Is it possible?
18,76,764
1929712 Asked
3,689
Active Tutors
1413871
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!