What people are saying - Write a review
We haven't found any reviews in the usual places.
abstract abstract data type applet apply argument assembly language binary search tree binary trees bs-tree Button c-curve called cards Chapter chocolates class-class class/set-method coins cond cons constructor data type deﬁne deﬁnition digits display dynamic programming EBNF element empty equal error evaluate example Exercise expression factorial factorial-product ﬁgure ﬁnd ﬁrst game-state global-environment height implementation init method input instance variable instruction integer interface item-list iterative Java label lambda loop make-game-state make-vector memoization memory merge sort Micro-Scheme Mini-Scheme movie multiple newline node object object-oriented programming operand operations output parameters pattern pile position predicate problem queue ra-stack read-eval-print loop recursive red-black trees result returns Scheme selectors sequence size-of-pile speciﬁc square stack string subclasses subtree superclass symbol takes top-minus vector vector-ref vector-set walk-count we’ll widget Write a procedure
Page 43 - Christmas my true love sent to me: Two Turtle Doves and a Partridge in a Pear Tree On the third day of Christmas my true love sent to me: Three French Hens Two Turtle Doves and a Partridge in a Pear Tree...
Page 225 - Respect the privacy of others. Computing and communication technology enables the collection and exchange of personal information on a scale unprecedented in the history of civilization. Thus there is increased potential for violating the privacy of individuals and groups. It is the responsibility of professionals to maintain the privacy and integrity of data describing individuals. This includes taking precautions to ensure the accuracy of data, as well as protecting it from unauthorized access...
Page 221 - The level of a node is the length of the path from the root to the node plus 1, which is the number of nodes in the path.
Page 58 - Perfect Numbers A number is said to be perfect if it is equal to the sum of its divisors other than itself, eg, 1+2 + 4 + 7+14 = 28. The lowest perfect number is 6 (1 +2 + 3). The highest known, and the 30th so far discovered, is (2216'°"-1) x 22'6'090.
Page 240 - The case expression matches this item if the value of the expression is greater than or equal to the lower bound and less than or equal to the upper bound. A flowchart indicating how a case construct is executed appears in Figure 2-2. Some simple examples follow. select case (dice) case (2:3, 12) print *, "You lose!
Page 221 - The depth of a node is the length of the path from the root to that node, where we define the length of a path to be the number of edges that we passed along.
Page 409 - The cost of a solution is the sum of the costs of the treatment plants and of the pipes.
Page 213 - Binary search tree: A binary search tree is either empty or it consists of three parts: the root, the left subtree, and the right subtree.
Page 226 - ... or bona fide authorization related to system operation and maintenance. User data observed during the normal duties of system operation and maintenance must be treated with strictest confidentiality, except in cases where it is evidence for the violation of law, organizational regulations, or this Code.
From Google Scholar
Cary G Gray, Illinois Wheaton, Michael D Frazier, Texas Abilene
Peter Van Roy, Seif Haridi
G Michael Schneider
All Scholar search results »
Anne Brygoo, Titou Durand, Pascal Manoury, Christian Queinnec, Michèle Soria
Pre-Preface Material Concrete Abstractions: An Introduction to ...
Free Books > Computers & Internet > Programming > Java > General ...
Concrete Abstractions on the web | Lambda the Ultimate
This file contains definitions of quilt-cover "basic block" images ...
CS314: Principles of programming languages
CONCRETE ABSTRACTIONS : AN INTRODUCTION TO COMPUTER SCIENCE USING ...
CS 9D Study Guide