http:^^wizard.cse.nd.edu^class_data^cse331^www^lecture.html

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

<li><!WA105><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide105.gif">Slide 105 The Rotate Routine (GIF format)</a>
<li><!WA106><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide106.gif">Slide 106 4-Node Break-Up at the Root (GIF format)</a>
<li><!WA107><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide107.gif">Slide 107 The 4-Node Split Routine (GIF format)</a>
<li><!WA108><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide108.gif">Slide 108 Searching in Red-Black Trees (GIF format)</a>
<li><!WA109><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide109.gif">Slide 109 Worstcase Insertion Order (GIF format)</a>
<li><!WA110><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide110.gif">Slide 110 Hashing Introduction (GIF format)</a>
<li><!WA111><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide111.gif">Slide 111 Hashing With Modulo Arithmetic (GIF format)</a>
<li><!WA112><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide112.gif">Slide 112 The Modulo Operation (GIF format)</a>
<li><!WA113><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide113.gif">Slide 113 Separate Chaining (GIF Format)</a>
<li><!WA114><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide114.gif">Slide 114 Linear Probing (GIF format)</a>
<li><!WA115><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide115.gif">Slide 115 Linear Probing Example (GIF format)</a>
<li><!WA116><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide116.gif">Slide 116 Double Hashing (GIF format)</a>
<li><!WA117><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide117.gif">Slide 117 Double Hashing Example (GIF format)</a>
<li><!WA118><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide118.gif">Slide 118 Linear Probe Statistics (GIF format)</a>
<li><!WA119><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide119.gif">Slide 119 Other Hashing Functions (GIF format)</a>
<li><!WA120><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide120.gif">Slide 120 Black-and-White Image Coding (GIF format)</a>
<li><!WA121><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide121.gif">Slide 121 Coded Image Example (GIF format)</a>
<li><!WA122><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide122.gif">Slide 122 Variable-Length Coding (GIF format)</a>
<li><!WA123><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide123.gif">Slide 123 Huffman Coding Example (GIF Format)</a>
<li><!WA124><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide124.gif">Slide 124 Continuing (GIF format)</a>
<li><!WA125><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide125.gif">Slide 125 Continuing (GIF format)</a>
<li><!WA126><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide126.gif">Slide 126 C.W. and C.C.W. Turns (GIF format)</a>
<li><!WA127><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide127.gif">Slide 127 Detecting C.C.W. Turns (GIF format)</a>
<li><!WA128><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide128.gif">Slide 128 Line Intersection Routine (GIF format)</a>
<li><!WA129><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide129.gif">Slide 129 A Poorman's Arctangent (GIF format)</a>
<li><!WA130><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide130.gif">Slide 130 Constructing Simple Closed Paths (GIF format)</a>
<li><!WA131><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide131.gif">Slide 131 Is A Given Point Inside A Polygon? (GIF format)</a>
<li><!WA132><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide132.gif">Slide 132 What Is This Routine Doing? (GIF format)</a>
<li><!WA133><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide200.gif">Slide 200 String Searching (Brute-Force Method) (GIF format)</a>
<li><!WA134><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide201.gif">Slide 201 Knuth-Morris-Pratt Algorithm (GIF format)</a>
<li><!WA135><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide202.gif">Slide 202 More On K-M-P Algorithm (GIF format)</a>
<li><!WA136><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide203.gif">Slide 203 Boyer-Moore Algorithm (GIF Format)</a>
<li><!WA137><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide204.gif">Slide 204 Another Example (GIF format)</a>
<li><!WA138><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide205.gif">Slide 205 Code For Boyer-Moore (GIF format)</a>
<li><!WA139><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide206.gif">Slide 206 Improving Boyer-Moore (GIF format)</a>
<li><!WA140><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide207.gif">Slide 207 Regular Expressions (To Describe Patterns) (GIF format)</a>
<li><!WA141><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide208.gif">Slide 208 Non-Deterministic Pattern Matching Machines (GIF format)</a>
<li><!WA142><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide209.gif">Slide 209 Non-Deterministic F.S.M. (GIF format)</a>
<li><!WA143><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide210.gif">Slide 210 Deque (GIF format)</a>
<li><!WA144><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide211.gif">Slide 211 Operating a N-D FSM With A Deque (GIF format)</a>
<li><!WA145><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide212.gif">Slide 212 Deque Code (GIF format)</a>
<li><!WA146><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide213.gif">Slide 213 What Is Parsing? (GIF Format)</a>
<li><!WA147><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide214.gif">Slide 214 Example of A Grammar (GIF format)</a>
<li><!WA148><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide215.gif">Slide 215 Example Parse Tree (GIF format)</a>
<li><!WA149><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide216.gif">Slide 216 Grammar For "C" (GIF format)</a>
<li><!WA150><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide217.gif">Slide 217 Parsing Factors (GIF format)</a>
<li><!WA151><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide218.gif">Slide 218 Terms and Expressiona (GIF format)</a>
<li><!WA152><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide219.gif">Slide 219 Parsing Routines in Action (GIF format)</a>
<li><!WA153><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide220.gif">Slide 220 A Simple Compiler (GIF format)</a>
<li><!WA154><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide221.gif">Slide 221 Compiling Factors (GIF format)</a>
<li><!WA155><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide222.gif">Slide 222 Compiling Terms (GIF format)</a>
<li><!WA156><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide223.gif">Slide 223 Compiling Expressions (GIF Format)</a>
<li><!WA157><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide133.gif">Slide 133 Adjacency Matrix (GIF Format)</a>
<li><!WA158><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide134.gif">Slide 134 Adjacency Lists (GIF format)</a>
<li><!WA159><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide135.gif">Slide 135 Depth-First Search (GIF format)</a>
<li><!WA160><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide136.gif">Slide 136 Depth-First Code (GIF format)</a>
<li><!WA161><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide137.gif">Slide 137 Depth-First Search Trees (GIF format)</a>
<li><!WA162><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide138.gif">Slide 138 Breadth-First Code (GIF format)</a>
<li><!WA163><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide139.gif">Slide 139 Breadth-First Example (GIF format)</a>
<li><!WA164><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide140.gif">Slide 140 Biconnectivity Example (GIF format)</a>
<li><!WA165><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide141.gif">Slide 141 Data Structures (GIF format)</a>
<li><!WA166><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide142.gif">Slide 142 Biconnectivity Example (GIF format)</a>
<li><!WA167><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide143.gif">Slide 143 Finding Articulation Points (GIF Format)</a>
<li><!WA168><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide144.gif">Slide 144 Minimum Spanning Trees (GIF format)</a>
<li><!WA169><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide145.gif">Slide 145 Proof of Property (GIF format)</a>
<li><!WA170><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide146.gif">Slide 146 Examples (GIF format)</a>
<li><!WA171><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide147.gif">Slide 147 Minimum Spanning Tree (GIF format)</a>
<li><!WA172><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide148.gif">Slide 148 Notes on Minimum Spanning Tree Code (GIF format)</a>
<li><!WA173><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide149.gif">Slide 149 Minimum Spanning Tree Code (GIF format)</a>
<li><!WA174><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide150.gif">Slide 150 Depth-First Search (GIF format)</a>
<li><!WA175><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide151.gif">Slide 151 Depth-First Search Code (GIF format)</a>
<li><!WA176><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide152.gif">Slide 152 Breadth-First Search (GIF format)</a>
<li><!WA177><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide153.gif">Slide 153 Breadth-First Search Code (GIF Format)</a>
<li><!WA178><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide154.gif">Slide 154 Shortest Path Spanning Tree (GIF format)</a>
<li><!WA179><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide155.gif">Slide 155 Shortest Path Spanning Tree (GIF format)</a>
<li><!WA180><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide156.gif">Slide 156 Shortest Path Spanning Tree Code (GIF format)</a>
<li><!WA181><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide157.gif">Slide 157 Directed Graphs (GIF format)</a>
<li><!WA182><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide158.gif">Slide 158 Transistive Closure (GIF format)</a>
<li><!WA183><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide159.gif">Slide 159 Warshall's Algorithm (GIF format)</a>
<li><!WA184><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide160.gif">Slide 160 All Shortest Paths (GIF format)</a>
<li><!WA185><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide161.gif">Slide 161 Floyd's Algorithm (GIF format)</a>
<li><!WA186><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide162.gif">Slide 162 Introduction to Flow Problems (GIF format)</a>
<li><!WA187><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide163.gif">Slide 163 Max Flow Example (GIF format)</a>
<li><!WA188><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide164.gif">Slide 164 Max Flow Examples (GIF format)</a>
<li><!WA189><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide165.gif">Slide 165 A Linear Program (GIF format)</a>
<li><!WA190><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide166.gif">Slide 166 Change Inequalities to Equalities (GIF format)</a>
<li><!WA191><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide167.gif">Slide 167 Basic Solutions (GIF format)</a>
<li><!WA192><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide168.gif">Slide 168 Listing of Basic Solutions (GIF format)</a>
<li><!WA193><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide169.gif">Slide 169 Procedure (GIF format)</a>
<li><!WA194><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide170.gif">Slide 170 Simplex Method Example (GIF format)</a>
<li><!WA195><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide171.gif">Slide 171 Choosing A Pivot Row (GIF format)</a>
<li><!WA196><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide172.gif">Slide 172 A Gauss-Jordan Iteration (GIF format)</a>
<li><!WA197><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide173.gif">Slide 173 Second Gauss-Jordan Iteration (GIF Format)</a>
<li><!WA198><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide174.gif">Slide 174 Choosing the Pivot Column (GIF format)</a>
<li><!WA199><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide175.gif">Slide 175 More on the Pivot Column (GIF format)</a>
<li><!WA200><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide176.gif">Slide 176 Choosing the Pivot Row (GIF format)</a>
<li><!WA201><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide177.gif">Slide 177 Summary of L.P. Procedure (GIF format)</a>
<li><!WA202><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide178.gif">Slide 178 Another L.P. Example (GIF format)</a>
<li><!WA203><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide179.gif">Slide 179 Continuing (GIF format)</a>
<li><!WA204><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide180.gif">Slide 180 Continuing (GIF format)</a>
<li><!WA205><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide181.gif">Slide 181 Continuing (GIF format)</a>
<li><!WA206><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide182.gif">Slide 182 Linear Congruential Method (GIF format)</a>
<li><!WA207><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide183.gif">Slide 183 Worrying About Overflow (GIF Format)</a>
<li><!WA208><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide184.gif">Slide 184 Peculiarity of L.C. Method (GIF format)</a>
<li><!WA209><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide185.gif">Slide 185 Additive Congruential Method (GIF format)</a>
<li><!WA210><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide186.gif">Slide 186 True Randomness (GIF format)</a>
<li><!WA211><a href="http://wizard.cse.nd.edu/class_data/cse331/lectures/slide187.gif">Slide 187 Chi-Squared Test (GIF format)</a>

</ul>

<hr>

<p>Comments to author: S.C. Bass (<!WA212><a
href="mailto:[e-mail]">[e-mail]</a>)</address>

<p>Copyright &copy 1996, University of Notre Dame<br>
All rights reserved.</p>

<p>Revised: 15 November, 1996</p>

</body>