Presentation is loading. Please wait.

Presentation is loading. Please wait.

Principles of Computing – UFCFA Lecture-2

Published byZinka Đukić Modified over 5 years ago

Similar presentations

Presentation on theme: "Principles of Computing – UFCFA Lecture-2"— Presentation transcript:

1 Principles of Computing – UFCFA3-30-1 Lecture-2
Instructor : Mazhar H Malik Global College of Engineering and Technology

2 Global College of Engineering and Technology
Previous Lecture Introduction about course Set Theory Set, Notation, Set Builder Notation Union , Intersection, Difference Universal Set and Complement of a set Global College of Engineering and Technology

3 Global College of Engineering and Technology
Today’s Lecture Equality Power Set Type of Number Commutative, Associative and Distributive Law Equations, Functions and Relation Global College of Engineering and Technology

4 Equality

5 Power Set

6 Types of Number

7 Types of Number

8 Common Number Sets

9 Commutative, Associative and Distributive Laws

10 Commutative Laws

11 Associative Laws

12 Associative Laws

13 Associative Laws

14 Distributive Law

15 Distributive Law

16 Equation

17 Function

18 Input, Relationship, Output

19 Input, Relationship, Output

20 Names

21 Your Turn…

22 Your Turn…

23 Relation

24 Resources

25 Thank You

Download ppt "Principles of Computing – UFCFA Lecture-2"

Similar presentations

1.5 Set Operations. Chapter 1, section 5 Set Operations union intersection (relative) complement {difference}

1.5 Set Operations. Chapter 1, section 5 Set Operations union intersection (relative) complement {difference}
Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.

Set Operations. When sets are equal A equals B iff for all x, x is in A iff x is in B or … and this is what we do to prove sets equal.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.

Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
(CSC 102) Discrete Structures Lecture 14.

(CSC 102) Discrete Structures Lecture 14.
Probability Theory Part 1: Basic Concepts. Sample Space - Events  Sample Point The outcome of a random experiment  Sample Space S The set of all possible.

Probability Theory Part 1: Basic Concepts. Sample Space - Events  Sample Point The outcome of a random experiment  Sample Space S The set of all possible.
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.

1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.

CSE115/ENGR160 Discrete Mathematics 02/14/12 Ming-Hsuan Yang UC Merced 1.
1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.

1 CSE 20: Lecture 7 Boolean Algebra CK Cheng 4/21/2011.
Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.

Rosen 1.6. Approaches to Proofs Membership tables (similar to truth tables) Convert to a problem in propositional logic, prove, then convert back Use.
Chapter 3: Set Theory and Logic

Chapter 3: Set Theory and Logic
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 2.3, Slide 1 Set Theory 2 Using Mathematics to Classify Objects.

Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 2.3, Slide 1 Set Theory 2 Using Mathematics to Classify Objects.
By : Fridgo Tasman, S.Pd., M.Sc.. A Set is a simply collection of distict objects. The objects can be person, number, food, and something else. Therefore,

By : Fridgo Tasman, S.Pd., M.Sc.. A Set is a simply collection of distict objects. The objects can be person, number, food, and something else. Therefore,
Introduction to Set Theory. Introduction to Sets – the basics A set is a collection of objects. Objects in the collection are called elements of the set.

Introduction to Set Theory. Introduction to Sets – the basics A set is a collection of objects. Objects in the collection are called elements of the set.
CSCI 2670 Introduction to Theory of Computing Instructor: Shelby Funk.

CSCI 2670 Introduction to Theory of Computing Instructor: Shelby Funk.
Set theory Neha Barve Lecturer Bioinformatics

Set theory Neha Barve Lecturer Bioinformatics
CSE 20: Lecture 7 Boolean Algebra CK Cheng

CSE 20: Lecture 7 Boolean Algebra CK Cheng
THE REAL NUMBERS College Algebra. Sets Set notation Union of sets Intersection of sets Subsets Combinations of three or more sets Applications.

THE REAL NUMBERS College Algebra. Sets Set notation Union of sets Intersection of sets Subsets Combinations of three or more sets Applications.
Set Theory Using Mathematics to Classify Objects 2 © 2010 Pearson Education, Inc. All rights reserved.

Set Theory Using Mathematics to Classify Objects 2 © 2010 Pearson Education, Inc. All rights reserved.
Introduction to Set theory. Ways of Describing Sets.

Introduction to Set theory. Ways of Describing Sets.
Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.

Ch. 2 Basic Structures Section 1 Sets. Principles of Inclusion and Exclusion | A  B | = | A | + | B | – | A  B| | A  B  C | = | A | + | B | + | C.

Similar presentations

Ads by Google