Running head: CS362-1504B-02 UNIT 3 IP
CS362-1504B-02 UNIT 2 IP
Unit 3 IP
Ronald Jensen
CTUO
CS362-1504B-02: Structured Query Language for Data Management
Todd Wolfe
December 6, 2015
Table of Contents
Section 1: Week 1.3
Section 2: Week 2.7
Section 3: Wee

Part I
Clearly describe the relationship between the union and the intersection of 2 or more sets.
Also, define the complement of a set and its relationship with the universe. Provide some examples.
The intersection (, and) of two sets is a set of all the

Randomly select a chip from the container. Record the number on the chip in a table, and return the chip
to the container prior to the next drawing. You must complete 15 drawings.
Construct a bar graph and probability distribution of your experiment.
Draw

Part I
Construct a graph based on the adjacency matrix that appears below. Label all nodes with indices
consistent with the placement of numbers within the matrix. Then, answer the questions that follow.
ABCDEF
A| 0 3 6 8 5 2 |
B| 3 0 4 9 0 0 |
C| 6 4 0 4

Part I
Suppose you have the following sequence of runtime for an operation: 3, 6, 11, 18, 27, 38,.
List the next 2 elements in the sequence.
72+2 = 51
82+2 = 66
Determine the general equation that yields results for any element of the sequence.
N2+2
What

Rachel Marshall
Applications of Discrete Mathematics and Statistics
Math225-1503B-03
Andrew Halverson
Unit 5 Individual Project
9/21/2015
X
Y
2
3
10
4
1
3
5
10
7
6
2
9
8
1
3
1
1
2
x = chip drawn
y = Drawing Number
Mean = 4.93333
Median = 4
Mode = 3, 10, 1

Use in-order traversal to traverse the tree, and select the correct list.
a e l r s t v
What traversal method traverses a tree on the left, then the right, and ends with the root?
Post-order traversal
Select the binary search tree representing the word "t

In the SDLC, the
design
phase includes taking the specific solution that was chosen and gathering all of the needs of the developers.
In the SDLC, development happens in the
implementation
phase
In the SDLC, the
requirements and analysis
phase helps the d

If edges were added to the graph connecting A and D and C and F, why would the graph not represent an Euler path?
Vertices A, B, C, and E are of odd degrees. An Euler path only has two vertices with odd degrees.
What is not a Hamilton circuit when startin

Part I
Empirical probability is the ratio of all the favorable outcomes to the total number of trials. Through this,
we can make predictions and guess future outcomes of the events. An example would be determining
the chance a NBA player will successfully