Basic Idea Of Queue

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/data-structures/queue/basics-stack-mix/asset-basic-idea-of-queue after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides a comprehensive introduction to the Queue data structure, starting with its formal definition and moving towards practical applications. The instructor defines a queue as a linear list where deletions are restricted to one end, known as the front, while insertions are restricted to the other end, known as the rear. He explicitly states that queues operate on a First-In-First-Out (FIFO) basis. To make these abstract concepts concrete, he utilizes a visual analogy of a queue at an ATM, annotating the slide to label the front and rear positions and the specific operations of enqueueing and dequeuing. The lecture concludes by exploring where queues are used in computer science, such as in time-sharing systems, and defines them as non-primitive, homogeneous linear data structures, supported by diagrams of router buffers and priority queues.

Chapters

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

    The session begins with the definition of a Queue displayed on the slide. The text reads: "A queue is a linear list of elements in which deletions can take place only at one end called the front, and insertions can take place only at the end called rear." The instructor explains that this structure is a "first in first out types of data structure(FIFO)." He then draws on the slide to illustrate this using a picture of people waiting in line. He writes "ATM" under the machine, points an arrow to the first person and writes "FRONT," and points to the last person writing "REAR." He further annotates the diagram by writing "Dequeue" near the front to signify deletion and "Enqueue" near the rear to signify insertion. He also numbers the people in the line 1 through 5 to demonstrate the sequential order of processing, reinforcing the FIFO concept visually.

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

    The instructor transitions to the applications and properties of queues. The slide text states: "In computer science queue are used in multiple places e.g. in time sharing system program with the same priority from a queue waiting to be executed." He underlines this text to highlight its importance. He also defines a queue as a "non-primitive linear data structure" and a "homogeneous collection of elements," underlining these phrases as well. The visual content shifts to technical diagrams. The first diagram shows a "Router's Buffer" with "Incoming Packet" entering a queue of packets (Packet 6 to Packet 1) before becoming an "Outbound Packet." The second diagram illustrates a flowchart where an "Arrival" goes to a "Classifier," which directs traffic to either a "Higher-priority queue" or a "Lower-priority queue" before reaching a "Processor" and "Departure." The instructor uses these diagrams to explain how queues manage data flow in networking and processing systems.

The lecture effectively bridges the gap between abstract data structure theory and real-world implementation. By starting with a clear definition and a relatable physical analogy (the ATM line), the instructor ensures students understand the fundamental mechanics of front and rear operations. The progression to technical diagrams of routers and priority queues demonstrates the versatility of queues in managing resources like network packets and CPU time. This structured approach allows students to see how the simple rules of FIFO apply to complex systems like operating systems and network routers, solidifying their understanding of why queues are essential in computer science.

Loading lesson…