Currently in my 5th semester found yours videos for the first time,you explain the concepts in a very complete manner...but there are certain topics missing form the video but still I'll try to complete them form other sources..hope I score good marks..thankyou sir
sir apke video and notes ki vjha se hi mera TAFL ka exam clear hua hai kuch bhi nhi ata tha bss apke video ko dekha tha exam ke 2 din pehle thank you sir :)
confusion : sir aapne 22:58 per omega ko worst case kaha fir 28:38 per aapne BigO ko worst case and omega ko best case kaha, please clarify. Thankyou for this lecture 👍
After watched this video i lost my vocabulary data and i have no word to say that how this video helpful for me thank you so much sir ❤❤❤❤ Please make the other series on OS, COA , TOC , Networking,. Engineering Mathematics.....love you sir ❤❤❤❤
28:51 big O- upper limit, worst case Big theta- lower limit, best case 50:47 a = number of sub problems in recursion n/b = size of each sub problem f(n) = cost( Divide.the problem to subroblem &. Combine the solution of subroblems)
Unit-1: Introduction to Algorithm
What is an Algorithm? - 00:05:00
Efficiency of Algorithms - 00:15:00
Analysis of Algorithms - 00:25:00
Space and Time Complexities - 00:35:00
Fundamental Algorithms - 00:45:00
Unit-2: Introduction to data structures
Basic Terminology - 01:00:00
Primitive Data Structure Operations - 01:10:00
Stacks - 01:20:00
Queues - 01:30:00
Linked Lists - 01:40:00
Binary Trees - 01:50:00
Graphs - 02:00:00
Unit-3: Tree and Graph
Minimum Spanning Trees - 02:10:00
Kruskal's Algorithm - 02:20:00
Prim's Algorithm - 02:30:00
DFS and BFS - 02:40:00
Single-Source Shortest Paths - 02:50:00
Bellman-Ford Algorithm - 03:00:00
Unit-4: Sorting and Searching
Introduction to Searching and Sorting - 03:10:00
Linear Search - 03:20:00
Binary Search - 03:30:00
Selection Sort - 03:40:00
Bubble Sort - 03:50:00
Insertion Sort - 04:00:00
Merge Sort - 04:10:00
Complexities of Sorting and Searching Algorithms - 04:20:00
Unit-5: Divide and Conquer Techniques
Divide and Conquer - 04:30:00
Binary Search - 04:40:00
Merge Sort - 04:50:00
Strassen's Matrix Multiplication - 05:00:00
Unit-6: Advanced Data Structures
Greedy Method - 05:10:00
Container Loading Knapsack Problem - 05:20:00
Dynamic Programming - 05:30:00
NP Theory - 05:40:00
thank you brother 9.5 hours main exam h
@@ultimategamingz4353 goodluck, bro
Mai academic k time apne saare dosto ko aapki videos dikhata tha , u just clear any topic in just a few minutes.!!
Sorting techniques algorithm :
1:16:52 Bubble sort
1:28:02 Selection sort
1:34:12 Insertion sort
1:43:28 Count sort
2:11:03 merge sort
2:22:12 Quick sort
2:53:35 activity algorithm
1:43:28
Sir , aap jo kaam krte ho na . Aap hamesha yehi krte rehna.! Mai aapki videos 2018 se dekh rha hu , jab aapke bahut minimum subscriber hu krte the.
Jo abhi bhi h
Toh bhai tu pass nahin hua hai kya ab tak 😂
Thank you so much for such a course .... ❤ From Pakistan
Love from India.
Currently in my 5th semester found yours videos for the first time,you explain the concepts in a very complete manner...but there are certain topics missing form the video but still I'll try to complete them form other sources..hope I score good marks..thankyou sir
sir salute hai apko pura video 1 jagha baith ke finish kardiya thank you so much sir 🙏🙏🙏🙏🙏🙏🙏🙏🙏🙏
Wow sir, thank you for putting such great effort for us.
1:35:53 condition should be key < arr[j] not key < arr[i]
sir apke video and notes ki vjha se hi mera TAFL ka exam clear hua hai kuch bhi nhi ata tha bss apke video ko dekha tha exam ke 2 din pehle thank you sir :)
Bhai notes kaha milega
@@physicsnote7081 description me mil jyga bhai
Thank you so much for sir ,for make these all video, this is helpful for us🙏🏻
outstanding sir
Really Love you sir Dil se ❤❤
Thankyou so so much sir for providing such helpfull lacture ❤❤
thank you so much sir , apke wajah se exam achha gya
Best notes for DAA i have seen so far on youtube
Finally 🤗Tysm Sir
Really Love you sir ❤❤
Respect for you Sir. 🙏🙏
your video is very helpful (thank u so much sir)
Main Point : = Time is precious ..😎
Best hai sir ji aap ❤
thank you so much Sir ji
Love u Guruji . It helps me and people like me a lot ♥♥❣❣👋👋🥰🥰
Sir computer networking 1 shot complete pls😢😢😢😢🙏🙏🙏🙏
Bro sir konse university se padha rhe b
Bro tu pass ho gya cn mai ?@@vaibhavawpl2718
Iska notes kaha milega bhai
The God channel
Sir Ji Tusii Great Ho ❤
aye haye maza aa gaya!!
Thank you so much sir ❤
Thank u so much sir❤🙏
confusion : sir aapne 22:58 per omega ko worst case kaha
fir 28:38 per aapne BigO ko worst case and omega ko best case kaha, please clarify.
Thankyou for this lecture 👍
Omega(n) means bestcase
and BigO(n) means worst case
After watched this video i lost my vocabulary data and i have no word to say that how this video helpful for me thank you so much sir ❤❤❤❤
Please make the other series on OS, COA , TOC , Networking,. Engineering Mathematics.....love you sir ❤❤❤❤
Yes sir pls
Sir pls networking,os krwa do jldi
Whole Semister in just 6Hrs 😅 But Video is really very nice ❤
Thank You sir
3:40:38 bhojpuri "galat resultwa mil raha tha" was epic sirji 😂
3:08:35 Sir ne to pol khol di!!
Salute
Sir there are too many ads in your video
Which disturbs our reading flow a lot.
Thank You
use u blok origin extension
Thank you so much sir ☺️
5:42:00 0/1 knapsack
Students' God 🙏
First comment
Please like sir...❤❤
Plz sabhi definition bhi likhiye kre notes revise krte time help milti h
You're a good person, your courses are a great resource to get comfortable with apprently scary courses of CS.
Thanks man
2:17:09 Merge fn ka snippet?
Sir really you help me alot ❤❤❤❤
🙂🙂sir you are amazing ❤❤❤❤
Yeah
@@mrinmoychowdhury9165
Merge Sort: 02:05:37
2:06:00 - Merge Sort
Thanks sir
Iska notes kaha milega bro
Sir this video can useful for Gate Exam
Yes Ji
thank you sir ,,,,,,,,
ekach number
god level chapter
3:49:30 main jo iteration 3 mai C ki value update ki hai bo too hun iteration 1st mai bhe change kr skte the na too asa kyun 😒
Can I understand this without knowing much about data structure?
keep it up 🤩
Sir yeh konse syllabus se affiliated h
Sir please tell where can i have ur notes
Discretion me link ba bhaiya ab tohra Logan ke bhojpuri me samjave ke pari ka 😂
😇
WATCHING THIS SHOT ON 1 AND PAPER AT 11 AM
hashing is same for data structure and DAA?
11:23 moment capture ho gya 😂
helpful
👍
Iska notes kaha mielba guys
1:00:30
Time is 10.27 and paper is from 11
Sir optimization technique in one shot please
Graphic lab notes sir ?? Waiting
in notation
28:51
big O- upper limit, worst case
Big theta- lower limit, best case
50:47
a = number of sub problems in recursion
n/b = size of each sub problem
f(n) = cost( Divide.the problem to subroblem &. Combine the solution of subroblems)
Sir ye video Dekh ke aktu 2024-25 m pass ho jaayenge kya please reply me❤
Bro iska notes kaha milega 😊
IGNOU mca ke liye useful h ??
avi half an hour tk video dekha usme aap khud confuse h worst case ko leke.. kavi omega ko worst case bolte h kavi bigO ko
sir please make toc one shot
2:47:20 30 april
❤
🥰🥰
Sir notes mei sab kuch nahi h please full notes wala dijiye
your linkdin ?
Sir Engineering physics one shot please
Cuet pg MCA ke liye ye useful h kya
is this aoa of eng sem 4??
32:30
Bhaiya object oriented programming pe video please
5:06:10
7:56 bhai cold coffee piyunga😂
Sir c programming one shot please sir
Isko Google aur microsoft ka ceo hona chahiye ki sundar pichai ko
Sir..
Is this course will help to batter understanding on Algorithm and will help for placement....?
Plzz reply anyone
Yes ji.
no
@@codingworld_official Than plzz recommend other video for that👆
@@vmstudy9965 what you want to learn ?
Tomorrow I'm going to 50 😢
2nd figure rong hai
"Wrong" ki spelling wrong hai😂
Its 12 PM on 29 MAY 2024, My paper is in 8AM on 30 MAY 2024
Bro can you please provide me your questions paper bcoz I also have exam of daa tomorrow
❤❤
Can I understand this without knowing much about data structure?
thank you sir
Thank you sir
Thank you very much sir❤