CUET Computer Science Key cards: 5 of this chapter’s 52 are free to read, with no account.
Say the answer in your head, then turn the card over.
The 5 free cards from Stack
Card 1 of 5
1 of 5
Definition
What is a linear data structure?
Computer Science - Class XII, Ch 3, p. 40
Definition
What is a linear data structure?
A data structure in which elements are organised in a sequence is called linear data structure.
Computer Science - Class XII, Ch 3, p. 40
Definition
What is the LIFO principle followed by a stack?
Computer Science - Class XII, Ch 3, p. 40
Definition
What is the LIFO principle followed by a stack?
It thus follows the Last-In-First-out (LIFO) principle. That is, the element which was inserted last (the most recent element) will be the first one to be taken out from the stack.
Computer Science - Class XII, Ch 3, p. 40
Definition
What is the PUSH operation on a stack?
Computer Science - Class XII, Ch 3, p. 42
Definition
What is the PUSH operation on a stack?
PUSH adds a new element at the TOP of the stack. It is an insertion operation.
Computer Science - Class XII, Ch 3, p. 42
Definition
What is 'overflow' in a stack?
Computer Science - Class XII, Ch 3, p. 42
Definition
What is 'overflow' in a stack?
A stack is full when no more elements can be added to it. Trying to add an element to a full stack results in an exception called 'overflow'.
Computer Science - Class XII, Ch 3, p. 42
Definition
What is the POP operation on a stack?
Computer Science - Class XII, Ch 3, p. 42
Definition
What is the POP operation on a stack?
POP operation is used to remove the top most element of the stack, that is, the element at the TOP of the stack. It is a delete operation.