EECS 1019 Lecture Notes - Fall 2018 Lecture 1 - Contraposition, Logical biconditional, Sentence (linguistics)

Chapter 1: the foundation logic + proof. A proposition is a declarative sentence which is either true or false but not both. Yes p, q, r will be used t

EECS 1019 Lecture Notes - Fall 2018 Lecture 2 - Truth table, Propositional function, Distributive property

Chapter 1: the foundation logic + proof. A tautology is a compound proposition which is always true. A contradiction is a compound proposition which is

EECS 1019 Lecture Notes - Lecture 3: Modus Tollens, Modus Ponens, Hypothetical Syllogism

Chapter 1: the foundation logic + proof. We now start to study mathematical proofs. We want to start from a premise (some given information) and make a

EECS 1019 Lecture 4: Proof by contrapositive + contradiction

Proof by cases: case (i): x = 0. Chapter 1: the foundation logic + proof. Disproving existence + proof by cases e. g: let x be from d = z. If x = 0, th

EECS 1019 Lecture Notes - Lecture 5: Empty Set, Natural Number

Chapter 2: basic structures sets, functions, sequences, sum and matrices. A set is a collection of objects called members or elements. Neither the orde

EECS 1019 Lecture 6: Set Operations + Intervals

Chapter 2: basic structures sets, functions, sequences, sum and matrices. Let a and b be two sets inside a universal set u. Union: a b = { x: x a x b} 

EECS 1019 Lecture Notes - Lecture 7: Empty Set, Contraposition

1. 1 #38 f) construct truth table for (p q) r p q. 1. 3 #18 determine whether ( p (p q)) q is a tautology p q p p q p (p q) q. Not a tautology ( p (p q

EECS 1019 Lecture Notes - Lecture 9: Bijection, Surjective Function

Chapter 2: basic structures sets, functions, sequences, sum and matrices. Given two non-empty sets a and b a function f. From a to b is an assignment o

All Subjects

Accounting

Mathematics

Statistics

Computer Science

Calculus

Psychology

Management

Biology

Physics

Chemistry

Electrical Engineering

Mechanical Engineering

Marketing

Music

History

Project Management

Business

Architecture

Geography

Science

Nursing

Information Technology

Engineering

English

Finance

Philosophy

Astronomy

Communications

Sociology

Anthropology

Prealgebra

Algebra

Precalculus

Ethics

Geometry

Probability

Economics

Introduction to abstraction. Use and development of precise formulations of mathematical ideas. Informal introduction to logic; introduction to naÔve set theory; induction; relations and functions; big O-notation; recursive definitions, recurrence relations and their solutions; graphs and trees. Three lecture hours per week. Plus drop-in optional problem sessions as well as instructor office hours, as these are announced in each term.

Discrete Mathematics for Computer Science

Browse the full collection of course materials, past exams, study guides and class notes for EECS 1019 - Discrete Mathematics for Computer Science at York University verified by our community.

Verified Documents at York University

Verified Documents for John Michael Machacek

Class Notes