Home > Search Results

object-oriented design


sort by: Relevancy | Title try advanced search for more options

  1. This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

  2. This course covers topics on the engineering of computer software and hardware systems: techniques for controlling complexity; strong modularity using client-server design, virtual memory, and threads; networks; atomicity and coordination of parallel activities; recovery and reliability; privacy, security, and encryption; and impact of computer systems on society. It also looks at case studies of working systems and readings from the curre...more

  3. This lecture covers the basics of designing and laying out dentures.

  4. Administrative Details, Exams - Time limit, Conflicts, Course Grade Breakdown, Assignment Details - Submission, Grading, Late Days, Course Email, Newsgroup, Facebook/Twitter, Mailing List, Course Prerequisites, Languages and Paradigms Taught - C++ vs. Pure C, Procedural Paradigm vs. Object-Oriented Paradigm, Assembly, Concurrent Programming Overview, Example of Data Sharing Issues with Concurrent Programming, Scheme, Functional Paradigm Ov...more

  5. November 16, 2007 lecture by Ge Wang for the Stanford University Human-Computer Interaction Seminar. In the first part of this talk, Ge presents the design, philosophy, and development of ChucK, a computer music programming language intending to provide a different approach, expressiveness, and thinking with respect to time and parallelism in audio programming - as well as a platform for precise and rapid experimentation. In the second par...more

  6. Buffer: Vector vs Stack, Buffer as Linked List, Cursor Design, Use of Dummy Cell, Linked List Insert/delete, Linked List Cursor Movement, Compare Implementation, Doubly Linked List, Compare Implementation, Space Time Trade Off, Implementing Map, Simple Map Implementation: Vector, Map as Vector : Performance Implication, A Different Strategy

  7. April 29, 2009 - Frank Wolak, senior fellow at the Stanford Institute for Economic Policy Research, discusses restructuring of the electricity industry in the U.S. using examples from California and explains the problems involved in energy market design.

  8. This course serves as an introduction to the theory and practice behind many of today's communications systems. 6.450 forms the first of a two-course sequence on digital communication. The second class, 6.451, is offered in the spring. Topics covered include: digital communications at the block diagram level, data compression, Lempel-Ziv algorithm, scalar and vector quantization, sampling and aliasing, the Nyquist criterion, PAM and QAM...more

  9. Architectural and circuit level design and analysis of integrated analog-to-digital and digital-to-analog interfaces in CMOS and BiCMOS VLSI technology. Analog-digital converters, digital-analog converters, sample/hold amplifiers, continuous and switched-capacitor filters. RF integrated electronics including synthesizers, LNA's, and baseband processing. Low power mixed signal design. Data communications functions including clock recovery. ...more

  10. Kawasaki talks about marketing and product design simplified. Kawasaki explains why this theory is all an entrepreneur will need to know about marketing. A simple chart illustrates his point - how to be the creator of a unique product or service and is valuable to a customer.