Given weight vector {15,25,35,45,55} and the profit vector {10,20,30,40,50} and a knapsack of capacity 100, find atleast three feasible solutions including optimal one for the knapsack problem of 5 items.
Feasible and optimal solution of knapsack problem:
Using greedy strategy, schedule the following jobs with deadline so as to maximize the profit.
Write the string matching algorithm due to Knuth,Moris and Pratt. Analyze its time complexity.
Define Quality Planning
Write a C program to transpose of a matrix.
