All Videos Tagged program (MoreDat) - MoreDat 2024-05-03T19:25:56Z http://moredat.ning.com/video/video/listTagged?tag=program&rss=yes&xn_auth=no Lecture 11 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-27:6483656:Video:4538 2012-10-27T00:37:29.868Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-11-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://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="http://moredat.ning.com/video/lecture-11-programming-abstractions-stanford"><br /> <img src="http://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 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. Lecture 8 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-26:6483656:Video:4734 2012-10-26T23:56:29.420Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-8-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345142026?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to… <a href="http://moredat.ning.com/video/lecture-8-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345142026?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to show a more efficient recursion code. The next example she covers is that of binary search and how recursion is used in this instance. Lecture 2 | Programming Abstractions (Stanford) tag:moredat.ning.com,2012-10-26:6483656:Video:4645 2012-10-26T23:22:53.227Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-2-programming-abstractions-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345140721?profile=original&amp;width=240&amp;height=180" width="240"></img><br /> </a> <br></br>Lecture two by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br></br> <br></br> Julie describes the similarities between C++ and Java, which include general syntax, primitive variable types, operators and control structures; she proceeds to go through the code of a basic C++ program and explains each individual… <a href="http://moredat.ning.com/video/lecture-2-programming-abstractions-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345140721?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Lecture two by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.<br /> <br /> Julie describes the similarities between C++ and Java, which include general syntax, primitive variable types, operators and control structures; she proceeds to go through the code of a basic C++ program and explains each individual piece of code, headers, global constants, global data types, and calling functions. She also proceeds to write a simple program during the lecture that gets input from the user and prints a statement to the screen. Lecture 4 | Programming Methodology (Stanford) tag:moredat.ning.com,2012-10-22:6483656:Video:4445 2012-10-22T15:47:35.080Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8 <a href="http://moredat.ning.com/video/lecture-4-programming-methodology-stanford"><br /> <img alt="Thumbnail" height="180" src="http://storage.ning.com/topology/rest/1.0/file/get/3345139605?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 moves into the history of computing and introduces the program Java.<br></br> <br></br> CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation,… <a href="http://moredat.ning.com/video/lecture-4-programming-methodology-stanford"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345139605?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 moves into the history of computing and introduces the program Java.<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.