A Student Network for Collaboration and Sharing

Signup on

What’s Next For Electronic Devices. Have you heard of FPGAs? Find out now here. And as a bonus get your free guide to writing a successful resume. Just Signup now and it’s all yours free.

Lecture 11 | Programming Abstractions (Stanford)

Watch it on MoreDat.Com

Lecture 11 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.

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.


You need to be a member of MoreDat to add comments!

Join MoreDat

© 2021   Created by Jerome Trent.   Powered by

Report an Issue  |  Terms of Service