| 1. Disjoint Sets Concept.mp4 | 30.1 MB | ||
| 1. Disjoint Sets Concept.srt | 7.5 KB | ||
| 1. Introduction For Greedy Approach.mp4 | 24.5 MB | ||
| 1. Introduction For Greedy Approach.srt | 8.8 KB | ||
| 1. Introduction Of BackTracking Concept.mp4 | 96 MB | ||
| 1. Introduction Of BackTracking Concept.srt | 21.3 KB | ||
| 1. Introduction Of Divide And Conqure.mp4 | 39 MB | ||
| 1. Introduction Of Divide And Conqure.srt | 9.9 KB | ||
| 1. Introduction Of Dynamic Programming.mp4 | 22 MB | ||
| 1. Introduction Of Dynamic Programming.srt | 6.8 KB | ||
| 1. Introduction.mp4 | 20.2 MB | ||
| 1. Introduction.srt | 921.6 B | ||
| 2. Binary Search Using DAC.mp4 | 97.4 MB | ||
| 2. Binary Search Using DAC.srt | 25 KB | ||
| 2. Disjoint Set Operations.mp4 | 141.8 MB | ||
| 2. Disjoint Set Operations.srt | 28.6 KB | ||
| 2. Index and Algorithm.mp4 | 22.5 MB | ||
| 2. Index and Algorithm.srt | 5 KB | ||
| 2. KnapSack Problem Using Greedy Approach.mp4 | 107.2 MB | ||
| 2. KnapSack Problem Using Greedy Approach.srt | 20.4 KB | ||
| 2. N-Queen Problem Using BackTracking.mp4 | 106.1 MB | ||
| 2. N-Queen Problem Using BackTracking.srt | 30.7 KB | ||
| 3. Concept Of Graphs, B.F.S, D.F.S.mp4 | 37.5 MB | ||
| 3. Concept Of Graphs, B.F.S, D.F.S.srt | 14.1 KB | ||
| 3. Hamilton Cycle Using BackTracking Method.mp4 | 16.6 MB | ||
| 3. Hamilton Cycle Using BackTracking Method.srt | 5.6 KB | ||
| 3. Job Sequencing Using Greedy Approach.mp4 | 50.9 MB | ||
| 3. Job Sequencing Using Greedy Approach.srt | 14.6 KB | ||
| 3. Merge Sorting Using DAC.mp4 | 143.1 MB | ||
| 3. Merge Sorting Using DAC.srt | 27.2 KB | ||
| 3. Properties of Algorithm.mp4 | 21.5 MB | ||
| 3. Properties of Algorithm.srt | 6.1 KB | ||
| 4. Concept Of Prim's Algorithm.mp4 | 45.6 MB | ||
| 4. Concept Of Prim's Algorithm.srt | 13.2 KB | ||
| 4. Pseudo Code.mp4 | 39.5 MB | ||
| 4. Pseudo Code.srt | 10.8 KB | ||
| 4. Quick Sort Using DAC.mp4 | 151 MB | ||
| 4. Quick Sort Using DAC.srt | 31.9 KB | ||
| 5. Explanation Of Kruskal's Algorithm.mp4 | 21.8 MB | ||
| 5. Explanation Of Kruskal's Algorithm.srt | 6.7 KB | ||
| 5. Strassen's Matrix Multiplication Using DAC.mp4 | 54.4 MB | ||
| 5. Strassen's Matrix Multiplication Using DAC.srt | 13 KB | ||
| 5. Time and Space Complexity.mp4 | 37.3 MB | ||
| 5. Time and Space Complexity.srt | 11.4 KB | ||
| 6. Asymptotic Notations.mp4 | 40.6 MB | ||
| 6. Asymptotic Notations.srt | 10.9 KB | ||
| 6. Problem Of Single Source Shortest Path.mp4 | 88.6 MB | ||
| 6. Problem Of Single Source Shortest Path.srt | 19.9 KB | ||
| 7. Randomized Algorithm.mp4 | 37.3 MB | ||
| 7. Randomized Algorithm.srt | 11.6 KB | ||
| Bonus Resources.txt | 307.2 B | ||
| Get Bonus Downloads Here.url | 204.8 B | ||
| ▲ 52 total files | |||
Design and Analysis of an Algorithm
Created by Monesh Venkul Vommi, Hemanth Yeluru | Last updated 6/2021
Duration: 4h 42m | 6 sections | 25 lectures | Video: 1280x720, 44 KHz | 1.5 GB
Genre: eLearning | Language: English + Sub
In a smart way
What you'll learn
By the ending of the Course Students will able to design a perfect CODING and ALGORITHAM in a smart way
Requirements
No , just the intrest towards the Course is well sufficient
Description
This course DESIGN AND ANALYSIS OF ALGORITHMS is very useful to design a programming code in a smart and easy way....
And this is not a tough course ofcourse little bit of hardwork and interest towards the course will make a expert in this course.... All you need is just to join your hands with me....i wont break your trust ....i will give my best to give you best content ....i will take many references for giving the best content to you.....this course is very intresting one that deals with every topic in the entire computer science and that may help you give a perfect grip the entire computer science... this entire course outcomes is
To analyze performance of algorithms. 2 To choose the appropriate data structure and algorithm design method for a specified application. 3 To understand how the choice of data structures and algorithm design methods impacts the performance of programs. 4 To solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking and branch and bound. 5 To understand the differences between tractable and intractable problems.
Ability to analyze the performance of algorithms.
Ability to choose appropriate algorithm design techniques for solving problems
Ability to understand how the choice of data structures and the algorithm design methods impact the performance of program
Who this course is for:Computer science students, Programmers and Any of the Students who are willing to learn the computers
Download More Courses Visit and Support Us -->> https://FreeCourseWeb.com
| torrent name | size | uploader | age | seed | leech |
|---|---|---|---|---|---|
| 958.9 MB | freecoursewb | 5 years | 0 | 0 | |
|
[ FreeCourseWeb ] Udemy - Web Scraping for Data Science - Python & Selenium - Basics Posted by
freecoursewb in Other
|
1.5 GB | freecoursewb | 5 years | 0 | 2 |
|
[ FreeCourseWeb ] Udemy - Ultimate JavaScript Arrays plus One To-Do List Project Posted by
freecoursewb in Other
|
506 MB | freecoursewb | 5 years | 0 | 0 |
| 615 MB | freecoursewb | 5 years | 0 | 1 | |
|
[ FreeCourseWeb ] Udemy - The Complete Google Docs Course - Google Docs Tricks & Tips Posted by
freecoursewb in Other
|
1.8 GB | freecoursewb | 5 years | 0 | 1 |
All Comments