2024-04-29T01:03:35Z http://moredat.ning.com/video/video/listTagged?tag=search&rss=yes&xn_auth=no 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. tag:moredat.ning.com,2012-10-19:6483656:Video:4419 2012-10-19T19:34:08.731Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-14-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345138975?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Huffman coding. More at <a href="http://cs50.tv/">http://cs50.tv/</a>.

<a href="http://moredat.ning.com/video/lecture-14-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345138975?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Huffman coding. More at <a href="http://cs50.tv/">http://cs50.tv/</a>. tag:moredat.ning.com,2012-10-19:6483656:Video:4286 2012-10-19T19:30:16.239Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-13-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345139034?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Huffman coding. More at <a href="http://cs50.tv">http://cs50.tv</a>

<a href="http://moredat.ning.com/video/lecture-13-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345139034?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Huffman coding. More at <a href="http://cs50.tv">http://cs50.tv</a> tag:moredat.ning.com,2012-10-19:6483656:Video:4280 2012-10-19T02:20:32.666Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-8-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345140747?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging. More at h...

<a href="http://moredat.ning.com/video/lecture-8-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345140747?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging. More at h... tag:moredat.ning.com,2012-10-19:6483656:Video:4413 2012-10-19T02:13:25.283Z Jerome Trent http://moredat.ning.com/profile/2f1v1ewv1dry8

<a href="http://moredat.ning.com/video/lecture-7-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345139622?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging. More at h...

<a href="http://moredat.ning.com/video/lecture-7-introduction-to-computer-science-1"><br /> <img src="http://storage.ning.com/topology/rest/1.0/file/get/3345139622?profile=original&amp;width=240&amp;height=180" width="240" height="180" alt="Thumbnail" /><br /> </a><br />Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging. More at h...