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:
Find the recurrence relation of binary search and derive the time complexity of binary search.
Write the string matching algorithm due to Knuth,Moris and Pratt. Analyze its time complexity.
What are Halstead’s metrics?
Difference between Inspections and Walkthrough
Write a C program to find sum of digit of any no.
What do you mean by software crisis & its solution.
