Abstract Data Types in Data Structures π
Learn about Abstract Data Types (ADTs) in data structures with Java examples. Complete playlist: https://goo.gl/3eQAYB

Telusko
291.4K views β’ Dec 19, 2017

About this video
Complete playlist of Data Structure Using Java : https://goo.gl/3eQAYB
Abstract Data Type(ADT) in Data Structure
In this video we will see :
- Example of Abstract Data Type in Data Structure
- What is Data type
- Primitive Data Type
- Complex Data Type
- Variables
- Abstract
- Associated operation with data type
- Types of Data type
- Different Abstract Data Type
- List, Stack, Queue, Map
- Hashmap
- Linked list
Abstract Data type is a type for objects whose behavior is defined by a set of value and a set of operations.
Some types of ADT are :
List : a List is an ADT that represents a countable number of ordered values, where the same value may occur more than once.
A list can often be constructed by writing the items in sequence, separated by commas, semicolons, or spaces,
Stack : It is Last-In-First-Out (LIFO) DS
The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack,
while getting to an item deeper in the stack may require taking off multiple other items first
We can perform 2 operation on it :
PUSH : which adds an element to the collection, and
POP : which removes the most recently added element that was not yet removed
Queue : Is is a First-In-First-Out (FIFO) data structure.
In a FIFO data structure, the first element added to the queue will be the first one to be removed.
Map : It is a generalization of a map or associative array abstract data type in which more than one value may be associated with and returned for a given key.
Check out our courses:
AI Powered DevOps with AWS - Live Course :- https://go.telusko.com/AIDevOps-AWS
Coupon: TELUSKO10 (10% Discount)
Complete Java Developer Course Batch-4: https://go.telusko.com/Complete4
Coupon: TELUSKO10 (10% Discount)
Master Java Spring Development : https://go.telusko.com/masterjava
Coupon: TELUSKO20 (20% Discount)
Udemy Courses:
Spring: https://go.telusko.com/udemyteluskospring
Java:- https://go.telusko.com/udemyteluskojava
Java Spring:- https://go.telusko.com/Udemyjavaspring
Java For Programmers:- https://go.telusko.com/javaProgrammers
Python : https://go.telusko.com/udemyteluskopython
Git : https://go.telusko.com/udemyteluskogit
Docker : https://go.telusko.com/udemyteluskodocker
For More Queries WhatsApp or Call on : +919008963671
website : https://courses.telusko.com/
Follow Navin Reddy on Instagram: https://www.instagram.com/navinreddy20
Subscribe to our other channel:
Navin Reddy : https://www.youtube.com/channel/UCxmkk8bMSOF-UBF43z-pdGQ?sub_confirmation=1
Telusko Hindi :
https://www.youtube.com/channel/UCitzw4ROeTVGRRLnCPws-cw?sub_confirmation=1
Abstract Data Type(ADT) in Data Structure
In this video we will see :
- Example of Abstract Data Type in Data Structure
- What is Data type
- Primitive Data Type
- Complex Data Type
- Variables
- Abstract
- Associated operation with data type
- Types of Data type
- Different Abstract Data Type
- List, Stack, Queue, Map
- Hashmap
- Linked list
Abstract Data type is a type for objects whose behavior is defined by a set of value and a set of operations.
Some types of ADT are :
List : a List is an ADT that represents a countable number of ordered values, where the same value may occur more than once.
A list can often be constructed by writing the items in sequence, separated by commas, semicolons, or spaces,
Stack : It is Last-In-First-Out (LIFO) DS
The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack,
while getting to an item deeper in the stack may require taking off multiple other items first
We can perform 2 operation on it :
PUSH : which adds an element to the collection, and
POP : which removes the most recently added element that was not yet removed
Queue : Is is a First-In-First-Out (FIFO) data structure.
In a FIFO data structure, the first element added to the queue will be the first one to be removed.
Map : It is a generalization of a map or associative array abstract data type in which more than one value may be associated with and returned for a given key.
Check out our courses:
AI Powered DevOps with AWS - Live Course :- https://go.telusko.com/AIDevOps-AWS
Coupon: TELUSKO10 (10% Discount)
Complete Java Developer Course Batch-4: https://go.telusko.com/Complete4
Coupon: TELUSKO10 (10% Discount)
Master Java Spring Development : https://go.telusko.com/masterjava
Coupon: TELUSKO20 (20% Discount)
Udemy Courses:
Spring: https://go.telusko.com/udemyteluskospring
Java:- https://go.telusko.com/udemyteluskojava
Java Spring:- https://go.telusko.com/Udemyjavaspring
Java For Programmers:- https://go.telusko.com/javaProgrammers
Python : https://go.telusko.com/udemyteluskopython
Git : https://go.telusko.com/udemyteluskogit
Docker : https://go.telusko.com/udemyteluskodocker
For More Queries WhatsApp or Call on : +919008963671
website : https://courses.telusko.com/
Follow Navin Reddy on Instagram: https://www.instagram.com/navinreddy20
Subscribe to our other channel:
Navin Reddy : https://www.youtube.com/channel/UCxmkk8bMSOF-UBF43z-pdGQ?sub_confirmation=1
Telusko Hindi :
https://www.youtube.com/channel/UCitzw4ROeTVGRRLnCPws-cw?sub_confirmation=1
Video Information
Views
291.4K
Likes
6.3K
Duration
8:56
Published
Dec 19, 2017
User Reviews
4.7
(58) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now