GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2018
Programming & Data StructuresStacks & QueueseasyMCQ1 mark
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer. 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?
Save your progress

Related Programming & Data Structures PYQs

GATE 2018

Consider the following C program: ```c #include <stdio.h> void fun1(char *s1, char *s2) { char *tmp; tmp = s1; s1 = s…

GATE 2018

Consider the following C code. Assume that unsigned long int type length is 64 bits. ```c unsigned long int fun(unsigned long int…

GATE 2018

The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7} exactly once is _______

GATE 2018

Consider the following C program: ```c #include <stdio.h> struct Ournode { char x, y, z; }; int main() { struct Ournode p…

GATE 2018

The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2,…

GATE 2018

Consider the following C program: ```c #include <stdio.h> int counter = 0; int calc(int a, int b) { int c; counter++; …