Consider the following pseudocode for a knapsack problem heuristic with capacity b, and n objects with rewards c and weights 1. Set S=0. b = b, I=(1,2,.n) 2. гереat 3. Let jl be the index such that cj z ci, i l. 4. I=1-0). S=S) 5. b =b- aj 6. Remove from I all indices i where ai > b 7. until I=0 8. The objects in set S are the objects in the solution. Implement this algorithm in VBA with n objects and capacity b. First take from the user the values for n and b. Then let rewards be random integer numbers between 5 and 10, and weights be random integer numbers between 1 and 10. Your inputs and solution should be exhibited on an Excel worksheet as well.

Q: Given a value `value`, if we want to make change for `value` cents, and we have infinite supply of…

A: 1. Create a list `dp` of size (value + 1) and initialize all elements to 0.2. Set `dp[0]` to 1,…

Q: make Algorithm forTesting Membership Input : a group G acting on [2 = { 1,2 ..... n }; a permutation…

A: function is_in_group(p : permutation; i : l..k+l ) : boolean;(* return true if the permutation p is…

Q: Let N be the set of all ounting numbers: 1, 2, 3,.... Consider these set definitions: A = {z € N| (4…

A: The complete answer is given below.

Q: time effiency

A: Given :-  In the above question, the statement is mention in the above given question   Need to…

Q: For the stable matching problem studied in class, consider the instance where you have 3 men called…

A: In the stable matching problem, the Gale-Shapley algorithm guarantees that a stable matching will be…

Q: Your training set is made up of the following 2-dimensional points: A: 0), (1,3), (3,0), (0,-2),…

A:

Q: Double insects are types of insects that live on Mars. These insects weave their networks to protect…

A: In this question, we are asked to print greatest conceivable measure of protectors Algrorithm: 1)…

Q: Write Algorithm for Membership Testing A group G operating on the function f = 1, 2,..., n; a…

A: Algorithm: Algorithm for Membership Testing: Initialize a Boolean variable "result" to false.…

Q: Algorithm: Algebraic JP Algorithm 1: Input : G(V, E), directed or undirected graph 2: Output : 3:…

A: To determine the shortest path between two nodes in a graph, the Algebraic JP Algorithm is utilized.…

Q: fun g(a, b, c, d) = if c[b(a)] < 1.2 then 2 * b(a) else 2 * d * a Using Hindley-Milner type…

A: System of Hindley–Milner type: A Hindley–Milner (HM) classification is a traditional lambda algebra…

Q: Write Algorithm for Round robin tournament including a scoring for the match results.…

A: given data: in: sequence P of n players (1 ≤ n)out: sequence R of n players with attribute…

Q: se; vat S : set of elements; i : integer ); (* Assuming that B and S (i+1) are a base and strong…

A: Summary The Schreier-Sims algorithm is a computational group theory algorithm named after…

Q: Create and explain a generic m-round winner tournament for players P called…

A: The Round-Winner-Tournament(P,m) is a tournament structure that consists of m rounds of matches…

Q: Explain why this loop invariant has the inductive property

A: A loop variant is an expression/statement about a loop in an algorithm. It is true before the first…

Q: onsider the challenge of determining whether a witness questioned by a law enforcement agency is…

A: BELOW STEP BY STEP COMPLETE SOLUTION REGARDING YOUR PROBLEM WITH EXPLANATIONS :

Q: 1. Input: G = (V, E) 2. Output: MIS I of G 3. I ← ∅ 4. V ← V 5. while V = ∅ 6. assign a random…

A: Algorithm: Initialize an empty set I to represent the maximal independent set. While the set of…

Q: If an AABB is given by: (the symbol ≤ means "less than or equal to", in case there is an issue with…

A: AABB refer as "Axis Aligned Bounding Box" is a primitive bounding shape shaped as a rectangle or…

Q: Write Algorithm for Testing Membership Input : a group G acting on f~ = { 1,2 ..... n }; a…

A: Algorithm for Testing Membership:

Q: Consider the following map where S is the start state and G is the goal state. Process the nodes in…

A: The answer is as follows: A) S-A-C-G B)h1 is admissible.

Q: Write Algorithm for Testing Membership Input : a group G acting on f~ = { 1,2 ..... n }; a…

A: Algorithm for Testing Membership:

Q: a group G acting on f~ = { 1,2 ..... n }; a permutation g of f~ = { 1,2 ..... n }; a base and strong…

A: given data:   implement Algorithm for Testing MembershipInput : a group G acting on f~ = { 1,2 .....…

Q: As we mentioned in class, a universal hash function is a function UH(K, M) that takes a key K, a…

A: A hash function is a algorithm that takes an input (or 'message') and produces a fixed-size string…

Q: zation problem we are looking for t ys to convert it to a decision probl ding a threshold variable k…

A: Given: Bob, Alice and You are considered as variant of pokemon problem.

Q: Let A = {1, 2, 3, 4, 5} and B = {2, 3, 4, 5, 6, 7} and C = {a, b, c, d, e} 17. Give an example of…

A: Refer below the example for above asked question:

Q: Suppose that you have the following collection T of data points in two dimensions: x|1 |1 |2 | 3 | 4…

A: def closestpair():      df=[]    while True:        print("Choose options from below:")…

Q: Algorithm for Modified Soluble Schreier Method procedure derived_normal_closure( G : group; vat N :…

A: given data: procedure derived_normal_closure( G : group; vat N : group; y : element of G ); (*…

Q: Write Algorithm for Outline of Schreier-Sims method Input : a set S of generators of a group G;…

A: Input : a set S of generators of a group G;Output : a base B for G;a strong generating set S of G…

Q: Transcribed Image Text he enquiry process that is recently implemented in their company. Given…

A:

Q: The recurrence relation for the method is O A. T(n) = T(n-1) for n > 0 and T(0) = 1 B. T(n) =…

A: Given: Given a time complexity finding problem and we need to choose the correct option.

Q: make Membership Testing Algorithm Input: a group G operating on f = 1,2,.....n; a permutation g of f…

A: Please refer to the following step for the complete solution to the problem above.

Q: The method is based on a population consisting of n vectors6 x0(k), . . . , xn(k), k is the…

A: In each iteration a new population is generated in the following way for each member of population…

Q: Monkey problem: A little monkey is allowed to jump k times between n branches labeled with the…

A: Solution:   i) Here is a SAGE code that computes fn(i) by simulations and plots the graphs for…

Q: Algorithm: Algebraic JP Algorithm 1: Input : G(V, E), directed or undirected graph 2: Output : 3:…

A: Here's a Python implementation of the Algebraic Johnson's algorithm:

Q: Luby’s Algorithm: 1. Input: G = (V, E) 2. Output: MIS I of G 3. I ← ∅ 4. V ← V 5. while V = ∅ 6.…

A: Initialize an empty set I to store the independent set and a set V containing all vertices.While the…

Q: For the set A = { ), deter mine n(A). n(A) =

A: For a set, A, n(A) means the number of subsets for the set A.   Every non-empty set has at least two…

Q: Algorithm for Testing Membership Input : a group G acting on [2 = { 1,2 ..... n }; a permutation g…

A: function is_in_group(p : permutation; i : l..k+l ) : boolean;(* return true if the permutation p is…

Q: 6. In Java create an algorithm for an undirected graph with n vertices and m edges that... - Takes…

A: Start.Initialize an adjacency list representation of the graph with n vertices.Add edges to the…

Q: (1) List the first four elements of L(G) in lexicographic order. O 1,010, 111, 00100 O €, 1,010, 111…

A: S1S1STT1X1TXX0X0X1

Q: Given two fuzzy set A and B A = {(x1,0.5), (x2,0.1), (x3,0.4)} B = {(x1,0.2), (x2,0.3), (x3,0.5)}…

A: In the given question A = {(x1, 0.5), (x2, 0.1), (x1, 0.4)}B = {(x1, 0.2), (x2, 0.3), (x1, 0.5)}…

Q: Design a MapReduce algorithm that computes the sum of a multiset. The input is represented by pairs…

A: Input to the Algorithm : Multiset Output : Sum of all the elements using (x,m) pair…

Q: Let S be the set consisting of all 10 digits and all upper- and lowercase letters. Let U be the set…

A: Please refer to the following step for the complete solution to the problem above.

Q: Write a principal variation search algorithm that uses negamax. in: node v; alpha value; beta value…

A: principal variation search algorithm that uses negamax:

Q: Luby’s Algorithm: 1. Input: G = (V, E) 2. Output: MIS I of G 3. I ← ∅ 4. V ← V 5. while V = ∅ 6.…

A: Luby's Algorithm is a randomized algorithm for computing a Maximum Independent Set (MIS) in a graph.…

Q: Child Ehab has a piece of Cut and Stick with an exhibit an of length n composed on it. He intends to…

A: Here have to determine about the piece of Cut and Stick programming problem statement.

Q: Luby’s Algorithm: 1. Input: G = (V, E) 2. Output: MIS I of G 3. I ← ∅ 4. V ← V 5. while V = ∅ 6.…

A: Luby's algorithm is a randomized algorithm that finds a maximum independent set (MIS) in an…

Q: {10,20,30,40} B ={30,40,50,60} C= {50,60,70} U =…

A: Solution - In the given question, we have to tell what is the cardinality of A.

Q: 1 3.) 2 3 Derive runtime as function of x. 4 Determine big-o upper bound. 5 Show work. 6 7 for (int…

A: In this question we have given an algorithm for that we need to determine the runtime as the…