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.
Describe in brief the term binary search?
What is the relation between Doubly Linked List and Circular Linked List?
State the difference between the Stack and Array?
Write down in brief the working process of Merge Sort?
Explain the difference between a stack and a Queue.
How is different type of element insert in a stack? Is it possible?
What is known by the verification and validation?
What is the competent data structure used within the internal storage representation in RDBMS?
Give a brief description of the term binary searching and Fibonacci search?
Explain about the spanning Tree?
18,76,764
1952843 Asked
3,689
Active Tutors
1439920
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!