STACKS

LIFO Order

The principle in a stack where the last element added is the first to be removed, maintaining the order of elements.

Dynamic Size

Property of a stack allowing it to grow or shrink as elements are added or removed.

Top Operation

Operation in a stack that provides access to the most recently added element without removing it.

Push Operation

Operation that adds an element to the top of the stack.

Pop Operation

Operation that removes the top element from the stack.

Overflow

Condition occurring when trying to push an element onto a full stack.

Underflow

Condition occurring when trying to pop an element from an empty stack.

Peek

Operation returning the top element without removing it from the stack.

isEmpty

Operation checking if the stack is empty.

Limited access points

Refers to a situation where data structures allow access to only specific locations or elements.

Recursive function calls

Functions that call themselves within their definition to solve smaller instances of the same problem.

Memory-efficient

Describes algorithms or data structures that optimize memory usage.

Depth-first search

A traversal algorithm that explores as far as possible along each branch before backtracking.

Queue

A data structure that follows the First In, First Out (FIFO) principle.

Operations

enqueue, dequeue:Enqueue adds an element to the rear of the queue, while dequeue removes an element from the front.

Access to both front and rear

Queues allow access to elements at both the front and rear positions.

Multiple access points

Ability to access data from various locations within a data structure.

Breadth-first search

A traversal algorithm that explores all neighbor nodes at the present depth prior to moving on to nodes at the next depth level.

Time-efficient

Algorithms or processes that complete tasks in a reasonable amount of time.

Used in scheduling algorithms

Queues are commonly used in scheduling algorithms to manage tasks based on their arrival time or priority.