2024-04-27T11:30:27Z http://moredat.ning.com/video/video/listTagged?tag=dynamic&rss=yes&xn_auth=no 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. tag:moredat.ning.com,2012-10-26:6483656:Video:4465 2012-10-26T23:17:17.376Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-1-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142846?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>The first lecture by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie Zelenski gives an introduction to the course, recursion, algorithms, dynamic data structures and data abstraction; she also introduced the significance of programming and gives her opinion of what makes 106B "great;" C++ is…

<a href="http://moredat.ning.com/video/lecture-1-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142846?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />The first lecture by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie Zelenski gives an introduction to the course, recursion, algorithms, dynamic data structures and data abstraction; she also introduced the significance of programming and gives her opinion of what makes 106B "great;" C++ is introduced, too.