Given an unlimited supply of coins of denominations x1; x2; : : : ; xn, we wish to make change fora value v using at most k coins; that is, we wish to find a set of k coins whose total value is v. this might not be possible: for instance, if the denominations are 5 and 10 and k = 6, then wecan make change for 55 but not for 65. give an efcient dynamic-programming algorithm for thefollowing problem. input: x1; : : : ; xn; k; v. question: is it possible to make change for v using at most k coins, of denominationsx1; : : : ; xn?

When you type the pwd command, you notice that your current location on the linux filesystem is the /usr/local directory. answer the following questions, assuming that your current directory is /usr/local for each question. a. which command could you use to change to the /usr directory using an absolute pathname? b. which command could you use to change to the /usr directory using a relative pathname? c. which command could you use to change to the /usr/local/share/info directory using an absolute pathname? d. which command could you use to change to the /usr/local/share/info directory using a relative pathname? e. which command could you use to change to the /etc directory using an absolute pathname? f. which command could you use to change to the /etc directory using a relative pathname?

Donnie does not have powerpoint. which method would be best for elana to save and share her presentation as is? a pdf a doc an rtf a ppt

*! 20 points! *jeff wants to create a website with interactive and dynamic content. which programming language will he use? a. dhtml b. html c. css d. javascript