Introduction To Algorithms And Analysis

COURSE DURATION :12 Weeks

@VTU COE

2.0
(1) 64 Students
Download Brochure

What you will learn

  • Computer Science and Engineering

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

play
Lecture 6 : The Master Method
Preview 29:28
play
Lecture 7 : Divide-and-Conquer
Preview 26:37
play
Lecture 8 : Divide-and-Conquer (Contd.)
Preview 27:40
play
Lecture 9 : Straseen's Algorithms
Preview 34:05
play
Lecture 10 : QuickSort
Preview 29:48

play
Lecture 11 : Analysis of Quicksort.
Preview 28:50
play
Lecture 12 : Randomized Quicksort
Preview 33:12
play
Lecture 13 : Heap
Preview 28:37
play
Lecture 14 : Heap Sort
Preview 30:06
play
Lecture 15 : Decision Tree
Preview 29:16

play
Lecture 16 : Linear time Sorting
Preview 27:08
play
Lecture 17 : Radix Sort & Bucket Sort
Preview 32:00
play
Lecture 18 : Order Statistics
Preview 27:22
play
Lecture 19 : Randomised Order Statistics
Preview 28:19
play
Lecture 20 : Worst case linear time order statistics
Preview 27:55

play
Lecture 21 : Hash Function
Preview 27:34
play
Lecture 22 : Open Addressing
Preview 29:10
play
Lecture 23 : Universal Hashing
Preview 28:46
play
Lecture 24 : Perfect Hashing
Preview 34:25
play
Lecture 25 : Binary Search Tree (BST) Sort
Preview 26:45

play
Lecture 26 : Randomly build BST
Preview 33:03
play
Lecture 27 : Red Black Tree
Preview 28:18
play
Lecture 28 : Red Black Tree (Contd.)
Preview 29:11
play
Lecture 29 : Augmentation of data structure
Preview 29:01
play
Lecture 30 : Interval trees
Preview 31:51

play
Lecture 31 : Fixed universe successor
Preview 26:31
play
Lecture 32 : Van Emde Boas data structure
Preview 34:38
play
Lecture 33 : Amortized analysis
Preview 31:18
play
Lecture 34 : Computational Geometry
Preview 26:42
play
Lecture 35 : Computational Geometry (cont....)
Preview 26:52

play
Lecture 36 : Dynamic Programming
Preview 27:45
play
Lecture 37 : Longest common subsequence
Preview 27:46
play
Lecture 38 : Graphs
Preview 28:34
play
Lecture 39 : Prim's Algorithms
Preview 28:01
play
Lecture 40 : Graph Search
Preview 27:25

play
Lecture 41
Preview 34:11
play
Lecture 42
Preview 28:06
play
Lecture 43
Preview 27:19
play
Lecture 44
Preview 27:40
play
Lecture 45
Preview 27:14

play
Lecture 46
Preview 25:46
play
Lecture 47
Preview 28:05
play
Lecture 48
Preview 26:02
play
Lecture 49
Preview 28:13
play
Lecture 50
Preview 32:41

play
Lecture 51: Disjoint set data structure
Preview 26:00
play
Lecture 52: Union-Find
Preview 28:20
play
Lecture 53: Augmented disjoint set data structure
Preview 31:26
play
Lecture 54: Network flow
Preview 27:45
play
Lecture 55 Network Flow (contd...)
Preview 25:49

play
Lecture 56 : Network Flow (cont...)
Preview 32:51
play
Lecture 57 : More on Dynamic Programming
Preview 26:23
play
Lecture 58 : More on Dynamic Programming (cont...)
Preview 31:50
play
Lecture 59 : Computational Complexity
Preview 28:17
play
Lecture 60 : Computational Complexity (cont...)
Preview 33:11

play
Live Session 31-08-2021
Preview 32:34
img
No Discussion Found

2.0

1 Reviews

5
0
4
0
3
0
2
1
1
0
user
Ananya Bindu N

5 months ago

How to get a certificate??

Meet Your Instructor
@VTU COE
img

Instructor
3.2 Rating
2542 Students
759 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
    29 h 29 m 15 s
  • Course Level
    Intermediate
  • Student Enrolled
    64
  • Language
    English
This Course Includes
  • 29 h 29 m 15 s Video Lectures
  • 2 Quizzes
  • 0 Assignments
  • 0 Downloadable Resources
  • Full Lifetime Access
  • Certificate of Completion