Exams › GATE › Technical

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)?

1. Both operations can be performed in O(1) time
2. At most one operation can be performed in O(1) time but the worst case time for the other operation will be Ω(n)
3. The worst case time complexity for both operations will be Ω(n)
4. Worst case time complexity for both operations will be Ω(log n)

Correct answer: Both operations can be performed in O(1) time

Solution

Both ENQUEUE and DEQUEUE operations can be implemented to run in O(1) time by using a circular array approach, which allows efficient addition and removal of elements without needing to shift other elements.

Related GATE Technical questions

• We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is
• Consider the following C program. void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ________; // call to f() } Which one of the following expressions, when placed in the blank above, will NOT result in a type checking error?
• The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
• Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change
• Consider the following C program. #include<stdio.h> void mystery(int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb = ptra; ptra = temp; } int main() { int a=2016, b=0, c=4, d=42; mystery(&a, &b); if (a < c) mystery(&c, &a); mystery(&a, &d); printf("%d ", a); } The output of the program is _________.
• Which of the following languages is generated by the given grammar? S → aS | bS | ε

⚔️ Practice GATE Technical free + battle 1v1 →