NEW

Practical List
Subject: Analysis of Algorithms
SE COMP


1>Generation of different Patterns

2>Implementation of different Sorting Techniques

3>Implementation based on divide and conquer method
Merge Sort
Quick Sort

4>Implementation on Greedy Approach
Knapsack Problem
Job Sequencing with deadlines
Optimal Storage on Tapes

5>Implementation on dynamic programming
Single Source Shortest Path – Dijkstra’s Algorithm
0/1 Knapsack Problem

6>Implementation of backtracking methods
N-queen’s Problem

7>Implementation of Branch and Bound Concept
0/1 Knapsack algorithm

8>Implementation of Internet Algorithm
Boyer-Moore Algorithm
Knuth-Morris-Pratt Algorithm