Lecture 24 | Programming Abstractions (Stanford)

Friday, February 5th, 2010

Lecture 24 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie introduces hashing and it’s uses in search and retrieval; map implementations and the different kinds of search algorithms are then discussed. Thereafter she explains that logarithmic searches are relatively fast and often finish the search in an immeasurable amount of time. She introduces a different approach to search that works in a faster manner than linear search. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on youtube: www.youtube.com

  • Share/Bookmark

Lecture 17 | Programming Abstractions (Stanford)

Monday, February 1st, 2010

Lecture 17 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. 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. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on youtube: www.youtube.com

  • Share/Bookmark

Lecture 12 | Programming Abstractions (Stanford)

Tuesday, January 26th, 2010

not wanted might happen. Julie then explains the interaction between pointers and dynamic arrays. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com … computer science technology software engineering c++ programming language lecture 12 pointer recursion address dynamic arrays recursive data lists …

  • Share/Bookmark

Lecture 19 | Programming Abstractions (Stanford)

Saturday, January 23rd, 2010

and debugs the code every several minutes. She continues to demonstrate how to write code involving stack. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com … computer science technology software engineering c++ programming language lecture 19 template implementers elentype variables lists stack …

  • Share/Bookmark

Lecture 9 | Programming Abstractions (Stanford)

Sunday, January 17th, 2010

solve the problem with a child’s toy and goes through how to solve the problem with a program. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com … computer science technology software engineering c++ programming language lecture recursion recursive call procedural fractal mandarin tower …

  • Share/Bookmark

Powered by WordPress Lab