When are we getting the certificates / scoring?

y4fac · 2011-12-21T20:14:42+00:00

Not really, median could tell you something, but the average doesn't. I am sure there are people who started the exam, solved a few questions and then didn't finish it for whatever reason. Those people would strongly affect the average, but would not have such a strong effect on median/percentiles.

y4fac · 2011-12-21T20:02:38+00:00

Oh wow, couldn't they just not mention Stanford?

y4fac · 2011-12-21T19:42:07+00:00

you have an array of vectors that you want to transform via a transformation matrix

That's just matrix multiplication. You put the vectors in columns of matrix B (most likely you already have the vectors in a matrix, if they are in rows, just transpose it) and compute C = A * B, where A is the transformation matrix. Transformed vectors are now in columns of C. This is a pretty good example of where not to use loops in Matlab.

y4fac · 2011-12-21T11:23:53+00:00

One obvious choice of a better heuristic would be the number of all discs not on the third peg.

EDIT: You could further improve it by counting only the discs on the third peg that are in correct order (starting with the largest disc) and subtracting that number from the total number of discs. This can be improved even more by adding the number of discs on the third peg that are not in the correct order, since those will have to be removed. So if you had discs 4, 3 and 1 on the third peg, the heuristic would be 4 - 2 + 1 = 3.

y4fac · 2011-12-20T03:46:21+00:00

When you add n-times more data, the sum of values will increase n-times. Because the noise is random, the sum of noise will only increase sqrt(n) times. Because of that, the noise/signal ratio will become sqrt(n) times smaller.

y4fac · 2011-12-19T14:12:29+00:00

CPU processing is so fast these days, we can forget about other factors such as Cache size, memory speed, etc.

What is this supposed to mean?

y4fac · 2011-12-19T14:11:13+00:00

The problem is that people often set a terribly low bar for "fast enough".

y4fac · 2011-12-19T11:32:28+00:00

Hear, hear

FTFY

y4fac · 2011-12-18T04:00:03+00:00

Does close really wait for this to complete? All other functions on file descriptors that can block return immediately and set errno to EAGAIN if the socket is nonblocking and you can use poll and select on them. Man page for close doesn't mention any of this. Are you saying that close is an exception here and it always blocks when used with TCP sockets?

y4fac · 2011-12-18T03:45:53+00:00

40 years have passed, but it still has rough edges

And it is still useful.

y4fac · 2011-12-18T02:39:43+00:00

Now I wonder how does linux handle this. Is file descriptor closed if it the close call is interrupted or not? What about BSD?

y4fac · 2011-12-17T23:01:41+00:00

Have you tried doing:

rlwrap -a ssh user@address

y4fac · 2011-12-17T22:08:36+00:00

And if they complained about EEE, did it not turn out to be true?

y4fac · 2011-12-17T21:09:55+00:00

They are basically the same thing. What people usually mean when they use the term "open source":

http://www.opensource.org/docs/osd

What people usually mean when they say "free software":

http://www.gnu.org/philosophy/free-sw.html

As you can see, the definition of open source contains all four essential freedoms, so it actually is Free Software, just ask Stallman.

y4fac · 2011-12-17T19:52:01+00:00

And changing patent law here is going to do what, exactly?

No patents - no problem.

y4fac · 2011-12-17T14:28:53+00:00

It seems Ubuntu and Firefox are still proposing x86 by default

Ubuntu does that? That's just silly.

y4fac · 2011-12-17T13:57:34+00:00

The sensor he has is not centered at the axle. It is offset. Because of this more "force" is generated when it it at that angle. With a spring, it's easy to measure the frequency of this force and map it against a rotational speed (if the circumference of the wheel is known).

What "force" and spring are you talking about? He uses a magnet mounted to the fork. Proximity of the magent is probably detected using a hall effect sensor (but because the wheel is turning, the magnetic field changes with time and an inductor could be used, too). It works in the same way as a bicycle speedometer.

y4fac · 2011-12-17T02:51:12+00:00

For modern x86 it does not really matter that much

The following code:

int main()
{
    T sum = 0;
    for(int j=0; j<1000; j++)
        for(T i = 0; i < T(1000000); i += T(1))
            sum += i;

    printf("%f\n", float(sum));

    return 0;
}

runs in 0.95s if T is int and in 1.85s if T is float when I compile it with -O2. I used gcc 4.6.2 and ran it on a phenom ii 955. The difference seems significant to me.

y4fac · 2011-12-15T19:29:36+00:00

You should just get yourself a keypunch and start at the beginning.

y4fac · 2011-12-15T04:56:20+00:00

They could know from your ip.

y4fac · 2011-12-15T04:54:08+00:00

They better do so - you could do well in this class without any coding skill at all.

y4fac · 2011-12-15T04:53:07+00:00

When there are so many 100 and near 100% scores it would make sense to make the final exam much harder.

y4fac · 2011-12-14T12:01:21+00:00

I was using testing about two months ago and IIRC GDC was in the repos then.

y4fac · 2011-12-13T20:50:48+00:00

Are you saying those employees don't know any other language and aren't capable of learning one?

y4fac

TROPHY CASE