Top rated MERLOT materials
https://www.merlot.org/
Top rated MERLOT materialsCopyright (C) 2018 MERLOT Some Rights ReservedFri, 10 Jun 2016 14:00:24 GMTMERLOThttps://www.merlot.org/merlot/images/merlot_column.png
https://www.merlot.org/
-1-1Base 2 binary multiplication - basic
https://www.merlot.org/merlot/viewMaterial.htm?id=731266
<p>Multiplies two small numbers (bytes) in binary form by simulating the physical repetition of the multiplicand, driven by the place-value digits of the multiplier.</p>Mon, 11 Feb 2013 00:42:37 GMTFelipe Razo CSU East BayHeuristic Algorithms
https://www.merlot.org/merlot/viewMaterial.htm?id=89019
An online Heuristic Algorithms textTue, 08 May 2001 07:00:00 GMTForbes LewisApplied Discrete Structures
https://www.merlot.org/merlot/viewMaterial.htm?id=740675
<p><strong>Applied Discrete Structures</strong> by <a href="http://faculty.uml.edu/math/faculty/doerr.htm" target="_new">Al Doerr</a> and <a href="http://faculty.uml.edu/klevasseur/" target="_new">Ken Levasseur</a> is a <em>free</em> open content textbook in discrete mathematics. Originally published in 1984 & 1989 by Pearson, the book has been updated to include references to Mathematica and Sage, the open source computer algebra system. </p><p><strong>Contents:</strong></p><p>Front Matter: Contents and Introduction</p><p><span>Chapter 1: Set Theory I</span><span> </span></p><p><span>Chapter 2: Combinatorics</span><span> </span></p><p><span>Chapter 3: Logic</span><span> </span></p><p><span>Chapter 4: More on Sets</span><span> </span></p><p><span>Chapter 5: Introduction to Matrix Algebra</span><span> </span></p><p><span>Chapter 6: Relations and Graphs</span><span> </span></p><p><span>Chapter 7: Functions</span><span> </span></p><p><span>Chapter 8: Recursion and Recurrence Relations</span><span> </span></p><p><span>Chapter 9: Graph Theory</span><span> </span></p><p><span>Chapter 10: Trees</span><span> </span></p><p><span>Chapter 11: Algebraic Systems</span><span> </span></p><p><span>Chapter 12: More Matrix Algebra</span><span> </span></p><p><span>Chapter 13: Boolean Algebra</span><span> </span></p><p><span>Chapter 14: Monoids and Automata</span><span> </span></p><p><span>Chapter 15: Group Theory and Applications</span><span> </span></p><p><span>Chapter 16: An Introduction to Rings and Fields</span><span> </span></p><p><span>Solutions to Odd-Numbered Exercises</span><span> </span></p>Thu, 14 Mar 2013 16:17:19 GMTKen Levasseur; Alan Doerr UMass LowellDiscrete Structures
https://www.merlot.org/merlot/viewMaterial.htm?id=620073
This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. This free course may be completed online at any time. See course site for detailed overview and learning outcomes. (Computer Science 202)Fri, 27 Jan 2012 18:50:18 GMTThe Saylor FoundationStanford Automata Theory Course
https://www.merlot.org/merlot/viewMaterial.htm?id=1173971
<p>Automata is part of the computer science curriculum as part of the subjects Theory of Computation as well as Compiler Design.This material is a link to a set of youtube videos that feature an online course for automata delivered by none other than Jeffrey Ullman, the author of "Introduction to Automata Theory ,Languages and Computation" as part of a Stanford University online course.These videos will be a useful tool to students to help them understand automata better</p>Fri, 10 Jun 2016 14:00:24 GMTJeffrey Ullman Stanford University