- Computer Science Engineering (CSE)
- Data Structure (DS)
- Worst space complexity of queue data str...

Q. |
## Worst space complexity of queue data structure is |

A. | o(n) |

B. | o(log(n)) |

C. | o(1) |

D. | n/a |

Answer» A. o(n) |

View all MCQs in:
Data Structure (DS)

- 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: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?
- Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
- Worst space complexity of stack data structure is
- Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
- Worst space complexity of singly linked list is
- Queue is _____ type of data structure.
- Which of the following data structure is not linear data structure?
- In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
- In a circular queue the value of r will be ..
- ………… is not the operation that can be performed on queue.

Login to Continue

It will take less than 2 minutes

Report MCQ