L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

preview_player
Показать описание


►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

#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 alot sir!!!

bhavnasen
Автор

You are guru of computer science. You have unlimited knowledge. And thank you for your awesome playlists. You are life saver. Thanks a ton.

mutahirajutt
Автор

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

shreyanmukherjee
Автор

No other vidoes related to computer science concepts on YouTube give me that much satisfaction like this channel vidoes..,

asianaaz
Автор

🎯 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

nitishkumar-ktnb
Автор

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 ✨

mohsinanaqvi
Автор

well explained all thr basic concept basesd on this lecture👏👏❤️❤️

junaidraza
Автор

Your teaching method is very good. Yours videos are very helpful for me. God bless you!

nawazjuttg
Автор


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

Arunchandel
Автор

Thnq so much sir...gate k liye algorithm krwai

himadrikasinha
Автор

Thank you sir method of teaching.
Make topic Easyer to Easyest....

ankitaginhotry
Автор

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

knowledgepro
Автор

1 channel, 2 teachers, almost every subject of the engineering field !!
Mann u guys are the best 🔥

rulesbreaker
Автор

bohot achaa smjh m aaya ek ek cheez ko deeply btaya bdeya laga padh kr sare classes dekh li 🙂

Anjali-wngg
Автор

You are an amazing teacher.. Explanations are so clear..Thank you..Please keep making videos.

madhurimaburagohain
Автор

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

yieytmrooen-dchl
Автор

Thanku bhaiya very wonderfully explained

Srishtiiiiiiiiiii
Автор

Sir add further videos of that analysis of algortihim quickly, so that we take help from it.

shazib_malik
Автор

your videos are very helpful for us who studying in canada. thank you so much

jotk
Автор

Thanks sir for helping all the net aspirants

netcracker