EECS 20 Chapter 21 Defining Signals and Systems Last time we Introduced mathematical notation to help define sets Learned the names of commonly used sets.

Slides:



Advertisements
Similar presentations
Algebra I Vocabulary Chapter 3. Any number that makes an inequality true is called a.
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
Week 1 Chapter 1 + Appendix A Signals carry information Signals are represented by functions Systems transform signals Systems are represented by functions,
Sets DISCRETE STRUCTURE ABDUL BASIT TAHIR, KAMRAN ALI, FAIZAN ILLAHI, NOMAN AHMAD, ARSALAN MUBASHIR.
EECS 20 Chapter 21 Defining Signals and Systems Last time we Introduced mathematical notation to help define sets Learned the names of commonly used sets.
Sets 1.
CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.
Sets 1.
Week 1 1.websitewebsite 2.takehome examtakehome 3.Chapter Appendix A.
CSC 2300 Data Structures & Algorithms January 16, 2007 Chapter 1. Introduction.
Discrete Math 6A Max Welling. Recap 1. Proposition: statement that is true or false. 2. Logical operators: NOT, AND, OR, XOR, ,  3. Compound proposition:
SETS A set B is a collection of objects such that for every object X in the universe the statement: “X is a member of B” Is a proposition.
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Sets.
This section will discuss the symbolism and concepts of set theory
1 2 Sets and Functions. The symbol means ‘is an element of’. Introduction to Set Theory In Mathematics, the word set refers to a group of numbers or other.
Chapter 3 Functions Functions provide a means of expressing relationships between variables, which can be numbers or non-numerical objects.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
Chapter P Prerequisites: Fundamental Concepts of Algebra 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 P.9 Linear Inequalities and Absolute.
DISCRETE COMPUTATIONAL STRUCTURES
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
CS201: Data Structures and Discrete Mathematics I
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
Chapter P Prerequisites: Fundamental Concepts of Algebra 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 P.9 Linear Inequalities and Absolute.
MATH 224 – Discrete Mathematics
CompSci 102 Discrete Math for Computer Science
1 Copyright © 2015, 2011, 2007 Pearson Education, Inc. Chapter 1-1 Basic Concepts Chapter 1.
Copyright © Cengage Learning. All rights reserved.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
ELEMENTARY SET THEORY.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
CHAPTER P SECTION 1 NOTES.
Chapter 2 With Question/Answer Animations. Section 2.1.
Basic Structures: Sets, Functions, Sequences, and Sums.
Chapter P Prerequisites: Fundamental Concepts of Algebra 1 Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 P.1 Algebraic Expressions, Mathematical.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
Unit :1 Set Theory Prof. A.J. SHAKADWIPI. Sets and Subsets A well-defined collection of objects. finite sets, infinite sets, subset A={1,3,5,7,9} B={x|x.
Objective: Students will identify the domain and range of ordered pairs and graphs.
Module #3 - Sets 3/2/2016(c) , Michael P. Frank 2. Sets and Set Operations.
Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.
Lecture 5 Set Theory. Plan of lecture Why set theory? Sets and their properties Membership and definition of sets “Famous” sets Types of variables and.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
Review of Equations and Inequalities An equation is a mathematical statement that two qualities are equal. Linear Equation in one variable can be written.
Introduction to Set Theory (§1.6) A set is a new type of structure, representing an unordered collection (group, plurality) of zero or more distinct (different)
1.1 – SETS AND SYMBOLS. Goals SWBAT understand basic set notation and set symbols SWBAT solve simple sentences with a given domain SWBAT graph sets of.
Chapter 2 Sets and Functions.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
1.1: Objectives Properties of Real Numbers
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Set, Combinatorics, Probability & Number Theory
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Discrete Structure II: Introduction
Algebra 1 Section 1.1.
2.1 Sets Dr. Halimah Alshehri.
CHAPTER 1 - Sets and Intervals
CHAPTER 1 - Sets and Intervals
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
Precalculus Essentials
Copyright © Cengage Learning. All rights reserved.
2.1 – Symbols and Terminology
Lecture Sets 2.2 Set Operations.
Section 1.1 and 1.4.
Identifying Functions
45 + (−32) 16 + (−24) − − /12/2019 Algebra IA Agenda
12 + (−19) −24 + (−32) (−6) − 7 (−6) − 9 08/13/2019 Algebra IA Agenda
Presentation transcript:

EECS 20 Chapter 21 Defining Signals and Systems Last time we Introduced mathematical notation to help define sets Learned the names of commonly used sets (Reals, etc.) Created multi-dimensional sets using set product Used notation to define domain & range for common signals Saw multiple ways to define a particular set Today we will List common ways to define functions (signals or systems) Touch on declarative vs. imperative definitions Talk about domain and range of systems Consider several common ways of defining systems

EECS 20 Chapter 22 Defining Functions A set is a collection of elements. You can define a set by listing the elements in curly brackets: EE20Profs = {Ross, Lee, Varaiya, ElGhaoui, Henzinger} Sometimes there are too many elements to list individually. Example: Set of all real numbers between 0 and 1 You can define an interval using square & round parentheses. A square bracket includes the endpoint, round excludes. (0,1)all real numbers strictly between 0 and 1 [5, ∞)all real numbers greater than or equal to 5

EECS 20 Chapter 23 Famous Sets Some sets that we will use routinely include: RealsSet of all real numbers Reals + Set of all nonnegative real numbers IntegersSet of all integers Integers + Set of all nonnegative integers NaturalsSet of all positive integers {1, 2, …} Naturals 0 Set of all nonnegative integers (Integers + ) Bools{true, false} Charset of all alphanumeric characters Complexset of all complex numbers Ñ Ñ+Ñ+ Ù+Ù+ Ù Í Â

EECS 20 Chapter 24 Famous Symbols Set inclusion: Î “belongs to” Ï “does not belong to” 1 Î [0,1]1 Ï [0,1) Quantifiers: " “for all” $ “there exists” Logical operators: Ù “and” Ú “or” Ø “not” Logical relations: Þ “implies” Û “is equivalent to”

EECS 20 Chapter 25 Defining Sets Using Predicates We can define a new set NS, a subset of some set S, in the following way: We say that some general element x Î S is also a member of NS if and only if the statement Pred(x) is true for that x. Here, x is called a variable and Pred(x) is called a predicate. Using mathematical notation, we define NS: NS = {x Î S | Pred(x) } Example: Write a definition for the set of even numbers, Evens. Evens = {x Î Integers | x/2 Î Integers }

EECS 20 Chapter 26 Set Operations Subset Ì A Ì B means “all elements in A are also in B” Example:Naturals Ì Integers Union Ç A Ç B is the set of x for which x Î A or x Î B Example:(0,5) Ç [4,8] = Intersection È A È B is the set of x for which x Î A and x Î B Example: (0,5) È [4,8] = Subtraction \ A \ B is the set of x for which x Î A and x Ï B Example: (0,5) \ [4,8] = Empty Set Æ (0,8] [4,5) (0,4)

EECS 20 Chapter 27 Practice Using Mathematical Notation Define the following sets using mathematical notation: A È B = Rationals = (rational numbers, Ð ) Integers16 = (integers representable by 16 bits) {x Î A | x Î A Ù x Î B} {x Î Reals | $ p Î Integers, q Î Naturals with x = p/q} {x Î Integers | x ≥ Ù x ≤ 32767} or Integers È [-32768, 32767] or {-32768, , …, 32767}

EECS 20 Chapter 28 Product Sets Sets we commonly refer to as “multi-dimensional” can often be expressed as a Cartesian product of two or more sets. A X B = {(a,b) | a Î A Ù b Î B} The product set A X B consists of all ordered pairs (a,b) with a being an element in set A and b being an element in set B. Example: Define the 1 st quadrant of the real plane, Reals + 2 Reals + 2 = Reals + X Reals +

EECS 20 Chapter 29 About Product Sets A X B = {(a,b) | a Î A Ù b Î B} B X A = {(b,a) | a Î A Ù b Î B} A X A = {(a 1, a 2 ) | a 1 Î A Ù a 2 Î A} A X A = A 2 A X A X A X … X A = A n A 1 X A 2 X A 3 X … X A n =  A i i = 1 n

EECS 20 Chapter 210 Product Set Examples Set of pixels on an old VGA monitor (640x480), VGAScreen VGAScreen = {1, 2, …, 640} X {1, 2, …, 480} or [1, 640] X [1, 480] È Integers 2 Set of seats in this classroom, 145DwinelleSeats 145DwinelleSeats =

EECS 20 Chapter 211 Signals Using Product Sets Prof. Ross’s computer desktop image is a 1024 x 768 pixel, 24-bit color image of Brett Favre. The image may be viewed as a signal. This means that each picture element (pixel) in the grid has its color described by a 24-bit (3 byte) number. What is the domain of this signal? What is the range? The 24 bits can represent color as follows: the first 8 bits represent the red intensity, the next 8 bits represent the green intensity, and the last 8 bits represent blue intensity. What is another way to represent the range? {1, 2, … 1024} X {1, 2, … 768} {1, 2, 3, …, 2 24 } = {1, 2, 3, …, } {1, 2, …, 2 8 } X {1, 2, …, 2 8 } X {1, 2, …, 2 8 } = {1, 2, …, 2 8 } 3

EECS 20 Chapter 212 Systems Using Products of Signal Sets Recall that systems map signals to new signals. The domain and range of a system are sets of signals. Example: Consider the system FreezeFrame. It takes a video composed of a sequence of 1024 x 768 pixel, 24-bit color images as input. It takes another input, DesiredFrame, which is an integer between 1 and MaxFrames. DesiredFrame changes over time. The system “freezes” the video on the frame DesiredFrame, and this image is the system output. The output changes over time as DesiredFrame changes. What is the domain of this system? What is the range of this system?