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 |
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.
Using greedy strategy, schedule the following jobs with deadline so as to maximize the profit.
What is ISO 9000 Certification? How to Get ISO 9000 Certification?
Discuss Quality Assurances
Write short notes on:
What is tree traversal?