Solutions

User User Exercise Exercise1.1 Sequence of expressions1.2 Into prefix form1.3 Sum of the squares1.4 Composite expressions1.5 Calculation order1.6 Special form1.7 Square root1.8 Cube root1.9 Procedures of sum1.10 Ackermann's function1.11 Iterative and recursive processes1.12 Pascal's triangle1.13 Fibonacci numbers and golden ratio1.14 Exchange 11 cents1.15 The sine of an angle1.16 Fast exponentiation1.17 Multiplication by means of repeated addition1.18 Iterative process for multiplying two integers1.19 Fibonacci numbers through transformation1.20 Gcd and orders of evaluation1.21 Smallest divisor1.22 Smallest primes1.23 Modify the smallest-divisor1.24 Modify the timed-prime-test1.25 Extra work1.26 Slow procedure1.27 Carmichael numbers1.28 Miller-Rabin test1.29 Simpson's Rule1.30 Iteration1.31 Higher-order procedures1.32 Accumulation1.33 General accumulation1.34 Evaluate the combination1.35 Golden ratio1.36 Fixed point1.37 Finite continued fraction1.38 Euler's expansion1.39 Lambert's formula1.40 Approximate zeros1.41 Double1.42 Composition1.43 Nth repeated application of f1.44 N-fold smoothed function1.45 Computing nth roots1.46 Iterative improvement2.1 Modify the make-rat2.2 Representation of line segments on the plane.2.3 Representation of rectangles on a plane2.4 Procedural representation of pairs2.5 Representation of pairs using only numbers and arithmetic operations2.6 Church numerals2.7 Upper and lower bounds of interval2.8 Subtraction of intervals2.9 The width of an interval2.10 Interval that spans zero2.11 The signs of the endpoints of the intervals2.12 Interval produced by center and percentage tolerance2.13 Percentage tolerance of the product of two intervals2.14 Different answers for the two ways of computing formulas for parallel resistors2.15 A form of formula that no variable that represents an uncertain number is repeated2.16 Different answers in equivalent algebraic expressions in general2.17 Last element of list2.18 Reverse2.19 Change coins of different currencies2.20 Dotted-tail notation2.21 A list of the squares2.22 Square-list with iterative process2.23 The procedure for-each2.24 Box-and-pointer structure2.25 Pick 7 from lists2.26 Expressions with two lists2.27 Deep reverse2.28 List of tree leaves2.29 Binary mobile2.30 A tree of the squares2.31 Tree map2.32 The set of all subsets2.33 List-manipulation operations as accumulations2.34 Horner's rule2.35 Count-leaves as an accumulation2.36 Accumulate-n2.37 Matrix operations2.38 Folds2.39 Reverse in terms of folds2.40 Unique pairs2.41 Ordered triples2.42 Eight queens puzzle2.43 Optimization of queens2.44 Up-split procedure2.45 Split procedure2.46 Representation of vectors2.47 Frames implementation2.48 Representation of segments using vectors.2.49 Primitive painters2.50 Flip and rotate transformations2.51 Below procedure2.52 Modification of wave2.53 Expressions evaluating2.54 Equal? as a procedure2.55 Expressions with quotes2.56 Basic differentiator2.57 Differentiation of arbitrary numbers of terms2.58 Modification of the differentiation program2.59 Union-set for sets represented as unordered lists2.60 Set with duplicates2.61 Adjoin-set for the ordered representation2.62 Union-set for for sets represented as ordered lists2.63 Converting a binary tree to a list2.64 Partial-tree procedure2.65 Procedures for sets implemented as (balanced) binary trees2.66 Lookup procedure2.67 Message decoding2.68 Encode-symbol procedure2.69 Successive-merge procedure2.70 Encode the message2.71 Frequencies of the symbols2.72 Growth order for character encoding2.73 Symbolic differentiation program with dispatching2.74 Data Structures at Insatiable Enterprises, Inc2.75 Make-from-mag-ang constructor in message-passing style2.76 Evolving system with generalized operations.2.77 Complex-number selectors2.78 Scheme's internal type system2.79 Generic equality predicate equ?2.80 Generic predicate =zero?2.81 Coercion of the arguments with same type2.82 Coercion in the general case of multiple arguments2.83 A generic raise operation2.84 Successive raising2.85 Drop procedure2.86 Generic complex numbers2.87 =zero? for polynomials2.88 Subtraction of polynomials2.89 Procedures for dense polynomials2.90 Generic operations on term lists2.91 Division of univariate polynomial2.92 Addition and multiplication of polynomials with different variables2.93 Generic operations in rational-arithmetic package2.94 Generic operation2.95 Pseudodivision2.96 Integerizing factor2.97 Algorithm as a procedure3.1 Creation of accumulators3.2 Number of procedure calls3.3 Password-protected account3.4 Control the number of password attempts3.5 Monte Carlo integration3.6 Advanced random number generator3.7 Joint accounts3.8 Order for evaluating subexpressions3.9 Factorial procedure environments3.10 Alternative Version Analysis3.11 Internal Definitions3.12 Appending lists3.13 Make-cycle procedure3.14 Mystery procedure3.15 Box-and-pointer diagrams3.16 The procedure to count the number of pairs3.17 The number of distinct pairs in a structure3.18 Determine if a loop is in the list3.19 Optimize memory usage3.20 Draw environment diagrams3.21 Print-queue procedure3.22 A queue as a procedure with local state3.23 A deque3.24 A table constructor make-table3.25 Generalizing one- and two-dimensional tables3.26 Ordered keys in a table organized as a binary tree3.27 Memoization3.28 An or-gate as a primitive function box3.29 An or-gate as a compound digital logic device3.30 Ripple-carry adder3.31 Accept-action-procedure! procedure3.32 The procedures in a queue3.33 Averager procedure3.34 Squarer3.35 Squarer as a primitive constraint3.36 Environment diagram3.37 ''Сonstraint'' versions of the arithmetic operations3.38 Joint bank account3.39 Remaining possibilities3.40 All possible values of x3.41 Serialized make-account3.42 Make-account changing3.43 Timing diagrams3.44 The problem of transferring an amount from one account to another3.45 Redefine accounts3.46 Draw a timing diagram3.47 Implementations of semaphores3.48 Serialized-exchange with the deadlock-avoidance method3.49 Scenario where the deadlock-avoidance mechanism does not work3.50 Generic stream-map3.51 Value of expressions3.52 The value of sum3.53 Description of the elements of the stream3.54 Mul-streams procedure3.55 Partial-sums procedure3.56 Hamming's problem of number generation3.57 Additions in computing Fibonacci numbers.3.58 An interpretation of the stream3.59 Power series represented as infinite streams3.60 Procedure for multiplying series3.61 Invert-unit-series procedure3.62 Div-series procedure3.63 Efficient of the sqrt-stream procedure3.64 Stream-limit procedure3.65 Three sequences of approximations to the natural logarithm of 23.66 Order of pairs in the stream3.67 Modification of pairs3.68 Alternative definition of pairs3.69 Triples procedure3.70 Weighting function3.71 Ramanujan numbers3.72 A stream of numbers that can be written as the sum of two squares3.73 An RC circuit3.74 Zero crossings3.75 Signal smoothing3.76 Smooth procedure3.77 Modification of the integral procedure3.78 Solve-2nd procedure3.79 Generalize the solve-2nd procedure3.80 A series RLC circuit3.81 Stream of random numbers3.82 Monte Carlo integration in terms of streams4.1 Evaluation order4.2 Help Louis4.3 Rewrite eval4.4 Special forms4.5 Modify the handling of cond4.6 Implement a syntactic transformation4.7 Let*4.8 Named let4.9 Iteration constructs4.10 Implement a new syntax for Scheme4.11 Rewrite the environment operations4.12 The common patterns4.13 Implement a special form make-unbound!4.14 Why Louis's map fails?4.15 Show that it is impossible to write a procedure halts?4.16 Implement the method for interpreting internal definitions4.17 Draw diagrams of the environment4.18 Alternative strategy for scanning out definitions4.19 Implement internal definitions4.20 Special form of letrec4.21 Recursive procedures without using letrec4.22 Extend the evaluator4.23 Compare the two versions of analyze-sequence4.24 Design and carry out some experiments4.25 Attempt to evaluate Factorial 4.26 The importance of lazy evaluation4.27 The interaction between lazy evaluation and side effects4.28 Evaluate the operator using actual-value4.29 Demonstrate the benefits of memoization4.30 Working with sequences in the lazy evaluator4.31 The behavior of the lazy evaluator4.32 The difference between the streams and the lazy lists4.33 Modify the evaluator's treatment of quoted expressions4.34 Modify the driver loop for the evaluator4.35 Write a procedure an-integer-between4.36 Generate arbitrary Pythagorean triples4.37 Efficiency of generating Pythagorean triples4.38 Modify the multiple-dwelling procedure4.39 The order of the restrictions in the multiple-dwelling4.40 Efficiency of generating possibilities4.41 Solve the multiple dwelling puzzle4.42 Solve the "Liars" puzzle4.43 Who is Lorna's father?4.44 A nondeterministic program to solve ''eight-queens puzzle''4.45 Five different ways of sentence parsing4.46 Order of operands evaluation4.47 Alternative variant of parse-verb-phrase4.48 The grammar extension4.49 Sentences generating4.50 Special form ramb4.51 Permanent-set! assignment4.52 If-fail construct4.53 The result of evaluating4.54 Analyze-require procedure4.55 Simple queries4.56 Compound queries4.57 'Replace person' rule4.58 ''Big shot'' rule4.59 Meeting-time rule4.60 Lives-near query4.61 Rules for next-to relation4.62 Rules for last-pair4.63 Genesis 44.64 An infinite loop4.65 A query to find all the wheels4.66 The total salaries of all the computer programmers4.67 The query system loop detector4.68 Rules for reverse operation4.69 A rule for adding ''greats'' to a grandson relationship4.70 The purpose of the let bindings in the procedures add-assertion! and add-rule!4.71 Explicit delay in the simple-query and disjoin procedures4.72 Streams interleaving4.73 Explicit delay in flatten-stream4.74 A simpler version of stream-flatmap4.75 A new special form - unique4.76 Separate processing the two clauses of the 'and'4.77 The filtering in a ''delayed'' manner4.78 The query language as a nondeterministic program4.79 A rule-application method that uses environments5.1 Register machine5.2 Describe the iterative factorial machine5.3 Сompute square roots using Newton's method5.4 Specify register machines5.5 Hand-simulate the factorial and Fibonacci machines5.6 Extra save and extra restore5.7 Test the machines5.8 Modify the extract-labels procedure5.9 Using operations to registers and constants only5.10 New syntax for register-machine5.11 Restore a register that was not the last one saved5.12 Extend the assembler5.13 Machine registers determination5.14 The number of pushes and the maximum stack depth required to compute n!5.15 Instruction counting5.16 Instruction tracing5.17 Labels print5.18 Traced registers5.19 A breakpoint feature5.20 Box-and-pointer and memory-vector representations5.21 Register machines for count-leaves5.22 A register machine for append procedure5.23 Derived expressions handling5.24 Сond as a new basic special form5.25 Normal order evaluator based on lazy evaluator5.26 Exploration of the tail-recursive property of the evaluator5.27 The maximum depth of the stack and the total number of pushes used in evaluating n!5.28 The evaluator without tail-recursion5.29 The stack operations in the tree-recursive Fibonacci computation5.30 Error handling system5.31 Superfluous operations5.32 Combinations whose operator is a symbol5.33 Сompare the resulting code of a factorial procedure5.34 The essential difference between the code for iterative and recursive versions of factorial5.35 An example of compiler output5.36 Order of evaluation of compiler5.37 Compiler's preserving mechanism5.38 Support open coding of selected primitives5.39 lexical-address-lookup and lexical-address-set! procedures5.40 Compile-time environment maintaining5.41 Find-variable procedure5.42 Compile-variable and compile-assignment with lexical-address instructions5.43 The compiler and internal definitions5.44 Modification of the open-coding compiler5.45 The quality of the compiler5.46 The effectiveness of compiling the tree-recursive Fibonacci procedure5.47 Modifying evaluator5.48 Compile-and-run primitive5.49 Register machine5.50 Metacircular evaluator5.51 Rudimentary implementation of Scheme in C5.52 Scheme compiler into C instructions Reset