That's Twitter Bootstrap's Fault! No, seriously, what is happening?

I just checked on FF on Win7 and FF on Arch. If you run NS, it shouldn't be an issue since there is no js at all. hmm..

I'll upload it gimme a sec (FF 18.0.1 on W7):





The textboxes on the right on the blog/home page are alligned strangely as is the "Get Started". Maybe it's by design (hope not :P). FWIW I have a whacky (poker player) resulution of 1920x1200 (x2 but the browser only takes up one full monitor)

If you look at a lot of the better MS programs out there, many are 1-2 year programs that are close to the curriculum of an undergrad program at a top school. You don't have to have a BA/BS in CS to enter either.

For someone very talented and motivated, it is definitely possible.

This seems strange. Most MS programs I've seen assume you know basic CS theory and cover material completely beyond an undergrad program (even a good undergrad program).

While often you don't need a BA/BS in CS to enter, its often assumed that you'll learn the material on your own time or by taking undergrad courses - both possibly extending the length of time it takes to complete the degree.

But I do agree with your claim that its possible.

Wow... I guess the Bootstrap guys aren't masters at Responsive CSS. I used the responsive version, but clearly something went amiss. As the old saying goes, if you don't like they way they dig a hole, dig your own ****ing hole.

I'm sorry guys, but there is zero chance at all that the guy did reasonably well at taking each of those classes. 52/33 = 10 days for each class. Assuming he didn't take any vacations, doesn't have a job at all during that period, a day for errands, and never got sick, and did this 7 days a week, he, at most, dedicated 80 hours to each class. Keeping up that kind of pace is total suicide to your mental state.

I was slightly off; looking at Columbia, they require 10 courses. 7/10 are at undergrad level though.

That said, I glossed over the fact that the guy is claiming to have done 33 CS courses in a year and passed them all with no background. That sounds off. I thought he just did the required minimum subject courses for a CS major.

Looking closely, he admits to failing some exams and then taking them (exact same exam I presume, so he knew what to study) again.

fake story to sell his ebook obv

http://www.scotthyoung.com/lmslvidcourse/

what a joke

Yeah, I saw that part too, but I didn't want to bring it up.

daveT, does he say he does all the readings and such? His FAQ makes it clear that his only requirement is passing the exam and that while he tries to do the programming assignments he doesn't consider doing them mandatory.

I think you're way overestimating how hard this would be.

lol the fact that this guy is selling ebooks on things like "doubling your reading rate" and "how to ace your finals without studying" doesn't set off snake oil alarm bells to you guys?

I'm with dave on this. There is just no way. It's probably possible to do an equivalent of a cs major in a year if you only hit the essentials but what this kid is claiming is just complete bull****.

He isn't forthcoming in his habits on Reddit either. And I'm sure that his Ted X talk isn't either. And he certainly isn't on the book site.

Should be further suspicious that he took some very advanced courses without doing the stated prerequisites either. Intro to Algos requires SICP and mathematics. Why didn't he bother taking 600? Just plain weird.

What he claims to have done is doable if you're smart, motivated and disciplined but it doesn't make sense that someone who's capable of doing it is choosing to live the way he does (selling self-help video courses online).

from his AI homework. guess he picked up scheme between his modal logic readings and writing Social Skills and Dancing for Dummies.

I usually find it creepy when internet investigators start digging around trying to "expose" people but this is interesting. He even did a TED talk LOL!!

In defense of TED, he did a TEDx talk, which has been having a lot of problems keeping charlatans of its stages.

... I have no clue what kind of person writes Scheme that looks like that. That sort of printing is offensive to the eyes, so let me pretty-print that for you:

I can barely figure out what he is doing here, but to start, he created a let-binding called loop. While it is a function of sorts, you don't call a let-binding that way. The code looks like he is calling loop with #f, not with loop as the code suggests he is doing. If loop was a function, then he could sort of call it that way.

The code is semantically wrong. It asks if the item is, in fact, a piece, yet it looks like he is attempting to query over the pieces already on the board, or maybe he has a list of pieces defined somewhere else in the code and he is attempting to check if the pieces he passed in are part of a list that he has already created?

The eqv shouldn't work. cdr returns a list and he appears to be comparing a scalar to a list item, which will always return false, unless he is using wtf (first), (second), (third), to deconstruct the list into a scalar. I honestly have no clue though.

As they say, you can learn Scheme in one day. It looks more like he just made it up and decided to pass it off as code. The code in this looks quite advanced for someone who has no provable prior experience in it, yet he manages to make several fundamental mistakes.

****

Didn't you say you were looking into doing SICP? How you liking it so far?

My god. The more I look at that code, the less I can make sense of it. What is x, y, and color have to do with cdr of pieces? Why are they in three different places and if he is looping, wouldn't he be checking if color is (cdr (cdr)) where he was originally checking x?

It would be like looping over this list in Python:

L = ['red', 'king', 'queen']

and checking if L[0] and L[1] and L[2] are 'blue', then continuing on through the list and seeing if 'king' is 'blue.'

I would love to give him the benefit of the doubt that he is actually calling a table, but there is no real indication that this is the case.

Should check out the Introduction to Algorithms hw as well. There's only about 15 files in it. Here is a small sampling of what you'll find:

Silly part is that the other codes use more advanced library packages.

^ nice big-theta bro.

also i haven't really been following but what is this guy's goal? like obv it seems like his real goal is to gain some street cred to sell something, but what is his stated goal?

can cram your way through some tests != learning how to program != becoming hirable as a developer

Einstein!

kero why won't the gubmint let us play some HORSE together right now?

also i hope you feel better. pretty much everyone in the mother****ing city (myself included) has been sick in the past month. it's crazy. reminds me that i'm low on two-stroke and chainsaws.

now back to deep space nine...

Since your sick, why don't you run that code over each chapter of Pride and Prejudice and see the output. It's the ultimate human -vs- machine competition: does the computer or the human go to the hospital first?

I can't figure out if it would produce the correct results either. Mind running a few test suites on it and report back to us?

Not sure what the O is on that either, but I know for certain it isn't 2logN(). I think he skipped the chapters and lectures about creating "efficient" algorithms, but that is speculation on my part.

cool. i'm totally gonna use his algorithm too: first, i look for one letter matches throughout the chapter. then, i look for *two* letter matches throughout the chapter. then, i

daveT

there is a fairly popular alternative to bootstrap, called Foundation:
http://foundation.zurb.com/

if you give that a shot please report back the results

Sure. I'll try that. I am reasonably good at Sass, so this should be more interesting to try out. Looks much more flexible than Bootstrap also.

I'll try to see if I can't change it up within a week and report back.