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 word Quick Sort?
Explain about a matrix and its uses with an example.
Give a brief description of the term binary searching and Fibonacci search?
Define the term cyclomatic complexity?
Write some of the disadvantages of the sequential storage?
Briefly describe the term queue operation?
Elucidate pre-order and in-order tree traversal?
Explain about the priority queue?
Discuss how to apply queue using stack?
Elucidate the terms Run-Time Stack, Binding Time, Recursive case, Base case and Tail Recursion?
18,76,764
1952541 Asked
3,689
Active Tutors
1421514
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!