Lecture Notes || SNS Courseware

Subject Details

Dept : CSE-IOT

Sem : 5

Regul : 2019

Faculty : Ms.B.Sangeethapriya

phone : 7010189775

E-mail : sangeetha.b.iot@snsce.ac.in

370

Page views

Files

Videos

R.Links

Lecture Notes

UNIT 1:

Recurrences, probabilistic analysis

Algorithm, pseudo code for expressing algorithms,

Theta notation ,little o notation

Time complexity asymptotic notation

performance analysis-space complexity,

Disjoint set operation,union and find algorithm

Big o notation,omega notation

UNIT 2:

Fractional knapsack problem

Divide and conquer algorithm

Analysis of binary search ,quick sort

Merge sort ,and or graph

Greedy algorithm,job sequencing with deadlines

Minimum cost spanning trees

Single source shortest path

UNIT 3:

Breadth first search and traversal, Depth first search and traversal

, Spanning trees, connected components

bi-connected components

Articulation points

DYNAMIC PROGRAMMING: General method, applications

0/1 knapsack problem

All pairs shortest path problem

Travelling sales person problem

, Reliability design

Lecture Notes