MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
MATH2251503A02
Applications of Discrete Mathematics and Statistics
Phase II DB I
July 19, 2015
Part I
1.
The union of two or more sets is the set that contains all the elements which exist in at least one of
the sets. The intersection of two or more set
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
Applications of Discrete Mathematics
(MATH203 1604B 01)
Jane Doe
Part I
The first example of data that I can think of that would not be properly represented as a
tree chart would be website traffic. The numbers of visits to a website per day would not
b
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
Applications of Discrete Mathematics
(MATH203 1604B 01)
Jane Doe
Part I
A Primary Key is intrinsic to a functional database. Without it, a database simply
would not function. It is a unique identifier. It is typically something that is different for
eac
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
Applications of Discrete Mathematics
(MATH203 1604B 01)
Jane Doe
Part I: Suppose you are developing a statistical database in which information about
professional football teams and records are stored.
Consider the following 2 sets of data that list foo
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
MATH2251503A02
Applications of Discrete Mathematics and Statistics
Phase III DB I
July 26, 2015
What is complexity: Complexity of an algorithm is concerned about how fast or slow does a algorithm
performs. Complexity is defined as a numerical function T
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
1
MATH2251503A02
Applications of Discrete Mathematics and Statistics
Phase II IP I
July 19, 2015
1) Since the diagonal has all zeros, there are no loops on the graph.
Since the matrix is symmetric, the graph is not directional.
2
The simple paths are:
A
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
MATH2251503A02: 1
MATH2251503A02
Applications of Discrete Mathematics and Statistics
Phase III IP I
July 26, 2015
Given sequence: 3,6,11,18,27,38,.
MATH2251503A02: 2
So equation that represents above sequence is: (n^2)+2
Put n=1 we get:(1^2)+2=3
Put
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
MATH2251503A02 Applications of Discrete Mathematics and Statistics
Phase I DB II
July 11, 2015
QUESTION 1
Proportions are the very fundamentals that govern the universe. They derive their notion from the
theory that there is more than one side to every
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
MATH2251503A02
Applications of Discrete Mathematics and Statistics
Phase IIII DB I
July 31, 2015
Probability.
PART I
There are two main basic types of probabilities:
a) Empirical probability
This refers to a form of probability based on some event occur
MATH2251503A02 Applications of Discrete Mathematics and Statistics
MATH 1503A

Fall 2015
Applications of Discrete Mathematics
(MATH203 1604B 01)
Jane Doe
Part I
When searching a database, a union is useful when you have more than one query as one
combined result. A union is the combined search of two or more queries. The intersection
is the