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/v3-toc2.html | |
| parent | 5d012c6c011a9dedf7d0a098e456206244eb5a0f (diff) | |
| download | tour-562a9a52d599d9a05f871404050968a5fd282640.tar.gz | |
*
Diffstat (limited to 'js/games/nluqo.github.io/~bh/v3-toc2.html')
| -rw-r--r-- | js/games/nluqo.github.io/~bh/v3-toc2.html | 246 |
1 files changed, 246 insertions, 0 deletions
diff --git a/js/games/nluqo.github.io/~bh/v3-toc2.html b/js/games/nluqo.github.io/~bh/v3-toc2.html new file mode 100644 index 0000000..37a22ad --- /dev/null +++ b/js/games/nluqo.github.io/~bh/v3-toc2.html @@ -0,0 +1,246 @@ +<HTML> +<HEAD> +<TITLE>Beyond Programming contents</TITLE> +<link rel="shortcut icon" href="http://www.cs.berkeley.edu/~bh/csls3-tiny.png" type="image/png"> +</HEAD> +<BODY> +<CITE>Computer Science Logo Style</CITE> volume 3: +<CITE>Beyond Programming</CITE> 2/e Copyright (C) 1997 MIT +<H1><EM>Computer Science Logo Style</EM><BR> +Volume 3: <EM>Beyond Programming</EM></H1> +<CITE>Brian Harvey<BR>University of California, Berkeley</CITE> + +<P><TABLE width="100%"><TR> +<TD><IMG SRC="csls3.jpg"> +<TD><TABLE> +<TR><TD align="right"><A HREF="v1-toc2.html">Volume 1: <CITE>Symbolic Computing</CITE></A> +<IMG SRC="csls1-tiny.jpg"> +<TR><TD align="right"><A HREF="v2-toc2.html">Volume 2: <CITE>Advanced Techniques</CITE></A> +<IMG SRC="csls2-tiny.jpg"> +<TR><TD align="right"><A HREF="logo.html">Download Berkeley Logo (UCBLogo)</A> +<IMG SRC="ucblogo2-tiny.gif"> +<TR><TD align="right"><A HREF="index.html">Brian's home page</A> +<IMG SRC="bh-tiny.jpg"> +<TR><TD align="right"> <A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-3">MIT +Press web page for <CITE>Computer Science Logo Style</CITE></A> +<IMG SRC="mitp.jpg"> +</TABLE></TABLE> + +<HR> + +<P>Below this short table of contents is an expanded table of contents +including sections within each chapter. Click on the chapter name +to jump down. You can also download the complete text of each chapter +in PDF format for elegant printing, or browse the HTML version. + +<P><EM>Note: These books are still in copyright, and in print. They are +posted here for your personal use, not for resale or redistribution. +Thanks!</EM> + +<p> +<a href="http://www.azoft.com/people/seremina/edu/v3-toc2-romanian.html">View +this +page in Romanian</a> courtesy of <a href="http://www.azoft.com/">azoft</a>. + +<p> +<a href="http://cupegraf.com/blog/v3-toc2/">Slovakian translation</a> +courtesy of <a href="http://cupegraf.com">Gasper Halipovich</a> + +<UL> +<LI>Preface +(<A HREF="pdf/v3ch00.pdf">frontmatter in PDF</A>) +(<A HREF="v3ch0/preface.html">HTML</A>) +<LI>Acknowledgments +(<A HREF="v3ch0/ack.html">HTML</A>) +<LI>1. <A HREF="v3-toc2.html#ch1">Automata Theory</A> +(<A HREF="pdf/v3ch01.pdf">PDF</A>) +(<A HREF="v3ch1/fsm.html">HTML</A>) +<LI>2. <A HREF="v3-toc2.html#ch2">Discrete Mathematics</A> +(<A HREF="pdf/v3ch02.pdf">PDF</A>) +(<A HREF="v3ch2/math.html">HTML</A>) +<LI>3. <A HREF="v3-toc2.html#ch3">Algorithms and Data Structures</A> +(<A HREF="pdf/v3ch03.pdf">PDF</A>) +(<A HREF="v3ch3/algs.html">HTML</A>) +<LI>4. <A HREF="v3-toc2.html#ch4">Programming Language Design</A> +(<A HREF="pdf/v3ch04.pdf">PDF</A>) +(<A HREF="v3ch4/langd.html">HTML</A>) +<LI>5. <A HREF="v3-toc2.html#ch5">Programming Language Implementation</A> +(<A HREF="pdf/v3ch05.pdf">PDF</A>) +(<A HREF="v3ch5/langi.html">HTML</A>) +<LI>6. <A HREF="v3-toc2.html#ch6">Artificial Intelligence</A> +(<A HREF="pdf/v3ch06.pdf">PDF</A>) +(<A HREF="v3ch6/ai.html">HTML</A>) +<LI>Bibliography +(<A HREF="pdf/v3ch07.pdf">backmatter in PDF</A>) +(<A HREF="v3ch7/biblio.html">HTML</A>) +<LI>Credits +(<A HREF="v3ch7/permissions.html">HTML</A>) +<LI>Index of Defined Procedures +(<A HREF="v3ch7/appuindex.html">HTML</A>) +<LI>General Index +(<A HREF="v3ch7/appindex.html">HTML</A>) +</UL> + +<HR> + +<H3>Preface</H3> + +<UL> +<LI>About This Series +<LI>How to Read This Book +<LI>What Isn't Included +<LI>Computers and People +</UL> + +<H3>Acknowledgments</H3> + +<H3><A name="ch1">1. Automata Theory</A></H3> + +<UL> +<LI>What is a Computation? +<LI>Finite-State Machines +<LI>Nondeterministic Machines +<LI>Representing Machines as Logo Lists +<LI>Text Editors: A Use for Acceptors +<LI>Regular Expressions +<LI>Rules That Aren't Regular +<LI>Regular Expressions and Finite-State Machines +<LI>How to Translate +<LI>Making the Machine Deterministic +<LI>Eliminating Redundant States +<LI>A Finite-State Adder +<LI>Counting and Finite-State Machines +<LI>Turing Machines +<LI>Turing's Thesis +<LI>The Halting Theorem +<LI>Proving the Halting Theorem in Logo +<LI>Program Listing +</UL> + +<H3><A name="ch2">2. Discrete Mathematics</A></H3> + +<UL> +<LI>Propositional Logic +<LI>An Inference System +<LI>Problems with Ordering +<LI>Data Structure +<LI>Program Structure: Recording Simple Propositions +<LI>Program Structure: Recording Implications +<LI>Using Implications to Represent Orderings +<LI>Backtracking +<LI>Generalized Inference Systems and Predicate Logic +<LI>Logic and Computer Hardware +<LI>Combinatorics +<LI>Inductive and Closed-Form Definition +<LI>Pascal's Triangle +<LI>Simulation +<LI>The Simplex Lock Problem +<LI>An Inductive Solution +<LI>Multinomial Coefficients +<LI>Program Listing +</UL> + +<H3><A name="ch3">3. Algorithms and Data Structures</A></H3> + +<UL> +<LI>Local Optimization vs. Efficient Algorithms +<LI>Memoization +<LI>Sorting Algorithms +<LI>Sorting by Selection +<LI>Sorting by Partition +<LI>Order of Growth +<LI>Data Structures +<LI>Data Structures in Real Life +<LI>Trees +<LI>Improving the Data Representation +<LI>Trees as an Abstract Data Type +<LI>Tree Modification +<LI>Searching Algorithms and Trees +<LI>Logo's Underlying Data Structures +<LI>Program Listing +</UL> + +<H3><A name="ch4">4. Programming Language Design</A></H3> + +<UL> +<LI>Programming paradigms +<LI>Interactive and Non-Interactive Languages +<LI>Block Structure +<LI>Statement Types +<LI>Shuffling a Deck Using Arrays +<LI>Lexical Scope +<LI>Typed Variables +<LI>Additional Types in Standard Pascal +<LI>Critique of Typed Variables +<LI>Procedures and Functions +<LI>Call by Value and Call by Reference +<LI>Parameters in Logo: Call by Binding +</UL> + +<H3><A name="ch5">5. Programming Language Implementation</A></H3> + +<UL> +<LI>Formal Syntax Definition +<LI>Tokenization +<LI>Lookahead +<LI>Parsing +<LI>Expressions and Precedence +<LI>The Two-Stack Algorithm for Expressions +<LI>The Simulated Machine +<LI>Stack Frames +<LI>Data Structures +<LI>Code Generation +<LI>Program Listing +</UL> + +<H3><A name="ch6">6. Artificial Intelligence</A></H3> + +<UL> +<LI>Microworlds: Student +<LI>How Student Translates English to Algebra +<LI>Pattern Matching +<LI>Solving the Equations +<LI>Age Problems +<LI>AI and Education +<LI>Combining Sentences Into One Equation +<LI>Allowing Flexible Phrasing +<LI>Using Background Knowledge +<LI>Optional Substitutions +<LI>If All Else Fails +<LI>Limitations of Pattern Matching +<LI>Context-Free Languages +<LI>Augmented Transition Networks +<LI>Program Listing +</UL> + +<H2>Appendices</H2> + +<H3>Bibliography</H3> + +<UL> +<LI>Read These! +<LI>Chapter 1: Automata Theory +<LI>Chapter 2: Discrete Mathematics +<LI>Chapter 3: Algorithms and Data Structures +<LI>Chapter 4: Programming Language Design +<LI>Chapter 5: Programming Language Implementation +<LI>Chapter 6: Artificial Intelligence +<LI>Computers and People +</UL> + +<H3>Credits</H3> + +<H3>Index of Defined Procedures</H3> + +<H3>General Index</H3> + +<P><A HREF="https://mitpress.mit.edu/books/computer-science-logo-style-second-edition-volume-3">MIT +Press web page for <CITE>Computer Science Logo Style</CITE></A> + +<P> +<ADDRESS> +<A HREF="index.html">Brian Harvey</A>, +<CODE>bh@cs.berkeley.edu</CODE> +</ADDRESS> +</BODY> +</HTML> |