Discrete Mathematics

 Upon successful completion of this course, the student will: (i) Be familiar with the terminology, operations, and symbols offset theory, and with formal logic. (ii)Be able to uselogictodeterminethevalidityofanargument.(iii) Be abl to construct the proof of atheorem directly,by the contrapositive,by cases,by contradiction,by truthtable,bycounter-example,andby mathematicalinduction.(iv)Beabletoidentifyarelation;specifically,apartialorder,equivalence relation, or total order.  (v) Be able to identify a function; specifically, subjective ,injective ,and objective functions.(vi) Be able to perform operations on matrices.(vii) Be familiar with the terminology for graphs and trees.(viii)Be able to trace Euler and Hamiltonian paths.(ix)Be able to construct minimal spanning trees and adjacency matrices for graphs. (x)Have begun to develop a logical mode of thought that will be applicable to computer design, both hardware and software. (xi) Be able to understand sequential logic (xii)Be able to understand sets and relations(xiii) Be able to represent information using zeros and ones.