Algorithmics of the knapsack type tasks

dc.contributor.authorPatcas, Csaba
dc.contributor.authorIonescu, Klára
dc.date.accessioned2012-06-28T10:06:51Z
dc.date.available2012-06-28T10:06:51Z
dc.date.conferenceend2008-04-12
dc.date.conferencestart2008-04-11
dc.date.issued2012-06-28
dc.description.abstractWe propose a new kind of approach of the teaching of knapsack type problems in the classroom. We will remind you the context of the general knapsack-task and we will classify it, including the two most popular task variants: the discrete and the continuous one. Once we briefly present the solving algorithm of the continuous variant, we will focus on the solving of the discrete task, and we will determine the complexity of the algorithms, looking for different optimizing possibilities. All these issues are presented in a useful way for highschool teachers, who are preparing students in order to participate in different programming contests.en_US
dc.description.citySzombathelyen_US
dc.description.conferencetypeInternationalen_US
dc.description.countryMagyarországen_US
dc.identifier.urihttp://hdl.handle.net/123456789/81
dc.language.isoen_USen_US
dc.titleAlgorithmics of the knapsack type tasksen_US
dc.title.conferenceINFODIDAKT 2008en_US
dc.type.classLectureen_US
dc.type.specificationScientificen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Knapsack.pdf
Size:
260.68 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: