http:^^www.cs.uidaho.edu^cs101^sylf.html

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

	characters, real numbers, sound, images, movies.  (See also 
	<!WA48><a href="http://www.cs.uidaho.edu/~foster/101f96/lectures.html">lecture notes from Foster's section</a>.)

<tr align=left valign=top><td nowrap>Oct 21<td align=right>24.<td>Reliability,
	redundancy.  <!WA49><a href="http://www.cs.uidaho.edu/cs101/day25.html">Error detecting and correcting
	codes</a> (see also Section 04 notes on <!WA50><a href="http://www.cs.uidaho.edu/~foster/101f96/lectures.html#hamming-codes">Hamming codes</a>).<br>
	<!WA51><a href="http://www.cs.uidaho.edu/~johnd/quizz.html">Quiz 7</a>.<br>
	<td align=right>Chpt 5

<tr align=left valign=top><td nowrap>Oct 23<td align=right>25.
<td><!WA52><a href="http://www.cs.uidaho.edu/cs101/assign7-answer.html">Assignment 7</a>.
	    <ul>

	      <li>(Section 01, Dickinson) Large software development
	      projects such as the <!WA53><a href="http://www.cs.uidaho.edu/cs101/day28.html">NASA Space
	      Shuttle</a>

	      <li>(Section 04, Foster) More on data representation.
	    </ul>


<tr align=left valign=top><td nowrap>Oct 25<td align=right>26.
	  <td>
	    <ul>

	      <li>No class on this day for section 1, John Dickinson
	      is out of town.  work on your assignment.
	  
	      <li>Section 4 (Foster) will talk about
	      <!WA54><a href="http://www.cs.uidaho.edu/~foster/101f96/lectures.html#hamming-codes">Hamming
	      codes</a>.
</ul>


<tr align=left valign=top><td nowrap>Oct 28<td align=right>27.

	<td>
	    <ul>
	      <li>(section 01, Dickinson) Program correctness.  Identifying
	errors and where errors come from.<br>
	<!WA55><a href="http://www.cs.uidaho.edu/cs101/john/quiz8.html">Quiz 8</a>.<br> 

	      <li>(section 04, Foster) <!WA56><a
	      href="http://www.cs.uidaho.edu/~foster/101f96/lectures.html#fault-tolerance">Fault
	      Tolerant Computing</a>, guest lecturer <!WA57><a
	      href="http://www.cs.uidaho.edu/faculty/krings.html">Axel
	      Krings</a>.

	    </ul>
<td align=right>Chpt 6

<tr align=left valign=top><td nowrap>Oct 30<td align=right>28.
	  <td>Testing software, Maintenance, Verification.<br>
	    <ul>
	      <li>Section 01, Dickinson: <!WA58><a
	      href="http://www.cs.uidaho.edu/cs101/assign8a.html">Assignment 8</a>.

	      <li>Section 04, Foster: <!WA59><a
	      href="http://www.cs.uidaho.edu/cs101/assign8b.html">Assignment 8</a>.
	      <!WA60><a href="http://www.cs.uidaho.edu/cs101/john/quiz8.html">Quiz 8</a>.
	    </ul>
	<td align=right>Chpt 6

<tr align=left valign=top><td nowrap>Nov 1<td align=right>29.<td>Two
	additional methods to access information in the Internet:
	<!WA61><a href="http://www.cs.uidaho.edu/cs101/day30.html">telnet and ftp</a>.

<tr align=left valign=top><td nowrap>Nov 4<td align=right>30.
	  <td>
	    <ul>
	      <li>(Section 01, Dickinson) Data structures - <!WA62><a
	      href="http://www.cs.uidaho.edu/cs101/day32.html">Binary Search Trees</a>.<br> <!WA63><a
	      href="http://www.cs.uidaho.edu/cs101/john/quiz9b.html">Quiz 9</a>.

	      <li> (Section 04, Foster) Guest Speaker: Dr. John
	      Munson.  Topic: <!WA64><a href="http://www.cs.uidaho.edu/cs101/day28.html">Software
	      development for the NASA Space Shuttle</a><br>
	    </ul>

<tr align=left valign=top><td nowrap>Nov 6<td align=right>31.
        <td>
	    <ul>
	      <li>(Section 01, Dickinson) <!WA65><a
	      href="http://www.cs.uidaho.edu/~johnd/scan/scan.html">Scanning Images</a>.

	      <li>(Section 04, Foster) Data structures - <!WA66><a
	      href="http://www.cs.uidaho.edu/cs101/day32.html">Binary Search Trees</a>.<br> <!WA67><a
	      href="http://www.cs.uidaho.edu/cs101/john/quiz9b.html">Quiz 9</a>.
	    </ul>

<tr align=left valign=top><td nowrap>Nov 8<td align=right>32.<td>
	Simulation and Modeling.  Limits of simulation and its roles
	and uses.<br>
	<!WA68><a href="http://www.cs.uidaho.edu/cs101/exam2.review.html">Studying for Exam #2</a>
	<td align=right>Chpt 7

<tr align=left valign=top><td nowrap>Nov 11<td align=right>33.
	  <td>
	    <ul>
	    <li>(Section 1, Dickinson) <!WA69><a href="http://www.cs.uidaho.edu/cs101/john/exam2.html"><b>Examination 2</b></a>. 
	    <li>(Section 4, Foster) <!WA70><a href="http://www.cs.uidaho.edu/~foster/101f96/exam2/exam2.html"><b>Examination 2</b></a>. 
	    </ul>
Covers	chapters 5-7, telnet, news, and ftp.

<tr align=left valign=top><td nowrap>Nov 13<td align=right>34.<td><!WA71><a
	href="http://www.cs.uidaho.edu/cs101/day35.html">Operating systems</a>.  Functions of an
	operating system: resource sharing, process management and
	user interface. Some examples of operating systems.  DOS,
	Unix, and Windows.<br>

<tr align=left valign=top><td nowrap>Nov 15<td align=right>35.<td>How a
	computer gets started -- the <!WA72><a href="http://www.cs.uidaho.edu/cs101/day37.html">boot
	process</a>.<br>

<tr align=left valign=top><td nowrap>Nov 18<td align=right>36.<td>
	<!WA73><a href="http://www.cs.uidaho.edu/cs101/day43.html">Computer viruses</a>.<br>
	<!WA74><a href="http://www.cs.uidaho.edu/cs101/assign9.html">Assignment 9</a>.<br>
	<!WA75><a href="http://www.cs.uidaho.edu/cs101/john/quiz10.html">Quiz 10</a>.

<tr align=left valign=top><td nowrap>Nov 20<td align=right>37.<td>A
	discussion of the <!WA76><a href="http://www.cs.uidaho.edu/cs101/day38.html">Internet</a>, what it
	is.<br>
	Name services and routing of packets.<br>

<tr align=left valign=top><td nowrap>Nov 22<td align=right>38.
	<td><ul>
	      <li>(Section 1, Dickinson) <!WA77><a href="http://www.cs.uidaho.edu/cs101/day39.html">Physical
	      file structure and organization</a>.  The structure of
	      files and directories on a physical disk.

	      <li>(Section 4, Foster) <strong>No class, instructor out
	      of town</strong>
	</ul>

<tr align=left valign=top><td nowrap>Dec 2<td align=right>39.<td><!WA78><a
	href="http://www.cs.uidaho.edu/cs101/day40.html">Human factors</a>: data entry, operator error,
	techniques to reduce errors.<br>
	<!WA79><a href="http://www.cs.uidaho.edu/cs101/john/quiz11.html">Quiz 11</a>.<br>
	<!WA80><a href="http://www.cs.uidaho.edu/cs101/assign11.html">Assignment 10</a>.<br>
	<!WA81><a href="http://www.cs.uidaho.edu/cs101/classq.html">Questions for the Final, suggested by the
	class</a>.
	<td align=right>Chpt 8

<tr align=left valign=top><td nowrap>Dec 4<td align=right>40.<td>Other
	issues within human factors.  Error checking codes, e.g. the ISBN
	scheme.
	<td align=right>Chpt 8

<tr align=left valign=top><td nowrap>Dec 6<td align=right>41.<td><!WA82><a
	href="http://www.cs.uidaho.edu/cs101/day42.html">Security, ciphers, and encryption</a>.
	<td align=right>Chpt 9

<tr align=left valign=top><td nowrap>Dec 9<td align=right>42.<td><!WA83><a 
	href="http://www.cs.uidaho.edu/cs101/day44.html">Security</a> between machines on the Internet.
	Also, security within our local UI network.<br>
	<!WA84><a href="http://www.cs.uidaho.edu/cs101/john/quiz12.html">Quiz 12</a>.
	<td align=right>Chpt 9

<tr align=left valign=top><td nowrap>Dec 11<td align=right>43.<td>Computers
	and society.
	<td align=right>Chpt 10

<tr align=left valign=top><td nowrap>Dec 13<td align=right>44.<td>What <!WA85><a
	href="http://www.cs.uidaho.edu/cs101/day46.html">computers are good at and some limitations</a>.
	Some thoughts about the <!WA86><a href="http://www.cs.uidaho.edu/cs101/final.review.html">final
	Examination</a>.
	<td align=right>Chpt 10
</table>

</body>
</html>