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

Watch it on MoreDat.Com

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.


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