Build a code for me in c# or python

₹600-1500 INR

Zamknięte

Opublikowano

ponad 4 lata temu

₹600-1500 INR

Płatne przy odbiorze

Non-deterministic 0/1 Knapsack solver You need to be alert to (usually minor) changes that may be made to the assignment statement or to the guidelines after the assignment is first put up. Refresh this frame and re-read the assignment carefully before you make your final submission. Assignment statement In the knapsack problem a set of items, each with a mass and a payoff are to be packed in a knapsack which can accomodate a given maximum mass. The aim is to choose the items so as not to exceed the capacity of the knapsack, while maximising the payoff. All of these are given as integers. You are required to read the capacity of the knapsack sequence of <mass, payoff> pairs and determine the choice of items to maximise the payoff without violating the knapsack capacity in the following two ways: [login to view URL] a deterministic technique and [login to view URL] a non-deterministic technique In each case do the following: [login to view URL] the count of execution of the steps where the choices are made and [login to view URL] the choices made and the payoff thus obtained. You need to submit a text report including the following: [login to view URL] of the deterministic problem solution scheme [login to view URL] of the non-deterministic problem solution scheme, including the using of OS primitives that are used and the relevant system calls, and [login to view URL] whether or not the given problem is in the class NP Your report should also contain three example formulae which are satisfiable and three example formulae that are not. These examples are to be developed by you (not taken from anywhere).

Identyfikator projektu: 20945634

Informację o projekcie

4 ofert

Zdalny projekt

Aktywny 5 lat temu

Szukasz sposobu na zarobienie pieniędzy?

Adres e-mail

Korzyści ze składania ofert na Freelancer.com

Ustal budżet i ramy czasowe

Otrzymuj wynagrodzenie za swoją pracę

Przedstaw swoją propozycję

Rejestracja i składanie ofert jest bezpłatne

4 freelancerzy składają oferty o średniej wysokości ₹1 450 INR dla tej pracy

@yoavshah

I am realy good with python and I learned this subject already Relevant Skills and Experience Python, and I learn this subject at university

₹1 450 INR w 2 dni

0,0

(0 opinii)

0,0

@rollyarnaudo

There are some issues with your description. Regarding solving it deterministically, it can be done pseudo-polynomially (although it's truly exponentially) using dynamic programming. That can be implemented in C# or Python, no problem. Regarding solving it "nondeterministically", I guess the idea is to solve it polynomially (in a nondeterministic Turing machine), to show that it's in NP. The problem here is that you have to turn the problem into a decision problem (one that returns a boolean), so you have to add a quota to the parameters. The solution is based on "guessing" an order to add the items to the knapsack. This solution cannot be implemented in C# or Python (since these do not implement nondeterministic Turing machines). An implementation of the idea would need to "backtrack" to consider all possible item orderings, leading again to an exponential time (deterministic) solution. The problem is NP-complete, so no surprise here. I didn't understand the "3 example formulae which are satisfiable and 3 that are not". I don't see this having to do with knapsack, but more with SAT. Let me know if you want me to solve it for you.

₹2 000 INR w 7 dni