All Videos Tagged lists (MoreDat) - MoreDat

Lecture 13 | Programming Abstractions (Stanford)

2012-10-27T00:47:07.297Z

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

Julie introduces linked lists and continues to discuss recursive data. She goes line by line through an example code she writes during the lecture. She then inserts variables in an order; she uses the example of an address book to explain this. Algorithm analysis are also introduced.

Lecture 12 | Programming Abstractions (Stanford)

2012-10-27T00:42:22.000Z

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.

Lecture 17 | Programming Methodology (Stanford)

2012-10-22T21:05:13.303Z

Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami wraps up arrays and introduces array lists.

CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Uses the Java programming language. Emphasis is on good programming style and the built-in facilities of the Java language.

Lecture - 12 Introduction to Computer Science 1

2012-10-19T19:11:46.934Z

File I/O. Forensics. Linked lists. Stacks. Queues. More at http://cs50.tv/.

Lecture - 11 Introduction to Computer Science 1

2012-10-19T19:07:39.442Z

File I/O. Forensics. Linked lists. Stacks. Queues. More at http://cs50.tv/.