Phase 1 Discussion Board 2
Josh Chandler
Prof: Andrew Halverson
MATH203-1301B-01: Applications of Discrete Mathematics
February 20, 2013
Pieces of the Union of two sets must be a part of at least one set, while pieces of an Intersection must
be a part of

Phase 4 Discussion Board
Josh Chandler
Prof: Andrew Halverson
MATH203-1301B-01: Applications of Discrete Mathematics
March 12, 2013
Here is the transition table and the diagram for the assignment:
i.
x
y
A
A
B
B
A
C
C
A
C
For state A when x is the input

Phase 3 Discussion Board
Josh Chandler
Prof: Andrew Halverson
MATH203-1301B-01: Applications of Discrete Mathematics
February 25, 2013
Part 1 of the assignment wants us to describe a set of data which cannot be represented by a tree. Tree
diagrams can onl

Josh Chandler
MATH203-1301B-01
Applications of Discrete Mathematics
Phase 2 Discussion Board
February 21, 2013
A primary key is described as an identifier which is unique in a table, but can contain multiple values. It
can be a number, text field, or othe

IT110-1302A-06 Introduction to Programming
Individual Project 5
Josh Chandler
May 5 , 2013
Table of Contents
Week 1:Project Outline
Week 1: Class Diagrams
Week 1: Use Case Diagrams
Week 2: Java Fundamentals
Week 3: Java Control Structures
Week 4: Er

IT110-1302A-06 Introduction to Programming
Individual Project 1
Josh Chandler
April 8, 2013
Table of Contents
Week 1:Project Outline
Week 1: Class Diagrams
Week 1: Use Case Diagrams
Week 2: Java Fundamentals
Week 3: Java Control Structures
Week 4: E

Phase 5 Discussion Board
Josh Chandler
Prof: Andrew Halverson
MATH203-1301B-01: Applications of Discrete Mathematics
March 19, 2013
Some of the most compelling topics that I have learned so far were set theory, logic, automatas and
relations of functions.