Far better it is to dare mighty things, to win glorious triumphs, even though checkered by failure, than to take rank with those poor spirits who neither enjoy nor suffer much, because they live in the gray twilight that knows neither victory nor defeat.
-- Theodore Roosevelt

"Continue in scientific research, you will experience great joy from it. But you must learn to enjoy it alone. You will be a subject of astonishment to those close to you. You will not be much better understood by the scholarly world. Mathematicians have a place apart there, and even they do not always read each other."
-- Camille Jordan to Henri Lebesgue

"He who seeks for methods without having a definite problem in mind seeks for the most part in vain."
-- David Hilbert
"Do not go gentle into that good night,
Rage, rage against the dying of the light."
-- Dylan Thomas

"Yesterday upon the stair I met a man who wasn't there. He wasn't there again today. I wish that man would go away."
-- Hughes Mearns

In 1997 I graduated with a Master of Mathematics Degree. In the Degree program offered by the Department of Mathematics and Statistics each student had the choice of completing a thesis or completing three comprehensive exams: one exam in the two part sequence of Real Analysis, one exam in a two part sequence of their choice, and one exam in an independent course.

I chose to take the Comprehensive option. I chose Abstract Algebra for my two part sequence, and Probability Theory for my independent course.

Below you will find a list of the courses I completed as a Graduate Student as well as the Comprehensive exams I completed. These exams were originally written in LaTeX and converted to HTML using LaTeXtoHTML.

Courses I completed as a Graduate student
My Real Analysis I and II exam

My Abstract Algebra I and II exam

My Probability Theory exam
When I took the Mathematical Modeling class as a graduate student, we were required to create a project implementing some type of modeling. I chose to model the Julia Set of complex functions. The theory of Julia Sets is a very interesting area of mathematical research. I created my modeling project and presented it on a web page. Below you will find a link to my project. This page was awarded the Study Web award of Academic Excellence.

My Mathematical Modeling Project

That same semester I took a course in Dynamics. I was required to write a paper so I chose to write a paper about the underlying theory of Julia Sets as a complement to the project I did for Mathematical Modeling. You will find a link below to my paper, "Julia Sets and the Mandlebrot Set".

"Julia Sets and the Mandlebrot Set"
As a graduate student we were encouraged to attend Mathematical conferences to help our professional development.

In August of 1996 I had the opportunity to attend one of these conferences in Seattle, Washington at the University of Washington. Below you will find a link to photos I took during my trip.

My photos of Seattle

Teaching History

Fall Quarter 1995 Algebra I

Winter Quarter 1996 Algebra I
Fall Quarter 1996 Algebra I

Winter Quarter 1997 Algebra I
Fall Quarter 1997 PreCalculus I
Algebra I

Winter Quarter 1998 CIS 150
CIS 247
CIS 271
CIS 272
Spring Quarter 1998 CIS 150
CIS 271
CIS 272
Summer Semester 1998 CIS 110
Fall Semester 1998 CIS 227

CIS 150
Spring Semester 1999 CIS 150
Summer Semester 1999 CIS 227
Fall Semester 1999 CIS 150

Spring Semester 2000 CIS 121
Summer Semester 2000 CIS 120
Fall Semester 2000 CIS 121

Spring Semeter 2001 CIS 321
Summer Semester 2001 CIS 121
Fall Semester 2001 CIS 405/505

Spring Semester 2002 CIS 120
Summer Semester 2002 CIS 121
Fall Semester 2002 CIS 401/501

Spring Semester 2003 CIS 121
Summer Semester 2003 CIS 121
Fall Semester 2003 CIS 120

Spring Semester 2004 CIS 121
Summer Semester 2004 CIS 121
Fall Semester 2004 CIS 401/501

Spring Semester 2005 CIS 227

Fall Semester 2007 CIS 150

Spring Semester 2008 CIS 150
Summer Semester 2008 CIS 121
Fall Semester 2008 CIS 401

CIS 211

Spring Semester 2009 CIS 401

CIS 211
Summer Semester 2009 CIS 121
Fall Semester 2009 CIS 401

CIS 211

Spring Semester 2010 CIS 150

CIS 211

Fall Semester 2010 CIS 211

CIS 150

Spring Semester 2011 CIS 211

CIS 150
Summer Semester 2011 CIS 490
Fall Semester 2011 CIS 150

CIS 211

Spring Semester 2012 CIS 150

CIS 211

CIS 150 Introduction to Computer Applications This course is designed to provide a broad-based introduction to the use of computers to enhance personal productivity. Topics to be covered are use of a graphical user interface, word processing, spreadsheet analysis, basic image management related to documents and reports and the fundamentals of Internet publishing. No prerequisites.
CIS 120 Problem Solving and Programming Concepts I Introduction to the design of algorithms and their implementation in a high-level programming language. Topics include: algorithm design strategies, programming concepts, programming environment, data structures, searching and sorting methods, and internal representation of data types. Prerequisite: MA 112 or an ACT score of 24 in Mathematics. Corequisite: CIS 122.
CIS 121 Problem Solving and Programming Concepts II Continuation of CIS 120. Topics include: design concepts, abstract data types, use of object libraries, dynamic storage allocation, stacks, queues, link lists, random access files, testing and software engineering practices. Prerequisites: CIS 110 and 120. Corequisite: CIS 123.
CIS 211 Advanced C++ Programming Advanced concepts in C++ Programming, constructors, destructors, classes and operation overloading.
CIS 227 Numerical Computation I Floating point numbers, representation, and errors; software tools for scientific computing; elementary problems in scientific computing. Prerequisite: MA 126.
CIS 247 Data Communications and Networking
CIS 271 Scientific Programming with Fortran
CIS 272 Scientific Programming with C
CIS 321 Data Communications and Networking An introduction to data communications, computer networking, and network operating systems. Topics include: basic concepts of data transmission, network architectures, communications devices, and communications protocols. Prerequisite: CIS 121.
CIS 405/505 Programming Languages This course is a cross-listed graduate/undergraduate course. The course examines programming language theory including examinations of languages such as LISP and PROLOG and provides an introduction to Automata Theory.
CIS 401/501 Accelerated Programming Introduction to the design of algorithms and their implementation in a high-level programming language. Topics include: problem solving strategies, programming concepts, programming environment, arrays, searching and sorting, internal representations of data, data concepts, abstract data types, use of object libraries, testing strategies, and software engineering practices.