NOC:Design and Analysis of Algorithms - Study24x7
NOC:Design and Analysis of Algorithms

8 Learners

NOC:Design and Analysis of Algorithms

Validity Unlimited NOC:Design and Analysis of Algorithms All Level NOC:Design and Analysis of Algorithms English

5.0 (1)
Free

Description

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 storage locations it uses (its space complexity). An algorithm is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input. Different inputs of the same length may cause the algorithm to have different behavior, so best, worst and average case descriptions might all be of practical interest. When not otherwise specified, the function describing the performance of an algorithm is usually an upper bound, determined from the worst case inputs to the algorithm.

Includes

  • NOC:Design and Analysis of Algorithms Total 8 Modules
  • NOC:Design and Analysis of Algorithms 56 Videos
  • NOC:Design and Analysis of Algorithms Downloadable on mobile
  • NOC:Design and Analysis of Algorithms Published on 08 July, 2019

Course Content

Week 1-Introduction, Analysis of Algorithms

NOC:Design and Analysis of Algorithms
  • <?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; ?>

Week 2-Searching and sorting

NOC:Design and Analysis of Algorithms
  • <?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; ?>

Week 3-Graphs

NOC:Design and Analysis of Algorithms
  • <?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; ?>

Week 4-Weighted graphs

NOC:Design and Analysis of Algorithms
  • <?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; ?>

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

NOC:Design and Analysis of Algorithms
  • <?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; ?>

Week 6-Data Structures: Search Trees, Greedy Algorithms

NOC:Design and Analysis of Algorithms
  • <?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; ?>

Week 7-Dynamic Programming

NOC:Design and Analysis of Algorithms
  • <?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; ?>

Week 8-Linear Programming and Network Flows,Intractability

NOC:Design and Analysis of Algorithms
  • <?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; ?>

Review & Ratings

5.0

1 Ratings

5 study24x7
 
100%
4 study24x7
 
0%
3 study24x7
 
0%
2 study24x7
 
0%
1 study24x7
 
0%
https://study247.s3-accelerate.amazonaws.com/studyx

Himanshi Srivastava

08 Jul 2019 05:37 PM

Excellent

Nice course to learn.

NOC:Design and Analysis of Algorithms NOC:Design and Analysis of Algorithms NOC:Design and Analysis of Algorithms Important 1
NOC:Design and Analysis of Algorithms NOC:Design and Analysis of Algorithms Comment 0

Similar Courses

NOC: Inorganic Chemistry of Life Principles and Pe..

by Prof C P Rao
0.0 (0)

2 Enrollments

Validity Unlimited

Free

Organic Chemistry and Pericyclic Reactions

by Dr N D Pradeep Singh
0.0 (0)

5 Enrollments

Validity Unlimited

Free

Organic photochemistry and pericyclic reactions

by Dr N D Pradeep Singh
0.0 (0)

1 Enrollments

Validity Unlimited

Free

NOC Medicinal Chemistry

by Prof Harinath Chakrapani
0.0 (0)

1 Enrollments

Validity Unlimited

Free

Organic Chemistry Lab Certification

by Prof Harinath Chakrapani
0.0 (0)

2 Enrollments

Validity Unlimited

Free

Organic Reaction Mechanism

by Dr R B Sunoj
0.0 (0)

1 Enrollments

Validity Unlimited

Free

Polymer Chemistry

by Dr D Dhara
0.0 (0)

1 Enrollments

Validity Unlimited

Free

Principles and Applications of Electron Paramagnet..

by Prof Ranjan Das
0.0 (0)

2 Enrollments

Validity Unlimited

Free

Rate processes

by Dr M Halder
0.0 (0)

1 Enrollments

Validity Unlimited

Free

Selected Topics in Co-ordination Chemistry

by Dr Vasishta D Bhatt
0.0 (0)

1 Enrollments

Validity Unlimited

Free

Structure and Functions of Biomolecules

by Dr S K Khare
0.0 (0)

1 Enrollments

Validity Unlimited

Free

RRB NTPC Mock Test 2019

by Learn N Share - Get latest updates on education
5.0 (1)

3 Enrollments

Validity Unlimited

21

NOC:Introduction to Research

by Dr Arun K Tangirala
4.0 (1)

5 Enrollments

Validity Unlimited

Free

NOC:Introduction to Statistical Hypothesis Testing

by Dr Arun K Tangirala
0.0 (0)

3 Enrollments

Validity Unlimited

Free

Government Jobs Exam Syllabus

by GOVERNMENT JOB NOTIFICATION
5.0 (2)

202 Enrollments

Validity Unlimited

Free

NOC:Introduction to Time  Frequency Analysis and ..

by Dr Arun K Tangirala
0.0 (0)

3 Enrollments

Validity Unlimited

Free

System (Process) Identification

by Dr Arun K Tangirala
0.0 (0)

4 Enrollments

Validity Unlimited

Free

System Identification

by Dr Arun K Tangirala
0.0 (0)

7 Enrollments

Validity Unlimited

Free

Error Correcting Codes

by Error Correcting Codes
5.0 (2)

27 Enrollments

Validity Unlimited

Free

Modern Instrumental Methods of Analysis

by Dr J R Mudakavi
0.0 (0)

8 Enrollments

Validity Unlimited

Free

NOC:Atomic and Molecular Absorption Spectrometry f..

by Dr J R Mudakavi
5.0 (2)

19 Enrollments

Validity Unlimited

Free

NOC:Inductive Couple Plasma Atomic Emmission Spect..

by Dr J R Mudakavi
0.0 (0)

14 Enrollments

Validity Unlimited

Free

NOC Infrared spectroscopy for pollution monitoring

by Dr J R Mudakavi
0.0 (0)

5 Enrollments

Validity Unlimited

Free

NOC Trace and ultra trace analysis of metals using..

by Dr J R Mudakavi
0.0 (0)

10 Enrollments

Validity Unlimited

Free

SBI Clerk 2018 Preliminary & Mains Mock Test

by Just Asking - Lets check your knowledge
4.0 (1)

3 Enrollments

Validity Unlimited

21