This preview shows pages 1–3. Sign up to view the full content.
COT 3100 Topics Covered
Logic : Use of truth tables, logical connectives, implications,
logic and implication laws, use of quantifiers
Sets : Definition, Union, Intersection, Minus, Some Counting,
Set Laws, Set Table, Venn Diagrams, Inclusion/Exclusion
Principle
Relations & Functions: Definition of a relation, reflexive,
irreflexive, symmetric, antisymmetric, transitive, injection,
surjection, and bijection.
Number Theory: Induction, Definition of divisibility, Use of
mod and mod rules, Euclid’s Algorithm
Strings and Languages: Regular expressions, DFAs, languages
are sets of strings.
Relevant parts in the book:
Logic 2.1 – 2.4
Sets 3.1 3.3
Number Theory 4.1 – 4.4
but I have dealt only with DFA’s.
Since we have not had an exam with induction, number theory
and strings and languages, that will be the stress of the exam.
No need to memorize the logic or set laws – I will attach the
necessary tables.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document Logic problem
Show that the following is a tautology:
( (p
∨
r)
∨
( (q
∧
r)
∨
p) )
∨
¬
( (
¬
(p
∧
q) )
∧
p ).
( (p
This is the end of the preview. Sign up
to
access the rest of the document.
This document was uploaded on 06/09/2011.
 Fall '09

Click to edit the document details