What Every Computer Scientist Should Know About Floating Point Arithmetic - CiteSeerX
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.6768
Advanced Computer Science Courses at Paper Trail
http://hnr.dnsalias.net/wordpress/?page_id=152

Below I've collected some links to advanced computer science courses on-line. I'm concentrating on courses with good lecture notes, rather than video lectures, and I'm applying a rather arbitrary filter for quality (otherwise this becomes a directory with less semantic utility). This is the good stuff! But only a subset of it - any recommendations for good courses are gratefully received. I'm mainly interested in systems, data-structures and mathematics, so reserve the right to choose topics at will.

Open courseware from various sources. High quality too.

A nice refresher for Bézier curves

Computational complexity lectures

Fields Medalist Tim Gowers' lectures on computational complexity.

free computer science books online in PDF format

eso

ntroduction in building your first toy language.

How To Create Your Own Freaking Awesome Programming Language

コンピューターサイエンスの教科書

全部読みたい

Free Computer Science Courses - Free Science and Video Lectures Online!

I have made a breakdown of the main arguments taught in high school and university which are utilized in computer science. I divided this list in a basic section and specific applications one.

linear

Discussion of computer science publications. Embedded image coding using zerotrees of wavelet coefficients Posted by dcoetzee on July 8, 2009

Graph

This is a Phase II expansion grant from the National Science Foundation (2008-2011). The goal of the project is to develop, classroom test, evaluate and disseminate projects based on primary historical sources in Discrete Mathematics, Combinatorics, Logic and Computer Science courses.

This is a Phase II expansion grant from the National Science Foundation (2008-2011). The goal of the project is to develop, classroom test, evaluate and disseminate projects based on primary historical sources in Discrete Mathematics, Combinatorics, Logic and Computer Science courses. This is a collaborative project between Mathematics (Math) and Computer Science (CS) faculty at New Mexico State University (NMSU) and Colorado State University at Pueblo (CSU-P).

Learning Discrete Mathematics and Computer Science via Primary Historical Sources

The goal of the project is to develop, classroom test, evaluate and disseminate projects based on primary historical sources in Discrete Mathematics, Combinatorics, Logic and Computer Science courses.

<<Computer Science Unplugged is a series of learning activities that reveals a little-known secret: computer science isn't really about computers at all! Unplugged teaches principles of computer science such as binary numbers, algorithms and data compression through games and puzzles that use cards, string, crayons and lots of running around. Unplugged is suitable for people of all ages, from elementary school to university, and from many countries and backgrounds. >> See the PDF of all activities that teachers can download....

Suggested by arun

[Found via Coast to Coast Bio] Tim Bray outlines a new CS curriculum that re-focuses on the web as a platform (rather than an individual computer). Under this training, CS students would graduate prepared for the modern challenges of working with big data.

The World Wide Web as a framework for structuring much of the academic Computer Science curriculum.

Viewing the World Wide Web as a framework for structuring part of the academic Computer Science (and Computer Engineering, perhaps) curriculum. Includes a link to "The first few milliseconds of a HTTPS connection" which should be as fascinating as a read.

This is the second post in an article series about MIT's lecture course Introduction to Algorithms. I changed my mind ...

Why Did M.I.T. Switch from Scheme to Python?

The freshman software engineering course (...) is now nearly thirty years old. Engineering has changed quite a lot in thirty years. Since 1995, Gerry and his co-author Prof. Hal Abelson have advocated changing the freshman curriculum radically, not basing it on SICP. In 1980, computer engineering was based on starting with clearly-defined things (primitives or small programs) and using them to build larger things that ended up being clearly-defined. Composition of these fragments was the name of the game. However, nowadays, a real engineer is given a big software library, with a 300-page manual that’s full of errors. He’s also given a robot, whose exact behavior is extremely hard to characterize (what happens when a wheel slips?).

"In 1980, computer engineering was based on starting with clearly-defined things (primitives or small programs) and using them to build larger things that ended up being clearly-defined. Composition of these fragments was the name of the game... Nowadays, a real engineer is given a big software library, with a 300-page manual that’s full of errors. He’s also given a robot, whose exact behavior is extremely hard to characterize (what happens when a wheel slips?). The engineer must learn to perform scientific experiments to find out how the software and hardware actually work, at least enough to accomplish the job at hand. We may not like it this way (”because we’re old fogies”), but that’s the way it is..."

Dan Weinreb’s blog » Blog Archive » Why Did M.I.T. Switch from Scheme to Python?

Some explanation of why MIT switched from Scheme to Python.

Stanford

aboutprogramming04.jpg (imagem JPEG, 1200×3000 pixels)

the world of programming infographic

... a most excellent puzzle game, wherein you build little machines to test robots. [via Math Less Travelled blog]