Owen Astrachan. A Computer Science Tapestry. McGraw-Hill, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Design Patterns by Example - Mitchener (1997) (1 citation) (Correct)
....last thing: The names have been made up to protect the innocent, but the designs are real. 8 3.2. BEFORE 9 3.2 Before 3.2.1 Data structures All the students taking CPS 108 had access to a selection of fundamental data structures provided by a library called Tapestry. See figure 3. 1 and [1]. Many of the data structures have a MakeIterator( method which creates an instance of a companion iterator class that passes over each element of the data structure. zIterator, 257 Whatever receives the iterator must be sure to delete it. Additionally, there is an IterProxy class which stores ....
Owen Astrachan. A Computer Science Tapestry. McGraw-Hill, 1997.
Do We Really Teach Abstraction? - Bucci, Long, Weide (Correct)
....help our students develop such skills starting in CS1 CS2. 1 Introduction Abstraction and information hiding have long been recognized as fundamental and essential principles in software development, and are usually given positions of prominence in computer science curricula as early as CS1 CS2 [1, 2, 5]. Information hiding and abstraction can be thought of as complementary aspects of one general idea: hide the details of a complex system while providing a simpler cover story to explain those aspects of the system that are of interest. In this context then, we view abstraction as presenting a ....
Astrachan, O.L., A Computer Science Tapestry. McGraw-Hill, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC