lecture30-apr14

lecture30-apr14 - Brooks, 1986 implemented as a data...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Brooks, 1986 implemented as a data structure (type) implemented with a "knowledge" of the object that is associated with enter algorithm simultaneouly C open walk to door; reach for knob; open door; walk through; close door. repeat until door opens turn knob clockwise; if knob doesn't turn, then take key out; find correct key; insert in lock; endif pull/push door move out of way; end repeat • Interfaces (user and to other systems) • Architecture • Components • Data Structures (persistent and non-persistent) • Other (tests, tools,documents, etc.) • Much depends on the computational paradigm • Functional • Object oriented • AI • Etc. o1 o2 o3 o4 ...
View Full Document

This note was uploaded on 08/30/2010 for the course EE 312 taught by Professor Shafer during the Spring '08 term at University of Texas.

Page1 / 4

lecture30-apr14 - Brooks, 1986 implemented as a data...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online