Queue Data Structure and Operations - Part 1
Offered By: Simple Snippets via YouTube
Course Description
Overview
Learn about the Queue data structure and its fundamental operations in this comprehensive video tutorial. Explore the concept of Queue as a linear data structure that follows the First-In-First-Out (FIFO) or Last-In-Last-Out (LILO) principle. Discover how Queue mimics real-world queues, such as lines of cars or people waiting at a food counter. Delve into the five standard operations of Queue: Enqueue, Dequeue, isFull, isEmpty, and count. Gain a solid understanding of this abstract data type with predefined capacity and its importance in Data Structures and Algorithms (DSA).
Syllabus
What is Queue Data Structure ? | Queue Operations | Data Structure & Algorithms (DSA) | Part - 1
Taught by
Simple Snippets
Related Courses
Conception et mise en œuvre d'algorithmes.École Polytechnique via Coursera Algorithmen und Datenstrukturen
Universität Osnabrück via iversity 数据结构与算法 Data Structures and Algorithms
Peking University via Coursera Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX 数据结构基础
Peking University via Coursera