Lecture Notes || SNS Courseware

Subject Details

Dept : CSE

Sem : 4

Regul : 2017

Faculty : K.Kalaiselvi

phone : NIL

E-mail : info.kalaiselvi@gmail.com

1.881K

Page views

Files

Videos

R.Links

Lecture Notes

UNIT 1:

Notion of an Algorithm

Fundamentals of Algorithmic Problem Solving

Important Problem Types

Analysis Framework

Empirical analysis - Mathematical analysis for Recursive Algorithms

Empirical analysis - Mathematical analysis for Non Recursive Algorithms

Asymptotic Notations and their properties

Mathematical Analysis of Non - Recursive Algorithms

Mathematical Analysis of Recursive Algorithms

Visualization

Empirical Analysis

UNIT 2:

Brute Force – Computing an – String Matching

Closest-Pair and Convex-Hull Problems

Exhaustive Search - Travelling Salesman Problem

Knapsack Problem - Assignment problem

Merge sort

Binary Search

Heap Sor

Multiplication of Large Integers – Closest-Pair and Convex - Hull Problems.

Closest pair problem

Convex Hull Problem

UNIT 3:

Dynamic programming – Principle of optimality - Coin changing problem

Computing a Binomial Coefficient – Floyd‘s algorithm –

Optimal Binary Search Trees

Knapsack Problem and Memory functions

Greedy Technique – Container loading problem -

Optimal Merge pattern - Huffman Trees

UNIT 4:

The Maximum-Flow Problem

The Simplex Method - Geometric Interpretation of Linear Programming

Maximum Matching in Bipartite Graphs

Stable marriage Problem

UNIT 5:

Lower - Bound Arguments

- P, NP NP- Complete and NP Hard Problems

Backtracking – n-Queen problem

Hamiltonian Circuit Problem

Subset Sum Problem

Branch and Bound – LIFO Search and FIFO search - Assignment problem –

Knapsack Problem

Traveling Salesman Problem

Approximation Algorithms for NP-Hard Problems – Travelling Salesman problem

Lecture Notes

Announcements

Recent Files

Copyright © SNS College Of Engineering 2014 Developed bySNSCE