GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2025 · CS2 - Afternoon
Programming & Data StructuresStacks & QueueshardMSQ2 marks
Consider a stack data structure into which we can PUSH and POP records. Assume that each record pushed in the stack has a positive integer key and that all keys are distinct. We wish to augment the stack data structure with an \(O(1)\) time MIN operation that returns a pointer to the record with smallest key present in the stack (1) without deleting the corresponding record, and (2) without increasing the complexities of the standard stack operations. Which one or more of the following approach(es) can achieve it?

Select every correct option.

Save your progress

Related Programming & Data Structures PYQs

GATE 2025 · CS1 - Forenoon

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having n distinct integers?

GATE 2025 · CS1 - Forenoon

```c #include <stdio.h> void foo(int *p, int x){ *p=x; } int main(){ int *z; int a = 20, b = 25; z = &a; foo(z,b); pri…

GATE 2025 · CS1 - Forenoon

The height of any rooted tree is defined as the maximum number of edges in the path from the root node to any leaf node. Suppose a…

GATE 2025 · CS1 - Forenoon

```c #include <stdio.h> int foo(int S[],int size){ if(size == 0) return 0; if(size == 1) return 1; if(S[0] ≠ S[1]) return 1+…

GATE 2025 · CS1 - Forenoon

Let LIST be a datatype for an implementation of linked list defined as follows: ```c typedef struct list { int data; struct li…

GATE 2025 · CS1 - Forenoon

```c #include <stdio.h> int gate (int n) { int d, t, newnum, turn; newnum = turn = 0; t=1; while (n≥t) t *= 10; t /=10; …