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.
Explain the terms: physical data independence logical data independence
What is the competent data structure used within the internal storage representation in RDBMS?
Specify the methods which are available in the storing sequential files?
Briefly describe the term Tree database. Elucidate its common uses?
Explain how deletion is performed in the binary search tree.
Define the term cyclomatic complexity?
Write down the differentiation between a stack and a Queue?
Describe in brief the word Merge Sort?
What is the way to implement of deletion from a binary tree?
Explain the way of searching for data in a linked list.
18,76,764
1933706 Asked
3,689
Active Tutors
1423293
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!