📄 http:^^www.cs.uiowa.edu^~cremer^courses^cs21^cs21.html
字号:
Date: Wed, 20 Nov 1996 23:18:35 GMTServer: NCSA/1.5Content-type: text/html<!DOCTYPE HTML PUBLIC "-//W3O//DTD W3 HTML 2.0//EN"><HEAD><TITLE>22C:21 Home Page</TITLE></HEAD><BODY><P><H2><b> 22C:21 Algorithms and Data Structures --- Spring 1996</b></H2><P><H5>MWF 1:30, Jessup Hall 221</H5><P><b> PROFESSOR:</b> <!WA0><a href="http://www.cs.uiowa.edu/~cremer">Jim Cremer</a>, 201N MacLean, E-mail: cremer@cs.uiowa.edu, Office hours: 2:30-3:30 T, 10:30-11:30 F, or by appointment<BR> <P><b> TA:</b> Jun Tu, 255D McBride, jun@cs.uiowa.edu, Office Hours: 3:30-4:30 W, 1:30-2:30 Th<BR><P><HR><H2> WHAT'S NEW (Last updated Monday, 5/13/96) </H2><UL><LI> Complete scores for the semester and the mapping from scores tocourse letter grades are available in the <!WA1><A HREF=#grades>Gradessection</A>. To see or pick up your graded final, please stop by myoffice.</UL><HR><UL><LI> <!WA2><A HREF=#homework>Homework assignments</A><LI> <!WA3><A HREF=#grades>Scores and grades</A><LI> <!WA4><A HREF=#schedule>Goals, content, and schedule</A><LI> <!WA5><A HREF=#books>Textbook and Supplemental books</A><LI> <!WA6><A HREF=#grading>Requirements and grading</A><LI> <!WA7><A HREF=#lateness>Late assignment policy</A><LI> <!WA8><A HREF=#collaboration>Policy on Collaboration</A><LI> <!WA9><A HREF=#prereq>Prerequisites</A><LI> <!WA10><A HREF=#langnote>Note on Language for Programming Assignements</A><LI> <!WA11><A HREF=#solns> Homework solutions, useful code, sample exams, etc.</A></UL><HR><H2><A NAME = prereq> Prerequisites </H2>22C:17, 22C:18, and 22C:19 (or permission of instructor)<HR><H2><A NAME=schedule> Course goals, content, and schedule</H2><P>The aim of the course is to gain experience with the major paradigms and data structures used in creating algorithms, and with basic methods for analyzing the time and space requirements of programs. We will cover most of the textbook.The tentative schedule is:<P><PRE> Week 1 Intro and Ch 1 (math background, induction, recursion) Week 2 Ch 2 (algorithm analysis notation and techniques), a bit of 7.6 and 10.2 Week 3 quick review of Ch3, Ch 4 (trees) Week 4 Ch 5 (hashing) Weeks 4 and 5 Ch 6 (priority queues) Week 6 Ch 7 (sorting) Week 7 (February 28) Exam 1,in class Weeks 7 and 8 Ch 8 (disjoint sets) Weeks 8 and 9 Ch 9 (graphs) Week 10 SPRING BREAK Week 11 Ch 9 (graphs), including a bit extra on decidability, tractability, complexity Weeks 12 and 13 Ch 10 (algorithm techniques), including greedy methods, dynamic programming, more divide-and-conquer Week 14 (April 17) Exam 2, in class Week 15 Ch 10.5 backtracking search/games (TENTATIVE) Week 16 Ch 11 (amortized analysis) May 10 (Friday) FINAL EXAM, 9:45 a.m. </PRE><HR><H2><A NAME=books> Textbook</H2><P> Weiss, <em> Data Structures and Algorithm Analysis</em>, Benjamin-Cummings, Second Edition, 1995.<P><H2> Supplemental Books (on reserve in Math Library)</H2> <P> Cormen, Leiserson, and Rivest, <em> Introduction to Algorithms</em>, McGraw-Hill, 1990<BR> Aho, Hopcroft, and Ullman, <em> Data Structures and Algorithms</em>, Addison-Wesley, 1983<P><HR><H2><A NAME=grading> Requirements and grading</H2><P>Course grades will be based on ten (or so) homework sets, twomidterm exams, and the final exam. There will be some smallprogramming assignments. Programming problems will usually be givenas part of regular written homework assignments; there will not be aseparate grading category for programming assignments. Classparticipation and effort may be taken into account in determining grades inborderline situations. The components will be weighted roughly asfollows:<PRE> Homeworks assignments 35% Midterm exams 20% each Final exam 25%<P></PRE><HR><H2><A NAME=lateness> Late assignment policy</H2><P>All assignments are due at the beginning of class. In other cases,assignments turned in within 24 hours will receive a 20% penalty, andthose turned in 24 to 48 hours late will receive a 50% penalty.(Exception --- each student may turn in one homework assignment up totwo days late with no penalty.) Regrade requests must be made withinone week of when the assignments are returned in class.<HR><H2><A NAME=collaboration> Policy on collaboration</H2><P>Homework and programming assignments should be done alone. It is reasonable to discuss general approaches to problem solution or algorithm design with other students but the bulk of the work must be done alone. Working out details, sharing in the write-up or sharing or copying code will be treated as a violation of the academic integrity rules.<HR><H2> <A = langnote> Note on Language for Progamming Assignments </H2><P>Program source code in the book is in Pascal. However, for course programming assignments, you will be free to use your choice of Pascal, C, or C++ (or another language if approved by the instructor).<HR><H2><A NAME=homework> Homework Assignments</H2><P><UL><LI> <!WA12><A HREF=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/hw8/hw8.html>Homework 8</A> (HTML version).<BR> <!WA13><A HREF=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/hw8.ps>Homework 8</A> (Postscript version).<LI> Official test data for Homework 8 (must turn in runs of your program on these files):<br><!WA14><A href=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/wordlist1>wordlist1</A>,<!WA15><A href=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/wordlist2>wordlist2</A>,<!WA16><A href=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/wordlist3>wordlist3</A><BR>Some other test data for Homework 8:<BR><!WA17><A href=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/extra-wordlist1>extra-wordlist1</A>,<!WA18><A href=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/extra-wordlist2>extra-wordlist2</A>,<!WA19><A href=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/extra-wordlist3>extra-wordlist3</A><br><LI> <!WA20><A HREF=http://www.cs.uiowa.edu/~cremer/courses/cs21/homeworks/hw7/hw7.html>Homework 7</A> (HTML version).<BR>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -