Docsity
Log inSign up
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search Store documents

The best documents sold by students who completed their studies

Search through all study resources
Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

University Rankings

Discover the best universities in your country according to Docsity users

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

From our blog

Exams and Study
Go to the blog

COMP157 Fall07 Assignment 7: Dynamic Programming Exercises, Assignments of Algorithms and Programming

University of the Pacific (UOP)Algorithms and Programming

Information about assignment 7 for the comp157 fall07 course. The assignment includes several dynamic programming exercises, such as finding the transitive closure of a directed graph and solving the knapsack problem. The necessary data for these exercises, including the directed graph and the items' values and weights for the knapsack problem.

Typology: Assignments

Pre 2010

Uploaded on 08/18/2009

koofers-user-cd7
koofers-user-cd7 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
COMP157Fall07Assignment7
HomeworkAssignment7:dueMonday,November12.
(1) Exercise7.1.6,page254
(2) Exercise7.3.4,page271
(3) Exercises8.4.9,page304
(4) Usedynamicprogrammingtofindthetransitiveclosureofthefollowingdirectedgraph.
Showallintermediatematricesinyouranswer.
(5) Usedynamicprogrammingtofindthemaximumpossiblevalueofthefollowingknapsack
problem.Solvetheproblemtwice:onceorderingtheitemstoptobottom,andthenordering
theitemsbottomtotop.Thiswillverifythattheitemorderdoesnotaffecttheresult.
capacity=20
valueweight
109
308
235
153
184
406
207
12
35
4 6

Partial preview of the text

Download COMP157 Fall07 Assignment 7: Dynamic Programming Exercises and more Assignments Algorithms and Programming in PDF only on Docsity!

COMP157 Homework Assignment Fall07 7 : due Monday, NovemberAssignment 12. 7

(1) (2) (3) ExerciseExerciseExercises 7.1.6,7.3.4, 8.4.9, pagepage page (^254271 ) (4) Use Show dynamic all intermediate programming matrices to find in yourthe transitive answer. closure of the following directed graph.

(5) Use problem. the itemsdynamic Solvebottom programming the to problem top. This to twice: willfind verify the once maximum thatordering the itempossible the itemsorder value topdoes (^) toof not thebottom, affect following and the then (^) result.knapsack ordering capacity value 10 = (^20) weight 9 (^302315 ) (^184020 )