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 the term two-dimensional array by using example?
What are the differences between data structure of System R and the relational structure?
Illustrate the term algorithm. Write down some of the properties of an algorithm?
What is the data structures employed to carry out recursion?
Define the two-dimensional array.
What are the categories of software?
What is known by the verification and validation?
Define the term data structure? Describe the types of data structures?
Define the term process?
Write the goals of Data Structure?
18,76,764
1935516 Asked
3,689
Active Tutors
1442360
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!