Greedy Algorithms

**1.**Greedy job scheduling with deadlines algorithms’ complexity is defined as

**2.**The method which return different solutions from a single point ,which is _________

**3.**job sequencing with deadline is based on ____________method

**4.**fractional knapsack is based on ____________method

**5.**The files x1,x2,x3 are 3 files of length 30,20,10 records each. What is the optimal merge pattern value?

**6.**The optimal merge pattern is based on _________ method

**7.**

Which of the following standard algorithms is not a Greedy algorithm?

**8.**

What is the time complexity of Huffman Coding?

**9.**

Which of the following is true about Huffman Coding.

**10.**

Consider the undirected graph below:

Using Prim's algorithm to construct a minimum spanning tree starting with node A, which one of the following sequences of edges represents a possible order in which the edges would be added to construct the minimum spanning tree?