Programming and Data Structures · Linear Structures, Trees and Heaps

Official IIT answer key · IIT Guwahati · Audited Aug 2026

GATE CSE 2018 Q3 · MCQ · 1 mark

A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let $n$ denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be implemented by deletion of a node from the tail.

Which one of the following is the time complexity of the most time-efficient implementation of `enqueue` and `dequeue`, respectively, for this data structure?

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 · IIT Guwahati · Audited Aug 2026

Take topic test

GATE CSE 2018 Q3 · MCQ · 1 mark

A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let $n$ denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be implemented by deletion of a node from the tail.

Which one of the following is the time complexity of the most time-efficient implementation of `enqueue` and `dequeue`, respectively, for this data structure?

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.

Which one of the following is the time complexity of the most time-efficient implementation of `enqueue` and `dequeue`, respectively, for this data structure?

Step-by-step verified solution

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

More from GATE CSE 2018

More on Linear Structures, Trees and Heaps

Which one of the following is the time complexity of the most time-efficient implementation of `enqueue` and `dequeue`, respectively, for this data structure?

Step-by-step verified solution

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

More from GATE CSE 2018

More on Linear Structures, Trees and Heaps

Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?

Step-by-step verified solution

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

More from GATE CSE 2018

More on Linear Structures, Trees and Heaps

Share this solution

Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?

Step-by-step verified solution

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

More from GATE CSE 2018

More on Linear Structures, Trees and Heaps

Share this solution

Which one of the following is the time complexity of the most time-efficient implementation of `enqueue` and `dequeue`, respectively, for this data structure?

Which one of the following is the time complexity of the most time-efficient implementation of `enqueue` and `dequeue`, respectively, for this data structure?