http:^^www.cs.uoregon.edu^classes^cis313^

This data set contains WWW-pages collected from computer science departments of various universities

Date: Tue, 26 Nov 1996 19:17:34 GMT
Server: Apache/1.1.1
Content-type: text/html
Content-length: 5781
Last-modified: Fri, 15 Nov 1996 17:24:13 GMT

<TITLE> CIS 313, Introduction to Data Structures </TITLE><center>
<h2>	CIS 313 Fall 1996</h2>
<h2> Introduction to Information Structures</h2>
<h3> UNDER CONSTRUCTION (As Always)</h3>

</center>

<hr>
<H4 ALIGN=CENTER>[ 
    <!WA0><A HREF="http://www.cs.uoregon.edu/classes/cis313/assignments.html">Assignments</A> |
    <!WA1><A HREF="http://www.cs.uoregon.edu">CIS</A> |
    <!WA2><A HREF="http://www.uoregon.edu/">UO</A> |
    <!WA3><A HREF="http://www.cs.uoregon.edu/classes/cis313/news.html">News</A> ]</H4>


<ul>

<li><b>Prerequisites:</b> Math 231-232, CIS 210-212.
<p><li><b>Time and Place:</b> 
 Mondays, Wednesdays, and Fridays at 10 am in 242 Gilbert.

<p><li><b>Instructor:</b> 
Chris Wilson, 326 Deschutes, phone [phone],
email <!WA4><a href="mailto:[e-mail]">[e-mail]</a>.
<p>


<li><b>Teaching Assistants:</b> 
<UL>
<LI> Jianzhong Xue, 233 Deschutes, phone [phone],
email <!WA5><a href="mailto:[e-mail]">[e-mail]</a>
<LI> Shuang Yang, 235 Deschutes
email <!WA6><a href="mailto:[e-mail]">[e-mail]</a>
</UL>
<P>
<li><b>Office  hours:</b> 
<ul><li>Chris: MWF 2-3 or by appt.
<li>Xue: 11-12 MWF
<li> Shuang: 10:30-11:30 UH
</ul>
<p><li><b>Directory:</b>  The (unix) directory for the class is 
/cs/classes/cis313.
<p><li><b>News:</b>  Keep an eye on the <!WA7><A HREF="http://www.cs.uoregon.edu/classes/cis313/news.html">course news</A> for miscellaneous announcements.

<P>
<LI> <B>Sample Solutions:</B> These will be linked through the 
<!WA8><A HREF="http://www.cs.uoregon.edu/classes/cis313/assignments.html">assignments</A> page.

