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.
Briefly describe the term B+ tree? Elucidate its uses?
Briefly describe the term B tree?
What do you mean by recursive algorithm? Describe in brief.
Write down the major data structures employed in the following areas: RDBMS, Network data model and Hierarchical data model?
List the areas in that data structures are applied extensively?
What does isEmpty() member technique determines?
Illustrate the difference between the stack and Queue in brief?
Explain the queue operation in brief.
Write a brief note on the term data structure? And also write down the types of data structures?
What are the main uses of data structures?
18,76,764
1946377 Asked
3,689
Active Tutors
1442642
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!