SLIIT - Data Structures and Algorithms: Queue Operations

Emotional Intelligence

• Emotional Intelligence (EI) is the capacity for recognizing our own feelings and those of others, for motivating ourselves, and managing emotions well in ourselves and in our relationships.
• EI is composed of:
  • Perceiving emotions
  • Reasoning with emotions
  • Understanding emotions
  • Managing emotions

Characteristics of Emotional Intelligence

• Emotionally mature individuals recognize their own anger and react to emotions of self and others.
• They have a "can do" approach, believing that they can succeed if they see others like themselves succeed.

Types of Emotions

• Primary emotions:
  • Positive: love, happiness, surprise, acceptance
  • Negative: fear, sadness, anger, disgust, shame
• Other descriptors:
  • Anxiety, alarm, apprehension, concern, qualm, dread, fright, terror
  • Grief, disappointment, sorrow, gloom, despair, suffering, dejection
  • Outrage, exasperation, wrath, indignation, hostility, irritability
  • Contempt, disdain, abhorrence, revulsion, distaste
  • Guilt, remorse, regret, embarrassment, humiliation

Daniel Gardner's Multiple Intelligences

• Original intelligences:
  • Logical/mathematical
  • Verbal/linguistic
  • Interpersonal
  • Intrapersonal
  • Visual/spatial
  • Musical
  • Bodily/kinesthetic
• "New" intelligences:
  • Naturalist
  • Existential
  • Emotional Intelligence

Queue Data Structure

• A queue is a First-In-First-Out (FIFO) data structure.
• Operations:
  • Insert: adds an element to the end of the queue.
  • Remove: removes an element from the front of the queue.
  • PeekFront: returns the element at the front of the queue without removing it.
• Implementation:
  • Using an array with restricted access.
  • Constructor creates a new queue of a specified size.
  • Variables:
    • maxSize: size of the queue array.
    • front: index of the item at the front of the queue.
    • rear: index of the item at the end of the queue.
    • nItems: number of items in the queue.

Implementing Queue Methods

• Insert:
  • Check if the queue is full.
  • Increment rear and add the item to the queue.
• Remove:
  • Check if the queue is empty.
  • Access the item at the front of the queue and increment front.
• PeekFront:
  • Check if the queue is empty.
  • Access the item at the front of the queue.

Applications of Queue

• Printer queue.
• Stores keystroke data as you type at the keyboard.
• Pipeline.
• Used in operating systems.

Circular Queue

• A circular queue is a queue where the last position is connected back to the first position.
• Implementation:
  • Insert: check if the queue is full, and if rear is at the end of the array, wrap around to the beginning.
  • Remove: check if the queue is empty, and if front is at the end of the array, wrap around to the beginning.

Questions and Answers

• Question 01: Draw the queue frame after performing the given operations.
• Question 02: Implement isEmpty() and isFull() methods of the queue class.
• Question 04: Draw the queue frame after performing the given operations on a circular queue.
• Question 05: Implement isFull(), isEmpty(), and peekFront() methods of the circular queue class.
• Question 06: Create a program to create a queue with a maximum size of 10 and insert the given items to the queue. Delete all items from the queue and display the deleted items.

Test your understanding of queue operations with this SLIIT - Faculty of Computing Data Structures and Algorithms quiz. Learn how to manipulate a queue by inserting items, peeking at the front item, and removing elements. Visualize the changes to the queue frame as you perform each operation.