CSCI 239 Midterm Review

You should be able to:

1. Convert a truth table to a boolean expression using the sum of products method.

2. Convert a truth table to a Karnaugh map and find the simplified boolean expression.

3. Draw a circuit from a Boolean expression.

4. Create a Boolean expression from a circuit.

5. Recognize logical expressions and determine if they lead to necessary conditions.

6. Do simple logical derivations.

7. Convert English sentences into logical statements.

8. Recognize and understand logical quantifiers.

9. Understand set operations and be able to represent them with Venn diagrams.

10. Manipulate sequences and series.

11. Understand functions and what they mean.

12. Be able to recognize the order of a formula using the lemmas from class. (Study the Analysis of Algorithms section of the Lectures associated with CSCI 239 on the web.)

13. Be able to solve systems of equations using matrices.

14. Be able to find the inverse of a square matrix.

15. Be able to multiply matrices and matrices times vectors.

16. Understand vector operations - dot product, sum, difference of vectors.
    

17. Understand and write simple Haskell Perl functions.