infyni

Analysis and Design of Algorithm

An Algorithm is a sequence of steps to solve a problem.

Live Course

Duration: 12 Hours

Enrolled: 132

Offered by: infyni

Live Course

About Course

An algorithm is a systematic method containing a sequence of instructions to solve a computational problem. It takes some inputs, performs a well defined sequence of steps, and produces some output. Once we design an algorithm, we need to know how well it performs on any input. In particular we would like to know whether there are better algorithms for the problem by analyzing an algorithm in a machine-independent way. Algorithm design and analysis is the core of computer science.

Topics
Instructor (1)

1 Introduction to Algorithms

Definitions and notations
standard notations - asymptotic notations
worst case
best case and average case analysis
big oh, small oh, omega and theta notations
Recursive algorithms
analysis of non- recursive and recursive algorithms
solving recurrence equations
analysing control structures.

2 Sorting and Searching

Analysis of Sorting and Searching Heap
insertion
selection and bubble sort
sequential
binary and Fibonacci search
Divide and Conquer Method- General Method binary search finding maximum and minimum merge sort and quicksort Stassen’s Matrix multiplication.

3 Shortest path algorithm

Minimum spanning tree algorithms
single source shortest path algorithm
scheduling.

4 Dynamic Programming

Introduction to Dynamic Programming
General method multistage graphs
all pair shortest path algorithm
0/1 Knapsack and Travelling salesman problem
approaches using recursion
memory functions.

5 Search and Traversal technique

Basic Search and Traversal technique
Techniques for binary trees and graphs
AND/OR graphs
biconnected components
topological sorting
Backtracking and Recursive backtracking

6 Advance Algorithm

Bounding – FIFO Branch-and-Bound
0/1 Knapsack problem
travelling salesman problem
Introduction to NP-Hard and NP-Completeness