Definition of a Set DM is study of discrete structures. Fundamental discrete structure upon which most of other discrete structures are built is the sets.

Slides:



Advertisements
Similar presentations
Learning Objectives for Section 7.2 Sets
Advertisements

Sets and its element A set is a collection of well-defined and well-distinguished objects. The objects that make up a set are called the members or elements.
Lecture 2 Introduction To Sets CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
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.
The Real Numbers 1.1 Sets A set is a collection of objects, symbols, or numbers called elements. Example 1 is a set containing the first three counting.
Sets DISCRETE STRUCTURE ABDUL BASIT TAHIR, KAMRAN ALI, FAIZAN ILLAHI, NOMAN AHMAD, ARSALAN MUBASHIR.
Analytical Methods in CS (CIS 505)
CSE115/ENGR160 Discrete Mathematics 02/10/11 Ming-Hsuan Yang UC Merced 1.
Sets. Copyright © Peter Cappello Definition Visualize a dictionary as a directed graph. Nodes represent words If word w is defined in terms of word.
Set Theory.
Ch 9 Inequalities and Absolute Value
1 Learning Objectives for Section 7.2 Sets After today’s lesson, you should be able to Identify and use set properties and set notation. Perform set operations.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
CSCI 1900 Discrete Structures
MATHEMATICS XI SETS.
Sets.
Set Notation.
This section will discuss the symbolism and concepts of set theory
Objectives: By the end of class, I will be able to:  Identify sets  Understand subsets, intersections, unions, empty sets, finite and infinite sets,
MTH 231 Section 2.1 Sets and Operations on Sets. Overview The notion of a set (a collection of objects) is introduced in this chapter as the primary way.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Chapter 7 Logic, Sets, and Counting Section 2 Sets.
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)
1 Copyright © 2015, 2011, 2007 Pearson Education, Inc. Chapter 1-1 Basic Concepts Chapter 1.
Section 2.1. Section Summary Definition of sets Describing Sets Roster Method Set-Builder Notation Some Important Sets in Mathematics Empty Set and Universal.
ELEMENTARY SET THEORY.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Module Code MA1032N: Logic Lecture for Week Autumn.
Chapter 2 With Question/Answer Animations. Section 2.1.
Discrete Mathematics SETS. What is a set? ^A set is a unordered collection of “objects”  People in a class: {A yşe, B arış, C anan }  Cities in Turkey.
1 Chapter Two Basic Concepts of Set Theory –Symbols and Terminology –Venn Diagrams and Subsets.
Discrete Mathematics Lecture # 10. Set Theory  A well defined collection of {distinct} objects is called a set.  The objects are called the elements.
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.
ITD1111 Discrete Mathematics & Statistics STDTLP
Welcome to Form 4 Mathematics Topic for the day SETS.
Set Theorem By Derek Mok, Alex Yau, Henry Tsang and Tommy Lee.
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
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.
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.
Sets and Operations TSWBAT apply Venn diagrams in problem solving; use roster and set-builder notation; find the complement of a set; apply the set operations.
CPCS 222 Discrete Structures I
Section 6.1 Set and Set Operations. Set: A set is a collection of objects/elements. Ex. A = {w, a, r, d} Sets are often named with capital letters. Order.
Sets. Outline Set and Set Elements Set Representation Subset, Proper Subset, Set Equality, and Null Set.
Sets CS 202, Spring 2007 Epp, chapter 5.
CSE15 Discrete Mathematics 02/13/17
Sets Page 746.
Set Definition: A set is unordered collection of objects.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
The Basic Concepts of Set Theory
Sets Section 2.1.
(є:belongs to , є:does not belongs to)
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from “Discrete.
CS100: Discrete structures
Set and Set Operations Grab a sheet from front.
        { } Sets and Venn Diagrams Prime Numbers Even Numbers
The Basic Concepts of Set Theory
2.1 Sets Dr. Halimah Alshehri.
CHAPTER 1 - Sets and Intervals
Chapter 2 The Basic Concepts of Set Theory
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.
ALGEBRA I - SETS : UNION and INTERSECTION
Discrete Mathematics CS 2610
The aim of education is to teach students how to think rather than what to think. Sets The set is the fundamental discrete structure on which all other.
2 Chapter Numeration Systems and Sets
Chapter 2 The Basic Concepts of Set Theory
Chapter 7 Logic, Sets, and Counting
Introduction A set is a collection of objects.
Presentation transcript:

Definition of a Set DM is study of discrete structures. Fundamental discrete structure upon which most of other discrete structures are built is the sets. Unordered collection of objects is called a set. The objects in a set are also called the elements, or members of the set. There are several ways to describe a set. One way is to list all members of the set, when possible. We have the notation to list elements of a set enclosed between braces and separated from each other by comma. Capital letters are used to name sets. Examples: –The set of all vowels of English V = { a, e, i, o, u}. –The set O of all odd positive integers less than 10, O = {1,3,5,7,9}. –The set S of all positive integers less than 100, S = {1,2,3,…..99}.

Set Notations Although sets are usually used to group together elements with common properties, there is nothing that prevents a set from having apparently unrelated elements. For example; V = {a, 2, Fred, New Jersey} is a set containing four elements a, 2, Fred and New Jersey. At times the braces notation is used to describe set without listing all of its elements. In such case only some elements are listed and then ellipses i.e. ( … ) are used to indicate general pattern of the elements that are included in the set. For Example; set of positive integers less than 100 can be denoted as {1, 2, 3, …, 99}. The set of whole numbers can be represented as {0, 1, 2, 3, … } For a set of elements that are infinitely many in descending as well as ascending order, ellipses can be used on either side of listed few elements. For Example; set of all integers can be denoted in the form of a set Z = { …, -2, -1, 0, 1, 2, … }.

Set Builder Notation Set Builder Notation; is another way of describing sets. Rather than listing we characterize all elements in a set by stating the property or properties that they share. For Example; The set O of all positive odd integers less than ten can be written as O = {x | x is an odd positive integer less than ten}. Set Builder notation becomes handy in describing sets that have infinitely large elements and can not be listed. For example; set of all real numbers can be denoted as R = {x | x is a real number}. Similarly set of all rational numbers can be represented as Q = {p/q | p  Z, q  Z  q ≠ 0}.

Equal Sets Equal Sets; At times it is mathematically important to assert that two differently specified collection of objects are really the same set or otherwise. It is thus important to understand what it means for two sets to be equal. Two sets are equal, if and only if, they have same elements. For Example; set {1, 3, 5} and set {3, 5, 1} are equal as they have the same elements 1, 2 and 3. Note; that the order in which the elements of set are listed does not matter. Also it does NOT matter if an element of set is listed more than once. For example; the two sets {1, 3, 3, 3, 5, 5, 5, 5} & {1, 3, 5} are equal as they have same elements.

Venn Diagrams Venn Diagrams; provide another way of representing the sets graphically. In Venn Diagrams the “Universal Set U”, which contains all the objects under consideration is represented by a rectangle’ Inside this rectangle, circles are drawn to represent sets. Some times dots are also used to represent particular element of the set. For example; to draw a Venn diagram representing V, set of vowels in English alphabets, we first draw a rectangle to indicate universal set U, which is the set of the 26 letters of English alphabets Inside this rectangle, we draw a circle to represent set V (the set of vowels). Inside this circle we indicate the elements of V with dots. It is customary to use capital letters for denoting sets and small case letters to represent elements of set.

Venn Diagram for Set of Vowels