
Title:
1043 Practical Scenarios

Description:

Now just to familiarize yourself with these problems a little bit more,

I would like to do the same thing that we have done here for these five problems.

I will now give you a number of practical scenarios.

What I would like you to tell me is which of these problems would probably be most useful

for attempting an NP completeness proof?

So again we will give these problems here numbers, one, two, three, and four,

and I will give you six practical scenarios where you can then choose

which problem to match to the scenarios, so you could have a scenario in Bioinformatics,

but you would like to compare DNA sequences to each other.

And what you are trying to find out is how much information they have in common.

You could have a scenario where you want to schedule computer programs.

What I mean by this is you have a bunch of computer programs.

You know approximately how much time you took those programs is going to take.

And you have a number of machines and of course you want to get as much work done as possible

within let's say the next hour so you have to decide which program to run on which machine

or you could have a question about let's say classrooms where you say,

"How many classrooms do we actually need for the next semester to teach our courses?"

So there will be certain courses that take place at a certain time or that cannot be scheduled together.

A new question is how many different rooms would we actually need?

Or you could have the scenario where two programmers

have been working on the same programming code.

And one of the programmers has made some changes and the other one has made some changes.

And now you need to get these two codes back together again,

and you do that by figuring out what they actually still have in common.

Another problem could be that you have a number of vans or delivery trucks

that you would like to fill and you want to find out

how many vans you need to transport all of these packages here.

They have different sizes. They have different priorities and so on.

And finally, a scenario that is none of the above so something else.

Please match the practical scenarios to the NP complete problem

that is most likely to occur in that scenario, and I want you to do this by entering numbers here

that correspond to these four problems.

You'll have to use some of these problems here more than once.