Lecture 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/

Category:

Education

Tags:

• computer
• science
• technology
• software
• engineering
• c++
• programming
• language
• lecture
• 21
• buffer
• stack
• vector
• linked
• list
• insert
• delete
• cursor
• point
• map
• as

[agapitoflores001]

More videos like this please. They're really helping me a lot.

[ScrewAttackChina]

glad to see the use of the dummy cell.. most implementations do not show this.. u need it for simplifying the implementation of the list's iterator.

[sgtjoebear]

There are soooooooo few videos on youtube about Linked List in C++, these are extremely important! More so than classes. Is it people vaguely understand pointers and how LL work?

[kobusob]

thanks alot!