http:^^www.cs.rpi.edu^~dugan^data_structures^index.html

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

  <TH> Sunday	</TH>
  <TH> Monday	</TH>
  <TH> Tuesday	</TH>
  <TH> Wednesday</TH>
  <TH> Thursday	</TH>
  <TH> Friday	</TH>
  <TH> Saturday	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 6</TH>
  <TH align=left valign=top> 	</TH>
  <TH align=left valign=top> </TH>
  <TH align=left valign=top> 1</TH>
  <TH align=left valign=top>2 <p>Shortest Paths <p><!WA53><A href="http://www.cs.rpi.edu/~dugan/data_structures/dugan11.html">Dugan</a>, <p><!WA54><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect11/lect11.html">Mehta</a></TH>
  <TH align=left valign=top> 3	</TH>
  <TH align=left valign=top> 4	</TH>
  <TH align=left valign=top> 5	</TH>
</TR>


<TR ALIGN=CENTER> <TH>Week 7</TH>
  <TH align=left valign=top> 6	</TH>
  <TH align=left valign=top>7 <p>Dictionaries, BSTs, and Hash Tables <!WA55><A href="http://www.cs.rpi.edu/~dugan/data_structures/dugan12.html">Dugan</a>, <p><!WA56><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect12/lect12.html">Mehta</a></TH>
  <TH align=left valign=top> 8 	</TH>
  <TH align=left valign=top> 9 <p>Huffman Codes <p><!WA57><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/12.pdf">Dugan</a>, <p><!WA58><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect13/lect13.html">Mehta</a></TH>
  <TH align=left valign=top> 10	</TH>
  <TH align=left valign=top> 11	</TH>
  <TH align=left valign=top> 12	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 8</TH>
  <TH align=left valign=top> 13	</TH>
  <TH align=left valign=top>14 <p>Midterm Break <p> NO CLASS </TH>
  <TH align=left valign=top> 15	</TH>
  <TH align=left valign=top>16   <p>Discrete Event Simulation <p><!WA59><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/12.pdf">Dugan</a>, <p><!WA60><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect14/lect14.html">Mehta</a></TH>
  <TH align=left valign=top> 17	</TH>
  <TH align=left valign=top> 18	</TH>
  <TH align=left valign=top> 19	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 9</TH>
  <TH align=left valign=top>20	</TH>
  <TH align=left valign=top>21 <p>Midterm Exam <p><!WA61><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA62><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect15/lect15.html">Mehta</a></TH>
  <TH align=left valign=top> 22	</TH>
  <TH align=left valign=top>23 <p>Analysis Of Algorithms <p><!WA63><A href="http://www.cs.rpi.edu/~dugan/data_structures/dugan16.html">Dugan</a>, <p><!WA64><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect16/lect16.html">Mehta</a></TH>
  <TH align=left valign=top> 24	</TH>
  <TH align=left valign=top> 25	</TH>
  <TH align=left valign=top> 26	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 10</TH>
  <TH align=left valign=top>27	</TH>
  <TH align=left valign=top>28 <p>Sorting <p><!WA65><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/14.pdf">Dugan</a>, <p><!WA66><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect17/lect17.html">Mehta</a><p><!WA67><a href="http://www.cs.rpi.edu/~dugan/data_structures/project2.html"><b>Homework#2 DUE</b></a></TH>
  <TH align=left valign=top> 29	</TH>
  <TH align=left valign=top>30 <p>Sorting (cont.) <p><!WA68><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/15.pdf">Dugan</a>, <p><!WA69><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect18/lect18.html">Mehta</a></TH>
  <TH align=left valign=top> 31	</TH>
  <TH align=left valign=top> 	</TH>
</TR>

</TABLE>

<TABLE BORDER=4 CELLPADDING=3 CELLSPACING=8>

<TR ALIGN=CENTER>
  <TH ROWSPAN=2><!WA70><IMG SRC="http://www.cs.rpi.edu/~dugan/gif/datebook.gif" HEIGHT=64 WIDTH=64></TH>
  <TH COLSPAN=8>November 1996</TH>
</TR>

<TR ALIGN=CENTER>
  <TH> Sunday	</TH>
  <TH> Monday	</TH>
  <TH> Tuesday	</TH>
  <TH> Wednesday</TH>
  <TH> Thursday	</TH>
  <TH> Friday	</TH>
  <TH> Saturday	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 10</TH>
  <TH align=left valign=top>  </TH>
  <TH align=left valign=top>  </TH>
  <TH align=left valign=top> </TH>
  <TH align=left valign=top> </TH>
  <TH align=left valign=top> </TH>
  <TH align=left valign=top>1</TH>
  <TH align=left valign=top>2 </TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 11</TH>
  <TH align=left valign=top>3 </TH>
  <TH align=left valign=top>4 <p>Linked Lists <p><!WA71><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA72><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect19/lect19.html">Mehta</a></TH>
  <TH align=left valign=top> 5</TH>
  <TH align=left valign=top>6 <p>Trees, BST  <p><!WA73><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA74><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect20/lect20.html">Mehta</a></TH>
  <TH align=left valign=top> 7	</TH>
  <TH align=left valign=top> 8	</TH>
  <TH align=left valign=top> 9	</TH>
</TR>


<TR ALIGN=CENTER> <TH>Week 12</TH>
  <TH align=left valign=top> 10	</TH>
  <TH align=left valign=top>11<p>Graphs <p><!WA75><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA76><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect21/lect21.html">Mehta</a></TH>
  <TH align=left valign=top> 12	</TH>
  <TH align=left valign=top> 13<p>Graphs (cont.) <p><!WA77><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA78><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect22/lect22.html">Mehta</a></TH>
  <TH align=left valign=top> 14	</TH>
  <TH align=left valign=top> 15	</TH>
  <TH align=left valign=top> 16	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 13</TH>
  <TH align=left valign=top> 17	</TH>
  <TH align=left valign=top>18 <p>Hash Tables <p><!WA79><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA80><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect23/lect23.html">Mehta</a><p><b>
<!WA81><a href="http://www.cs.rpi.edu/~dugan/data_structures/project3.html">Homework #3</a> DUE
</b></TH>
  <TH align=left valign=top> 19	</TH>
  <TH align=left valign=top>20 <p>Partially Ordered Trees and Heaps <p><!WA82><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA83><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect24/lect24.html">Mehta</a></TH>
  <TH align=left valign=top> 21	</TH>
  <TH align=left valign=top> 22	</TH>
  <TH align=left valign=top> 23	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 14</TH>
  <TH align=left valign=top>24	</TH>
  <TH align=left valign=top>25 <p>AVL Trees <p><!WA84><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA85><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect25/lect25.html">Mehta</a></TH>
  <TH align=left valign=top> 26	</TH>
  <TH align=left valign=top>27 <p>Thanksgiving <p>NO CLASS </TH>
  <TH align=left valign=top> 28	</TH>
  <TH align=left valign=top> 29	</TH>
  <TH align=left valign=top> 30	</TH>
</TR>

</TABLE>


<TABLE BORDER=4 CELLPADDING=3 CELLSPACING=8>

<TR ALIGN=CENTER>
  <TH ROWSPAN=2><!WA86><IMG SRC="http://www.cs.rpi.edu/~dugan/gif/datebook.gif" HEIGHT=64 WIDTH=64></TH>
  <TH COLSPAN=8>December 1996</TH>
</TR>

<TR ALIGN=CENTER>
  <TH> Sunday	</TH>
  <TH> Monday	</TH>
  <TH> Tuesday	</TH>
  <TH> Wednesday</TH>
  <TH> Thursday	</TH>
  <TH> Friday	</TH>
  <TH> Saturday	</TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 15</TH>
  <TH align=left valign=top>1  </TH>
  <TH align=left valign=top>2  <p>Memory Management, Free Lists, Garbage Collection <p> <!WA87><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA88><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect26/lect26.html">Mehta</a></TH>
  <TH align=left valign=top>3  </TH>
  <TH align=left valign=top>4  <p>Summary and Review <p> <!WA89><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA90><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect27/lect27.html">Mehta</a></TH>
  <TH align=left valign=top>5  </TH>
  <TH align=left valign=top>6  </TH>
  <TH align=left valign=top>7 </TH>
</TR>

<TR ALIGN=CENTER> <TH>Week 16</TH>
  <TH align=left valign=top>8 </TH>
  <TH align=left valign=top>9 <p>Final Exam<p> <!WA91><A href="http://www.lib.rpi.edu/dept/library/reserves/66/66436001/0.pdf">Dugan</a>, <p><!WA92><a href="http://www.cs.rpi.edu/~dugan/data_structures/mehta/lect28/lect28.html">Mehta</a><p><b>Homework#4 DUE</b></TH>
  <TH align=left valign=top> </TH>
  <TH align=left valign=top> </th>
  <TH align=left valign=top> 	</TH>
  <TH align=left valign=top> 	</TH>
  <TH align=left valign=top> 	</TH>
</TR>


</TABLE>