<p><li><b>Evaluation:</b> 
<UL>
<LI> There will be four or five written assignments
and three programming assignments.  These are to be done individually
rather than in groups.  
<LI> The midterm was held on Nov. 8.  Check out the
<!WA9><A HREF="http://www.cs.uoregon.edu/classes/cis313/midtopics.html">study guide</A> (html) and the 
<!WA10><A HREF="http://www.cs.uoregon.edu/classes/cis313/midterm.ps">sample solution</A> (postscript only).
<LI> The final will be held on Thursday, Dec. 12
at 10:15 (it's a two hour exam).
<LI>  The final will <B>not be in the regular classroom.</B>  It will
be held in <B>room 238</B>, down the hall.
</UL>

<p>  The approximate weighting of the work done is<P><ul>

<table border=2><tr><td>
<li>Homework Assignments</td><td> 30%</td></tr><tr><td>
<li>Programming Assignments</td><td>25%</td></tr><tr><td>
<li>Midterm</td><td> 15%</td></tr><tr><td>
<li>Final Exam</td><td>30%</td></table></ul>



<P><LI><B>Text:</b> Weiss, <i> Algorithms, Data Structures, and  Problem Solving with
C++</i>, Addison-Wesley, 1995.
A
<!WA11><A HREF="http://heg-school.aw.com/cseng/authors/weiss/adp-cpp/adp-cpp.html">
home page</A>
is available for the text.  Following the "Supplement" link will lead
you to C++ code for downloading.  (There have been problems reported
with that link - try the 
<!WA12><A HREF="http://www.fiu.edu/~weiss/"> author's home page</A>
as well.)


<P><LI><B>Supplemental Reading:</b><ul><li>

Decker, Hirschfield, <I>The Object Concept</i>, PSW Publ., 1995.<li>

Cormen, Leiserson, and Rivest, <i>Introduction to Algorithms</i>, The
MIT Press 1990.<li>

 Aho, Hopcroft and Ullman, <i> Data Structures and Algorithms</i>,
Addison-Wesley 1987.<li>

 Helman and Veroff, <i>Intermediate Problem Solving and
Data Structures; Walls and Mirrors</i>, Benjamin/Cummings 1986. <li>

 Knuth, <i>The Art of Computer Programming, vol.I</i>, Addison-Wesley
1975.<li>

 Ross and Wright, <i> Discrete Mathematics</i>, Prentice Hall 1992.<li>

Epp, <i> Discrete Mathematics with Applications</i>, PSW Publ., 1995.

</ul>

<h2> Tentative Syllabus</h2> 

<table border=2>
<tr>
<td>Week of</td><td> Chapter </td><td> Description</td>
</tr>
<tr><td></td></tr>
<tr>
<td> Sep 30 </td><td> 5 </td><td> algorithm analysis </td>
</tr>
<tr>
<td> Oct 7 </td><td> 6, 15, 16  </td><td>  simple data structures
</td>
</tr>
<tr>
<td> Oct 14  </td><td> 7  </td><td> recursion and timing</td>
</tr>
<tr>
<td> Oct 21 </td><td> 11 </td><td> stacks and compilers</b> </td>
</tr>
<tr>
<td> Oct 28  </td><td> 12 </td><td> Huffman coding</td>
</tr>
<tr>
<td> Nov 4  </td><td> 17  </td><td> trees </td>
</tr>
<tr>
<td> Nov 11  </td><td> 18  </td><td> binary search trees </td>
</tr>
<tr>
<td> Nov 18 </td><td> 18 </td><td> AVL and red-black trees </td>
</tr>
<tr>
<td> Nov 25  </td><td> 20  </td><td> priority queues </td>
</tr>
<tr>
<td> Dec 2  </td><td> 8  </td><td> sorting </td>
</tr>
<tr><td></td></tr>
<tr>
<td>Dec 12  </td><td>  </td><td> <b>Final Exam</b> at 10:15 Thursday
</tr>
</table><P>

<P><LI><B>Late policy:</B>  All assignments are due by 5:00pm of the
stated due date, though it is much safer to turn them in at class time.
Late papers are subject to a 5% per day penalty, up to a maximum
of 25%.  Late assignments will not be accepted once the graded
papers are returned or once sample are handed out.

<P><LI><B>Programming:</b> should be done in C++. The programs have
to be accompanied by a manual-like documentation page, analysis of
program correctness and complexity, and evidence of experimentation
that includes sample runs. Documentation should include both in-code
and general comments. Legibility of the code is essential. The
official center for computing activity is the Computing Room 100 in
Deschutes Hall.  Of course, if you have C++ available elsewhere,
such as at home, you are welcome to use it.  Due to the variety
of platforms used, you should turn in hardcopy.

<P><LI><b>Grading:</b> will be performed by an able and experienced
grader. Any contested score will be first referred to that person. Be
aware of the possibility of correcting grading mistakes both in your
favor and disadvantage, so that the challenged score can change in
either direction. <B> Note:</b> to allow for a larger margin
of subjectivity in grading, we will use the whole score range, from 0
to 100%; you may expect the average score (corresponding to B-) to be
around 50%. The final letter grade will be assigned based on the
total weighted score curve.

</ul>