Using greedy strategy, schedule the following jobs with deadline so as to maximize the profit.
Deadlines and profits are mentioned as follows:
Job i |
1 |
2 |
3 |
4 |
Deadline di |
3 |
2 |
3 |
1 |
Profit gi |
9 |
7 |
7 |
2 |
Write the string matching algorithm due to Knuth,Moris and Pratt. Analyze its time complexity.
Using greedy strategy, schedule the following jobs with deadline so as to maximize the profit.
Write short notes on
What are the difference between linear and non-linear data structure?
What are the differences between AVL Tree & Binary Search Tree ?
Distinguish between Decision table versus decision tree
Why Required of ISO 9001:2000 standard?