Solving 0-1 Knapsack Problem (ΕΝ)

សម្ព័ន្ធភាព៖ សាកលវិទ្យាល័យថេស្សាលី (UTH)
ដំណោះស្រាយ៖ ក្រុម | រយៈពេល៖ មួយទៅពីរម៉ោង



Problem published by: Zaharouli Theano In the knapsack problem () you need to fill the knapsack with an optimal set of items. In the 0-1 Knapsack to deal with this problem you select each item only once. To solve this problem you need to program in C language and for that you will need an editor program and a gcc compiler to run after your password. By the end of this work you will be better acquainted with the C language and will practice on it.


The students who will deal with solving this problem will develop the their C programming skills, will have understood basic concepts of C, will become familiar with the use of knapsack, will be able to at the end of solving it explain the retrospective solution and its benefits to the other students and will be able to program other similar problems with knapsack.


The problem is addressed to young computer science students who wish to practice their skills in programming, to engage with problems related to distinguish between mathematics and programming and develop their skills in problem solving with various possible solutions. They can also be more advanced in programming individuals to engage in a repetition around C.