Which of the following is TRUE?AStack is a FIFO structureBBoth stack and queue have two active endsCExamples of add operation are push() and dequeue()D“First come first served” is best referred to queue operation

What will be the final elements on the queue and stack if the following sequence of operations are executed? Queue q = new Queue(); Stack s = new Stack(); q.push("a"); s.push("b"); q.push("c"); s.push("d"); s.push( q.pop() ); q.push( s.peek() ); q.push( s.pop() );

One difference between a queue and a stack

Identify and describe each operation(s) in a Stack and a Queue.

What is the term for inserting into a full queue known as? IncorrectQuestion 130 / 1 ptsOne difference between a queue and a stack is:  Queues require dynamic memory, but stacks do not   Stacks use two ends of the structure, queues use only one.   Queues use two ends of the structure; stacks use only one.   Stacks require dynamic memory, but queues do not.  Question 141 / 1 ptsWhich is the correct operation for:"Remove the front item from the queue and return it"  deQueue()   de.Queue(Item)   Cant be performed on a Queue Data Structure.   dQueue()  IncorrectQuestion 150 / 1 ptsIn linked list implementation of a queue, the important condition for a queue to be empty is?  REAR is null   FRONT is null   no correct answer   LINK is empty  IncorrectQuestion 160 / 1 ptsIn a nonempty queue if front=rear, it means  Logic error.   Queue is full   Queue underflow   only one element left in the queue.  IncorrectQuestion 170 / 1 ptsIf front=rear ,then the queue is? IncorrectQuestion 180 / 1 ptsConsider the following operations performed on a stack of size 5 : Push (a); Pop() ; Push(b); Push(c); Pop(); Push(d); Pop();Pop(); Push (e) Which of the following statements is correct?  Overflow occurs   Stack operations are performed smoothly   no correct answer   Underflow occurs  IncorrectQuestion 190 / 1 ptsIn linked list implementation of a queue, from where is the item deleted? IncorrectQuestion 200 / 1 ptsIn linked list implementation of a queue, where does a new element be inserted?Quiz Score: 23 out of 40PreviousNextSubmission Details:

An implementation of a queue Q, using two stacks S1 and S2, is given below:void insert(Q, x) {   push (S1, x);}  void delete(Q){   if(stack-empty(S2)) then      if(stack-empty(S1)) then {          print(“Q is empty”);          return;      }      else while (!(stack-empty(S1))){          x=pop(S1);          push(S2,x);      }   x=pop(S2);}Let n insert and m (<=n) delete operations be performed in an arbitrary order on an empty queue Q. Let x and y be the number of push and pop operations performed respectively in the process. Which one of the following is true for all m and n?n+m <= x < 2n and 2m <= y <= n+mn+m <= x < 2n and 2m<= y <= 2n2m <= x < 2n and 2m <= y <= n+m2m <= x <2n and 2m <= y <= 2n