Module #1 Flashcards
as a collection well defined objects, called elements, having certain common property
Sets
the set is represented by actually listing the elements which belong to it
Roster Method
separated by comma and enclosed between pair of curly brackets
Roster Method
sometimes a set is defined by stating property P which characterizes all the elements of the set
Set Builder Method
the elements must satisfy a given rule or condition
Set Builder Method
It represents relation and operator using the plane geometrical figures such as rectangle, circle, ellipse
Venn Diagram
a set whose elements are countable.
Finite Set
a set whose elements are not
countable.
Infinite Set
a set having no element. Its also called
as null set or void set. It is denoted by ø or
{}.
Empty Set
a set containing only one element. It is also
called a singleton.
Unit Set
If each element of the set A is also an
element of set B.
Subset
Set A is a proper subset of set B if there is at least one element in B not contained in A
Proper Subset
class of sets or the set of sets
Family Set
the set of all subsets of a given set. It is
denoted by P(A) where number of subsets equal to 2^A
Power Set
a set which contains all objects, including itself.
Universal Set
written as “A is the set containing everything that is not in A.”
Complement
two sets A and B consisting of the same
elements and same cardinality.
Equal Sets
two sets A and B having the same
cardinality.
Equivalent Sets
the two sets having no common elements.
Disjoint Set
is a bunch of vertices ( which are represented by circles and are connected by edges represented by lines
Graph
are undirected graphs Any two vertices are
connected by exactly one simple path A tree also does not contain a cycle
Trees
in a graph G consists of a pair ( E) of sequences
Path
is a path that begins and ends at the same vertex
Circuit
there is an edge (arc) connecting them.
Adjacent Vertices
is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. In other words a simple graph is a graph without loops and multiple edges.
Simple Graph
A graph is called connected if there is a path from any vertex to any other vertex in the graph, otherwise, the graph is
disconnected
If the graph is disconnected, the various
connected pieces are called the components of the graph
Component
is one that does not repeat any node
except for the first and last
Simple Cycle
