Facebook Open Academy kicked off in spring 2013 with an ambitious goal to improve the curriculum at a meaningful number of top university computer science departments around the world. Specifically, the aim is to provide a practical, applied software engineering experience as part of a university student’s CS education. This is accomplished through a partnership with open source projects that allows the students to receive academic credit for work pertaining to the open source code base. Mentors and faculty engage with the students on a weekly basis to support progress and positive learning outcomes.
CS Unplugged is a collection of free learning activities that teach Computer Science through engaging games and puzzles that use cards, string, crayons and lots of running around.
Some really great stuff here.
Though old, this essay is still both relevant and brilliant. A must-read for computer science researchers.
In the best case, the papers are just a formality. Hackers write cool software, and then write a paper about it, and the paper becomes a proxy for the achievement represented by the software. But often this mismatch causes problems. It’s easy to drift away from building beautiful things toward building ugly things that make more suitable subjects for research papers.
I wrote about Jesse Anderson’s Infinite Monkey Theorem experiment back in October of last year. I haven’t followed his progress until now — as it turns out, Jesse’s virtual monkeys managed to recreate every single work of Shakespeare:
The monkeys accomplished their goal of recreating all 38 works of Shakespeare. The last work, The Taming Of The Shrew, was completed at 2 AM PST on October 6, 2011. This is the first time every work of Shakespeare has actually been randomly reproduced. Furthermore, this is the largest work ever randomly reproduced. It is one small step for a monkey, one giant leap for virtual primates everywhere. This page shows what day each work of Shakespeare was completed on.
Contains information on the theory of relational databases, popular RDBMSs, concurrency control etc. The site has a collection of PPT/PDF slides that are useful for repetition of the main concepts.
The Information Retrieval Methods PDF by Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze is not only gratis, but a good resource on all kinds of Information Retrieval topics: the boolean model, the vector space model, tf-idf weighting, language models etc.