• 2887 views

    Lec 10 - Programming Abstractions (Stanford)

    "Lec 10 - Programming Abstractions (Stanford)" Lecture 10 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie explains procedural recursion and introduces permute code. She goes through another example of recursive code line by line, explaining each component. Recursive backtracking and it's usefulness are discussed. The example of placing several queen chess pieces on a board where none of them can attack the other is then demonstrated. Complete Playlist for the Course: http://www.youtube.com/view_play_list?p=FE6E58F856038C69 CS 106B Course Website: http://cs106b.stanford.edu Stanford Center for Professional Development: http://scpd.stanford.edu/ Stanford University: http://www.stanford.edu/ Stanford University Channel on YouTube: http://www.youtube.com/stanforduniversity/

    Video is embedded from external source so embedding is not available.

    Video is embedded from external source so download is not available.

    Here is the next lecture for this course

    Watch NEXT
    LECTURE
    2638 views     Lec 15 - Programming Abstractions (Stanford)

    Lec 11 - Programming Abstractions (Stanford)

     47:48
    Lecture List | Course Details | Contents | Related

    No content is added to this lecture.

    Go to course:

    This video is a part of a lecture series from of stanford