Design analysis and algorithm topic Job sequencing with deadline.pdf
- 1. Algorithm Unit 2 part 2
- 2. Job sequencing with deadline • We are given n jobs where each job is associated with a deadline And profit. If the job is finished before the death . • We have single CPU with non-pre-emptive scheduling. • With each job, we assume arrival time is 0 burst time of each job requirement is 1. • Select a subset of N jobs, such that the job in a subset can be completed within the deadline and generate maximum profit.
- 3. • Q. if we have four task. having deadline And profit. Find the maximum profit possible.
- 6. • Conclusion • Follow the given steps to solve the problem: • Sort all jobs in decreasing order of profits. • A trait on jobs in decreasing order of profit for each job, do the following: • Find the time slot i such that slot is empty and i< deadline, and i is greatest. Put the job in this slot and mark this slot filled. • If no such I exist, then ignore the job.
- 12. Huffman trees • Hoffman invented a greedy algorithm that constructs an optimal prefix code called a Hoffman code. • The algorithm builds the tree.T corresponding to the optimal code in a bottom up manner. It begin with a set of |c| leaves, and performs a sequence of|c|-1 merging operations to create the final tree.
- 13. • Q. Find an optimal Hoffman code for the following set of frequency.