@@muhammadmanekia9041 He is from Hyderabad, Telengana, Andhra Pradesh, INDIA. You see his Facebook page where his school, college name given. Search that college internet.
i got goosebumps - sir you are so knowledgeable and wow at explaining- must have even prepared hard before delivering videos like this with such amazing content- much respect
*Key Takeaways:* - algorithms are written in pseudocode, as long as the intended audience can understand it, it's good enough - in pseudocode, you can use various conventions for assignment: "a = b", "a := b", and even "a
Thank you sir.. I am a First year engineering student and I am Completing my all course online instead of Listening my professor's lecture.. For C++ and data structure and algo I have taken your course on udemy and for Algorithms I follow your RUclips channel and after Completing all these for java I will also take your udemy course😎😅 . Your teaching style is just awesome. Thank you
I like how he calming, adjust himself by saying "...and furthermore, if you have any other..." Why dont WE have a professor like you. PLEASE SIR COME TO THE UNITED STATES!!!
I am from Pakistan and I am a self taught developer who got a Bachelor in Accounting and Finance, although I have learned a lot of statistics in my degree but we did not learn Computer Science so I really needed to learn that and after finding your course I am relived. Allah ap ko kush rakhay or ap ko is ka ajar day nai to kon ye cheezain free main batata hay.
00:26 📝 When writing an algorithm, data types and variable declarations are not necessary; focus on understanding the logic and steps. 02:40 🕐 Time efficiency is a crucial criterion for algorithm analysis; it determines how quickly a procedure or algorithm produces results. 03:25 🚀 Space efficiency is another important criterion; analyze how much memory space an algorithm consumes during execution. 04:04 🔄 Data transfer and network consumption are significant considerations, especially in internet-based or cloud-based applications. 05:22 ⚙ Other criteria for analysis include power consumption, CPU usage, and specific project requirements, depending on the application. 06:57 🔄 Time complexity is evaluated based on the number of basic statements in an algorithm, each considered as one unit of time. 09:35 🧮 Space complexity is determined by the number of variables used; it's often represented as a constant, indicating the order of 1.
Sir this is so satisfying. You know how to make someone understand easily. You are greatest in this topic with absolutely no doubt. Loved your full series. Thanks a lot. Respect+
You are the best of all the teachers available on you tube as your way of teaching is awesome and most importantly you understand what are the problems faced by the students and teach in the way to get rid of it.Thank you sir, thank you very much.
Just started watching this series #feeling peace of mind #knowledge #superb explanation - bike and mars wala example was epic ...lots of love and respect .
Lecture 1.3 How Write and Analyze Algorithm What to analyze: -------------------------- Traditional: 1 Time - How much time does it take to run the alhorithms - we get a time function 2 Space - How much memory does the algorthm claim Others: 3 Network consumption - How much data transfere is done from a server/ cloud 4 Power consumption - importaint for mobile/tablet (eg. write memory operations require a lot of power) 5 CPU Registers Consumed - Time analysis: ---------------------- Assumed cost for single statements (simple, not nested): 1 unit of time e.g. algoritm Swap(a, b) { temp = a; // cost = 1 a = b; // cost = 1 b = temp; // cost = 1 } // total cost: f(n) = 3 f(n) does not vary as a function of a or b => constant time complexity O(1) Somewhat-nested statements (e.g. 5*a + 6*b) - For the sake of simplicity; assume cost = 1 unit of cost In principle we could translate everything into machine code to find the actual number of CPU operations - but in practice we generally care about order of magnitude, and so we dont. Space analysis: ------------------------ Assumed cost for variables (simple, not objects etc): 1 word (words instead of e.g. bytes, because we care about order of magnintude, not the exact number of bytes needed to store the variable) Eg for Swap: S(n) = len(a, b, temp) = 3 words S(n) does not vary as a function of a or b => constant memory complexity O(1)
00:03 Writing a program in a specific language requires declaration of data types and temporary variables. 01:26 Algorithms are procedures for solving problems. 02:40 The important criteria for analyzing algorithms are time efficiency and space consumption. 04:09 Network consumption, criteria for data transfer and power consumption are important factors to consider when developing algorithms or writing programs. 05:36 The time analysis is important in analyzing the project. 06:44 The time complexity of the given statement is considered to be constant 08:03 Analysis and planning are essential for successful missions 09:20 Space analysis result
Fantastic explanations. Love your videos! It's interesting how you say for example "5 into a", which actually means a divided by 5, i.e. how many times does 5 go into a, when you're really taking about multiplication, 5 times a. Yes, I'm nitpicking. You give fantastic explanations. Thank you!
You should put RUclips add on right place. Add should be play between two topic not in between any topic as it suddenly break concentration during understanding topic. By the way you explain every topic in excellent way.
thank you, sir, pleaser to see your class, I think you are a Bengali if you have enough time please start Chennail . manny of diploma engineering students can be benefited by your classes.
I think the use of word for space used comes from the hardware name for the size of a register. Different architectures will have a different n-byte basic registers but in any case that basic size will be referred to as a 'word'.
In the book Narasimha Karumanchi (Data Structures and Algorithms Made Easy) in Page num: 17, section 1.9 How to Compare Algorithms, stated that Execution times is not a good measure as execution times are specific to particular computer, and also number of statements executed is also not a good measure, since the number of statement varies with the programming language as well as the style of the individual programmer. So Ideal solution is that to find function f(n) to compare.
Hi sir What willbe time comolexity of in build functions? For eg class string has methods like length, substring, indexof... Etc how to calculate timr complexity
sir apki explain bhot ache hai lkin sir plz make your videos in hindi for this course and other becoz there are lot of teacher for english but a few teacher teach in hindi but not effective style and your work is very nice so i want and requsted to you
As some of you have asked for, soft copy of the notes of the lectures. Here is the small contribution from my side to this brilliant Algorithm Lecture series. kumartechnicalarticles.wordpress.com/2019/04/08/notes-algorithms-by-abdul-bari/
![BLACK BAG - Official Trailer [HD] - Only in Theaters March 14](http://i.ytimg.com/vi/Du0Xp8WX_7I/mqdefault.jpg)
I decided to save time and look directly for Indian videos
Thank you : )
I hope our Indians teachers met your expectations 😁
@@rajeshsharmajaipur pretty sure he's Pakistani
@@muhammadmanekia9041 Lol, nice joke, once more.
@@muhammadmanekia9041 he's from india, see the channel about
@@muhammadmanekia9041 He is from Hyderabad, Telengana, Andhra Pradesh, INDIA. You see his Facebook page where his school, college name given. Search that college internet.
Note for self:
0:00 - How to write an algorithm
2:00 - How to analyse an algorithm
5:35 - Time analysis
9:18 - Space analysis
Thanks
Thank you
i got goosebumps - sir you are so knowledgeable and wow at explaining- must have even prepared hard before delivering videos like this with such amazing content- much respect
You got goosepimpled?
Each statement is one unit of time(Time analysis). Each variable is one word(Space analysis). Wow! Thank you for making it so easy to understand.
*Key Takeaways:*
- algorithms are written in pseudocode, as long as the intended audience can understand it, it's good enough
- in pseudocode, you can use various conventions for assignment: "a = b", "a := b", and even "a
thanks for summarising it
hey, at 7:40 shouldn't there be 6 statements for total statements instead of 4?
Thank you
Thanks bro
Mast mast😊😊😊😊😊
Thank you sir..
I am a First year engineering student and I am Completing my all course online instead of Listening my professor's lecture..
For C++ and data structure and algo I have taken your course on udemy and for Algorithms I follow your RUclips channel and after Completing all these for java I will also take your udemy course😎😅
.
Your teaching style is just awesome. Thank you
what are you doing now
bro do we have to take this algorithm course to do ds??
THE GUY IS GOOD
I like how he calming, adjust himself by saying "...and furthermore, if you have any other..." Why dont WE have a professor like you. PLEASE SIR COME TO THE UNITED STATES!!!
The best algorithm course I have ever seen. Thanks for sharing.
try this also #seekcoding
I MOSTLY SEE THAT MOST OF THE RUclipsR DONT EVEN REPLY BUT YOU DID
NICE JOB
I REALLY APPRECIATE.
try this also #seekcoding
@@SeekCoding you are doing great. A bit more consistency can do wonders for you
I am from Pakistan and I am a self taught developer who got a Bachelor in Accounting and Finance, although I have learned a lot of statistics in my degree but we did not learn Computer Science so I really needed to learn that and after finding your course I am relived. Allah ap ko kush rakhay or ap ko is ka ajar day nai to kon ye cheezain free main batata hay.
what are you doing now
Same
Pakistan ke log padhte bhi hai kya ????
I was searching for the best algorith course.I have stoped here and enagaged in the course.Thank you for the wonderful course.
i liked the way you said " the space is constant again" at 9:35
anyway very Good teacher :)
try this also #seekcoding
00:26 📝 When writing an algorithm, data types and variable declarations are not necessary; focus on understanding the logic and steps.
02:40 🕐 Time efficiency is a crucial criterion for algorithm analysis; it determines how quickly a procedure or algorithm produces results.
03:25 🚀 Space efficiency is another important criterion; analyze how much memory space an algorithm consumes during execution.
04:04 🔄 Data transfer and network consumption are significant considerations, especially in internet-based or cloud-based applications.
05:22 ⚙ Other criteria for analysis include power consumption, CPU usage, and specific project requirements, depending on the application.
06:57 🔄 Time complexity is evaluated based on the number of basic statements in an algorithm, each considered as one unit of time.
09:35 🧮 Space complexity is determined by the number of variables used; it's often represented as a constant, indicating the order of 1.
Thank you professor.Greetings from TURKEY. I appreaciate you !
This is the most underrated programming channel on youtube... Thank you!
This is among the most underrated channel.
My friends recommend you and when I see your first video I just get addicted to this playlist.
The best course I ever seen on youtube. Thank you so much sir G , I am really big fan of your very simple and easy to understand method.
The REAL teacher for avg engg colleges in the world, thanks man!
try this also #seekcoding
very understandable and straight to the point, thank you for putting these out. watching from germany
Sir this is so satisfying. You know how to make someone understand easily. You are greatest in this topic with absolutely no doubt. Loved your full series. Thanks a lot. Respect+
You are the best of all the teachers available on you tube as your way of teaching is awesome and most importantly you understand what are the problems faced by the students and teach in the way to get rid of it.Thank you sir, thank you very much.
Just one word that describes Abdul sir is " AWESOME".
the best course on algorithm you can find over the internet, thank you so much for your efforts, sir!🥳
i have taken your course on udemy and now i am watching your RUclips lecture thnx you ❤❤
Just started watching this series #feeling peace of mind #knowledge #superb explanation - bike and mars wala example was epic ...lots of love and respect .
Your explanation is good me n my friends are satisfied.
try this also #seekcoding
Thank you very much Sir.
I wrote my exam more than my expectations from myself only because of you. Thank you very much.
Lecture 1.3 How Write and Analyze Algorithm
What to analyze:
--------------------------
Traditional:
1 Time - How much time does it take to run the alhorithms
- we get a time function
2 Space - How much memory does the algorthm claim
Others:
3 Network consumption - How much data transfere is done from a server/ cloud
4 Power consumption - importaint for mobile/tablet (eg. write memory operations require a lot of power)
5 CPU Registers Consumed -
Time analysis:
----------------------
Assumed cost for single statements (simple, not nested): 1 unit of time
e.g.
algoritm Swap(a, b) {
temp = a; // cost = 1
a = b; // cost = 1
b = temp; // cost = 1
} // total cost: f(n) = 3
f(n) does not vary as a function of a or b => constant time complexity O(1)
Somewhat-nested statements (e.g. 5*a + 6*b) - For the sake of simplicity; assume cost = 1 unit of cost
In principle we could translate everything into machine code to find the actual number of CPU operations - but in practice we generally care about order of magnitude, and so we dont.
Space analysis:
------------------------
Assumed cost for variables (simple, not objects etc): 1 word
(words instead of e.g. bytes, because we care about order of magnintude, not the exact number of bytes needed to store the variable)
Eg for Swap: S(n) = len(a, b, temp) = 3 words
S(n) does not vary as a function of a or b => constant memory complexity O(1)
Your way of explaination is just amazing. Luckily i found your channel. Really hats of to your work🙏🙏
after this playlist, I can understand mit cow :D
thx sir for such a high quality content
Thanks for sharing the videos for free! Very clear and precise explaination with good examples.
00:03 Writing a program in a specific language requires declaration of data types and temporary variables.
01:26 Algorithms are procedures for solving problems.
02:40 The important criteria for analyzing algorithms are time efficiency and space consumption.
04:09 Network consumption, criteria for data transfer and power consumption are important factors to consider when developing algorithms or writing programs.
05:36 The time analysis is important in analyzing the project.
06:44 The time complexity of the given statement is considered to be constant
08:03 Analysis and planning are essential for successful missions
09:20 Space analysis result
Fantastic explanations. Love your videos! It's interesting how you say for example "5 into a", which actually means a divided by 5, i.e. how many times does 5 go into a, when you're really taking about multiplication, 5 times a. Yes, I'm nitpicking. You give fantastic explanations. Thank you!
In india - 5 into a is = 5xa . Learn to know the context of the person delivering the lecture before nitpicking
I love your video sir...straight to the point, concise and clear
I'm a newbie from Vietnam,I hope learn much of you
Simple and fresh like water. Thanks for you great explanation 😃
Thank you so much for sharing this course to us.
it'll help us a lot :) 😁
Thank u sir..... watching ur videos from ladakh during lockdown 2020
Sir, i have found your video very useful ..
Your way of explanation make beginners to start and make there base.
Your teaching is the best
Best wishes from Nepal...
What a tutorial. . One of best video across I found .
I have just completed 9th class,aspiring to be a software developer in google..
Your course have helped me a lot sir..
Thank you for sharing your knowledge & teaching us. Sir 😊
Sir you're making it very easy...keep it up sir.....
We're glad to have you here. And, you're a life saviour.
Man your content is amazing. Thanks a lot honestly
sir as like algorithm your every word makes a clear sense towards topic thank you for fine lectures.
big thanks to you prof, its much clear about algorithm
You should put RUclips add on right place. Add should be play between two topic not in between any topic as it suddenly break concentration during understanding topic.
By the way you explain every topic in excellent way.
I tried gate smashers before this one and honestly i got smashed ,
thank you Abdul Sir for making this course interesting and understandable
The way he explain owsm👌👌
Thanks for explaining and i have clearly understood concept. 🤘
Thank you so much sir for helping us out 😀
Sir space is only due to variables or will it increase if we increase number of functions and number of lines in the code as well?
thank you so much sir بہترین وضاحت کے لئے آپ کا بہت شکریہ
sir the way are explaining the is just awesome....
learning algorithm in 2024 , 5 april
21st July! 😊
29th 🎉
@@_ssayantan_ 8月9日
12 Aur 2024
16 August
Thank you very much. You are a genius. 👍👍🙏🙏👌👌🔝🔝
Excellent Explaination Sir,Thank you so much
Love from bangladesh
Thank you so much ....iam watching you from Libya
thank you, sir, pleaser to see your class, I think you are a Bengali if you have enough time please start Chennail . manny of diploma engineering students can be benefited by your classes.
Very well explained Sir. Thank you very much
I think the use of word for space used comes from the hardware name for the size of a register. Different architectures will have a different n-byte basic registers but in any case that basic size will be referred to as a 'word'.
In the book Narasimha Karumanchi (Data Structures and Algorithms Made Easy) in Page num: 17, section 1.9 How to Compare Algorithms, stated that Execution times is not a good measure as execution times are specific to particular computer, and also number of statements executed is also not a good measure, since the number of statement varies with the programming language as well as the style of the individual programmer. So Ideal solution is that to find function f(n) to compare.
@@abdul_bari You're so cute teacher I ever seen :)
U r nice teacher...sir!
Great content sir please suggest me some books for data structures and algorithms
Hi sir
What willbe time comolexity of in build functions?
For eg class string has methods like length, substring, indexof... Etc how to calculate timr complexity
thanks, sir.... from Bangladesh
Thank you so much sir, great way of teaching .
brilliant way of teaching.
Thanks for making this playlist
High respect sir , please do more :)
Liked your explanation sir
this is a great class. thank you. What is temp?
Beautifully explained..
Thank you so much sir. Really Grateful.
NICE SUPER EXCELLENT MOTIVATED
Sir can you plz work on audio quality it is good but difficult to understand 😊
Very nicely explained sir.
More than perfect! Thank you.
Thanks for the tutorial,
Just I wish you used a dedicated mic to record your voice, the echo is annoying.
Sir why you use f(n) when you added the time that algorithm takea plzz tell me🤗
i think COST or COGS is also an important criteria to analysis as we are using CLOUD
Good Work Sir. Thank you.
Thank you for your efforts
Thanks very much sir . What is the best reference book for algorithm ?
Nice work sir
what books/resources are you following?
sir apki explain bhot ache hai lkin sir plz make your videos in hindi for this course and other becoz there are lot of teacher for english but a few teacher teach in hindi but not effective style and your work is very nice so i want and requsted to you
Gulnaz Siddiqui english seekh le.
Please Sir, I would like to know if you have a full video on Algorithm and Data Structure?
Its on udemy
@@amolnarang6541 thanks
Watching from Kashmir
Great explanation Allah bless uh
THANK YOU FOR YOUR EFFORT.SIR
Sir aap padhte bahut accha hai but yahi topic ager hindi m hota to aur bhi acche se samjhe aata
long time drooling over the videos of mit. i discovered i had just learnt the terms not their meaning...
Complete bliss
THE GOAT
As some of you have asked for, soft copy of the notes of the lectures. Here is the small contribution from my side to this brilliant Algorithm Lecture series.
kumartechnicalarticles.wordpress.com/2019/04/08/notes-algorithms-by-abdul-bari/