• 2197 views

    Lec 21 - Programming Abstractions (Stanford)

    "Lec 21 - Programming Abstractions (Stanford)" Lecture 21 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie talks about the buffer version of vector vs. stack and follows this with an example of cursor design. She also talks about linked list insertion and deletion. Cursor movement is the next topic covered; she illustrates how the cursor points from one cell to the next. 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/

    Video is embedded from external source so embedding is not available.

    Video is embedded from external source so download is not available.

    Here is the next lecture for this course

    Watch NEXT
    LECTURE
    2022 views     Lec 14 - Programming Abstractions (Stanford)

    Lec 22 - Programming Abstractions (Stanford)

     49:45
    Lecture List | Course Details | Contents | Related

    No content is added to this lecture.

    Go to course:

    This video is a part of a lecture series from of stanford