All Videos Tagged templates (MoreDat) - MoreDat 2024-05-03T08:16:59Z http://moredat.ning.com/video/video/listTagged?tag=templates&rss=yes&xn_auth=no Lecture 20 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4544 2012-10-27T01:38:31.702Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-20-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142459?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 20 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie continues discussing Vector and moves on to stack and queue, covering chapter ten in the course textbook. She goes over several rules for templates again to reinforce how important they… <a href="http://moredat.ning.com/video/lecture-20-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142459?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 20 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie continues discussing Vector and moves on to stack and queue, covering chapter ten in the course textbook. She goes over several rules for templates again to reinforce how important they are. Lecture 17 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4740 2012-10-27T01:25:50.778Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-17-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142044?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 17 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie continues to go over sort templates and callback functions, then shows a final version of the sort template, one that will be extremely useful in the next homework assignment. She also goes over class implementation and its uses… <a href="http://moredat.ning.com/video/lecture-17-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142044?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 17 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie continues to go over sort templates and callback functions, then shows a final version of the sort template, one that will be extremely useful in the next homework assignment. She also goes over class implementation and its uses as well as time constructors. Lecture 16 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4477 2012-10-27T01:03:19.655Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-16-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345143337?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie continues with sorting, specifically quadratic and linearithmic sorting methods, and then explains how to reasonably partition data sets for quicksort. Thereafter, she proceeds to go over different functional templates for sorting… <a href="http://moredat.ning.com/video/lecture-16-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345143337?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 16 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie continues with sorting, specifically quadratic and linearithmic sorting methods, and then explains how to reasonably partition data sets for quicksort. Thereafter, she proceeds to go over different functional templates for sorting algorithms and also briefly goes over instantiation errors and how to fix them. Lecture 5 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-26:6483656:Video:4731 2012-10-26T23:41:35.869Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-5-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142268?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 5 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. In the fifth lecture,<br></br> <br></br> Julie discusses the use of templates, vectors and template specialization. She then goes through an example of code line by line explaining each part in detail. Finally, she goes on to explain what grid interfaces… <a href="http://moredat.ning.com/video/lecture-5-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142268?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 5 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. In the fifth lecture,<br /> <br /> Julie discusses the use of templates, vectors and template specialization. She then goes through an example of code line by line explaining each part in detail. Finally, she goes on to explain what grid interfaces are and briefly goes over how you can use them in programming different games.