1. Consider the knapsack problem with the capacity C= 8 and 5 items with weights 3, 6, 2, 5, 3. a) Find which items will exactly fill the knapsack using dynamic programming solution introduce in class. Show all your work. b) Give all the possible lists that can be added in the knapsack of question 1

1. Consider the knapsack problem with the capacity C= 8 and 5 items with weights 3, 6, 2, 5, 3. a) Find which items will exactly fill the knapsack using dynamic programming solution introduce in class. Show all your work. b) Give all the possible lists that can be added in the knapsack of question 1

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5SA

See similar textbooks

Similar questions

In this question, you are to implement two functions for reversing linked lists. One function, reverse_iter(..), must use an iterative approach (i.e., loops), whereas the other function, reverse_rec(..), must use recursion instead. We have already implemented the linked list as well as all its helper-functions in the Ilist-module.
A. Construct a RECURSIVE solution for following iterative solution to find a value in a circular-linked list B. Analyze the runtime complexity (correctly explain the scenario, show how much work would be done, and represent the work using asymptotic notations, i.e. big O), of the given iterative solution and your recursive solution for the best case scenario and the worse case scenario. C. prove the correctness of your recursive solution by induction /**@param value - a value to search for@return true if the value is in the list and set the current reference to itotherwise return false and not updating the current reference*/public boolean find(T value){ if(this.cur == null) return false; //get out, nothing is in here Node<T> tmp = this.cur; //start at the current position if(tmp.data == value) return true; // found it at the starting location tmp = tmp.next; //adv. to next node, if there is one while(tmp != cur) { if(tmp.data == value){ this.cur = tmp;…
1. Write your specification of recursive formula in plain English, 2. Your recursive solution for the formula and its proof of correctness 3. The algorithm using either memoization or bottom-up dynamic programming 4. The runtime analysis
Problem 4 We can use lists of numbers like l to represent a mathematical vector. Recall from math classes that a vector is an object with a magnitude and direction. The magnitude is the sqrt of the sum of the squares (for a vector (x,y) it's the Pythagorean theorem for the magnitude (x^2 + y^2)**(1/2)). For a vector of any other length, the formula generalizes to (l[0]^2 + l[1]^2 + l[2]^2 + ... )**(1/2). For this problem use l from Problem 1 and a for loop to compute the magnitude of l with the result stored in l_mag. For l above, its magnitude is 12.96. Python gives you the ** exponentiation operator to raise a number to a power. You could also import math and use math.sqrt(). l = [1, 2, 3, 4, 5, 7, 8] Please give proper explanation and typed answer only.
5. Consider the Josephus problem: in class, we looked at n elements in a circle and eliminated every second element until only one was left. The last element surviving this process was called the Josephus number. Instead of finding the last survivor, let I(n) be the element that survives second to last. To give a few small values, I(2) = 1, I(3) = 1, I(4) = 3, and I(5) = 5. Give a closed form expression for I(n) for any n ≥ 2.
Please follow and understand the graph to code. Use DFS!
Array lists and linked lists are both examples of list implementations. Give an example of a case in which an array list might be preferable over a linked list. Justify your actions in each scenario.
Source:https://www.mog.dog/files/SP2019/Sipser_Introduction.to.the.Theory.of.Computation.3E.pdf
Implement the restart function that implements the stable marriage algorithm to solve the admission problem in a university The structures: class candidate{ float notes[3]; list choices; }; class Program{ private: float P[3]; // Weight for all 3 notes int places; // # of places list admitted; }; void Restart(list c, list p){ }
Note: Do not copy it from internet or else it can result it some unwanted circumstances!
Given three sequences of length m, n, and p each, you are to design and analyze an algorithm to find the longest common subsequence (LCSS) for the three sequence. Is it possible to use dynamic programming to find the LCSS between the three sequences? If yes, provide recursive solution to the above problem. (Hint: We already designed dynamic programming algorithm for two sequences of length m and n in our class.)
Let’s assume M is a set defined as M ⊆ Z^+ × Z^+. Assume that M is defined using the concept of recursion taught in class as: i) (1, 2) ∈ M, ii) If (x, y) ∈ M, then (3x − y, 2x) ∈ M. Perform 5 recursive steps to obtain the updated M.