<h1  align=left><a name="GradingPolicy">Grading Policy</a></h1>
<P>
Your grade will be based on the following evaluations:


<TABLE BORDER=4 CELLPADDING=3 CELLSPACING=2>

<TR ALIGN=CENTER>
  <TH> Task	</TH>
  <TH> Weight	</TH>
  <TH> Section One Average </TH>
  <TH> Section Two Average </TH>
</TR>

<TR ALIGN=CENTER>
   <TH> Homework #1 </TH>
   <TH> 15 % </TH>
   <TH> 38/100  </TH>
   <TH> 48/100  </TH>
</TR>

<TR ALIGN=CENTER>
   <TH> Homework #2 </TH>
   <TH> 15 % </TH>
   <TH>  </TH>
   <TH>  </TH>
</TR>

<TR ALIGN=CENTER>
   <TH> Homework #3 </TH>
   <TH> 15 % </TH>
   <TH>  </TH>
   <TH>  </TH>
</TR>

<TR ALIGN=CENTER>
   <TH> Homework #4 </TH>
   <TH> 15 % </TH>
   <TH>  </TH>
   <TH>  </TH>
</TR>

<TR ALIGN=CENTER>
   <TH> Mid-Term Exam </TH>
   <TH> 20 % </TH>
   <TH> </TH>
   <TH> 70/80 </TH>
</TR>

<TR ALIGN=CENTER>
   <TH> Final Exam </TH>
   <TH> 20 % </TH>
   <TH> </TH>
   <TH> </TH>
</TR>

<TR ALIGN=CENTER>
  <TH rowspan=2> TOTAL	</TH>
  <TH> 100 %</TH>
</TR>
</TABLE>
<h1  align=left><a name="CollaborationPolicy">Policy on Collaboration</a></h1>
<p>
No collaboration is permitted on exams.
<p>
You are encouraged to work with other students in the class on the
assignments.  Useful forms of collaboration include discussing design
alternatives, details of algorithms and data structures, possible
sources of reusable code, and help with debugging, compiling,
makefiles, etc.
<p>
You are also encouraged to practice code reuse, with the stipulation
that any reused code submitted as part of your assignment must be
clearly and explicitly attributed.  Code that can be reused includes
that found in the textbooks, code from previous work you have done (in
this class or others), and code from other books or Internet sites.
<p>
You may NOT reuse code written by another student in the class.  
<p>
The easiest way to attribute any code that you reuse is with a
comment.  You must give enough information so that the TAs can find
the code themselves.  Examples:
<pre>
  /* the following code is from p.111 of Weiss textbook */
  class vector { ...

  /* the following code is from my CS I project, Feb 1995. */

  /* the following code was downloaded from ftp://ftp.cs.rpi.edu/pub/... */

  /* the following code is from the book "Advanced C++" by James Coplien,
   * Addison-Wesley, 1992, p.152
   */
</pre>
<p>
Collaboration and discussion does not mean that the assignments may be
done jointly; each assignment you submit must be 100 percent your own
work.  You must be especially carefull when discussing another
student's code (perhaps to help with finding a bug).  DO NOT copy any
of the code, either on paper or electronically.  DO NOT write any code
for the other student, even just to fix a typographical error.  DO NOT
look and another student's code and then sit down and write nearly
identical (but not quite) code yourself.  DO NOT "paraphrase" code
from another source and fail to attribute it in a comment.
<p>
Any code submitted which the TAs find too similar to another students
code, or any code which is similar to code from a book or another
source which has not been properly attributed, will result in a zero
for the assignment in question and possibly a failing course grade.
<h1 align=left><a name="LateWorkPolicy">Policy on Late Work</a></h1>
<P>
Homeworks are due at 11:59:59 PM, on the due date.  Late homeworks will 
be accepted with a penalty of 10% per day for 3 days.  After that, the
project will not be accepted.
<P>
Exams are to be taken at the specified date and time.  If you miss the
exam, you will receive a 0.
<P>
Sometimes things happen. If there are circumstances that prevent you
from meeting your obligations for this course, you need to talk to us
or the TAs to make arrangements IN ADVANCE.
<h1  align=left><a name="DroppingCourse">Dropping the Course</a></h1>
<P>
We want you to stay in the course!  Please talk to us before you 
decide to drop.  If things can't work out, the drop
date is <b>September 30, 1996</a>
<hr>
<hr>
<address>
<b>Bob Dugan</b> <!WA93><a href="mailto:[e-mail]">[e-mail] </a> <br>
<b>Alok Mehta</b> <!WA94><a href="mailto:[e-mail]"> [e-mail] </a>
</address>
</body>