HomeОбразованиеRelated VideosMore From: Computer Education For all

Data Structures and Algorithms Complete Tutorial Computer Education for All

5937 ratings | 535283 views
Computer Education for all provides complete lectures series on Data Structure and Applications which covers Introduction to Data Structure and its Types including all Steps involves in Data Structures:- Data Structure and algorithm Linear Data Structures and Non-Linear Data Structure on Stack Data Structure on Arrays Data Structure on Queue Data Structure on Linked List Data Structure on Tree Data Structure on Graphs Abstract Data Types Introduction to Algorithms Classifications of Algorithms Algorithm Analysis Algorithm Growth Function Array Operations Two dimensional Arrays Three Dimensional Arrays Multidimensional arrays Matrix operations Operations on linked lists Applications of linked lists Doubly linked lists Introductions to stacks Operations on stack Array based implementation of stack Queue Data Structures Operations on Queues Linked list based implementation of queues Application of Trees Binary Trees Types of Binary Trees Implementation of Binary Trees Binary Tree Traversal Preorder Post order In order Binary Search Tree Introduction to Sorting Analysis of Sorting Algorithms Bubble Sort Selection Sort Insertion Sort Shell Sort Heap Sort Merge Sort Quick Sort Applications of Graphs Matrix representation of Graphs Implementations of Graphs Breadth First Search Topological Sorting Subscribe for More https://www.youtube.com/channel/UCiV37YIYars6msmIQXopIeQ Find us on Facebook: https://web.facebook.com/Computer-Education-for-All-1484033978567298 Java Programming Complete Tutorial for Beginners to Advance | Complete Java Training for all https://youtu.be/gg2PG3TwLx4
Html code for embedding videos on your blog
Text Comments (208)
ZERO ONE (3 days ago)
Now watch this
Sudhir Kumar Jayaswal (6 days ago)
Which book you have referred while making this.?
John Mahoney (11 days ago)
Excellent thank you
This is the worst technical book I've ever bought. I returned it immediately. The author replied my review on Amazon.com, however he didn't change my point of view. The book should be called "Data structures and Algorithms", without the "made easy" part.
Great educational video providing a detail explanations about the different computer languages and how they are used for data structure and applications. Where I can get in writing the presentation. Computer Education for All have a great use of YouTube and Facebook. I was looking for the information provided in this video.
shanzah aslam (18 days ago)
doess it also give the codes of all the topics mentioned aswell??
Ahmad Hasan (29 days ago)
After showing the implementation of array and string operations(and maybe more, I haven't got there yet) you told that the detailed coding for all methods are given in the demonstration. I couldn't catch it, where is the demonstration actually? And how can I get it? Shall be very grateful to know that.
Waqar Ahmad (1 month ago)
The logo in the background is of Allama Iqbal Open University Pakistan. Credits should be given
Mark (1 month ago)
Honestly without examples some content is difficult to understand. Like ADT advantages. I guess I need learn an oop language to better understand the content of this video. I know C I know structures but I don't know about encapsulation. The reason I decided to learn about data structures was understanding OOP a bit because I don't understand the oop. What are constructors for instance. Why is creating an object isn't enough and there is a need for a constructor. Don't know. I would really like to read about all these concepts in a chronological order. I am convinced the only way I can truly understand the oop concepts is learning the story behind their invention.
Sriharsha Angadi (1 month ago)
Wonderful video. Please let me know where can i download the slides?
RAJIV RIDDLE (1 month ago)
Muḥammad ibn Mūsā al-Khwārizmī born in 780AD
borzak101 Me (1 month ago)
Video is better if you turn sound off and just read it.
Dr.nouraldein Ahmed (1 month ago)
May God reward you with good
bushra afridi (2 months ago)
Really really helpfull...great efforts.
Luciano Rezende (2 months ago)
Hi professor, do you have some github source code repository? Excellent video! Thank you very much.
Sharad Kashyap (3 months ago)
can you please provide the link of write up. It would be very beneficial
Obaid aljabry (3 months ago)
develop and algorithm program and flow chart to perform the following task, read type of the vehicle, model of the vehicle, price of the vehicle
Roumeissa Laourari (3 months ago)
pass it to 1.25 and enjoy ;)
Kajal Jha (3 months ago)
montecarlo811 (3 months ago)
EngineeredMechanized (3 months ago)
This seems like a very well made collection of lectures. I am of electrical background but took up AI this semester without having much knowledge of computer programming except for some basic C programming. Are these videos enough to know what I need to know before starting AI. Replies would be highly appreciated.
Manohar Kondi (3 months ago)
I have gone through the whole video, it was awesome. could you pls provide document and detailed programs for me.
Ganesh Kakkireni (4 months ago)
at 1:53:20 *q was not initialized but used... it should be q = p->next | q= head, isn't it?
Kehinde Kareem (4 months ago)
This is Fantastic and Excellent Tutorial. Thanks for this video.
yash chaturvedi (4 months ago)
great content but in shell sort example the final list is not in sorted form as 72<75.
charles klaus (4 months ago)
Amazing lecture!
Paris qian sen (4 months ago)
6 hours and 49 mins of treasure! A bit too hard core
salman shanu (4 months ago)
Compute address of jth element in an array formula, SIZE indicates the data type size, not the number of items in array
rishav bagchi (4 months ago)
make video speed 1.25x you're good to go!
ankesh kumar (4 months ago)
only introduction with basic explanation of all DS topics.
What Is What? (4 months ago)
Doesn't this content belong to Allama Iqbal Open University of Pakistan? You should've at least given them some credit, here is something positive from Pakistan, the lecture is HQ.
Ankita Gupta (4 months ago)
is this tutorial for data structure using c language ?
sahruna khan (4 months ago)
Thank you so much
puspa joshi (5 months ago)
It's really nice explanation.
swamy pediredla (5 months ago)
It is useful for gate and net exams
Sneha Sruthi (5 months ago)
Thank you sir!!
AAZinvicto (5 months ago)
Awesome video, can watch it at 1.5 speed if you are just brushing up your DS
Gregory Jones (5 months ago)
can we have slides for this great job.
Pramod Kumarage (5 months ago)
where can i get the example codes related to above tutorial
Sai Prajwal Kotamraju (7 months ago)
1:53:40 while(p!=NULL){ q = p->next;
Lokesh Sagar (7 months ago)
Where can i find the codes for it??
ihsan khan (8 months ago)
Great job! Helped me a lot.... carry on plz
John Leezyen (8 months ago)
19:55. ADT 27:40. Unit 2 algoritms
Abdullahi Habib Anangi (9 months ago)
Please can u send me the soft or hard copy to my mail ?? [email protected]
anony mous (10 months ago)
anony mous (10 months ago)
Cristian Game4Yu (10 months ago)
Ty :) <3
Henry Mideko (10 months ago)
the don is atticulate and v. proffesional. thanks sir, bring us more.
Cheyno Mdingi (11 months ago)
Fiiinally, a computer science video by a pajeet with an easy to understand accent!
Carl Taylor (3 months ago)
He sounds like Donald Duck.
Live Mr. Blind (11 months ago)
It's absolutely awesome 👌 perfect 👏
Arun Shah (11 months ago)
Excellent Contents! Ignore all the negative comments, people are just greedy. This video is long, detailed and so much effort went into it, I am actually honoured to receive such a good education from this video. -> I have spent 3 months at University doing algorithms and data structures, and I learned almost nothing, it was completely abstract, this video perfectly blends concepts, maths, arguments explanations code examples and is just really really good. Anyone who has spent tens or hundreds of thousands of pounds for education and can compare the quality of this video and its contents vs university teaching will tell you that this video is more valuable than gold or diamonds. thank you very much for your hard work, if I can make a donation to show my appreciation please let me know, very happy to help. excellent teaching & material.
thanks for your appreciations and that kind of response we need. Enjoy
hfontanez98 (1 year ago)
@43:48 Algorithm Growth Function table. Very useful. (although they did not include O(1) or constant).
hfontanez98 (1 year ago)
This tutorial could've been broken down to separate data type tutorial as a "Part I", leaving Data Structures and Algorithms as "Part II."
Dear Its Complete Tutorial on Data Structure and Algorithm and also watch Algorithms and Data Structures in units on this playlist https://youtu.be/8KcUR2iJJ3c
Viral Patel (1 year ago)
Thanks a lot for Sharing this!! This is an amazing tutorial...:)
appreciations are highly welcome!
Yogesh Sanchihar (1 year ago)
good videos
A New Era (1 year ago)
nice video
joy (1 year ago)
thnx sir
Henry Tirla (1 year ago)
where can i get the power point? Please Help
i suggest to bookmark the Data structures and algorithms tutorial video to easy access
muhammad alias (1 year ago)
i feel difficulty in my assignment
muhammad alias (1 year ago)
please help me
Fazal Muhammad (1 year ago)
really good contents to learn thanks for providing such materials to us
Amna Zara (1 year ago)
video is totaly blur :(
Zeeshan Jamal (4 months ago)
you need to set the quality to 720p. May be your internet is slow therefore optimizing
Health is Wealth (1 year ago)
Nice Demonstration and Full Tutorial on Data Structures Very Easy
are ppts available
still not please book mark this video for futuristic approach
Ahmad Sayeb (1 year ago)
hi, thanks for such a detailed explanation. i wanted to know where i can get the Detailed Codes. i watched the array section and there was no detailed implementation of the Array.
Anks k (1 year ago)
your c and s pronounce is very bad hear that is very irritating.....plz change pronounce
really Anks!
Sandaruwan Senadheera (1 year ago)
can some one help me with this code pls..... #include <iostream> using namespace std; enum sportType { cricket, tennis, waterSport, karate}; union sportChoice{ struct cricketInfo; char tennisInfo[20]; char waterSportInfo[20]; char karateInfo[20]; }; struct cricketInfo{ char nameTeam[20]; char typePlay[20]; }; struct participantType{ char firstName[15]; char secondName[15]; char dob[15]; char sex[10]; char address[30]; char phoneNumber[10]; int activityScore[5]; sportChoice choice; }; void readInfo(participantType self[]); void print (participantType self[]); int main() { participantType self(); readInfo(myself); print(myself); return 0; } void readInfo(participantType self[]){ char s,ch; for(int i=0; i<5; i++){ cout<< " First Name: "; cin.getline(self[i].firstName, 15); cout<< " Second Name: "; cin.getline(self[i].secondName, 15); cout<<" Date of Birth: "; cin.getline(self[i].dob, 15); cout<<" Sex: "; cin.getline(self[i].sex, 15); cout<<" Address: "; cin.getline(self[i].address, 15); cout<<" Phone No: "; cin.getline(self[i].phoneNumber, 15); cout<<" Score of the fitness test: "; cin>>self[i].activityScore; cout<< "Choice of Sport(cricket-c,tennis-t,water sport-w,karate-k): "; cin>>s; cin.get (ch); switch(s){ case 'c': case'C': self[i].choice = cricket; break; case 't': case 'T': self[i].choice = tennis; break; case 'w': case 'w': self[i].choice = waterSport; break; case 'k': case 'K': self[i].choice = karate; break; default cout<< "Incorrect"; } switch ( self[i].choice){ case cricket: cout<< " Name of the team: "; cin.getline(self[i].cricketInfo.nameTeam, 20); cout<< " Type of play: "; cin.getline(self[i].cricketInfo.typePlay, 20); break; case tennis: cout<< " Single or Double: "; cin.getline(self[i].tennisInfo,20); break; case waterSport: cout<< " Swimming, Diving or windsurfing: "; cin.getline(self[i].waterSportInfo,20); break; case karate: cout<< " Color of the Belt: "; cin.getline(self[i].karateInfo,20); break; } } } void print ( participantType self[]){ for (i=0; i<5; i++){ cout<< "Name : "<< self[i].participantType.firstName<<" "<< self[i].participantType.secondName; cout<< "Date of Birth: "<<self[i].participantType.dob; cout<< "Sex: "<<self[i].participantType.sex; cout<< "Address: "<<self[i].participantType.address; cout<< "Phone No."<<self[i].participantType.phoneNumber; cout<< "Fitness text score: "<<self[i].participantType.activityScore; cout<< "Choice of Sport: "; switch (self[i].choice){ case cricket: cout<< " plays cricket for team: " << self[i].cricketInfo.nameTeam; cout<< "Type of play: " << self[i].cricketInfo.typePlay; case tennis: cout<< " plays tennis as "<<self[i].tennisInfo<< "play"; case waterSport: cout<< " plays water Sports as "<<self[i].waterSportInfo; case karate: cout<< "plays karate & holds " << self[i].karateInfo << " belt"; } } }
problem not mentioned and need more hear files
Kiran Parhad (1 year ago)
I think, there is typo error in insertion sort algorithm @4:47:19 , last line should be x[k] = temp.
Prasanna (1 year ago)
Sincere thanks. Very educative. You had put in lots of effort wit great attention to details. Thank you!
Nandha kumar (1 year ago)
This video can be suitable 4 beginners?
nice comments on Data Structures and Algorithm
waldo lok (1 year ago)
Your accent throws me off a bit but thanks for the vid
17:31 - The access to structure member through pointers in C. The sign "<-" is should be turned around, so that: employee[0]->name, employee[0]->title, employee[0]->salary
1:53:17 - The sorting of linked list. The variable "q" is not initialised properly, so "q->next" is accessing any trash located somewhere in the memory. In other words, the code of sorting doesn't work.
lorenzo garcia (1 year ago)
much better if source code is provided
Asghar Nazir (1 year ago)
5:09:28, heap written statement contradicts the picture example shown
if you have some correction please make changes for Heap written statement in data structures and algorithm
EwokPanda (1 year ago)
Thank god for 1.5x speed!
Thanks for appreciated to Data Structures and Algorithms
rachit chhabra (1 year ago)
A complaint though "When we consider the programming details of these methods!!!!!!!!!??????????????"
when writing any Programming Algorithms and techniques to solve any particular problem etc
rachit chhabra (1 year ago)
This is a gold mine!! Sincere thanks from my side
Nice compliments on Data Structures and Algorithms
Asghar Nazir (1 year ago)
at 1:14:40 I think there is a mistake n should be the number of columns, not the number of rows
may be some think missed thanks for your corrections! in Data Structures and Algorithms
Asghar Nazir (1 year ago)
Can we have these slides also, please
try to find out presentation for Data Structures and Algorithms but not yet available
Nikhil Lele (1 year ago)
some corrections needed in the lecture :- 1) 1:22:23 In general, NxN tri-diagonal matrix can be stored into N(N+1) /2 array. Not N(N-1)/2
Thanks for your compliments in Data Structures and Algorithms but its not possible to yet add it...
Milton Landriel (1 year ago)
No hash tables? :(
off course its a huge section some think may missed but i tried to Data Structures and Algorithms complete tutorial and necessary and most wanted
Rafay Qureshi (1 year ago)
Thank you for the great explanation.
Mike P (1 year ago)
This is awesome!
Thanks to like Data Structures and Algorithms Complete Tutorial
shridhar dongare (1 year ago)
thanks for sharing
Anes P.A (1 year ago)
Hi sir, In time 37:07 , how this pseudo code work fine for X=3 and Y=6 ?
see the whole Data Structures and Algorithms Complete Tutorial
geetha nalini (1 year ago)
it helps me a lot
Thanks to like Data Structures and Algorithms Made Easy
geetha nalini (1 year ago)
nyc video
Thanks to like Data Structures and Algorithms Complete Tutorials
No Body (1 year ago)
Is there a way or a site where we can download the content, the sheets?
still not but try to arrange for you... about Data Structures and Algorithms Complete Tutorials
nicholas stearns (1 year ago)
Correct me if I'm wrong but the explanation of shell sort in this video is incorrect. Shell sort is performing an insertion sort on the subarray of elements a whose distance is the increment. What's explained here is a kind of bubble sort on that subarray that doesn't actually work. The pseudocode might still be correct, however.
Jyotirmay Senapati (1 year ago)
Formula to store a tri-diagonal matrix into an array (1:22:15) is wrong. It will be N(N+1)/2 where as N(N-1)/2 is presented. Please let me correct, if I am wrong.
Rafay Qureshi (1 year ago)
Yes, you are right. It got me too. e.g. N(N+1)/2 => 4(5)/2 = 10, (correct), but, if we calculate N(N-1)/2 => 4(3)/2 = 6, which is incorrect. Mistakes could happen :)
Ramesh Yakkala (1 year ago)
Abdullah Rabea (1 year ago)
It will be amazing if there is a link to the slides used in the video, for later quick review. :)
Alesia Nakipava (5 months ago)
Abdullah Rabea did you find them ?
ravi theja (1 year ago)
where can I download the slides for reference @Computer Education For All ??
Saurodeep Kar (1 year ago)
Where's the demonstration part ?
Chaitanya Keskar (1 year ago)
thank u so much ..
an nguyễn (1 year ago)
download ebook pdf .
nyabwa fredrick (1 year ago)
good representation !
najeh mchirgui (1 year ago)
Thanks you so much
Lavuvzu Surat (1 year ago)
1:14:39 N cannot be the number of rows, it's the number of columns = number of elements in a row
Lavuvzu Surat (1 year ago)
1:01:52 SIZE is can not be the number of elements in the Array, but the size of an Element.

Would you like to comment?

Join YouTube for a free account, or sign in if you are already a member.