This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: the reverse graph, and the second DFS spanning tree as the SCC’s. [8] Q2b. If the same graph is undirected (merge any doubly directed edge), then what do you think are the SCC’s? [2] Q3. For the following game tree describe which nodes will be pruned by alphabeta pruning, and explain briefly why they will be pruned? Q4. The following list of objects is provided to be manufactured in a factory, with (time, profit) pair for each object: (1, 40), (3, 18), (2, 4) and (2, 20) Q4a. The factory needs to choose a subset of objects such that the total preparation time is less than or equal to 5 and the total profit is maximum . Solve the problem (find max profit, and the subset) by dynamic programming. [8] Q4b. What is the solution when any object may be partially produced ( not DP algorithm )? [2]...
View
Full
Document
This note was uploaded on 02/10/2012 for the course CSE 5211 taught by Professor Dmitra during the Spring '12 term at FIT.
 Spring '12
 Dmitra
 Algorithms

Click to edit the document details