Design and Analysis of Algorithms

Design and Analysis of Algorithms

@VTU COE

0.0
(0) 32 Students
Download Brochure

What you will learn

  • none

This course will cover basic concepts in the design and analysis of algorithms. 1. Asymptotic complexity,notation 2. Sorting and search 3. Algorithms on graphs: exploration, connectivity, shortest paths, directed acyclic graphs, spanning trees 4. Design techniques: divide and conquer, greedy, dynamic programming 5. Data structures: heaps, union of disjoint sets, search trees 6. Intractability

play
Course Outline
Preview 09:24
play
Example: Air Travel
Preview 09:32
play
Example: Xerox shop
Preview 06:19
play
Example: Document similarity
Preview 09:29
play
Introduction and motivation
Preview 18:34
play
Input size, worst case, average case
Preview 10:27
play
Quantifying efficiency: O( ), Omega( ), Theta( )
Preview 18:01
play
Examples: Analysis of iterative and recursive algorithms
Preview 17:21

play
Arrays and lists
Preview 06:23
play
Searching in an array
Preview 09:09
play
Selection Sort
Preview 12:11
play
Insertion sort
Preview 13:51
play
Merge sort
Preview 13:45
play
Merge sort - analysis
Preview 15:10
play
Quicksort
Preview 17:05
play
Quicksort - analysis
Preview 12:17
play
Sorting - Concluding remarks
Preview 08:07

play
Introduction to graphs
Preview 12:03
play
Representing graphs
Preview 13:46
play
Breadth first search (BFS)
Preview 20:38
play
Depth first search (DFS)
Preview 12:43
play
Applications of BFS and DFS
Preview 22:42
play
Directed acylic graphs: topological sort
Preview 20:25
play
Directed acylic graphs: longest paths
Preview 14:00

play
Single source shortest paths: Dijkstras algorithm
Preview 16:15
play
Dijkstras algorithm: analysis
Preview 14:21
play
Negative edge weights: Bellman-Ford algorithm
Preview 16:41
play
All pairs shortest paths
Preview 19:35
play
Minimum Cost Spanning Trees
Preview 11:58
play
Prims Algorithm
Preview 21:10
play
Kruskals algorithm
Preview 14:37

play
Union-Find using arrays
Preview 22:11
play
Union-Find using pointers
Preview 15:24
play
Priority queues
Preview 10:15
play
Heaps
Preview 23:13
play
Heaps: Updating values, sorting
Preview 12:00
play
Counting inversions
Preview 17:57
play
Closest pair of points
Preview 16:34

play
Binary Search Trees
Preview 33:05
play
Balanced search trees
Preview 22:12
play
Interval scheduling
Preview 18:06
play
Scheduling with deadlines: minimizing lateness
Preview 17:21
play
Huffman codes
Preview 29:04

play
Introduction to dynamic programming
Preview 19:30
play
Memoization
Preview 19:53
play
Grid Paths
Preview 21:26
play
Common subwords and subsequences
Preview 27:18
play
Edit distance
Preview 14:33
play
Matrix multiplication
Preview 15:52

play
Linear Programming
Preview 18:01
play
LP modelling: Production Planning
Preview 13:26
play
LP modelling: Bandwidth allocation
Preview 10:21
play
Network Flows
Preview 18:04
play
Reductions
Preview 10:59
play
Checking Algorithms
Preview 23:46
play
P and NP
Preview 20:47
img
No Discussion Found

0.0

0 Reviews

5
0
4
0
3
0
2
0
1
0
Meet Your Instructor
@VTU COE
img

Instructor
3.2 Rating
5446 Students
800 Courses
About Instructor

VTU is one of the largest Technological Universities in India with 24 years of Tradition of excellence in Engineering & Technical Education, Research and Innovations. It came into existence in the year 1998 to cater the needs of Indian industries for trained technical manpower with practical experience and sound theoretical knowledge.

video

Free

  • Course Duration
    15 h 11 m 23 s
  • Course Level
    Intermediate
  • Student Enrolled
    32
  • Language
    English
This Course Includes
  • 15 h 11 m 23 s Video Lectures
  • 0 Quizzes
  • 0 Assignments
  • 0 Downloadable Resources
  • Full Lifetime Access
  • Certificate of Completion