Scribd
Upload
6 views1 page

Algorithmic Problem Solving Techniques

The document outlines a curriculum covering fundamental concepts in algorithmic problem solving, including algorithm efficiency, important problem types, and various algorithms such as BFS, DFS, and sorting techniques. It also addresses advanced topics like NP, NP-Complete, and NP-Hard problems, along with approximation algorithms. Each unit focuses on specific algorithms and problem-solving strategies, providing a comprehensive overview of algorithm design and analysis.

Uploaded by

Mr. Vish
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views1 page

Algorithmic Problem Solving Techniques

The document outlines a curriculum covering fundamental concepts in algorithmic problem solving, including algorithm efficiency, important problem types, and various algorithms such as BFS, DFS, and sorting techniques. It also addresses advanced topics like NP, NP-Complete, and NP-Hard problems, along with approximation algorithms. Each unit focuses on specific algorithms and problem-solving strategies, providing a comprehensive overview of algorithm design and analysis.

Uploaded by

Mr. Vish
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

UNIT 1

Fundamentals of algorithmic problem solving


Fundamentals of analysis of algorithm efficiency
Important Problem Types
Asymptotic notation and its properties
Mathematical analysis of Recursive algorithm
Mathematical analysis of Non Recursive algorithm

UNIT 2
GRAPHS-BFS,DFS Applications
Connectivity(strong bi-connectivity)
MST-Kruskal and Prims
Bellman Ford Algorithm
Dijkstras algorithm
Floyd Warshall algorithm
Ford Fulkerson
Maximum Bipartite matching algorithm

UNIT 3
Merge Sort
Quick Sort
Dynamic Programming
Matrix Chain
Multistage Graph
Optimal Binary Search Tree
Greedy Technique
Activity Selection
Optimal Merge Pattern
Huffman Trees

UNIT 4
N Queens Problem
Hamiltonian Circuit Problem
Subset Sum Problem
Graph Coloring Problem
15 Puzzle Problem
Assignment Problem
Knapsack Problem
Travelling Salesman Problem

UNIT 5
P NP NP Complete and NP Hard problems
Approximation algorithm
Travelling Salesman Problem
Knapsack problem

You might also like