Exercises

1. Which of the following options will be correct when a top-down approach of dynamic programming will be applied to solve a given problem related to the space and time complexity?
   1. It will increase both time and space complexity. 
   2. It will increase the time complexity, and decrease the space complexity 
   3. It will increase the space complexity, and decrease the time complexity 
   4. It will decrease both time and space complexities.
2. Dijkstra’s single shortest path algorithm is applied on edge weighted directed graph shown in Figure 3.17. What will be the order of the nodes for the shortest path distance path (Assume A as source) ?

Figure 3.17: An edge-weighted directed graph

3. Consider the weights and values of the items listed in Table 3.8. Note that there is only one unit of each item.

   Item

   ...