Lecture 13 | Programming Abstractions (Stanford)

March 29th, 2010 | by admin |

Lecture 13 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.

Julie introduces linked lists and continues to discuss recursive data. She goes line by line through an example code she writes during the lecture. She then inserts variables in an order; she uses the example of an address book to explain this. Algorithm analysis are also introduced.

Complete Playlist for the Course:

http://www.youtube.com/view_play_list?p=FE6E58F856038C69

CS 106B Course Website:

http://cs106b.stanford.edu

Stanford Center for Professional Development:

http://scpd.stanford.edu/

Stanford University:

http://www.stanford.edu/

Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/

Duration : 0:51:35


[youtube C36NAaS6ITM]

  1. 4 Responses to “Lecture 13 | Programming Abstractions (Stanford)”

  2. By Choscura on Mar 29, 2010 | Reply

    good stuff.
    good stuff.

  3. By calvinyen2008 on Mar 29, 2010 | Reply

    Really good …
    Really good lectures! Quite useful for improving my programming skills.

  4. By govardz on Mar 29, 2010 | Reply

    nOsebleed!
    nOsebleed!

  5. By tyebillion on Mar 29, 2010 | Reply

    Hokay.
    Hokay.

Post a Comment