Lecture 21 | Programming Abstractions (Stanford)




Lecture 21 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie talks about the buffer version of vector vs. stack and follows this with an example of cursor design. She also talks about linked list insertion and deletion. Cursor movement is the next topic covered; she illustrates how the cursor points from one cell to the next. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu …

Posted by admin on Jul 17 2009 in Education


Lecture 18 | Programming Methodology (Stanford)

Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami wraps up arrays and introduces the term debugging. 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. Complete …

Posted by admin on Jul 16 2009 in Education


Lec 10 - Introduction To Problem Solving and Programming

Lecture_10

Posted by admin on Jul 14 2009 in Education


Lec 2 - Introduction To Problem Solving and Programming

Lecture_2

Posted by admin on Jul 10 2009 in Education


Lecture 5 | Programming Paradigms (Stanford)

Lecture by Professor Jerry Cain for Programming Paradigms (CS107) in the Stanford University Computer Science department. In this lecture, Prof. Cain focuses on linear search and stack within the C programming language. Programming Paradigms (CS107) introduces several programming languages, including C, Assembly, C++, Concurrent Programming, Scheme, and Python. The class aims to teach students how to write code for each of these individual languages and to understand the programming …

Posted by admin on Jul 8 2009 in Education


Lecture 2 | Programming Paradigms (Stanford)

Lecture by Professor Jerry Cain for Programming Paradigms (CS107) in the Stanford University Computer Science department. In this lecture, Prof. Cain discusses C and C++ programming codes, as well as binary addition and subtraction. Programming Paradigms (CS107) introduces several programming languages, including C, Assembly, C++, Concurrent Programming, Scheme, and Python. The class aims to teach students how to write code for each of these individual languages and to understand the …

Posted by admin on Jul 8 2009 in Education


Lec 8 - Introduction To Problem Solving and Programming

Lecture_8

Posted by admin on Jul 4 2009 in Education


Lecture 24: eXtreme Programming - Richard Buckland

extreme programming, unit tests, test as you go, unit tests in C, one objective at a time, refactoring. asserts. multi-file programs in C. linking. #include header files prototypes. main. static helper functions. object files .o files Also: hornblower patriotism / the french

Posted by admin on Jul 4 2009 in Education


Lec 7 -Introduction To Problem Solving and Programming

Lecture_7

Posted by admin on Jul 3 2009 in Education


Lecture 4 | Programming Paradigms (Stanford)

Lecture by Professor Jerry Cain for Programming Paradigms (CS107) in the Stanford University Computer Science department. In this lecture, Prof. Cain discusses C and C++ programming, including bit patterns, memory copy, and linear search. Programming Paradigms (CS107) introduces several programming languages, including C, Assembly, C++, Concurrent Programming, Scheme, and Python. The class aims to teach students how to write code for each of these individual languages and to understand the …

Posted by admin on Jun 30 2009 in Education