Programming Abstractions in C (CPP)

****************************************************************************** book from stanfords CS106b: (http://see.stanford.edu/see/courseinfo.aspx?coll=11f4f422-5670-4b4c-889c-008262e09e4e) Video: Lecture 1-27

udp://tracker.openbittorrent.com:80
udp://open.demonii.com:1337
udp://tracker.coppersurfer.tk:6969
udp://exodus.desync.com:6969

asc11 (2010-08-17)

" My unbiased opinion about why 106B is one of the best courses at Stanford – it’s going to be totally obvious when I say these things, and you guys are going to have to go along with it. I’m actually a big time geek, and I happen to love programming. That’s why I’m a perfect fit for teaching this course. I have taught 106 B or [106]X more than I’ve taught any other class that I’ve taught at Stanford in my time here, and that’s because each quarter when we’re setting the schedule, I say give me B. Give me X. There’s no better course to teach."
-- instructor Julie Zelenski

asc11 (2010-08-17)

Course | Programming Abstractions
This course (CS 106B) is the successor to CS 106A and covers more advanced programming topics such as recursion, algorithmic analysis, and data abstraction. It is taught using the C++ programming language, which is similar to both C and Java. In the past when both CS 106A and CS106B were taught in C/C++, the coupling between the two classes was very tight and it was unheard for students to take CS106B without having completed our CS 106A (we recommended CS 106X instead). Nowadays, some students do go straight into CS106B, this is typically appropriate for a student who done well in an intro programming course (e.g., scored 4 or 5 on the CS AP exam or earned a good grade in a college course) and has sufficient familiarity with good programming style and software engineering issues (at the level of CS 106A) to use this understanding as a foundation on which to tackle advanced topics.
2 years ago