Based on our lecture discussions, which of the following problems do we know can be solved using Dynamic Programming in polynomial time?

Which of the following is NOT to correct to say about Topological sorting of a directed acyclic graph

Based on our lecture discussion, using a greedy algorithm to schedule 10 jobs of varying lengths (2, 4, 4, 8, 3, 3, 5, 3, 2, 1) across three (3) available processors, what would be the (maximum) finishing time of the schedule (so you need to find the minimum of the maximum finishing time among all the processors)?

Consider a function f( n ) representing the running time of an algorithm.

How many bits would be needed in a message if a networking company uses Huffman coding as a

What is the worst-case time complexity of the following algorithm? Select the tightest bound. 

Consider a newly discovered problem, "Problem-X". If researchers manage to find a polynomial-time algorithm that can transform any instance of the well-known NP-Complete problem "3-CNF" into an instance of "Problem-X" such that the answer to the "3-CNF" instance is "yes" if and only if the answer to the "Problem-X" instance is "yes," what can we definitively conclude about "Problem-X"?

Which of the following is NOT a typical step in a greedy algorithm?

Following the discussion from our lectures, what is the worst-case running time of the Rabin-Karp algorithm (for the text of size n and the pattern of size m, where m < n)? 

Which of the following statements is NOT true about the Longest Common Subsequence (LCS) problem?