All Videos Tagged pointers (MoreDat) - MoreDat 2024-05-08T02:17:57Z https://moredat.ning.com/video/video/listTagged?tag=pointers&rss=yes&xn_auth=no Lecture 12 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4541 2012-10-27T00:42:22.000Z Jerome Trent https://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="https://moredat.ning.com/video/lecture-12-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="https://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="https://moredat.ning.com/video/lecture-12-programming-abstractions-stanford"><br /> <img src="https://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. Lecture 11 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4538 2012-10-27T00:37:29.868Z Jerome Trent https://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="https://moredat.ning.com/video/lecture-11-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="https://storage.ning.com/topology/rest/1.0/file/get/3345140566?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 11 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie continues with recursive backtracking and introduces pointers and recursive data. Following, she focuses on solving the problems rather than the exact code and later uses the example of a program that will solve a Sudoku puzzle.… <a href="https://moredat.ning.com/video/lecture-11-programming-abstractions-stanford"><br /> <img src="https://storage.ning.com/topology/rest/1.0/file/get/3345140566?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 11 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie continues with recursive backtracking and introduces pointers and recursive data. Following, she focuses on solving the problems rather than the exact code and later uses the example of a program that will solve a Sudoku puzzle. She explains that recognizing and looking for patterns between all of the different recursive examples is an important component to learning recursion. Lecture 15 | Programming Methodology (Stanford) tag:moredat.ning.com,2012-10-22:6483656:Video:4630 2012-10-22T20:44:19.253Z Jerome Trent https://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="https://moredat.ning.com/video/lecture-15-programming-methodology-stanford"><br /> <img alt="Thumbnail" height="180" src="https://storage.ning.com/topology/rest/1.0/file/get/3345142553?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami recaps on pointers and memory. He then lectures on reading files, creating files, and over writing files.<br></br> <br></br> CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design,… <a href="https://moredat.ning.com/video/lecture-15-programming-methodology-stanford"><br /> <img src="https://storage.ning.com/topology/rest/1.0/file/get/3345142553?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami recaps on pointers and memory. He then lectures on reading files, creating files, and over writing files.<br /> <br /> CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Uses the Java programming language. Emphasis is on good programming style and the built-in facilities of the Java language.