Algorithmics (演算法)

Lecturer: 江振瑞
Teacher Assistant
: 葉政峰 廖基豪
Blackborad System: http://bb.ncu.edu.tw (演算法B)
Time: Tuesday 15:00~17:50
Place: E6 - A2O9
TA Class: ~
Downloads:
TextBook:

Reference Books: Syllabus:  
     (DynamicP2.pptx) (11/27)
Homework9:
A. Given a 0/1 knapsack problem with knapsack capacity C=10, and 3 objects with weights 10, 3, 5 and profits 40, 20, 30, use the recursive-form dynamic programming technique to solve the 0/1 knapsack problem.
B. The resource allocation problem is defined as follows. We are given m resources and n projects. A profit P(i, j) will be obtained if i, 0<=i<=m, resources are allocated to project j. The problem is to find an allocation of resources to maximize the total profit. Solve the resource allocation problem with the following profit matrix
Homework 12:
A. Use the A* algorithm to solve the multi-stage graph shortest path problem on page 216. (Note: You should draw the search tree.)
B. (Bonus) Write a program to implement the A* algorithm to solve the multi-stage graph shortest path problem. You should hand in a hardcopy report and upload your report and program via FTP. TA will ask you to demo your program.
  1. http://online-judge.uva.es/p/v101/10131.html
  2. http://online-judge.uva.es/p/v100/10069.html
  3. http://online-judge.uva.es/p/v101/10154.html
  4. http://online-judge.uva.es/p/v1/116.html
  5. http://online-judge.uva.es/p/v100/10003.html
  6. http://online-judge.uva.es/p/v102/10261.html
  7. http://online-judge.uva.es/p/v102/10271.html
  8. http://online-judge.uva.es/p/v102/10201.html
Scoring:
Links:


Back to My Home