9

We run projects with real-world clients from within our school building. I would add to Buffy's beautiful answer one idea that we've communicated to the clients that our students will be working with: As gifted and wonderful as our students are, recognize that they are still students, and the primary purpose here is educational. The work that your group ...


4

Let me point you to the Google Summer of Code site. Look at the characteristics of the problems and the relationship to the project providers. It is explicitly an educational project site, and project providers (companies) make no claim that they will use any of the code that students write. I haven't been involved with it, but assume that some process vets ...


4

One example which is actually relatively common in everyday life, especially for people who do a lot of traveling (e.g., backpackers and some business people), is the knapsack problem. The applications section gives several other fairly common situations where this problem is encountered. The Wikipedia article also lists a few methods that can be used to ...


3

My business view on this arrangement is: students ↔ middle man ↔ customers Where students are dodgy (unreliable by nature), but cheap (receive study credit and no compensation), while the middle man organisation promised the customers results at some price. If this arrangement works, the middle man gets rich, although then, the ethics are out of the door. In ...


3

Although it should probably be only one strategy among many, you might teach it through practical examples. In this short program that uses flask_user (and which students can install in just a few minutes) the decorator ensures that only authenticated users can use the route: https://flask-user.readthedocs.io/en/latest/quickstart_app.html


2

Interval scheduling is a quite common example, with real world applications. You could also consider graph coloring algorithms, like Welsh-Powell's or DSATUR, since it can also illustrate that greedy algorithms are not always optimal. This example is a bit less "real world-y", but it has also applications in scheduling.


2

Computing a maximum-weight basis in a matroid, which is a straight-forward generalization of Kruskal's algorithm. You may object that this is not "every day life". But well, that's pretty much the exhaustive answer to the question which problems can be solved using a greedy algorithm. :-) You can show them the proof that whenever the greedy ...


2

David A. Wheeler has a collection of essays, including several on software security (particularly targeting Unix/Linux). There are lots of tools around, including sophisticated checkers that are build on LLVM, like klee. You'll also find discussions like "Top 12 Open Source Security Tools" with a bit of searching. There are lots of standards, look ...


1

u may find this example about the use of Edmond Karo Max-Flow Algorithm in World-War-2 interesting https://m.facebook.com/story.php?story_fbid=2969706433062743&id=2567729029927154 . . & I always find supermarket shopping a knapsack problem according to ur ability to carry goods!!!! . -If ur students r familiar with mining & cryptocurrencies u ...


1

There are two somewhat separate concepts of a decorator. I'm guessing that you mean the one related to using "first class" functions in Python or in a more traditional functional language. The other concept is from OO programming and involves the method structure of an object. They are related, of course, since a function in Python is an object. ...


1

I'd start looking at the ACM curriculum recomendations. They break down what a bachelor's degree should cover, in gread detail. Yes, it covers some four years of coursework, full time. No, as Euclid is reported to say, there is no royal road.


1

Books: The standard reference on Algorithmic Game Theory is the book by Nisan, Tardos, Roughgarden, and Vazirani. Algorithmic Game Theory http://www.cambridge.org/journals/nisan/downloads/Nisan_Non-printable.pdf Another book on AGT is by Kevin Leyton-Brown from UBC and Yoav Shoham from Stanford: Multi-Agent Systems: Algorithmic, Game-Theoretic and ...


1

try Tim Roughgarden online AGT course & book https://youtube.com/playlist?list=PLEGCF-WLh2RJBqmxvZ0_ie-mleCFhi2N4 and those 2 lectures by Constantinos Daskalakis for the PPAD class https://youtu.be/TUbfCY_8Dzs https://youtu.be/Ih0cPR745fM and Papa Dimitriou 2 lectures in Simons Institute https://youtu.be/ggi2PZbO0oQ https://youtu.be/0cyR_fpOvOc Tim ...


Only top voted, non community-wiki answers of a minimum length are eligible