Enqueue Operation On Queue

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/CODING-FOR-PLACEMENT/data-structure/queue/basics-stack-mix/asset-enqueue-operation-on-queue after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. C: C Programming by Yash Sir
  2. C++: Programming in C++
  3. Java: Java
  4. Python: Python for Placements by Yash Sir
  5. OOPs Concept: Object Oriented Programming (OOPS)
  6. Pseudo Code: Pseudo Codes
  7. Data Structure: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithm: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  9. DSA Implementation: DSA using Python
  10. Competitive Coding: Coding Questions by Yash Sir, Coding Questions Bank
  11. Mega Test:
  12. Grand Test:
  13. Live Class Notes: Placement Live Classes
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture, presented by Sanchit Jain Sir from Knowledge Gate, focuses on the 'Insertion' operation within a queue data structure implemented using a fixed-size array. The instructor begins by drawing an array of size 8, indexed from 0 to 7, to visualize the storage. He defines a function `Q_in(Queue, N, F, R, item)` where N is the size, F is the front pointer, R is the rear pointer, and item is the data to be inserted. The lecture systematically breaks down the algorithm into conditional logic, starting with overflow checks and initialization steps. The instructor uses red handwriting to write pseudocode on the screen, explaining how to handle the queue when it is full or empty. He demonstrates the process by populating the array with sequential characters, illustrating the movement of the rear pointer as elements are added.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with the title 'Insertion' and a blank array of 8 boxes. The instructor introduces the function signature `Q_in(Queue, N, F, R, item)` written in red ink. He explains the parameters: Queue, N (size), F (front), R (rear), and item. He begins writing the logic, starting with the condition `if (R == N-1)`. This check determines if the queue is full in a linear implementation. If true, he writes 'write overflow & exit'. Next, he introduces the condition `if (F == -1)` to check if the queue is empty. For an empty queue, he writes the initialization step: 'set F=0 & R=0'. This segment establishes the foundational checks required before any insertion can occur.

  2. 2:00 – 4:53 02:00-04:53

    The instructor completes the insertion algorithm by writing the `else` block. He writes `R = R + 1` to increment the rear pointer for subsequent insertions after the first one. Then, he writes `Queue[R] = item` to store the new element at the updated rear position. To demonstrate this logic, he fills the array boxes with the characters 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h' sequentially. He points to the 'R' pointer moving from index 0 to 7 as the array fills up. This visual demonstration reinforces the concept of linear insertion where the rear pointer moves forward until the array is full, solidifying the understanding of the `Q_in` function's execution flow.

The lecture progresses logically from defining the problem and function parameters to implementing the core algorithm. It covers the critical edge cases of overflow and empty queue initialization. The demonstration with characters 'a' through 'h' provides a concrete example of the abstract logic, showing how the rear pointer increments and data is stored sequentially. This forms the basis for understanding linear queue insertion before potentially moving to circular queue variations.

Loading lesson…