About
Advanced memory management features of C and C++; the differences between imperative and object-oriented paradigms. The functional paradigm (using LISP) and concurrent programming (using C and C++). Brief survey of other modern languages such as Python, Objective C, and C#.
Prerequisites: Programming and problem solving at the Programming Abstractions level. Prospective students should know a reasonable amount of C++. You should be comfortable with arrays, pointers, references, classes, methods, dynamic memory allocation, recursion, linked lists, binary search trees, hashing, iterators, and function pointers. You should be able to write well-decomposed, easy-to-understand code, and understand the value that comes with good variable names, short function and method implementations, and thoughtful, articulate comments.
Course Homepage: [[http://see.stanford.edu/see/courseinfo.aspx?coll=2d712634-2bf1-4b55-9a3a-ca9d470755ee]]
Course features at Stanford Engineering Everywhere page: *Programming Paradigms *Lectures *Syllabus *Handouts *Assignments *Exams *Resources
Related categories
Uploaded videos:
Lecture 1: Programming Paradigms
Sep 07, 2010
·
13664 Views
Lecture 2: C/C++ Data Types - Interpretations
Sep 07, 2010
·
17850 Views
Lecture 3: Converting Between Types of Different Sizes and Bit Representations U...
Sep 07, 2010
·
4565 Views
Lecture 6: Integer Stack Implementation - Constructor and Destructor
Sep 07, 2010
·
3602 Views
Lecture 8: Heap Management - How Information about Allocations are Stored in the...
Sep 07, 2010
·
3530 Views
Lecture 9 How a Code Snippet is Translated into Assembly Instructions
Sep 07, 2010
·
3038 Views
Lecture 10: More Detail about Activation Records - Layout of Memory During a Fun...
Sep 07, 2010
·
2874 Views
Lecture 11: Moving from C Code Generation to C++ Code Generation: Basic Swap Exa...
Sep 07, 2010
·
3764 Views
Lecture 12: Preprocessing Commands - #Define as a Glorified Find and Replace
Sep 07, 2010
·
2608 Views
Lecture 13: Review of Compilation Process of a Simple Program Into a .O File
Sep 07, 2010
·
3015 Views
Lecture 14: Example in Which Writing Past the End of Array Causes the Return Add...
Sep 07, 2010
·
2633 Views
Lecture 15: Transitioning from Sequential Programming to Concurrent Programming ...
Sep 07, 2010
·
2701 Views
Lecture 16: Review of Semaphore Syntax
Sep 07, 2010
·
3422 Views
Lecture 17: Review of the Dining Philosopher Problem
Sep 07, 2010
·
3588 Views
Lecture 18: Guest Lecturer
Sep 07, 2010
·
2478 Views
Lecture 19: Imperative/Procedural Paradigms (C) and Object-Oriented Paradigm(C++...
Sep 07, 2010
·
4162 Views
Lecture 20: Car-Cdr Recursion Problem that Returns the Sum of Every Element in a...
Sep 07, 2010
·
2776 Views
Lecture 21: Introduction to the Kawa Development Environment: Evaluation of Expr...
Sep 07, 2010
·
2487 Views
Lecture 22: Writing a Recursive Power Set Function in Scheme
Sep 07, 2010
·
5047 Views
Lecture 23: Scheme Memory Model - How Scheme Instructions Synthesize Linked List...
Sep 07, 2010
·
2910 Views
Lecture 24: Overarching Features of Python: Scripting Language
Sep 07, 2010
·
5245 Views
Lecture 25: Rewriting RSG to Illustrate all Three Paradigms and Lambdas in Pytho...
Sep 07, 2010
·
2612 Views
Lecture 26: XML Processing and Python - Two Different XML Processing Models
Sep 07, 2010
·
3451 Views