set design, and addressing; control structures and microprogramming; memorymanagement, caches, and memory hierarchies; interrupts and I/O structures.Prereq:&nbsp;<!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs352">ECE/CS&nbsp;352</A> and <!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">CS/ECE&nbsp;354</A>;co-req:&nbsp;<!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>.<A NAME="cs558">&#160;</A><H2><A NAME="SECTION000932000000000000000">558 <!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><A NAME="tex2html66" HREF="http://sal-cnc.me.wisc.edu/558.html">Introduction to Computational Geometry</A> 3 cr. (also ME and IE)</A></H2><P>Introduction to fundamental geometric computations and algorithms, and theiruse for solving engineering and scientific problems.  Computer representationsof simple geometric objects and paradigms for algorithm design.  Applicationsfrom areas of engineering analysis, design and manufacturing, biology,statistics, and other sciences.Prereq:&nbsp;<!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> or equivalent, Math 223 or equivalent, or consent of instructor.<A NAME="cs562">&#160;</A><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><A NAME="tex2html67" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000933000000000000000">562 Expert Systems: Design and Implementation 3 cr.</A></H2><P>Design of expert knowledge bases: choice of appropriate representation,knowledge base structure, connection with databases.  Knowledge acquisition:possible knowledge sources, logical analysis and formalization, consistencyand adequate checking.  Inference engine construction and tailoring: choiceand control of inferencing strategies, handling uncertain knowledge, achievingefficiency.  Display and dialog design.  Implementation of explanationcapabilities.  Evaluation of knowledge engineering environments and languages.Prereq:&nbsp;<!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs460">CS&nbsp;460</A> or&nbsp;<!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">540</A>.(Infrequently offered.)<A NAME="cs564">&#160;</A><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><A NAME="tex2html68" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000934000000000000000">564 Database Management Systems: Design and Implementation<BR>4 cr. ugrad, 3 cr. grad.</A></H2><P>What a database management system is; different data models currently used tostructure the logical view of the database: relational, hierarchical, andnetwork.  Hands-on experience with relational and network-based databasesystems.  Implementation techniques for database systems.  File organization,query processing, concurrency control, rollback and recovery, integrity andconsistency, and view implementation.  Prereq:&nbsp;<!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>and&nbsp;<!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">354</A>.<A NAME="cs577">&#160;</A><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><A NAME="tex2html69" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000935000000000000000">577 Introduction to Algorithms 3 cr.</A></H2><P>Survey of important and useful algorithms for sorting, searching,pattern-matching, graph manipulation, geometry, and cryptography.  Paradigmsfor algorithm design. Techniques for efficient implementation.  Prereq:&nbsp;<!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>and Math&nbsp;222, or consent of instructor.<A NAME="cs638">&#160;</A><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><A NAME="tex2html70" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000936000000000000000">638 Undergraduate Topics in Computing 3 cr.</A></H2><P>Prereq:&nbsp;Consent of instructor.<A NAME="cs640">&#160;</A><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><A NAME="tex2html71" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000937000000000000000">640 Introduction to Computer Networks 3 cr.</A></H2><P>Architecture and components of computer communications networks; protocolconcepts and standards; OSI Reference Model; network/protocol architectureexamples: Internet, ISO/CCITT, SNA, DECNET, public data networks;local area networks-gateways, internetworking, transport and applicationprotocols.  Prereq:&nbsp;<!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">CS&nbsp;537</A>.<A NAME="cs681">&#160;</A><A NAME="cs682">&#160;</A><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><A NAME="tex2html72" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000938000000000000000">681-682 Senior Honors Thesis 3 cr. per sem.</A></H2><P>Prereq:&nbsp;Honors candidacy and consent of instructor.<A NAME="cs691">&#160;</A><A NAME="cs692">&#160;</A><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><A NAME="tex2html73" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000939000000000000000">691-692 Senior Thesis 2-3 cr. per sem.</A></H2><P>(A year's course must be taken to get credit.)  Prereq:&nbsp;Consent of instructor.<A NAME="cs699">&#160;</A><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><A NAME="tex2html74" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000940000000000000000">699 Directed Study 1-6 cr.</A></H2><P>Prereq:&nbsp;Junior or senior standing and consent of instructor.<A NAME="cs701">&#160;</A><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><A NAME="tex2html75" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000941000000000000000">701 Programming Languages and Compilers 3 cr.</A></H2><P>Design and implementation of compilers for modern programming languages.Emphasis on tools for compiler construction.  Prereq:&nbsp;<!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">CS&nbsp;536</A>.<A NAME="cs702">&#160;</A><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><A NAME="tex2html76" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000942000000000000000">702 Compiler Construction 3 cr.</A></H2><P>Techniques for the implementation of compilers for sophisticated programminglanguages.  Prereq:&nbsp;<!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">CS&nbsp;536</A>; co-req: <!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs701">CS&nbsp;701</A>or consent of instructor.  (Infrequently offered.)<A NAME="cs703">&#160;</A><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><A NAME="tex2html77" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000943000000000000000">703 Advanced Topics in Programming Languages and Compilers 3 cr.</A></H2><P>Advanced topics in compiling and programming languages design.  Advancedparsing techniques; automatic syntactic error correction; local and globalcode optimization; attribute grammars; programming language design issues(data and control abstractions, specification and verification of high levellanguages).  Prereq:&nbsp;<!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs701">CS&nbsp;701</A>.<A NAME="cs704">&#160;</A><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><A NAME="tex2html78" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000944000000000000000">704 Principles of Programming Languages  3 cr.</A></H2><P>Introduction to principles of advanced programming languages andprogramming-language theory.  Topics include: lambda-calculus, functionallanguages, polymorphic functions, type inference, structural induction, lazyevaluation, operational semantics, denotational semantics, and axiomaticsemantics.  Prereq:&nbsp;<!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">CS&nbsp;536</A> or consent of instructor.<A NAME="cs709">&#160;</A><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><A NAME="tex2html79" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000945000000000000000">709 Mathematical Techniques for Analysis of Algorithms 3 cr.</A></H2><P>Techniques for quantitative analysis of algorithms.  Charging arguments,amortization, probabilistic methods.  Adversary and information lower bounds.