Course Features
- Lectures 26
- Quiz 0
- Duration 50 hours
- Skill level All levels
- Language English
- Students 1
- Assessments Yes
Curriculum
- 7 Sections
- 26 Lessons
- 10 Weeks
Expand all sectionsCollapse all sections
- Analysis of Algorithm [Module 1]:- Introduction5
- Analysis of Algorithm [Module 2]:- Divide and Conquer Approach7
- 16.1Max Min Problem with Solved Example8 Minutes
- 16.2Merge Sort Algorithm with Solved Example20 Minutes
- 16.3Multiplying Long Integers Using Divide and Conquer Technique9 Minutes
- 16.4Quick Sort Algorithm web17 Minutes
- 16.5Quick Sort Algorithm Explained with Example15 Minutes
- 16.6Divide & Conquer With Example6 Minutes
- 16.7Binary Search10 Minutes
- Analysis of Algorithm [Module 3]:- Greedy Method Approach4
- Analysis of Algorithm [Module 4]:- Dynamic Programming Approach5
- Analysis of Algorithm [Module 5]:- Backtracking and Branch and bound2
- Analysis of Algorithm [Module 6]:- String Matching Algorithms0
- Analysis of Algorithm Importance with Solution3
![First Year Sem 2 MU NEP [ Comps – IT – AIML Branch ]](https://www.informaltuitions.in/wp-content/uploads/2020/02/WhatsApp-Image-2020-06-26-at-12.15.44-PM-400x250.jpeg)
![Sem-4 IT MU [ Maths 4 – CNN – OS – AT – COA ]](https://www.informaltuitions.in/wp-content/themes/eduma/images/demo_images/demo_image.jpg)
![Deloitte NLA Complete Prep Course [ Videos + Notes + Mock ]](https://www.informaltuitions.in/wp-content/uploads/2019/08/VIVA-QUESTION-400x250.png)
