2024-04-23T07:07:05Z http://moredat.ning.com/video/video/listTagged?tag=address&rss=yes&xn_auth=no tag:moredat.ning.com,2012-10-27:6483656:Video:4468 2012-10-27T00:47:07.297Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-13-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142314?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 13 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> 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…

<a href="http://moredat.ning.com/video/lecture-13-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142314?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 13 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> 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. tag:moredat.ning.com,2012-10-27:6483656:Video:4541 2012-10-27T00:42:22.000Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-12-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345140688?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 12 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie continues to go over pointers and moves on to recursive data and linked lists. She starts off explaining the basics of pointers and have two variables pointing to the same address then explains that it is better to not delete the…

<a href="http://moredat.ning.com/video/lecture-12-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345140688?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 12 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie continues to go over pointers and moves on to recursive data and linked lists. She starts off explaining the basics of pointers and have two variables pointing to the same address then explains that it is better to not delete the same address more than once, as something not wanted might happen. Julie then explains the interaction between pointers and dynamic arrays.