00:02 Algorithm is a finite set of steps to solve a problem 00:57 Algorithm is a finite set of steps or instructions with a finite number of instructions and finite execution time. 02:06 Algorithms should have a finite number of instructions and should be unambiguous. 03:02 Algorithm analysis compares algorithms based on time and space usage 04:06 Algorithm analysis can be done prior to or after execution 05:15 Difference between priori and posteriori analysis 06:02 Analyzing time complexity by calculating iterations. 07:02 Analysis of algorithm performance
Your way of teaching is fabulous the way you start the course along with the syllabus and your way of explaining concepts is superb.....Thanks alot sir!!!
✦ An algorithm is a finite set of steps to solve a particular problem. 00:02 ✦ Algorithm is a finite number of steps 00:57 ✦ An algorithm should execute a finite number of times. 02:06 ✦ Algorithm analysis involves comparing algorithms based on time and space usage 03:02 ✦ Pre vs Post Analysis 04:06 ✦ Difference between priori and posteriori analysis in algorithm analysis 05:15 ✦ Understanding time complexity analysis 06:02 ✦ Analyzing algorithm complexity and asymptotic notations Click to expand 07:02
🎯 Key Takeaways for quick navigation: 00:00 *Algorithm is defined as a finite set of steps to solve a specific problem, providing a blueprint for solving problems regardless of programming language.* 01:24 *Characteristics of algorithms include a finite number of instructions, each taking finite time to execute, and unambiguous instructions.* 03:18 *Algorithm analysis involves comparing algorithms based on parameters like time and space complexity, essential for determining efficiency.* 04:16 *Analysis can be done prior to execution (independent of hardware) or posterior (dependent on hardware), affecting the exactness of results.* 05:40 *Prior analysis focuses on iteration count, providing approximate values, while posterior analysis offers exact values but is hardware-dependent.* 06:40 *Asymptotic notations like Big O, Big Omega, and Theta are used to represent algorithmic complexities, helping in comparing and understanding algorithms' performance.* Made with HARPA AI
Thank you so much sir.... Agar koi topic search karo aur aapki video mil jaye toh dil khush ho jaata h... I learnt digital electronics from you and then dbms and now algorithms.. Great work sir ✨
half video tak i was blank.jesse pata hi nahi kya hora hai...but jab last me book ke example se sab samaj me agaya...... thnkyou so much... this is so much better den my online class :)
Sir do more videos on algorithms, so it will help me , to give ugc exam in this june......tq for ur all videos...this videos will make me more understood of concepts..
sir i hope u were teaching me in college directly so i wouldnt have to spend extra time on utube literally u have helped me understand concepts from nearly every subject in my syllabus thank you so much sir 🫡
You are sooooo good but sometimes I miss things because of automatic subtitles and different pronunciation. Thank you so much for uploading the videos!
Hello sir, First of all thank you for all the video and notes that you are providing to us, your way of teaching and making the topic to understand is very easy...please keep up the good work😊 and now my questing to you is I am planning to give UGC NET this time and I don't have any notes of my own paperII CS ..... Due to which I land up to your channel and from the last few weeks I am going through some playlist of yours from which I have completed topic DBMS nicely... But now I have doubt came into my mind that If I reffer TH-cam playlist like this and make some notes out of it, will that be enough to clear NET/JRF? Though I am preparing paper I side by side, but my problem is with my own paper II. Please help Sir Your reply will be highly appreciate. Thank you
Thank u so much sir for such a useful video.. sir will this all videos which are on alogrithm are suffiecient for Study for Nielit Scientific Technical Assistant A post.
Sir your way of teaching is too good , But sir ek question hai hum algorithm ko analyse krty ku hain , means k agr humarey pass pehly sy he ek program hai ab oska algorithm likhny ki ya osko analyse krny ki zaroorat ku hotii hai humein
00:02 Algorithm is a finite set of steps to solve a problem
00:57 Algorithm is a finite set of steps or instructions with a finite number of instructions and finite execution time.
02:06 Algorithms should have a finite number of instructions and should be unambiguous.
03:02 Algorithm analysis compares algorithms based on time and space usage
04:06 Algorithm analysis can be done prior to or after execution
05:15 Difference between priori and posteriori analysis
06:02 Analyzing time complexity by calculating iterations.
07:02 Analysis of algorithm performance
Thanks for summary
Did you use any AI tool for this?
Your way of teaching is fabulous the way you start the course along with the syllabus and your way of explaining concepts is superb.....Thanks alot sir!!!
This way is informative and enjoyable ♥️😍
nice explanation
Hello mam 👋🏻
Hii
❤
You are guru of computer science. You have unlimited knowledge. And thank you for your awesome playlists. You are life saver. Thanks a ton.
✦
An algorithm is a finite set of steps to solve a particular problem.
00:02
✦
Algorithm is a finite number of steps
00:57
✦
An algorithm should execute a finite number of times.
02:06
✦
Algorithm analysis involves comparing algorithms based on time and space usage
03:02
✦
Pre vs Post Analysis
04:06
✦
Difference between priori and posteriori analysis in algorithm analysis
05:15
✦
Understanding time complexity analysis
06:02
✦
Analyzing algorithm complexity and asymptotic notations
Click to expand
07:02
No other vidoes related to computer science concepts on TH-cam give me that much satisfaction like this channel vidoes..,
Who is watching on 2024
You
I
🎯 Key Takeaways for quick navigation:
00:00 *Algorithm is defined as a finite set of steps to solve a specific problem, providing a blueprint for solving problems regardless of programming language.*
01:24 *Characteristics of algorithms include a finite number of instructions, each taking finite time to execute, and unambiguous instructions.*
03:18 *Algorithm analysis involves comparing algorithms based on parameters like time and space complexity, essential for determining efficiency.*
04:16 *Analysis can be done prior to execution (independent of hardware) or posterior (dependent on hardware), affecting the exactness of results.*
05:40 *Prior analysis focuses on iteration count, providing approximate values, while posterior analysis offers exact values but is hardware-dependent.*
06:40 *Asymptotic notations like Big O, Big Omega, and Theta are used to represent algorithmic complexities, helping in comparing and understanding algorithms' performance.*
Made with HARPA AI
Never seen such simple and easy to understand explanation, god bless you for this.
will share this to every1 who is looking for effective learning
Your teaching method is very good. Yours videos are very helpful for me. God bless you!
Thank you so much sir.... Agar koi topic search karo aur aapki video mil jaye toh dil khush ho jaata h... I learnt digital electronics from you and then dbms and now algorithms.. Great work sir ✨
bohot achaa smjh m aaya ek ek cheez ko deeply btaya bdeya laga padh kr sare classes dekh li 🙂
kise bhi coching ki need nahe hai or na he other classes ki ye ser bohot achaa padhte h 🥰
Thank you sir method of teaching.
Make topic Easyer to Easyest....
Thanku bhaiya very wonderfully explained
well explained all thr basic concept basesd on this lecture👏👏❤️❤️
Thnq so much sir...gate k liye algorithm krwai
Well explain.....👌👌👏👏thank you...😊😊
Thank you sir!
Thank you sir 🙏❤️
Much respect from Pakistan for the stuff you have put into your channel. Quite newbie friendly.
half video tak i was blank.jesse pata hi nahi kya hora hai...but jab last me book ke example se sab samaj me agaya...... thnkyou so much... this is so much better den my online class :)
Ye aadmi sab kuch kese padha deta h 😭
Bsdk engineer ha wo😎😎
Dimaag ko use karke
😅😅
Muh se
@@poonamchoukikar1575achaa
1 channel,2 teachers , almost every subject of the engineering field !!
Mann u guys are the best 🔥
Sir your teaching method is great. 👍👍
Only hope for VU students..
Thank u soo much sir😊
Government Degree colleges are the best in C's in Pakistan
Superb Sir.... you are the best teacher in the world....
How i got the best ever sir here on earth..🙌🙌🙌🙌
kehna kya chahte ho??
Effective delivery! Stay blessed.
your videos are very helpful for us who studying in canada. thank you so much
Glad to hear that
sir, thanks for this fabulous playlist for us..i watched all your videos..its amazing.❤
You are an amazing teacher.. Explanations are so clear..Thank you..Please keep making videos.
Sir dil se thank you ......For all of your videos
Good information sir
Thanks sir for helping all the net aspirants
Thank you sir❤❤❤❤
Thank you💐 sir...for ☝️ precious knowledge 😇
Thanks sir.. good
thankyou so much .. your all video help a lot
You are unbelievable sir❤
Sir really thank you so much ❤
good teachers are the best teacher
Thank yuh soo much sir for this video.. Really helped me
Glad to hear from you. Thank you
Putting your address in the comment box is the new trend....
best tutorial for algorithm
U have lot of knowledge no words
legend watching day before exam trying to complete the syllabus from this lectures ... cause i am doing this and i know i am a legend
Good way of explanation. Nice.
7:38 sir mujhe lgaa thanos ki chuttki ka asar hogya.
great Video BTW
So hardworking and nice teacher
Sir really incredible ❤️
Thank You Sir
I did clear net thanks to your videos.. with this I am sure to clear JRF
Thx sir from today start my algorithm course🙂🙂🙂
Watch at 2x, u will feel more active plus sir also feel like straight forward ❤
Thanks a lot sir very nice explanation
Nice video sir,
Sir plz DAA videos regarding NTA net ke hisab se banaye...Plz... Thank you...
Awasome sir....
Amazing Sir...
Thank you so much sir ❤️
Sir do more videos on algorithms, so it will help me , to give ugc exam in this june......tq for ur all videos...this videos will make me more understood of concepts..
Thank you sir👍
Thank u so much Sir for this video.
From Pakistan
sir i hope u were teaching me in college directly so i wouldnt have to spend extra time on utube
literally u have helped me understand concepts from nearly every subject in my syllabus
thank you so much sir 🫡
Thanks sir g 👍
Sir u explained very nicely I have understood everything
Sir add further videos of that analysis of algortihim quickly,so that we take help from it.
Thanx sir
Thank you sir.....
Thanks a lot sir
Awesome
Thanku sir
tnq so much 😊💚
Thanks sir❤
Sir Your teachings are wonderful.Then what about the students who don't know Hindi? Please provide in English also
Your explanation is very good ..please do explain in english as it is a medium of communication for all
Thanks sir!
You are sooooo good but sometimes I miss things because of automatic subtitles and different pronunciation. Thank you so much for uploading the videos!
Thank so much
Good
Sir very good
Thnkx
Basic concepts- Algorithm Specification-Introduction
Fabulous
Who watching in sept 2024
Meee🙌🏻
can u please upload the whole syllabus, sir, plz.
anyway, I learn the operating system from your guidance and it was awesome.
Hey Prince
@@varshamishra3340 hey varsha😂
@@novicemakers_abhishekkamal 😂😂🤣🤣
😁🤣🤣
Hello sir,
First of all thank you for all the video and notes that you are providing to us, your way of teaching and making the topic to understand is very easy...please keep up the good work😊 and now my questing to you is I am planning to give UGC NET this time and I don't have any notes of my own paperII CS ..... Due to which I land up to your channel and from the last few weeks I am going through some playlist of yours from which I have completed topic DBMS nicely... But now I have doubt came into my mind that If I reffer TH-cam playlist like this and make some notes out of it, will that be enough to clear NET/JRF? Though I am preparing paper I side by side, but my problem is with my own paper II.
Please help Sir
Your reply will be highly appreciate.
Thank you
Same query here
Broo, ek hi dil hai. Kitni baar jeetoge 😭. Exams aapke bharose hi pass hote hai ! 😭
Tnq sir
Sir can you explain how to start writing an algorithm of own please..
Yes sir please
Sir, well explained, clear voice ...👏👏
Which mic do you use? Plz provide link
thanks..its boya mic from amazon
Boya pro?
Plz provide link!!
nice session
Jahanfanah… tusi great ho 😅 🫣
Who is watching on November 2024
Thank u so much sir for such a useful video.. sir will this all videos which are on alogrithm are suffiecient for Study for Nielit Scientific Technical Assistant A post.
Sir you explained very well....sir please make a video for red black tree and b tree also
B tree is already there
last year nots, bnaye they, ab MTECH krra hu, rivision start kiya hai, thankyou
Thank you
Sir your way of teaching is too good ,
But sir ek question hai hum algorithm ko analyse krty ku hain , means k agr humarey pass pehly sy he ek program hai ab oska algorithm likhny ki ya osko analyse krny ki zaroorat ku hotii hai humein
God bless you
Love, Respect from PAKISTAN. dear Sir!
Thanks.... kindly make on regular basis....I missed NET by 1 marks.... kindly guide how to restart.....
nc explanation sir. thnku soo much
sir uniform values ka kya meaning hota hai?