Computer Science 140 Syllabus-

Discrete Structures

for Computer Scientists

Course Syllabus:  Cmpr 140 Syllabus- Spring 2018.docx

Meet Your Instructor:  

Meet Your Instructor:

 Hi, my name is Dr. George Sweeney. I am a full-time professor here at Santa Ana College.  I have a PhD in Math Education from the joint doctoral program at San Diego State and UC San Diego.  I also have a master's degree in Math from Cal Poly Pomona and a bachelor's from UCLA.  My fields of specialty are in research methodologies, Statistics, Linear Algebra, and Data Science.  I am Bronze, Silver, and Gold certified in Canvas in-person and online teaching. My dissertation was on teaching and learning in Linear Algebra, and I have done research and been published in research in trigonometry, differential equations, physical chemistry and calculus.  I love to teach and do mathematics.  I am currently learning some new computer programming languages.  I also enjoy meditating, making music, reading, playing with my kids, and hanging out with my wife.  I have been married for 13 years and I have two children, 2 1/2 and 5.

Course Description:  

This course presents the fundamentals of discrete mathematics as applied to the computer sciences. Topics include sets, relations, functions, basic logic, proof techniques, counting, graphs, trees and probability.

Successful students will:

• Apply discrete mathematics concepts and techniques to solve problems.
• Develop problem solving skills employing pattern recognition, transfer of learning and the ability to evaluate choices among solution techniques.

Textbook Information:  

Discrete Mathematics and Its Applications, 7^rd Ed. (Rosen, ISBN 0-07-338309-0)

Office Hours