1. Consider the following dynamic programming implementation of the Knapsack problem:   #include int find_max(int a, int b) {       if(a > b)          return a;       return b; } int knapsack(int W, int *wt, int *val,int n) {      int ans[n + 1][W + 1];      int itm,w;      for(itm = 0; itm <= n; itm++)          ans[itm][0] = 0;      for(w = 0;w <= W; w++)         ans[0][w] = 0;      for(itm = 1; itm <= n; itm++)      {           for(w = 1; w <= W; w++)           {                if(wt[itm - 1] <= w)                   ans[itm][w] = ______________;                else                   ans[itm][w] = ans[itm - 1][w];           }      }      return ans[n][W]; } int main() {      int w[] = {10,20,30}, v[] = {60, 100, 120}, W = 50;      int ans = knapsack(W, w, v, 3);      printf("%d",ans);      return 0; }   Which of the following lines completes the above code? A. find_max(ans[itm – 1][w – wt[itm – 1]] + val[itm – 1], ans[itm – 1][w]) B. find_max(ans[itm – 1][w – wt[itm – 1]], ans[itm – 1][w]) C. ans[itm][w] = ans[itm – 1][w]; D. none of the mentioned

Q: Write a C++ program that:   (1) defines and implements a hash class that constructs a 15 element…

A: Introduction Hashing is an important Data Structure that is created to employ a special function…

Q: What does .compare do in c++? for example in this sorting function void employeeSort(string…

A: Compare: “compare()” function is one of in-built function that is used to compare the strings. It…

Q: ramming part: Given the following CFG and the Predictive Parsing table. Write a program to trace…

A: Step 1 is handled by FillNonTerminals(), FillTerminals(), and FillSymbols(), each with a…

Q: What is the overall Big-O running time of function foo?

A: Lets analyse the given code: for running time complexity void foo(int n){    int sum=0;//runs for…

Q: To use math.sqrt function you need to first: O def math O import math O Do nothing

A: Sqrt function is used to find the square root of a number.

Q: In early implementations of FORTRAN language, a compiler may choose to use static allocation (i.e.,…

A: 1) Static allocation refers to the process of reserving memory for variables during compile-time.…

Q: Consider the following C code snippet. Implement the C code snippet in MIPS assembly language. Use…

A: Compiler : MIPS gcc 11.2.0

Q: Use C++ and solve the problem without a sorting algorithm. here is the code I have: #include…

A: We need to use C++ and solve the given problem without a sorting algorithm.

Q: int i, j, k; mid - left + 1; right - mid; int Le[a], Ri[b]; for (i = 0; i < a; i++) Le[i] = x[left +…

A: Merge Sort is a Divide and Conquer algorithm. The mergeSort() function divides the input array into…

Q: Given the following logic circuit: Do A B a) Find the output value at the points A, B, and C. b)…

A: As per our Guidelines we are supposed to answer first question only.Kindly Repost another question…