Representation Of Queue
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Quantitative Aptitude & Numerical Ability: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Data Structures- Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Collections & Strings, Functions & Modules, File Handling & Data Analysis, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, Process Synchronization, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Windows OS
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control, Relational Algebra, Relational Calculus, NoSQL, Data Warehousing & Mining
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security, Transport Layer Services, DLL: Flow Control, Cloud Computing
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer, Instr Formats & Modes
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Language Design, DMA, Macros, Scoping & File Handling, Object Oriented Programming (OOPS), Programming in C++, Java, HTML, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends, MS Office Applications
- Artificial Intelligence: Artificial Intelligence
- Image Processing: Digital Image Fundamentals
- Internet & Web Technology: Website, Browser & Services, Internet Fundamentals, Server Side & Security, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Cyber Safety and Security, Ethical Hacking
- Descriptive Paper: English Writing Ability
- Mains - Unit Tests:
- Mains - Full Mock Tests:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces the linear array representation of queues using two pointer variables, FRONT and REAR. The instructor demonstrates how to initialize the queue by populating an array and positioning pointers at the first and last elements. He contrasts this with linked list implementations and defines the fundamental FIFO (First In First Out) property. Key operations like insertion and deletion are explained through pointer arithmetic and visual diagrams, including a real-world analogy of people waiting in line at an ATM. The lesson emphasizes the specific conditions required for empty queues and the mathematical updates to pointers during standard operations.
Chapters
0:00 – 2:00 00:00-02:00
The session begins by defining the structure of a queue using a linear array named QUEUE. The instructor draws a row of eight empty boxes and fills the first four with the numbers 1, 2, 3, and 4. He explicitly marks the FRONT pointer at the first element (index 0) and the REAR pointer at the last element (index 3). To provide context, he also sketches a linked list representation below the array, showing nodes labeled a, b, c, and d connected by arrows, with FRONT pointing to 'a' and REAR pointing to 'd'. This visual comparison helps students understand that while the underlying storage differs, the logical flow remains consistent.
2:00 – 5:00 02:00-05:00
The lecture transitions to queue operations and conditions. The text states that FRONT = NULL indicates an empty queue. The instructor explains that deleting an element increases the FRONT value by 1, demonstrated by crossing out the number 1 and moving the FRONT arrow to 2. Conversely, adding an element increases the REAR value. He defines a queue as a linear list where deletions occur at the front and insertions at the rear. A diagram of people standing in a line at an ATM is drawn to illustrate the FIFO concept, labeling the start of the line as FRONT and the end as REAR. The text on screen reinforces that terms 'Front' and 'Rear' are used specifically when the linear list is implemented as a queue.
5:00 – 5:13 05:00-05:13
In the final segment, the focus remains on the insertion logic. The on-screen text explicitly displays the formula REAR = REAR + 1. The instructor emphasizes that whenever an element is added to the queue, the REAR pointer must be incremented to point to the new location. The visual shows an arrow indicating the movement of the REAR pointer to the right, reinforcing the concept of expanding the queue within the array structure. This specific rule ensures that the next insertion happens at the correct index.
The video effectively bridges the gap between abstract data structure definitions and concrete implementation details. By using both array and linked list diagrams alongside real-world analogies, the instructor clarifies how pointers manage the dynamic nature of queue elements. The progression from initialization to specific pointer arithmetic rules provides a complete foundational understanding of queue mechanics.

