subject

Let s = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight values, a: (12,4), b: (10,6), c: (8,5), d: (11,7), e: (14,3), f: (7,1), g: (9,6). what is an optimal solution to the fractional knapsack problem for s assuming we have a sack that can hold objects with total weight 18? show your work.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 20:00
How is the number 372 written when expanded out to place values in the base 8 (octal) number system? a. 2 x 4 + 3 x 2 + 4 x 1 b. 3 x 64 + 7 x 8 + 2 x 1 c. 3 x 8 + 7 x 7 + 2 x 6 d. 3 x 100 + 7 x 10 + 2 x 1
Answers: 1
question
Computers and Technology, 23.06.2019 12:30
What is the difference between the internet and the world wide web?
Answers: 1
question
Computers and Technology, 24.06.2019 21:30
Computer security/cybersecurity1) each of the following code fragments contains a number of security vulnerabilities. for each fragment, identify these security vulnerabilities and, for each vulnerability, discuss at least one way that it could be improved. note that in your discussion of how each vulnerability could be improved, you do not need to re-write a new version of the program in c; simply discuss your solution, either in pseudocode or in 1-2 sentences.a) /* file descriptor leak */#include #include int main(int argc, char *argv[]){ char *filepath = argv[0]; char *shellpath = argv[1]; file *passwords; passwords = fopen(filepath, "r"); /* read the password and do something with it */ /* . . */ /* fork and execute alternative shell */ execl(shellpath, "shell", null); }b)#include /* assume the following function is written for an electronic storefront. the user will enter the id of the item to be ordered, as well as the quantity of units that they would like to purchase. the program will then lookup the price for the price for the item using a predefined function, and return the total cost of the order.*/int gettotalcost(){ char itemid[9]; int price, unitsordered, cost; printf(" enter the 9-digit id of the item to be ordered: "); scanf("%s", & itemid); /* lookup the price according to the itemid */ price = getpricebyid(itemid); printf(" enter the quantity of units to be ordered: "); scanf("%d", & unitsordered); cost = price * unitsordered; return cost; }c)#include /* the following function is intended to return a user's full name by concatenating the user's first and last name into a single string and then returning that string. */char *getfullname(char *firstname, char *lastname, int max_len){ char fullname[max_len]; strcpy(fullname, firstname); strcat(fullname, " "); strcat(fullname, lastname); return fullname; }d)#include /* the following code snippet runs through the list of cli arguments entered and displays them to the console. */int main(int argc, char *argv[]){ int i; printf("you've entered the following arguments: "); for(i = 0; i < argc; i++){ print(argv[i]); printf("\n"); } /* */}
Answers: 2
question
Computers and Technology, 25.06.2019 12:30
In many applications, only a small percentage of the points in a given set p of n points are extreme. in such a case, the convex hull of p has less than n vertices. this can actually make our algorithm convexhull run faster than Īø(nlogn). assume, for instance, that the expected number of extreme points in a random sample of p of size r is o(rĪ± ), for some constant Ī± < 1. (this is true when the set p has been created by picking points uniformly at random in a ball.) prove that under this condition, the running time of the algorithm is o(n).
Answers: 3
You know the right answer?
Let s = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight values, a: (12,4), b:...
Questions
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
History, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01
question
Mathematics, 15.09.2020 01:01