Lecture 26 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department.
Julie ties up the "loose ends" of the course: after a general review of the concepts covered in the course, she asks which of two examples is the better. She then covers manipulation of dynamic data structures (lists, trees, graphs) as well as reviews code from similar assignments. Then she touches on design and efficiency of code. Lastly, she goes over the next courses one might take if continuing in computer science and the different paths possible.
Complete Playlist for the Course:
CS 106B Course Website:
Stanford Center for Professional Development:
Stanford University Channel on YouTube:
Tagged under: computer,science,technology,software,engineering,++,programming,language,lecture,26,review,exam,dynamic,data,lists,trees,graphs,design,pointers
Clip makes it super easy to turn any public video into a formative assessment activity in your classroom.
Add multiple choice quizzes, questions and browse hundreds of approved, video lesson ideas for Clip
Make YouTube one of your teaching aids - Works perfectly with lesson micro-teaching plans
1. Students enter a simple code
2. You play the video
3. The students comment
4. You review and reflect
* Whiteboard required for teacher-paced activities
With four apps, each designed around existing classroom activities, Spiral gives you the power to do formative assessment with anything you teach.
Carry out a quickfire formative assessment to see what the whole class is thinking
Create interactive presentations to spark creativity in class
Student teams can create and share collaborative presentations from linked devices
Turn any public video into a live chat with questions and quizzes