filmov
tv
Lec-47: Enqueue(), Dequeue() & other Operations on Queue | Data Structure
Показать описание
This video is about Enqueue(), Dequeue() & other Operations on Queue.
A queue is an abstract data type that represents a collection of elements in which elements are added at one end (rear) and removed from the other end (front).
Operations on a queue are: Enqueue(), Dequeue(), FrontPeek(),RearPeek(), IsEmpty() and IsFull().
0:00 - Introduction
0:48 - Queue operations
3:05 - Enqueue()
5:56 - Dequeue()
7:16 - Frontpeek()
8:10 - Rearpeek()
8:41 - IsEmpty() & IsFull()
►Data Structure (Complete Playlist):
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Design and Analysis of algorithms (DAA) (Complete Playlist):
►Graph Theory:
►Programming in C:
►Digital Logic:
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
#queue #datastructures #algorithm #dsa #placements
Комментарии