Scribd
Upload
3 views33 pages

Lecture 1

Discrete mathematics focuses on mathematical structures that are discrete rather than continuous, with applications in computer science, cryptography, and software development. Key concepts include sets, their operations, and representations, which are foundational for understanding discrete structures like graphs and relations. The document also covers important properties of sets, such as cardinality and power sets, along with their computer representations.

Uploaded by

janeburden223
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views33 pages

Lecture 1

Discrete mathematics focuses on mathematical structures that are discrete rather than continuous, with applications in computer science, cryptography, and software development. Key concepts include sets, their operations, and representations, which are foundational for understanding discrete structures like graphs and relations. The document also covers important properties of sets, such as cardinality and power sets, along with their computer representations.

Uploaded by

janeburden223
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 33

Discrete Mathematics

Lecture 1
Sets
Introduction
 Discrete mathematics is the study of mathematical
structures and objects that are fundamentally
discrete rather than continuous.

 Examples of objects with discrete values are integers,


graphs, or statements in logic.

 Discrete mathematics and computer science.


Concepts from discrete mathematics are useful for
describing objects and problems in computer
algorithms and programming languages. These have
applications in cryptography, automated theorem
proving, and software development.
Basic discrete structures
Discrete math = study of the discrete structures
used to represent discrete objects

Many discrete structures are built using sets

Sets = collection of objects

Examples of discrete structures built with the help


of sets:
Graphs
Combinations
Relations
Sets
Representing Sets
Important Sets in Discrete
Maths
Equality of Sets
Special Sets
Venn Diagrams
Subset
Empty Set/Subset
Properties
Subset Properties
Proper Subset

Example: A={1,2,3} B
={1,2,3,4,5}
Infinite Set
Cardinality
Power Set
Power Set
Power Set
N-tuple
Cartesian Product
Cardinality of Cartesian
Product
Set Operations
Set Operations
Disjoint Sets
Cardinality of Union Sets

Why this formula?


Set Difference
Complement of a Set
Set Identities
Set Identities
Set Identities
Computer Representation
of Sets
Computer Representation of
Sets
Computer Representation
of Sets
Bitwise XOR

Bit Shifting
Left shift
Given a bit string 1 0 1 1 << 1 (a single left shift) results in the bit string 0110.
Thus, 1 0 1 1 << 1 = 0 1 1 0.
Logical right shift
Given 1011 >>> 1 = 0101. The least significant bit is dropped remaining 101.
then zero is appended as the most significant bit, resulting in 0101.
Arithmetic right shift
Given 1011 >> 1 = 1101. The least significant bit is dropped leaving the
bits 110. Now, instead of filling the vacuum with zero as the most
significant bit, arithmetic right shift uses a copy of the existing most
significant bit, to fill the vacuum resulting in 1101

You might also like