GATE DA 2024 | Question: 22
The fundamental operations in a double-ended queue D are:
insertFirst(e) – Insert a new element e at the beginning of D.
insertLast(e) – Insert a new element e at the end of D.
removeFirst() – Remove and return the first element of D.
removeLast() – Remove and return the last element of D.
In an empty double-ended queue, the following operations are performed:
insertFirst(10)
insertLast(32)
a ←removeFirst()
insertLast(28)
insertLast(17)
a ←removeFirst()
a ← removeLast()
The value of a is ______.
Ans: 17
0:00 Intro & Question
0:59 Solution
----------------------------------------------------
📗👩🏫Math Lecture for GATE CS • Mathematics Lectures for GATE CSE by ...
❓🙋♀️Math GATE PYQ : • Mathematics GATE CSE PYQ (2010-2024) ...
----------------------------------------------
❓🙋♀️GATE General Aptitude (GA) solved by Monalisa • General Aptitude PYQ solved by Monali...
----------------------------------------------------------------
📘👩🏫Algorithm Lectures : • Algorithm Lectures for GATE CSE by Mo...
❓🙋♀️Algorithm GATE PYQ: • Algorithm GATE CSE PYQ (2010-2024) so...
----------------------------------------------------------------
📙👩🏫Compiler Design Lectures : • Compiler Design Lectures for GATE Com...
❓🙋♀️Compiler Design PYQ : • Compiler Design PYQ(2010-2024) GATE C...
----------------------------------------------------------------------
📔👩🏫Theory Of Computation Lectures • TOC (Theory of Computation) Lectures ...
❓🙋♀️TOC GATE PYQ: • TOC (Theory of Computation) GATE CSE ...
-------------------------------------------------------------------
📒👩🏫Data Structure Lecture: • Data Structure Lecture for GATE Compu...
❓🙋♀️Data Structure PYQ: • Data Structure GATE CS PYQ(2010-2024)...
-----------------------------------------------------------------------
#gate_cs #gate #aptitude #generalaptitude #gate2024 #gateda #monalisacs #datascience #queue