You are on page 1of 8

INDEX

SL.N DATE TITLLE OF THE PROGRAM PAGE NO SIGNATURE


O

SEARCHING

1 LINEAR SEARCH

2 BINARY SEARCH

3 FIBONACCI SEARCH

SORTING

4 BUBBLE SORT

5 SELECTION SORT

6 INSERTION SORT

7 HEAP SORT

8 RADIX SORT

9 SHELL SORT

DIVIDE AND CONQUER METHOD

10 FINDING MINIMUM AND MAXIMUM

11 QUICK SORT

12 MERGE SORT

GREEDY METHOD

13 KNAPSACK PROBLEM

14 PRIM’S ALGORITHM

15 KRUSKAL’S ALGORITHM
INDEX

TITLLE OF THE PROGRAM


INDEX

SL.N DATE TITLLE OF THE PROGRAM PAGE NO SIGNATURE


O

GRAPH TRAVERSAL

16 BREADTH FIRST SEARCH

17 DEPTH FIRST SEARCH

DYNAMIC PROGRAMMING

18 ALL PAIR SHORTEST PATH

19 0/1 KNAPSACK PROBLEM

20 TRAVELLING SALESMAN PROBLEM

BACK TRACKING

21 N-QUEEN PROBLEM

22
M-COLORING

BRANGH AND BOUND


23
TRAVELLING SALESMAN PROBLEM
INDEX
INDEX
INDEX
INDEX
INDEX

You might also like