- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The first step in the naïve greedy algor...

Q. |
## The first step in the naïve greedy algorithm is? |

A. | analysing the zero flow |

B. | calculating the maximum flow using trial and error |

C. | adding flows with higher values |

D. | reversing flow if required |

Answer» A. analysing the zero flow | |

Explanation: the first step in the naïve greedy algorithm is to start with the zero flow followed by adding edges with higher values. |

View all MCQs in:
Design and Analysis of Algorithms

- Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?
- A greedy algorithm can be used to solve all the dynamic programming problems.
- The 0-1 Knapsack problem can be solved using Greedy algorithm.
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- The naive pattern searching algorithm is an in place algorithm.
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Prim’s algorithm resembles Dijkstra’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