VTU Online Class - Course Details

Introduction To Algorithms And Analysis

SOURAV MUKHOPADHYAY

0.0

(0) 30 Students

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.

Lecture 1 : Insertion sort

Lecture 2 : Analysis of Insertion Sort

Lecture 3 : Asymptotic Analysis

Lecture 4 : Recurrence of Merge Sort

Lecture 5 : Substitution Method

Lecture 6 : The Master Method

Lecture 7 : Divide-and-Conquer

Lecture 8 : Divide-and-Conquer (Contd.)

Lecture 9 : Straseen's Algorithms

Lecture 10 : QuickSort

Lecture 11 : Analysis of Quicksort.

Lecture 12 : Randomized Quicksort

Lecture 13 : Heap

Lecture 14 : Heap Sort

Lecture 15 : Decision Tree

Lecture 16 : Linear time Sorting

Lecture 17 : Radix Sort & Bucket Sort

Lecture 18 : Order Statistics

Lecture 19 : Randomised Order Statistics

Lecture 20 : Worst case linear time order statistics

Lecture 21 : Hash Function

Lecture 22 : Open Addressing

Lecture 23 : Universal Hashing

Lecture 24 : Perfect Hashing

Lecture 25 : Binary Search Tree (BST) Sort

Lecture 26 : Randomly build BST

Lecture 27 : Red Black Tree

Lecture 28 : Red Black Tree (Contd.)

Lecture 29 : Augmentation of data structure

Lecture 30 : Interval trees

Lecture 31 : Fixed universe successor

Lecture 32 : Van Emde Boas data structure

Lecture 33 : Amortized analysis

Lecture 34 : Computational Geometry

Lecture 35 : Computational Geometry (cont....)

Lecture 36 : Dynamic Programming

Lecture 37 : Longest common subsequence

Lecture 38 : Graphs

Lecture 39 : Prim's Algorithms

Lecture 40 : Graph Search

Lecture 51: Disjoint set data structure

Lecture 52: Union-Find

Lecture 53: Augmented disjoint set data structure

Lecture 54: Network flow

Lecture 55 Network Flow (contd...)

Lecture 56 : Network Flow (cont...)

Lecture 57 : More on Dynamic Programming

Lecture 58 : More on Dynamic Programming (cont...)

Lecture 59 : Computational Complexity

Lecture 60 : Computational Complexity (cont...)

Live Session 31-08-2021

No Discussion Found

0.0

0 Reviews

5

0

4

0

3

0

2

0

1

0

Meet Your Instructor

video

Free

Course Duration

29 h 29 m 15 s
Course Level

Intermediate
Student Enrolled

30
Language

English

This Course Includes

29 h 29 m 15 s Video Lectures
0 Quizzes
0 Assignments
0 Downloadable Resources
Full Lifetime Access
Certificate of Completion