NOC:Design and Analysis of Algorithms - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
googlePlay app_img
NOC:Design and Analysis of Algorithms
broucher Course Brochure
NOC:Design and Analysis of Algorithms
by Prof Madhavan Mukund

The analysis of algorithms is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them. Usually, this involves determining a function that relates the length of an algorithm's input to the number of steps it takes (its time complexity) or the number of stor...

5.0  (316 Ratings) 702 Learner
validy img Validity Unlimited
level All Level
level English
cover Img Preview not available
Program Fee
FREE
About This Course

The analysis of algorithms is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them. Usually, this involves determining a function that relates the length of an algorithm's input to the number of steps it takes (its time complexity) or the number of stor...

Show more
Course Curriculum
8 Sections | 56 Lecture | 15h 05min total length
Expand all sections
NOC:Design and Analysis of Algorithms

Week 1-Introduction, Analysis of Algorithms

| 01h 47min total length
  • <?php echo $alt; ?>

    Course Outline

    17m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Example: Air Travel

    9m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Example: Xerox shop

    6m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Example: Document similarity

    9m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Introduction and motivation

    18m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Input size, worst case, average case

    10m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Quantifying efficiency: O( ), Omega( ), Theta( )

    18m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Examples: Analysis of iterative and recursive algorithms

    17m <?php echo $alt; ?>
NOC:Design and Analysis of Algorithms

Week 2-Searching and sorting

| 01h 36min total length
  • <?php echo $alt; ?>

    Insertion sort

    13m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Selection Sort

    13m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Searching in an array

    13m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Arrays and lists

    13m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Sorting - Concluding remarks

    8m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Quicksort - analysis

    8m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Quicksort

    8m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Merge sort - analysis

    8m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Merge sort

    8m <?php echo $alt; ?>
NOC:Design and Analysis of Algorithms

Week 3-Graphs

| 01h 37min total length
  • <?php echo $alt; ?>

    Representing graphs

    13m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Introduction to graphs

    13m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Directed acylic graphs: longest paths

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Directed acylic graphs: topological sort

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Applications of BFS and DFS

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Depth first search (DFS)

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Breadth first search (BFS)

    14m <?php echo $alt; ?>
NOC:Design and Analysis of Algorithms

Week 4-Weighted graphs

| 01h 42min total length
  • <?php echo $alt; ?>

    Kruskals algorithm

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Prims Algorithm

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Minimum Cost Spanning Trees

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    All pairs shortest paths

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Negative edge weights: Bellman-Ford algorithm

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Dijkstras algorithm: analysis

    14m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Single source shortest paths: Dijkstras algorithm

    14m <?php echo $alt; ?>
NOC:Design and Analysis of Algorithms

Week 5- Data Structures: Union-Find and Heaps, Divide and Conquer

| 01h 56min total length
  • <?php echo $alt; ?>

    Closest pair of points

    16m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Counting inversions

    16m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Heaps: Updating values, sorting

    16m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Heaps

    16m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Priority queues

    16m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Union-Find using pointers

    16m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Union-Find using arrays

    16m <?php echo $alt; ?>
NOC:Design and Analysis of Algorithms

Week 6-Data Structures: Search Trees, Greedy Algorithms

| 02h 25min total length
  • <?php echo $alt; ?>

    Huffman codes

    29m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Scheduling with deadlines: minimizing lateness

    29m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Interval scheduling

    29m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Balanced search trees

    29m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Binary Search Trees

    29m <?php echo $alt; ?>
NOC:Design and Analysis of Algorithms

Week 7-Dynamic Programming

| 01h 35min total length
  • <?php echo $alt; ?>

    Matrix multiplication

    15m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Edit distance

    15m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Common subwords and subsequences

    15m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Grid Paths

    15m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Memoization

    15m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Introduction to dynamic programming

    15m <?php echo $alt; ?>
NOC:Design and Analysis of Algorithms

Week 8-Linear Programming and Network Flows,Intractability

| 02h 25min total length
  • <?php echo $alt; ?>

    P and NP

    20m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Checking Algorithms

    20m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Reductions

    20m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Network Flows

    20m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    LP modelling: Bandwidth allocation

    20m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    LP modelling: Production Planning

    20m <?php echo $alt; ?>
  • <?php echo $alt; ?>

    Linear Programming

    20m <?php echo $alt; ?>
show 5 more sections

Review & Ratings

5.0
https://img1.study24x7.com/assets/images/svg-three/course/courseDetails/videoPlayIcon.svg

Hridendra Srivastava

08 Jul 2019 05:37 PM

Nice course to learn.

More Courses by Prof Madhavan Mukund

NOC:Functional Programming in Haskell

by Prof Madhavan Mukund
0.0 (0)

5 Enrollments

Validity Unlimited

Free

NOC:Programming, Data Structures and Algorithms in..

by Prof Madhavan Mukund
5.0 (0)

31 Enrollments

Validity Unlimited

Free