DAY-3 DSA BOOTCAMP

Which operation is used to add an element to a Stack?

• Enqueue

• Dequeue

• Push

• Pop

What happens when you try to pop an element from an empty Stack?

• It returns null

• It returns the top element 

• It causes an underflow 

• It causes an overflow

What is the time complexity of a push operation in a Stack?

• 1

• n

• n logn

• n^2

Which of the following applications may use a Stack?

• Recursion 

• Parsing

• Browser history

• All of the above

• Removes the last from Q

• Keeps the Q same as it was before the call

• Makes Q empty

• Reverses the Q

Which of the following operations on a queue data structure has a time complexity of O(1)? 
A] Enqueue

B] Dequeue

C] Peek.

D] Clear.

• Only A

• A and B only

• All of the Above

• Only B

Which of the following is true about linked list implementation of queue?

A] In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

B] In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• A only

• B only

• Both of the above
  A and B

• None of the above

• Prints numbers from 0 to n-1

• Prints numbers from n-1 to 0

• Prints first n Fibonacci numbers

• Prints first n Fibonacci numbers in reverse order.

(This Question 45 sec to solve)

Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: 
i. isEmpty (Q) — returns true if the queue is empty, false otherwise. 
ii. delete (Q) — deletes the element at the front of the queue and returns its value. 
iii. insert (Q, i) — inserts the integer i at the rear of the queue. 
Consider the following function: 

• Leaves the queue Q unchanged

• Reverses the order of the elements in the queue Q

• 
  Deletes the element at the front of the queue Q and inserts it at the rear keeping the other elements in the same order

• Empties the queue Q

The minimum number of stacks needed to implement a queue is.

• 3

• 2

• 4

• 1