http:^^www.cs.washington.edu^education^courses^322^96w^handout3^handout3.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 71 行
HTML
71 行
Date: Wed, 08 Jan 1997 20:50:41 GMTServer: NCSA/1.4.2Content-type: text/html<!DOCTYPE HTML PUBLIC "-//W3O//DTD W3 HTML 2.0//EN"><!Converted with LaTeX2HTML 95 (Thu Jan 19 1995) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds ><HEAD><TITLE>Final Exam CSE 322</TITLE></HEAD><BODY><meta name="description" value="Final Exam CSE 322"><meta name="keywords" value="handout3"><meta name="resource-type" value="document"><meta name="distribution" value="global"><P> <BR> <HR><A NAME=tex2html1 HREF="node1.html"><IMG ALIGN=BOTTOM ALT="next" SRC="http://www.cs.washington.edu/general/latex2html_icons//next_motif.gif"></A> <IMG ALIGN=BOTTOM ALT="up" SRC="http://www.cs.washington.edu/general/latex2html_icons//up_motif_gr.gif"> <IMG ALIGN=BOTTOM ALT="previous" SRC="http://www.cs.washington.edu/general/latex2html_icons//previous_motif_gr.gif"> <BR><B> Next:</B> <A NAME=tex2html2 HREF="node1.html"> About this document </A><BR> <HR> <P><P><H1>Final Exam CSE 322</H1><P><STRONG></STRONG><P><P><STRONG>Wednesday, March 13, 1996, 2:30 - 4:20</STRONG><P><P>We will use the <IMG ALIGN=MIDDLE ALT="" SRC="img1.gif"> inch blue book. You may use the first8 pages for your own handwritten notes.<P>The exam will be comprehensive covering the entire course.<P>You should have read and understood the following chapters and sections ofSudkamp.<UL><LI> Chapter 1, all sections. Pay particular attention to to Section 1.3,Countable and Uncountable Sets.<LI>Chapter 2, all sections.<LI>Chapter 3, all sections.<LI>Chapter 4. We did not cover this chapter in detail. You should knowand understand the nondeterministic top-down and bottom-up parsing methods.<LI>Chapter 5, only section 5.3, Useless Symbols. Although we did notcover this section directly, you should read and understand it. <LI>Chapter 6, all sections. We did not talk much about <IMG ALIGN=BOTTOM ALT="" SRC="img2.gif">-NFA's, butyou should know what they are. Sudkamp's approach to showing theequivalence of DFA's, NFA's, regular expressions, and regular grammars wasdifferent than mine. Nonetheless, try to read and understand his approach.<LI>Chapter 7, all sections except section 7.3, The Pumping Lemma forRegular Languages.<LI>Chapter 8, all sections except, 8.3 and 8.6. Also remember to study theDPDA too, which is not covered in the book.<LI> Chapter 9, only sections 9.1 and 9.2.<LI>Chapter 11, only sections 11.1, 11.2, 11.3, 11.4. and 11.8. We are notcovering these sections in complete detail, but you should know andunderstand what I did in class in these sections.</UL><BR> <HR><UL> <LI> <A NAME=tex2html3 HREF="node1.html#SECTION00010000000000000000"> About this document ... </A></UL><BR> <HR><P><ADDRESS><I>James Fix <BR>Mon Mar 4 14:57:38 PST 1996</I></ADDRESS></BODY>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?