All Videos Tagged stack (MoreDat) - MoreDat 2024-04-23T12:12:45Z http://moredat.ning.com/video/video/listTagged?tag=stack&rss=yes&xn_auth=no Lecture 21 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4654 2012-10-27T01:42:16.127Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-21-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345140889?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 21 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> 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… <a href="http://moredat.ning.com/video/lecture-21-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345140889?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 21 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> 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. 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 19 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4743 2012-10-27T01:33:29.584Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-19-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142386?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 19 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie reiterates the rules for template implementers and continues by coding live with the class explaining each line of code in detail after writing it. Throughout the process of writing the code, she encounters several errors and… <a href="http://moredat.ning.com/video/lecture-19-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142386?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 19 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie reiterates the rules for template implementers and continues by coding live with the class explaining each line of code in detail after writing it. Throughout the process of writing the code, she encounters several errors and debugs the code every several minutes. She continues to demonstrate how to write code involving stack. Lecture 9 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4535 2012-10-27T00:21:40.798Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-9-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345140757?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 9 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing… <a href="http://moredat.ning.com/video/lecture-9-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345140757?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 9 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing different pictures. She then discusses the problem of moving a stack of disks from one peg to the other peg. Later, she demonstrates the basic principle necessary to solve the problem with a child's toy and goes through how to solve the problem with a program.