Lecture Notes || SNS Courseware

Subject Details

Dept : IT

Sem : 4

Regul : 2017

Faculty : Prof.T. R. lekhaa

phone : NIL

E-mail : lekhaa86@gmail.com

1.024K

Page views

Files

Videos

R.Links

Lecture Notes

UNIT 1:

Important Problem Types

Fundamentals of the Analysis of Algorithmic Efficiency

Asymptotic Notations and their properties.

Mathematical analysis for Recursive algorithms

Mathematical analysis for Non-recursive algorithms

Visualization

Analysis Framework – Empirical analysis

Notion of an Algorithm

Fundamentals of Algorithmic Problem Solving

UNIT 2:

Brute Force – Computing an

Closest-Pair and Convex-Hull Problems

Exhaustive Search - Travelling Salesman Problem

Knapsack Problem - Assignment problem

Divide and Conquer Methodology – Binary Search

Merge sort – Quick sort

– Heap Sort - Multiplication of Large Integers

Closest-Pair and Convex - Hull Problems.

Divide and Conquer Methodology – Binary Search

UNIT 3:

Dynamic programming – Principle of optimality

Coin changing problem, Computing a Binomial Coefficient –

Floyd‘s algorithm – Multi stage graph

Optimal Binary Search Trees

Knapsack Problem and Memory functions

Greedy Technique – Container loading problem - Prim‘s algorithm

Optimal Merge pattern - Huffman Trees.

UNIT 4:

maximum flow problem

stable marriage problem

Bipartite matching graph problem

UNIT 5:

lower bound np hard and complete problems

N queens problem

Lecture Notes

Announcements

Recent Files

Copyright © SNS College Of Engineering 2014 Developed bySNSCE