The following lecture notes have been developed by instructors of
CSC364. The order in which they occur corresponds to the order
in which we will discuss this material during the term.

<H2> CSC 364 lecture notes: </H2>
<ul>
<li> <A HREF="greedy.ps">Greedy Algorithms</A> </li>
<li> <A HREF="DP.ps">Dynamic Programming Algorithms</A> </li>
<li> <A HREF="flow.ps">Network Flows </A> </li>
<li> <A HREF="TM-P.ps">Turing Machines and Polynomial Time </li>
<li> <A HREF="NP.ps">NP and NP-Completeness </li>
<li> <A HREF="undec.ps">Computability and Noncomputability 
</li>
 
</ul>