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.
Elucidate pre-order and in-order tree traversal?
Write down some of the limitations of arrays?
Write down in brief the working process of Merge Sort?
How Armstrong rules are complete sound?
Give brief description of the term Quick Sort algorithm?
What do you mean by the node class?
Briefly describe the term Tree database. Elucidate its common uses?
Describes the uses of Tree Database?
What do you mean by the term matrix? Describe its uses with an illustration.
Explain the terms: physical data independence logical data independence
18,76,764
1958733 Asked
3,689
Active Tutors
1418577
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!