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 20 | Programming Abstractions (Stanford)

Monday, January 11th, 2010

ten in the course textbook. She goes over several rules for templates again to reinforce how important they are. 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 20 template chapter 10 vector stack implementers …

  • Share/Bookmark

Lecture 22 | Programming Abstractions (Stanford)

Tuesday, January 5th, 2010

, possibly better, strategy. The basics of trees and their usefulness and how they can be used with binary search is then introduced. 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 22 map vector strategy trees …

  • Share/Bookmark

Lecture 18 | Programming Abstractions (Stanford)

Sunday, December 27th, 2009

data types) in more detail. She then develops a Vector from the ground up, explaining each step as she goes. 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 18 implement vector ADT abstract data type abstraction …

  • Share/Bookmark

Lecture 25 | Programming Abstractions (Stanford)

Tuesday, December 8th, 2009

vector or binary search tree. She then introduces the DAWG data structure. 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 25 lexicon sorted vector binary search tree flatten array dawg directed acyclic word …

  • Share/Bookmark

Powered by WordPress Lab