A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)? A) Both operations can be performed in O(1) time B) At most one operation can be performed in O(1) time but the worst case time for the other operation will be (n) C) The worst case time complexity for both operations will be (n) D) Worst case time complexity for both operations will be ( n)

Official answer: A) Both operations can be performed in O(1) time. Explanation: A queue can be efficiently implemented using a circular array with two pointers, `front` and `rear`. - ENQUEUE operation: Increments the `rear` pointer using modulo arithmetic (`rear = (rear + 1) % capacity`) and inserts the element at `array[rear]`. This takes O(1) time. - DEQUEUE operation: Removes the element at `array[front]` and increments the `front` pointer using modulo arithmetic (`front = (front + 1) % capacity`). This also takes O(1) time. Since both operations perform a constant number of operations without shifting remaining elements, both ENQUEUE and DEQUEUE run in O(1) time. Therefore, option A is correct.

A) Both operations can be performed in O(1) time

B) At most one operation can be performed in O(1) time but the worst case time for the other operation will be (n)

C) The worst case time complexity for both operations will be (n)

D) Worst case time complexity for both operations will be ( n)

Programming and Data Structures · Linear Structures, Trees and Heaps

Official IIT answer key · IISc Bangalore · Audited Aug 2026

Take topic test

GATE CSE 2016 Set 1 Q10 · MCQ · 1 mark

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ( $n$ refers to the number of items in the queue)?

Select an option to check

Key concept

Linear Structures, Trees and Heaps

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Linear Structures, Trees and Heaps

Across the provided GATE CS papers, this topic evaluates foundational data structures with an emphasis on implementation mechanics, boundary conditions, and asymptotic time complexities of core and advanced operations. Earlier questions focus directly on array-based circular queue pointer conditions and basic operation bounds (O(1) enqueue/dequeue). Recent questions test deep algorithmic understanding of multi-step operations like melding across disparate data structures such as doubly linked lists, binary heaps, and binary search trees.

Full Linear Structures, Trees and Heaps guide →

More on Linear Structures, Trees and Heaps

All 14 questions on Linear Structures, Trees and Heaps →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Programming and Data Structures · Linear Structures, Trees and Heaps

Official IIT answer key · IISc Bangalore · Audited Aug 2026

Take topic test

GATE CSE 2016 Set 1 Q10 · MCQ · 1 mark

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ( $n$ refers to the number of items in the queue)?

Select an option to check

Key concept

Linear Structures, Trees and Heaps

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Linear Structures, Trees and Heaps

Full Linear Structures, Trees and Heaps guide →

More on Linear Structures, Trees and Heaps

All 14 questions on Linear Structures, Trees and Heaps →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ( $n$ refers to the number of items in the queue)?

Step-by-step verified solution

Check you can still solve Linear Structures, Trees and Heaps under a clock

More from GATE CSE 2016 Set 1

More on Linear Structures, Trees and Heaps

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ( $n$ refers to the number of items in the queue)?

Step-by-step verified solution

Check you can still solve Linear Structures, Trees and Heaps under a clock

More from GATE CSE 2016 Set 1

More on Linear Structures, Trees and Heaps

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is **CORRECT** (nnn refers to the number of items in the queue)?

Step-by-step verified solution

Check you can still solve Linear Structures, Trees and Heaps under a clock

More from GATE CSE 2016 Set 1

More on Linear Structures, Trees and Heaps

Share this solution

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is **CORRECT** (nnn refers to the number of items in the queue)?

Step-by-step verified solution

Check you can still solve Linear Structures, Trees and Heaps under a clock

More from GATE CSE 2016 Set 1

More on Linear Structures, Trees and Heaps

Share this solution

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ( $n$ refers to the number of items in the queue)?

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ( $n$ refers to the number of items in the queue)?