Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi
Duration: 9 hr 23 min
💻 KnowledgeGate Website: https://www.knowledgegate.ai
For free notes on University exam’s subjects, please check out our course: https://www.knowledgegate.ai/courses/FREE-SEMESTER-EXAM-BUNDLE
📝 Please message us on WhatsApp: https://wa.me/918000121313
➡ Contact Us: 👇
📞Call on: +91-8000121313
🟦 Telegram Updates: https://t.me/kg_gate
🟩 Whatsapp Updates: https://www.whatsapp.com/channel/0029VaC5Weq2Jl85NaTls63w
📧 Email: contact@knowledgegate.in
➡ One Shot Complete Playlist for GATE CSE Exam : 👇
▶️ http://tiny.cc/GATEoneshotplaylist
➡ Our One Shot Semester Exam Videos: 👇
▶ Operating System: https://youtu.be/xw_OuOhjauw
▶ DBMS: https://youtu.be/YRnjGeQbsHQ
▶ Computer Network: https://youtu.be/q3Z3Qa1UNBA
▶ Digital Electronics: https://youtu.be/pHNbm-4reIc
▶ Computer Architecture: https://youtu.be/DsK35f8wyUw
▶ Data Structure: https://youtu.be/MdG0Vw9f1A4
▶ Algorithm: https://youtu.be/z6DY_YSdyww
▶ Software Engineering: https://youtu.be/NlLM3sVF8wY
▶ Theory of Computation: https://youtu.be/9kuynHcM3UA
▶ Compiler: https://youtu.be/OQCjakjCJu4
▶ Discrete Maths: https://youtu.be/3zOtLEeHygg
▶ Artificial Intelligence: https://youtu.be/yiXAmkimZRQ
▶ Machine Learning: https://youtu.be/2oGsCHlfBUg
#knowledgegate #sanchitsir #sanchitjain
*********************************************************
Content in this video:
00:00 (Chapter-0:- About this video)
02:10 (Chapter-1 Introduction): Algorithms, Analysing Algorithms, Efficiency of an Algorithm, Time and Space Complexity, Asymptotic notations: Big-Oh, Time-Space trade-off Complexity of Algorithms, Growth of Functions, Performance Measurements.
1:20:55 (Chapter-2 Sorting and Order Statistics): Concept of Searching, Sequential search, Index Sequential Search, Binary Search Shell Sort, Quick Sort, Merge Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time. Sequential search, Binary Search, Comparison and Analysis Internal Sorting: Insertion Sort, Selection, Bubble Sort, Quick Sort, Two Way Merge Sort, Heap Sort, Radix Sort, Practical consideration for Internal Sorting.
3:14:59 (Chapter-3 Divide and Conquer): with Examples Such as Sorting, Matrix Multiplication, Convex Hull and Searching.
3:40:22 (Chapter-4 Greedy Methods): with Examples Such as Optimal Reliability Allocation, Knapsack, Huffman algorithm
4:36:05 (Chapter-5 Minimum Spanning Trees): Prim’s and Kruskal’s Algorithms
5:00:25 (Chapter-6 Single Source Shortest Paths): Dijkstra’s and Bellman Ford Algorithms.
5:25:25 (Chapter-7 Dynamic Programming): with Examples Such as Knapsack. All Pair Shortest Paths – Warshal’s and Floyd’s Algorithms, Resource Allocation Problem. Backtracking, Branch and Bound with Examples Such as Travelling Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles and Sum of Subsets.
6:52:40 (Chapter-8 Advanced Data Structures): Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci Heaps, Tries, Skip List, Introduction to Activity Networks Connected Component.
8:36:05 (Chapter-9 Selected Topics): Fast Fourier Transform, String Matching, Theory of NPCompleteness, Approximation Algorithms and Randomized Algorithms
The video player loads when you open this lesson in the course.
Explore the full course: Free Learning & Guidance Program by Sanchit sir
Discussion
notes
notes
so hard to find any thing in this place WTH
so hard to find any thing in this place WTH
notes
so hard to find any thing in this place WTH
how is it so hard to find the notes
notes
so hard to find any thing in this place WTH
where are the notes?
notes
so hard to find any thing in this place WTH