00:01 Complete data structures and helpful hand written notes 01:54 Introduction to various data structures 05:30 Difference between linear and non-linear data structures 07:13 Linear data structures have memory utilization disadvantage 11:03 Understanding linear data structures and array operations 12:50 Understanding one and two-dimensional arrays in data structures 16:16 How to calculate the address of array elements based on index position. 18:00 Understanding column major in data structures 20:56 Ordering and traversal in data structures 22:24 Traversing array elements and using for loop 25:24 Understanding position and index in arrays 26:47 Inserting and shifting elements in arrays 29:45 Deletion and shifting in data structures 31:10 Lost expensive watch and searching for it 33:59 Understanding random access and linked lists 35:32 Understanding the representation of linked lists 38:31 Understanding Node Pointers and Memory Allocation 40:04 Inserting data into a linked list 43:08 Traversing linked list and node pointers 44:35 Explanation of traversing a linked list till the last node 47:36 Traversal and search in linked list 49:03 Understanding linked list and variations of insert operation 51:48 Understanding the process of inserting a new node 53:11 Inserting and deleting nodes at the end of the list. 56:05 Managing addresses and connections in linked lists 57:39 Incrementing pointer increases flexibility and changes in code complexity 1:00:28 Understanding the process of node connection in data structures 1:02:02 Explanation of node addition in a data structure 1:04:49 Understanding deletion in data structures 1:06:13 Understanding node addressing and insertion in data structures 1:09:21 Deleting a node and updating the head in a circular linked list 1:10:53 Creating a circular linked list in data structures 1:13:52 Understanding the concept of stack data structure 1:15:21 Implementing array in static and dynamic nature 1:18:18 Understanding stack operations and pointers 1:19:47 Understanding stack and empty stack identification 1:22:41 Understanding stack operations and applications 1:24:23 Understanding the concept of postfix in data structures. 1:27:28 Understanding prefix notation in expressions 1:28:58 Understanding postfix notation and its application through traversal. 1:31:56 Understanding the order of operations in postfix expressions 1:33:26 Postfix notation for arithmetic operations 1:36:27 Understanding the hierarchy of operators in data structures 1:37:48 Understanding the structure of arithmetic expressions 1:40:33 Understanding the evaluation of postfix expressions using a stack 1:41:59 Understanding postfix notation and stack operations 1:45:01 Understanding the rules of insertion and deletion in stacks and queues 1:46:33 Understanding array indexing and overflow conditions. 1:49:43 Understanding the behavior of rear and front in queue operations. 1:51:17 Understanding memory utilization in linear data structure 1:54:26 Understanding circular queue movement 1:55:49 Discussion on queue implementation and operations 1:58:39 Leaf nodes are the lowest nodes with no children. 2:00:15 Understanding nodes and paths in a tree structure 2:03:46 Understanding the relationship between depth and height in tree nodes 2:05:17 Explaining the concept of a binary tree and its characteristics 2:08:14 Understanding full binary trees and tree filling direction 2:09:43 Understanding complete and perfect binary trees 2:12:45 Generate in order, preorder, and post order traverse for a given tree. 2:14:30 Understanding the order of nodes in the middle 2:17:33 Understanding the allocation of nodes in arrays 2:19:08 Understanding binary trees and linked lists 2:22:16 Binary Search Tree (BST) makes searching easy 2:23:44 Binary search tree optimizes searching 2:26:46 It is important to understand the impact of deleting leaf nodes in a tree structure. 2:28:20 Understanding the deletion of nodes from a binary search tree. 2:31:24 Understanding balance factor and its significance 2:33:00 Understanding how to correct the balance when disturbed 2:36:25 Understanding left and right rotation in data structures 2:37:55 Understanding AVL tree insertion and balancing 2:40:55 Maintaining BST property through rotation 2:42:27 Balancing a disturbed 14 2:45:27 Deleting nodes in a binary search tree can cause balance factor issues 2:46:58 Understanding complete binary trees and properties Crafted by Merlin AI.
I have my interview on 12-aug-2024 and it is completely based on DSA,this video is just awesome, now I know each and every datastructures i can attend my interview confidently. thank you so much brother.
@@saikiran2831 it was good, but the company's expectations were very high , they wanted multiple other technologies to be known apart from DSA. The problems which they gave me was Advanced level of Leetcode and hackerrank there were 3 problems given in which I was able to solve 2 of them the 2nd problem was of more advanced level which was based on graphs.
Sir please make playlist on internet of things(iot) thank you sir ❤ Introduction to Internet of Things: Application areas of IoT, Characteristics of IoT, Things in IoT, IoT stack, Enabling technologies, IoT challenges, IoT levels, IoT and cyber physical system, IoT and WSN 04 2 Sensors, Microcontrollers, and Their Interfacing: Sensor interfacing, Types of sensors, Controlling sensors, Microcontrollers, ARM 04 3 Protocols for IoT : Messaging protocols, Transport protocols, IPv4, IPv6, URI 06 4 Cloud for IoT: IoT and cloud, Fog computing, Security in cloud, Case study 04 5 Application Building with IoT: Various application of IoT : Food, Healthcare, Lavatory maintenance, Water quality, Warehouse, Retail, Driver Assistance, Collision impact 04 6 Arduino and Raspberry Pi: Arduino : Architecture, Programming and Application Raspberry Pi : Architecture, Programming and Application 06 7 IoT Security: Various security issues and need, architecture, requirement, challenges and algorithms
Apka boht boht sukrea sir dill sy apki waja sy hmri Degree asan hui apki waja sy hmry subject pass huye apki waja sy Hmy finals achy huye sara credit apko jata h Khush raho Sir Or Abaad raho
The explanation of DSA concepts was truly exceptional. It was clear, concise, and to the point, with very simple examples that made the theory easy to grasp. I really appreciated the straightforward approach and found the video extremely helpful.
No no no no sir i am missing your super energized body languages in this video .... here u r just talking like others 😿........ may be not only me others will also miss those extra emotions in your teaching method that made u more unique
Such a great video sir...... I really appreciate your hardwork for us😊😊.... You really explain well and its really good for quick revision... All concepts are well explained ☺️ Thnku so much sir for the efforts
Sir main share jarur karunga but mere exam ke baad, nah to baaki sab bhi to sikh lanege..😁.. You are beyond the limit sir.. Thank you so so much.. Agar possible ho to MCQ ka 1 shot video bana dete sir.
sir please please can you make a complete playlist on CCNA, there's no updated CCNA course in Hindi , pls help me I need to pass CCNA in 2 months , please make a complete playlist you are my only hope 😢😢
mashallah teaching concepts with easy examples ...salute u sir ....i have watched no of videous so that i can get comfortable way of learninhg which i have found here now..thank yoiu sir keep risign and shinihn
Sir I am studing Data Structures first time in my Life... And Sir Believe me You made all these topics easy for me... I never thought that in this concise Video, you are able to teach me so much. Thank you Sir, Thank you very much.
% MATLAB code to compute and plot the frequency response of a series RLC circuit % Define circuit parameters R = 10; % Resistance in ohms L = 0.01; % Inductance in henries C = 100e-6; % Capacitance in farads % Define the transfer function H(s) = 1 / (s^2*L*C + s*R*C + 1) numerator = [1]; % Numerator: 1 (constant in the numerator) denominator = [L*C, R*C, 1]; % Denominator: s^2*L*C + s*R*C + 1 % Create the transfer function H = tf(numerator, denominator); % Plot the Bode plot (frequency response) bode(H); grid on; title('Frequency Response of Series RLC Circuit'); % Optionally, plot using freqz for another way of visualizing % You may uncomment the following lines if you'd like to use freqz % [h, w] = freqz(numerator, denominator, 'half'); % figure; % plot(w, abs(h)); % xlabel('Frequency (rad/s)'); % ylabel('Magnitude'); % title('Frequency Response of Series RLC Circuit'); % grid on;
00:01 Complete data structures and helpful hand written notes
01:54 Introduction to various data structures
05:30 Difference between linear and non-linear data structures
07:13 Linear data structures have memory utilization disadvantage
11:03 Understanding linear data structures and array operations
12:50 Understanding one and two-dimensional arrays in data structures
16:16 How to calculate the address of array elements based on index position.
18:00 Understanding column major in data structures
20:56 Ordering and traversal in data structures
22:24 Traversing array elements and using for loop
25:24 Understanding position and index in arrays
26:47 Inserting and shifting elements in arrays
29:45 Deletion and shifting in data structures
31:10 Lost expensive watch and searching for it
33:59 Understanding random access and linked lists
35:32 Understanding the representation of linked lists
38:31 Understanding Node Pointers and Memory Allocation
40:04 Inserting data into a linked list
43:08 Traversing linked list and node pointers
44:35 Explanation of traversing a linked list till the last node
47:36 Traversal and search in linked list
49:03 Understanding linked list and variations of insert operation
51:48 Understanding the process of inserting a new node
53:11 Inserting and deleting nodes at the end of the list.
56:05 Managing addresses and connections in linked lists
57:39 Incrementing pointer increases flexibility and changes in code complexity
1:00:28 Understanding the process of node connection in data structures
1:02:02 Explanation of node addition in a data structure
1:04:49 Understanding deletion in data structures
1:06:13 Understanding node addressing and insertion in data structures
1:09:21 Deleting a node and updating the head in a circular linked list
1:10:53 Creating a circular linked list in data structures
1:13:52 Understanding the concept of stack data structure
1:15:21 Implementing array in static and dynamic nature
1:18:18 Understanding stack operations and pointers
1:19:47 Understanding stack and empty stack identification
1:22:41 Understanding stack operations and applications
1:24:23 Understanding the concept of postfix in data structures.
1:27:28 Understanding prefix notation in expressions
1:28:58 Understanding postfix notation and its application through traversal.
1:31:56 Understanding the order of operations in postfix expressions
1:33:26 Postfix notation for arithmetic operations
1:36:27 Understanding the hierarchy of operators in data structures
1:37:48 Understanding the structure of arithmetic expressions
1:40:33 Understanding the evaluation of postfix expressions using a stack
1:41:59 Understanding postfix notation and stack operations
1:45:01 Understanding the rules of insertion and deletion in stacks and queues
1:46:33 Understanding array indexing and overflow conditions.
1:49:43 Understanding the behavior of rear and front in queue operations.
1:51:17 Understanding memory utilization in linear data structure
1:54:26 Understanding circular queue movement
1:55:49 Discussion on queue implementation and operations
1:58:39 Leaf nodes are the lowest nodes with no children.
2:00:15 Understanding nodes and paths in a tree structure
2:03:46 Understanding the relationship between depth and height in tree nodes
2:05:17 Explaining the concept of a binary tree and its characteristics
2:08:14 Understanding full binary trees and tree filling direction
2:09:43 Understanding complete and perfect binary trees
2:12:45 Generate in order, preorder, and post order traverse for a given tree.
2:14:30 Understanding the order of nodes in the middle
2:17:33 Understanding the allocation of nodes in arrays
2:19:08 Understanding binary trees and linked lists
2:22:16 Binary Search Tree (BST) makes searching easy
2:23:44 Binary search tree optimizes searching
2:26:46 It is important to understand the impact of deleting leaf nodes in a tree structure.
2:28:20 Understanding the deletion of nodes from a binary search tree.
2:31:24 Understanding balance factor and its significance
2:33:00 Understanding how to correct the balance when disturbed
2:36:25 Understanding left and right rotation in data structures
2:37:55 Understanding AVL tree insertion and balancing
2:40:55 Maintaining BST property through rotation
2:42:27 Balancing a disturbed 14
2:45:27 Deleting nodes in a binary search tree can cause balance factor issues
2:46:58 Understanding complete binary trees and properties
Crafted by Merlin AI.
Bro you just🤯🤯🤯🤯
best video for refreshing DSA concepts , really appericiate your efforts sir .
Description ke Links dekh kar Mujhe Itni Khushi Hui Main Aap Ko Bata Nahi Sakta😊
aap donate karke bata sakte hain, ki aap kitne khush hain...☺
I have my interview on 12-aug-2024 and it is completely based on DSA,this video is just awesome, now I know each and every datastructures i can attend my interview confidently. thank you so much brother.
How was ur interview brother??
@@saikiran2831 it was good, but the company's expectations were very high , they wanted multiple other technologies to be known apart from DSA. The problems which they gave me was Advanced level of Leetcode and hackerrank there were 3 problems given in which I was able to solve 2 of them the 2nd problem was of more advanced level which was based on graphs.
Did you got selected?
@@girlysh09 nope
@@drvelocityracerkannada why? Where you lack?
Thank you sir🎉 apki videos dekh ke hi mere Puri engineering honours mai complete hue hai ... Again thanks 🙏
Job laga kya bhai?
@@moushufalam7521 nahi 😂😂🤣🤣🤣🤣
premium content sir, best revision in one shot
Sir please make playlist on internet of things(iot) thank you sir ❤
Introduction to Internet of Things:
Application areas of IoT, Characteristics of IoT, Things in IoT, IoT stack, Enabling
technologies, IoT challenges, IoT levels, IoT and cyber physical system, IoT and
WSN
04
2 Sensors, Microcontrollers, and Their Interfacing:
Sensor interfacing, Types of sensors, Controlling sensors, Microcontrollers, ARM
04
3 Protocols for IoT :
Messaging protocols, Transport protocols, IPv4, IPv6, URI
06
4 Cloud for IoT:
IoT and cloud, Fog computing, Security in cloud, Case study
04
5 Application Building with IoT:
Various application of IoT : Food, Healthcare, Lavatory maintenance, Water quality,
Warehouse, Retail, Driver Assistance, Collision impact
04
6 Arduino and Raspberry Pi:
Arduino : Architecture, Programming and Application
Raspberry Pi : Architecture, Programming and Application
06
7 IoT Security:
Various security issues and need, architecture, requirement, challenges and algorithms
DS theory 🤡 DS coding💀
Nice one 😂😂😂
Bhai ye kaunsi language se hai?
@@Professor_Shonku_ bhai ye HTML CSS se h
@@tushar5568na bro it's assembly language
Bhai ye English language se hai@@Professor_Shonku_
Boht mast hai bro
U done it very well
Sary ka Sara he revise ho gaya
thankyou very much sir go for more 1 shot videos
tomorrow is my DSA Practical and today I am watch your 1 shot
Hari Omm Pranam Sir,
Kahin na kahin iss ka intezar thaa,
Dhanyavad aapka 🙏
The search operation example in array is so damnn funny🤣🤣🤣, thank you sir for making boring study more memorable and joyfull
As a interview and for competitive purpose,i think, there is a great session on UA-cam. Thanks for this @5 min. Engineer.
Apka boht boht sukrea sir dill sy apki waja sy hmri Degree asan hui apki waja sy hmry subject pass huye apki waja sy Hmy finals achy huye sara credit apko jata h Khush raho Sir Or Abaad raho
Thank you so much Bhai ❤️ you're doing great
Sir Algorithms lecture in one shot please
Searching operation wala example mast tha... 😄🎉
The explanation of DSA concepts was truly exceptional. It was clear, concise, and to the point, with very simple examples that made the theory easy to grasp. I really appreciated the straightforward approach and found the video extremely helpful.
Sir kal paper hai university or aj mene puri ds complete ✅ kar li thankyou ❤❤❤
best for revision.
.Thank U
semester saver...great way of teaching
Correction at 2:08:42 ---> Second Example of Full Binary Tree is Correct according to the defination
Yup bro
Really thanks sir because of you i can guarantee that this time ill pass this time thanks at lot sir
Most underrated DSA teacher !!!! 🫂🫂🫂
No no no no sir
i am missing your super energized body languages in this video .... here u r just talking like others 😿........ may be not only me others will also miss those extra emotions in your teaching method that made u more unique
i had same concept in my 12th cs but my teachers didnt thought at all this way ...great sir thankyou so much ....
i think first video more than 30 minutes. Great job sir. Keep it up
Thank youuuuuuuu soo much sir apke videos hamesha muje bacha lete hai.....🙏🏻🌟😊😊😊
Such a great video sir......
I really appreciate your hardwork for us😊😊....
You really explain well and its really good for quick revision...
All concepts are well explained ☺️
Thnku so much sir for the efforts
Ok thanks beta 😂😂😂
@@AbhishekTripathi-cx4hu 👀👀
Thank you so much sir ❤
Apka explain krne ka tarika ...touch wood nazar na lgee....🧿bhaut bhaut acha hai .....thank you sir 🙏❤️🙏
your row major part is not in the video... after one dim array it switch directly to col major skipping the explanation part of row major...
Looking for this comment .
Thanku so much for providing this.......!!!❤
Sir main share jarur karunga but mere exam ke baad, nah to baaki sab bhi to sikh lanege..😁.. You are beyond the limit sir.. Thank you so so much.. Agar possible ho to MCQ ka 1 shot video bana dete sir.
😂😂
Thanku bhaiya this content is very helpfull
thank you so much sir words are not enough for thanking you
Thanks a lot sir for such wonderful video. Really appreciated sir and I hope you get tons of likes and love from everyone.😇
Wonderful lecture.
Superb and fantastic !! ✅✅
Thanks a lot !!
Sir , you are great and Goru of explanation, may God bless you and grant you health wealth and success ameen, I m from Lahore Pakistan. Regards
Thank you sir... You are the last minute saviour...♥️♥️
thank your sirrr......bohut kamal ka hai yehhhh
thanku so much for this guidence 💝💝
Thank you so much sir
What a great vedio ❤
Thnku sir.....😇😇 im very grateful 🙏
the way you made me revise so well!
Thank you So much Sir, You have became a life saver.
Thank you soo much sir ,best method of teaching with great content ❤
Dhanyvad❤
Thank you for the insightful lecture........... It was incredibly helpful.💜💜💜💜💜💜💜
Design and analysis of algorithms 1 shot sir
Thank you so much sir ❤ love your content❤❤❤❤
sir please please can you make a complete playlist on CCNA, there's no updated CCNA course in Hindi , pls help me I need to pass CCNA in 2 months , please make a complete playlist you are my only hope 😢😢
Best DSA Revison Video
Thanku so much sir...amazing♥
😂😂BHAII 10 MARK'S KA BENEFIT HUAA DHANYVADD 😊🎉❤❤
2:16:19 best 🫢
Mera exm kl h or m Aaj dekh k pss hojaunga 😊😂😂
Aap ka exam kaisa hua
Kis clg se ho aap
pass hua ?
@@radhikachauhan2643aksar khamos lafzo ka matlab na hota hai 😊😂
Mera v kal he 😂
6month study= 4 hours study 😂😂😂🎉
😅😅😅
4 Hours study= Brain 4 year reading
4 hour study > 6 month study
mashallah teaching concepts with easy examples ...salute u sir ....i have watched no of videous so that i can get comfortable way of learninhg which i have found here now..thank yoiu sir keep risign and shinihn
Sir I am studing Data Structures first time in my Life...
And Sir Believe me You made all these topics easy for me...
I never thought that in this concise Video, you are able to teach me so much.
Thank you Sir, Thank you very much.
sir you skipped some minutes in the video. It starts directly after column major form, skipping the 2d matrix and row mojor form
sir ji ,17:54 time pe kuch garbar lagraha he, i think video skip ho geya keya ??
Happy Teachers Day Guru Ji 😍
Queue means: Piche (rear) Dalo & Mu (front) se Nikalo
% MATLAB code to compute and plot the frequency response of a series RLC circuit
% Define circuit parameters
R = 10; % Resistance in ohms
L = 0.01; % Inductance in henries
C = 100e-6; % Capacitance in farads
% Define the transfer function H(s) = 1 / (s^2*L*C + s*R*C + 1)
numerator = [1]; % Numerator: 1 (constant in the numerator)
denominator = [L*C, R*C, 1]; % Denominator: s^2*L*C + s*R*C + 1
% Create the transfer function
H = tf(numerator, denominator);
% Plot the Bode plot (frequency response)
bode(H);
grid on;
title('Frequency Response of Series RLC Circuit');
% Optionally, plot using freqz for another way of visualizing
% You may uncomment the following lines if you'd like to use freqz
% [h, w] = freqz(numerator, denominator, 'half');
% figure;
% plot(w, abs(h));
% xlabel('Frequency (rad/s)');
% ylabel('Magnitude');
% title('Frequency Response of Series RLC Circuit');
% grid on;
Sir one shot video on Mathematics that required for software engineer ❤
sir apka explain karne ka tarika bhot acha lagta h
Thank you so much ❤️
Aise hi c++ cover krvaiye sir...
+3 stream physical science BSC semistar1 2024 ke liye vedio banao sir.....
Perfect video ❤
nice bro😘😘 premium content
thanks you so much sir this video is very help full sir so thank you so much sir😊😊😊😊😊😊
20:57, 1005 hoga bcz Lr ki value 0 nahi 2 hai
Loved the way of your explanation 😂😂👌
Sir C language ka one shot please 🙏
2D Array kaat diya sir.
Thanks a lot for the video bhai
Thank you sir ❤❤
Good job bro ❤
Thanks sir, really helpful!
THANK YOU SIR JI
Best summary video👏🏻👏🏻
❤❤❤❤ thank you so much ♥️♥️
Kal interview he mera me aaj ye video dekh ke interview clear kar lunga 😎😅
Respect button for acharya Prashant ❤❤❤❤❤
The best tutorial
Well explained.
Superb Sir🤩🤩
Paper mein algo aati hai so please one video for all algo. Please sir❤❤❤❤❤❤❤❤❤❤❤❤❤❤
Thank you so much sir ❤
Sir. Ye video competitive exam ke leye bhi kaam aayegi ? Jisme ye topics puche jate hai
computer orhanisation and digital logic or machine learning ka one shot sir
mera 4 din me exam hai ab aap hi sahar ho sir ji
Kis chiz ka exam hai appka
is this lecture is good for study who have zero knowledge of DSA ??
Very nice explaination sir ❤❤
Thank you very much Sir.
Is this a whole theory lecture enough for bca semester exam?
Sir design and analysis of algorithms ki video please .....
kya baat kya baat kya baat ... wahh no wards ...
You are the bestest