Lecture Notes || SNS Courseware

Subject Details

Dept : CSE

Sem : 4

Regul : R2019

Faculty : Ramesh kalyan G

phone : NIL

E-mail : ramesh.g.cse@snsct.org

662

Page views

Files

Videos

R.Links

Lecture Notes

UNIT 1:

Introduction, Notion of an Algorithm

Fundamentals of Algorithmic Problem Solving

Important Problem Types

Implementation of GCD using Euclidean Algorithm

Fundamentals of the Analysis of Algorithm EfficiencyFundamentals of the Analysis of Algorithm Efficiency

Mathematical Analysis for Recursive Algorithm

Mathematical Analysis for Non-recursive Algorithms

Analysis Framework

Asymptotic Notations and its properties

Fundamentals of Algorithmic Problem Solving

Implementation of GCD using Consecutive Integer checking algorithm

UNIT 2:

Sequential Search and Closest Pair Problem

Knapsack Problem, Assignment

Quick Sort

Implementation of Merge Sort

Brute Force: Selection Sort , Bubble Sort

UNIT 3:

Knapsack Problem and Memory Functions

Dynamic Programming: Computing a Binomial Coefficient

UNIT 4:

Flow Network

Knuth Morris Pratt Algorithm- Analysis

Implementation of Ford Fulkerson Method

Implementation of Naïve Bayes Algorithm

UNIT 5:

Hamiltonian Circuit Problem, Subset Sum Problem

Knapsack Problem

Branch and Bound: Assignment Problem

Lecture Notes