diff options
author | elioat <elioat@tilde.institute> | 2023-08-23 07:52:19 -0400 |
---|---|---|
committer | elioat <elioat@tilde.institute> | 2023-08-23 07:52:19 -0400 |
commit | 562a9a52d599d9a05f871404050968a5fd282640 (patch) | |
tree | 7d3305c1252c043bfe246ccc7deff0056aa6b5ab /js/games/nluqo.github.io/~bh/ssch26/part7.html | |
parent | 5d012c6c011a9dedf7d0a098e456206244eb5a0f (diff) | |
download | tour-562a9a52d599d9a05f871404050968a5fd282640.tar.gz |
*
Diffstat (limited to 'js/games/nluqo.github.io/~bh/ssch26/part7.html')
-rw-r--r-- | js/games/nluqo.github.io/~bh/ssch26/part7.html | 60 |
1 files changed, 60 insertions, 0 deletions
diff --git a/js/games/nluqo.github.io/~bh/ssch26/part7.html b/js/games/nluqo.github.io/~bh/ssch26/part7.html new file mode 100644 index 0000000..0b0fe31 --- /dev/null +++ b/js/games/nluqo.github.io/~bh/ssch26/part7.html @@ -0,0 +1,60 @@ +<P> + +<P> +<HTML> +<HEAD> +<TITLE>Simply Scheme: Introducing Computer Science, Part 26: Conclusion: Computer Science</TITLE> +</HEAD> +<BODY> +<CITE>Simply Scheme:</CITE> +<CITE>Introducing Computer Science</CITE> 2/e Copyright (C) 1999 MIT +<H2>Part VII</H2> +<H1>Conclusion: Computer Science</H1> + +<TABLE width="100%"><TR><TD> +<IMG SRC="../simply.jpg" ALT="cover photo"> +<TD><TABLE> +<TR><TD align="right"><CITE><A HREF="http://www.cs.berkeley.edu/~bh/">Brian +Harvey</A><BR>University of California, Berkeley</CITE> +<TR><TD align="right"><CITE><A HREF="http://ccrma.stanford.edu/~matt">Matthew +Wright</A><BR>University of California, Santa Barbara</CITE> +<TR><TD align="right"><BR> +<TR><TD align="right"><A HREF="../pdf/ssch26.pdf">Download PDF version</A> +<TR><TD align="right"><A HREF="../ss-toc2.html">Back to Table of Contents</A> +<TR><TD align="right"><A HREF="../ssch25/database.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="preview.html"><STRONG>NEXT</STRONG></A> +<TR><TD align="right"><A HREF="http://mitpress.mit.edu/0262082810">MIT +Press web page for <CITE>Simply Scheme</CITE></A> +</TABLE></TABLE> + +<HR><BIG> + +<P>This is the end of the technical material in this book. We've +explored the big ideas of composition of functions, functions as data, +recursion, abstraction, and sequential programming. As a review, you might +enjoy rereading Chapter 1 to see how the formerly mysterious +examples now make sense. + +<P>This book is intended both as a standalone programming course for people +whose main interest is in something else and as preparation for those who +intend to continue studying computer science. The final chapter is directed +mainly at the latter group, to tell them what to expect. We confess, +though, to the hope that some of the former may have enjoyed this experience +enough to be lured into further study. If you're in that category, you'll +be particularly interested in a preview of coming attractions. + +<P> + +</BIG> +<HR> +<P><A HREF="../ss-toc2.html">(back to Table of Contents)</A><P> +<A HREF="../ssch25/database.html"><STRONG>BACK</STRONG></A> +chapter thread <A HREF="preview.html"><STRONG>NEXT</STRONG></A> + +<P> +<ADDRESS> +<A HREF="../index.html">Brian Harvey</A>, +<CODE>bh@cs.berkeley.edu</CODE> +</ADDRESS> +</BODY> +</HTML> |