Data Structure and Algorithms in JAVA | Full Course on Data Structure | Great Learning

In this course, we are going to discuss Data Structures and Algorithms using Java Programming. The data structure is a way to store and organize data so that it can be used efficiently. It is a set of concepts that we can use in any programming language to structure the data in the memory. Data structures are widely used in almost every aspect of computer science i.e. operating systems, computer science, compiler design, Artificial Intelligence, graphic,s and many more. Some examples of Data structures that we are going to cover in this course are arrays, linked lists, stack, queue, Binary Tree, Binary Search Tree, Graphs, etc. Apart from knowing these data structures, it's also important to understand the algorithmic analysis of a given code. Different Sorting and searching techniques will be talked about with their implementation in java programming. Lastly, this course contains information on the Greedy approach, Dynamic approach, and divide and Conquer approach to programming.

🏁 Topics Covered:
00:00:00 Introduction
00:01:34 Agenda
00:02:58 Introduction to Data Structure
00:06:02 Types of Data Structure
00:16:14 Arrays Introduction
00:29:31 Arrays Implementation
00:55:41 Advantages and Disadvantages of Arrays
01:01:30 Stack introduction
01:11:29 Stack implementation
01:33:50 Advantages and Disadvantages of Stack
01:35:44 Queue introduction
01:40:16 Queue implementation
02:06:02 Advantages and Disadvantages of Queue
02:08:00 Linked list introduction
02:15:32 Linked list types
02:24:30 Linked List implementation
02:45:50 Circular Linked list implementation
03:07:43 Advantages and Disadvantages of Linked List
03:11:51 Binary tree introduction
03:15:06 Binary tree implementation
03:36:42 Advantages and Disadvantages of Binary Tree
03:38:12 Binary search tree introduction
03:41:32 Binary search tree implementation
03:54:56 Advantages and Disadvantages of Binary search Tree
03:56:26 Graphs introduction
04:07:30 Breadth first search implementation
04:37:08 Depth first search implementation
05:01:10 Hash tables introduction
05:09:16 Hashing implementation
05:25:48 Algorithms introduction and algorithmic analysis
05:43:32 Finding space and time complexity
05:53:50 Linear Search
05:56:44 Linear search implementation
06:03:31 Complexity analysis of Linear Search
06:07:03 Binary Search
06:20:35 Bnary search implementation
06:31:50 Complexity analysis of Binary Search
06:35:02 Insertion sort
06:43:37 Insertion sort implementation
06:53:23 Complexity analysis of Insertion sort
07:01:51 Selection sort
07:12:31 Selection sort implementation
07:20:00 Complexity analysis of Selection sort
07:28:58 Quick sort
07:42:59 Quick sort implementation
07:57:51Complexity analysis of Quick sort
08:03:29 Introduction to Divide and Conquor approach
08:06:20 Merge sort
08:18:24 merge sort implementation
08:40:07 Introduction to Greedy's approach
08:44:37 Prim's minimal Spanning Tree algorithm
08:51:38 Prim's minimal Spanning Tree algorithm implementation
09:14:38 Introduction to Dynamic Programming
09:17:04 Tower of Hanoi
09:28:04 Tower of Hanoi implementation
09:39:20 Summary

🔥Check Our Free Courses with free certificate:

⚡ About Great Learning Academy:
Visit Great Learning Academy to get access to 1000+ free courses with free certificate on Data Science, Data Analytics, Digital Marketing, Artificial Intelligence, Big Data, Cloud, Management, Cybersecurity, Software Development, and many more. These are supplemented with free projects, assignments, datasets, quizzes. You can earn a certificate of completion at the end of the course for free.

⚡ About Great Learning:
With more than 5.4 Million+ learners in 170+ countries, Great Learning, a part of the BYJU'S group, is a leading global edtech company for professional and higher education offering industry-relevant programs in the blended, classroom, and purely online modes across technology, data and business domains. These programs are developed in collaboration with the top institutions like Stanford Executive Education, MIT Professional Education, The University of Texas at Austin, NUS, IIT Madras, IIT Bombay & more.

SOCIAL MEDIA LINKS:
🔹 For more updates on courses and tips follow us on:

[hannanhub]

my first course on dsa.. and it was worth it..thanks a lot great learning

[bainapallivinodkumar]

@3:34:51 please change the function names in all other funcs except preorder traversal so that it will give correct answers just func names accrodingly

[kdurgaprasad]

Thank u very much, this video helped me a lot to understand the data structures and algorithims in java.
a small request from my side, mam explain the last two topics with their implentation with some more examples

[joyceasante]

Thank you for uploading this tutorial.

May I suggest that the lady instructor slow down when she speaks?

It will make the video more fun to watch.

[jyotiranjanmuduli]

mam ....in the dequeue part ... the code which u have implemented .. i think it will take o(n) time since we r shifting the elements also...but sir told that all operation took o(1) time ...

[MukeshSingh-urku]

At 3:34:29 your output for inorder and and postorder are wrong.
Output for inorder Traversal is D B E A C
Output for postorder Traversal is D E B C A
I am also learning from your channel
Please correct this Error so that it will be beneficial for all Learner.
The Errors are in the inordertraversal() and postordertraversal() methods
Please Correct It

[deepakrs_]

Thanks Great learning, Full Length video of DSA with Java.

[youtube]

Why u not implemented the stack (u directly used the stack class in collection)

[shikshadigital]

Hii all where can I find notes of this course

[PrathamV-eq]

Thank you for providing The concept Data structure
I Helped to learn the the full Data structure i this video

[k.pranavi-fz]

it is best vedio to reviese the datastructure topics but the only default is only voice of yours some times your voice is some low at that time we need to use full volume .expect that the topics were superb.

[vishalmaske]

in Stack....when we use Search think it searches from last index !!!!

[yogeshkumardhruw]

There's a mistake you guys are doing that you guys are saying Linked List can store homogeneous elements but in reality it can store heterogeneous elements. Guys please correct that!!!

[PallabChatterjee]

Can I get the notes means the slides of this lecture please I must say great course from great learning

[kirtijangid]

Mam. You said in stack, index start from 1..??

[kamsharinethayananthan]

In Quick sort, she mentioned that

int temp = a[pindex+1];
a[pindex+1]=a[end];
a[end] = temp;

instead of above we can use below/

int temp = a[pindex+1];
a[pindex+1]=pivot;
pivot = temp;

but that's wrong. It didn't work

[Hasnain-Mushtaq]

How can I get certificate of this course please give me it's link

[_SurajYadav-lrfl]

int []a1=new int[] {3, 2, 53, 33, 12, 5};
Arrays.sort(a1);




ma'am from above code we can also sort an array what is difference between your method and
my method ????

[beesetti.d.ssubhash]

Is it enough for learning complete data structures and algorithms course??

[shreeyanshukumar]

The girl has explained her part in a more simplified way than the guy. I had to watch his part on loop to understand what he is trying to explain :D