# Max 2

posted by .

what is the effect of the delete operations on stack and queue. design algorithms

• Max 2 -

The effects depend on the implementation of the data structure. If the stack is implemented as a doubly linked list, deleting the extreme nodes will have minimal consequences. Same goes for queue.

## Similar Questions

1. ### Physics

A stack of books rests on a level perfectly smooth surface. A force F acts on the stack and it acclerated at 3m/s^2. A 1kg book is added to the stack. The same force is applied and now the stack accelerates at 2m/s^2. What was the …
2. ### Computer Science....PLZ HELP

DESIGN A METHOD "popOne" IN THE "Stack" CLASS WHICH POPS AN EXISTING MEMBER FROM A STACK.
3. ### software

write a function for delete a 'ITEM' from a linear queue.
4. ### Programming & Algorithm

(1) How to design algorithms to implement the stack operations. (2) Write a program to multiply any two matrices. (Using Basic) and finally, (3) Consider the algebraic expression E=(2x+y)(5a-b)^3. Draw the tree T which correspond to …
5. ### Computer Science

Using the operations push(E obj), peek(), pop(), empty() give a Java implementation of the method // Reverses the elements in the stack //and returns the result. // The stack passed as an argument to //reverse() will be // destroyed …
6. ### It/210 Axia College

Design complex program algorithms using the three basic control structures.Currency Conversion Design Appendix h
7. ### Data structure

Q1. Write a menu driven program for checkout lines in a supermarket, Using Queue data structure and Queue Simulation concepts. Create varied lines of servers depending on the user input initially. Display the queue of each server along …
8. ### meme

Consider the system of equations A ⊗ x = b where (i) A ∈ R m×n max , x ∈ R n max, b ∈ R m max and Rmax = R ∪ {−∞}, (ii) ⊗ denotes the max-plus matrix (or matrix-vector) product based …
9. ### Programming

Write a java method that will take two sorted stacks A and B (min on top), and return one stack D that is sorted (min on top). You are allowed to use only the stack operations such as pop, push, isEmpty and peek. Example: suppose A={(top)1,4,7,9} …
10. ### java

Write a java method that will take two sorted stacks A and B (min on top), and return one stack D that is sorted (min on top). You are allowed to use only the stack operations such as pop, push, isEmpty and peek. Example: suppose A={(top)1,4,7,9} …

More Similar Questions