Job Sequencing with Deadlines - Greedy Method in Hindi | DAA Lectures
HTML-код
- Опубликовано: 10 май 2019
- #AOA #algorithm #computerscience #aoa #lastmomenttuitions #LMT
To get the study materials for final yeat(Notes, video lectures, previous years, semesters question papers)
forms.gle/Ajzi9TLKuXxkDwET7
Analysis of Algorithms Full Course - bit.ly/2kLGKL8
Engineering Mathematics 03 (VIdeos + Handmade Notes) - bit.ly/2GaM8yY
Branches Available: Comps, IT, Mechanical, EXTC, Electrical, Civil, Production, Instrumentation
Other Second Year Engineering Courses :
Semester 03 -
Engineering Mathematics 03 - bit.ly/2GaM8yY
Discrete Mathematics - bit.ly/2kAtbOJ
Electronic Circuits & Communication Fundamentals - bit.ly/2kdlmOu
Digital Logic Design & Analysis - bit.ly/2Xb7y6x
Data structure: bit.ly/3pXRr9k
Semester 04 -
Engineering Mathematics 04 - bit.ly/2lVXj77
Computer Organisation & Architecture - bit.ly/2lPFO8G
Computer Graphics - bit.ly/2mdTzy3
Operating Systems - bit.ly/3g3eXxw
First Year Engineering Courses :
Engineering Mathematics 1 - bit.ly/2lUPezA
Engineering Physics 1 - bit.ly/2lRbElo
Engineering Chemistry 1 - bit.ly/2kAOAY2
Basic Electrical Engineering - bit.ly/2VPQlyW
Engineering Mechanics - bit.ly/2kNxjuH
Engineering Mathematics 2 - bit.ly/2kASuQG
Engineering Physics 2 - bit.ly/2kNy0UP
Engineering Chemistry 2 - bit.ly/2kAtWr3
Engineering Drawing - bit.ly/2maYwHV
Structured Programming Approach - bit.ly/2kNxKVR
Exclusive Courses :
Engineering Mathematics 03 (VIdeos + Handmade Notes) - bit.ly/2GaM8yY
Aptitude Preparation (with tips & tricks + Notes) - bit.ly/2kmlyLA
Other Engineering Courses :
Microprocessor - bit.ly/2mk7mDs
Database Management Systems - bit.ly/2lWJ4ir
Computer Networks - bit.ly/2mcoURH
System Programming & Compiler Construction - bit.ly/2ma4Xei
Cryptography & System Security - bit.ly/2mdw7kw
Data Warehousing & Mining - bit.ly/2PRCqoP
Machine Learning - bit.ly/2Xp4dmH
Software Engineering - bit.ly/2lRb9bb
Digital Signal & Image Processing - bit.ly/2lOqUzE
Mobile Communication & Computing - bit.ly/2lOqKIy
Artificial Intelligence & Soft Computing - bit.ly/2mgKk0b
Big Data Analysis - bit.ly/2mdvPtW
Human Machine Interaction - bit.ly/2Ts3PRh
Wireless Adhoc Network - bit.ly/3gdW6Qs
Distributed Computing - bit.ly/2WQLoI0
Natural Language Processing - bit.ly/3cUcX8F
Technical & Placement Preparation :
Interview Series - bit.ly/2ki9U4l
Python (Beginners) - bit.ly/2mgLR6r
Arduino (Beginners) - bit.ly/2mj7dAb
UML Diagrams - bit.ly/2mj54od
SQL (Beginners) - bit.ly/3gcLoK6
Understood....! 🙂👍
The concept you taught is totally wrong, according to your concept complexity of algorithm becomes O(n) instead of O(n^2).
O(n) is better na
Best vedio. Samjne layak tutorial. Improve audio quality guys. Kada vgre bajta hai bich bich me. Starting k 5 min me baccho ki awaz aarhi hai n all
ur voice sounds like jonathan gaming
Totally wrong concept
Do u hav better one
Yup
@@arpita0608 do you want to know that?
@@antarbasu5342 yes
@@vinyass3733 contact with me
apne TS[i]=0 ke liye for i to 'n' kyu liya 'n' to no. of jobs represent kare hai dmax ana chahiye udhar pe
it dosent matter bro.
Algorithm bilkul nhi smjh aaya
Kahi se bhi nhi smjh rha h algorithm
Itna tough h kya algorithm
bakwass