ics141-lecture01-Logic

# ics141-lecture01-Logic - University of Hawaii ICS141...

This preview shows pages 1–9. Sign up to view the full content.

1-1 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii ICS141: Discrete Mathematics for Computer Science I Department of Information and Computer Sciences University of Hawaii Stephen Y. Itoga

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1-2 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii Lecture 1 Course Overview Chapter 1. The Foundations 1.1 Propositional Logic
1-3 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii Class Information Instructor: Stephen Itoga (POST 305A) Email: [email protected] Office hours: TTH after class or by appointment TA: Michael Claveria (POST 303-1 ) Email: [email protected] Office hours: TBA Text: Discrete Mathematics and Its Applications ( 6 th Edition ), by Kenneth H. Rosen, McGraw-Hill Grading Class spot quizes: 10% Homework assignments: 20 % Exam 1, 2, 3: 15% , respectively (total 45% ) Final Exam: 25 % (Thursday, May 15, 9:45am – 11:45am )

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1-4 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii Some material in these slides were taken/adapted from the slides made by Prof. Michael P. Frank and Prof. Jonathan L. Gross which are provided through the publisher of “Discrete Mathematics and Its Applications” written by Kenneth H. Rosen. I’ve modified these slides from Professor Baek.
1-5 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii What is Mathematics, really? It’s not just about numbers! Mathematics is much more than that: But, these concepts can be about numbers, symbols, objects, images, sounds, anything ! Mathematics is, most generally, the study of any and all absolutely certain truths about any and all perfectly well-defined concepts.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1-6 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii So, what’s this class about? What are “discrete structures” anyway? Discrete ” ( “discreet”!) - Composed of distinct, separable parts. (Opposite of continuous .) discrete : continuous :: digital : analog Structures - Objects built up from simpler objects according to some definite pattern. Discrete Mathematics - The study of discrete, mathematical objects and structures.
1-7 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii Discrete Structures We Study DM PART I Propositions Predicates Proofs Sets Functions Orders of Growth Algorithms Integers Summations Sequences Strings Permutations Combinations DM PART II Relations Graphs Trees Boolean Functions / Logic Circuits Automata

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1-8 ICS 141: Discrete Mathematics I (Spring 2008) University of Hawaii Why Study Discrete Math? The basis of all of digital information processing is: Discrete manipulations of discrete structures represented in memory. It’s the basic language and conceptual foundation for all of computer science.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 30

ics141-lecture01-Logic - University of Hawaii ICS141...

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online