L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA
Вставка
- Опубліковано 5 вер 2024
- 👉Subscribe to our new channel: / @varunainashots
►Time complexities of various Algorithms: • L-1.6: Time Complexiti...
►Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on UA-cam: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
#WhatisAlgorithm#Algorithmanalysis#daa
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
Who is watching on 2024
You are guru of computer science. You have unlimited knowledge. And thank you for your awesome playlists. You are life saver. Thanks a ton.
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?
Ye aadmi sab kuch kese padha deta h 😭
Bsdk engineer ha wo😎😎
Dimaag ko use karke
😅😅
Muh se
@@poonamchoukikar1575achaa
No other vidoes related to computer science concepts on UA-cam give me that much satisfaction like this channel vidoes..,
well explained all thr basic concept basesd on this lecture👏👏❤️❤️
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 ✨
Your teaching method is very good. Yours videos are very helpful for me. God bless you!
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 🥰
1 channel,2 teachers , almost every subject of the engineering field !!
Mann u guys are the best 🔥
Thnq so much sir...gate k liye algorithm krwai
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
Thank you sir method of teaching.
Make topic Easyer to Easyest....
✦
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
Well explain.....👌👌👏👏thank you...😊😊
Sir add further videos of that analysis of algortihim quickly,so that we take help from it.
You are an amazing teacher.. Explanations are so clear..Thank you..Please keep making videos.
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
Thank you sir!
your videos are very helpful for us who studying in canada. thank you so much
Glad to hear that
Only hope for VU students..
Thank u soo much sir😊
Government Degree colleges are the best in C's in Pakistan
Much respect from Pakistan for the stuff you have put into your channel. Quite newbie friendly.
sir, thanks for this fabulous playlist for us..i watched all your videos..its amazing.❤
Thanks sir for helping all the net aspirants
Thank you sir 🙏❤️
Sir really thank you so much ❤
Sir your teaching method is great. 👍👍
🎯 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
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 :)
Thanku bhaiya very wonderfully explained
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....
How i got the best ever sir here on earth..🙌🙌🙌🙌
kehna kya chahte ho??
thankyou so much .. your all video help a lot
Thank you💐 sir...for ☝️ precious knowledge 😇
U have lot of knowledge no words
Superb Sir.... you are the best teacher in the world....
You are sooooo good but sometimes I miss things because of automatic subtitles and different pronunciation. Thank you so much for uploading the videos!
Nice video sir,
Sir plz DAA videos regarding NTA net ke hisab se banaye...Plz... Thank you...
Sir dil se thank you ......For all of your videos
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..
Good information sir
good teachers are the best teacher
I did clear net thanks to your videos.. with this I am sure to clear JRF
Watch at 2x, u will feel more active plus sir also feel like straight forward ❤
Thank you sir❤❤❤❤
You are unbelievable sir❤
Thanks sir.. good
best tutorial for algorithm
last year nots, bnaye they, ab MTECH krra hu, rivision start kiya hai, thankyou
7:38 sir mujhe lgaa thanos ki chuttki ka asar hogya.
great Video BTW
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 UA-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
Effective delivery! Stay blessed.
Sir can you explain how to start writing an algorithm of own please..
Yes sir please
So hardworking and nice teacher
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 😂😂🤣🤣
😁🤣🤣
Your explanation is very good ..please do explain in english as it is a medium of communication for all
Broo, ek hi dil hai. Kitni baar jeetoge 😭. Exams aapke bharose hi pass hote hai ! 😭
Sir u explained very nicely I have understood everything
Thx sir from today start my algorithm course🙂🙂🙂
Thank u so much Sir for this video.
From Pakistan
Thanks a lot sir very nice explanation
Thank You Sir
Good way of explanation. Nice.
Anwar from sialkot pakistan. university of sialkot,
Padhai v hoti kya pakistan me??
Sir Your teachings are wonderful.Then what about the students who don't know Hindi? Please provide in English also
Thanks.... kindly make on regular basis....I missed NET by 1 marks.... kindly guide how to restart.....
Thanku sir
Thanx sir
Hello sir,
Sir kya aap daa pr kuch or video share kr denge please like backtracking and branch or bound....
Thanks a lot sir
Thank you so much sir ❤️
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.
Thank you sir.....
Awasome sir....
Fabulous
Awesome
Good
Sir really incredible ❤️
Thank you sir👍
Sir you explained very well....sir please make a video for red black tree and b tree also
B tree is already there
Basic concepts- Algorithm Specification-Introduction
Love, Respect from PAKISTAN. dear Sir!
nc explanation sir. thnku soo much
sir uniform values ka kya meaning hota hai?
Amazing Sir...
Thank so much
Thanks sir g 👍
Thnkx
Sir can you have completed videos on design and analysis of algorithm۔
Pray for me I have very saru teacher in my clg۔۔۔۔۔۔۔
Sir very good
sir what benifit to join membership
Hey Sir can u please make a video on advanced topics which are asking in google, microsoft and other top notch companies.
Thanks sir!
Tnq sir
God bless you
Sir har topic ke questions ka bhi playlists banaiye please
Hello please provide the subtitles in English, as it is easy for us to make notes. Your first video has the subtitles but after that, no one has the correct subtitles
Jahanfanah… tusi great ho 😅 🫣
Kindly also refer some book in your videos, so we can have notes
sir please do video on data structures syllabus and important topics for gate