Lecture 12 | Programming Abstractions (Stanford)

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

Julie continues to go over pointers and moves on to recursive data and linked lists. She starts off explaining the basics of pointers and have two variables pointing to the same address then explains that it is better to not delete the same address more than once, as something not wanted might happen. Julie then explains the interaction between pointers and dynamic arrays.

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/

Category:

Education

Tags:

• computer
• science
• technology
• software
• engineering
• c++
• programming
• language
• lecture
• 12
• pointer
• recursion
• address
• dynamic
• arrays
• recursive
• data
• lists

[AlphaEmission]

wow really helpful thanks very much for the upload

[digitalSpartan]

thank you so much :)

[tayadevijay]

I love you 

[zfjquery]

well there is an way to get the size of raw array using sizeof() method which means c++ knows the size of array , remeber sizeof will return the number of bytes of array you need to divide that size by 4 (for integer array) , divide by 1( for char array)

[dimipeli]

After a sharp drop in the early classes the "students" number now is stabilized around the 10k number.

[omahdezavalos]

She is get in into the zone very good expert, very good class top of elite ... I meaning it

best regard

[abeesk]

:)))))))))))))))))))))))))))))­)))))))))))))))