Daniel R. Page

Daniel R. Page

Science Educator, Researcher

Table of Contents

  • Contact:

    Email: drpage[at]pagewizardgames.com

    Phone: (204) 802-0155

              "The purpose of computing is insight, not numbers." - Richard Hamming

    Degrees

    2011 B.C.Sc. (Hons.)         University of Manitoba   (Bachelor of Computer Science-Honours)

      • Major: Computer Science
      • Minor: Mathematics
      • Concentrations: Theoretical Computer Science, and Computer Graphics 

    Research Interests

    My interests at the given time are the following:
    • Enumeration Algorithms for Combinatorial Constructions
    • Languages, and Combinatorial Compositions
    • Theory of Computation
    • Combinatorics, and Automata Theory
    • Computational Discrete Mathematics

    Research, and Publications

    Generalized Algorithm for Restricted Weak Composition Generation (November 2011)                                                                                               D. R. Page, (submitted 30/11/2011, currently in revision 14/02/2012)

    Generalized Methods for Restricted Weak Composition Enumeration, (not online)  (August 2011)                                                                 Supervisor: Dr. John van Rees, University of Manitoba, Summer 2011. (Undergraduate Thesis) 

    Enumeration Algorithms for Unrestricted and Restricted Compositions and Words, (online) (January 2011)                                                       Maintained by D. R. Page, originally completed at University of Manitoba, Winter 2011. 

    Presentations

    Seminar: Generalized Methods for Restricted Weak Composition Enumeration(WIP) (March 6, 2012)                                                                   D. R. PageDepartment of Computer Science Seminar Series, University of Manitoba

    Generalized Methods for Restricted Weak Composition Enumeration, (not online) (August 2011)                                                            Supervisor: Dr. John van Rees, University of Manitoba, Summer 2011.

    Enumeration Algorithms for Unrestricted and Restricted Compositions and Words, (online) (April 2011)                                                                  Originally presented at University of Manitoba, Winter 2011.

    All Finite Fields have a Prime Power Order: Morphisms, Cauchy's Theorem, and Proof, (online) (March 2011)                                                         Originally presented at University of Manitoba, Winter 2011.

    Teaching, and Tutoring

    I currently teach children science in after school programs with Mad Science, and work as a Museum Interpreter at the Western Canada Aviation Museum for the museum's educational programs.

    I tutor through my personal services, but also I have in the past with Tutoring Works .  In the past and currently I offer services by the following methods:

    • One-on-One tutoring.
    • Group tutoring.
    • Remote, or Online Tutoring (via live digital stream).

    My services are offered to students in the home, or on campus, at my home (locally, or remotely).  I have experience tutoring all kinds of students, and have a passion for explaining the 'why' questions which are important, that barely get touched at certain levels in the formal sciences.  I provide deep, but simple explanations but can readily provide more formal explanations as necessary.  I have over four years of tutoring experience in the following scientific fields:

    • Computer Science
    • Mathematics
    • Physics
    • Statistics

    I have tutored the following courses in the past:

    Secondary School Level:

    • Grade 10 Pre-Calculus
    • Grade 11 Pre-Calculus
    • Grade 11 Physics
    • Grade 12 Pre-Calculus
    • Grade 12 Physics
    • Introduction to Calculus/Advanced Math

     Post Secondary School Level:

    I have tutored for students for the following courses at this level:

    Red River College

    • MATH1007 - Calculus

    University of Manitoba

    • COMP1010 - Introduction to Computer Science 1
    • COMP1020 - Introduction to Computer Science 2
    • COMP2130 - Discrete Mathematics for Computer Science
    • COMP2140 - Data Structures and Algorithms
    • COMP2080 - Analysis of Algorithms
    • COMP3170 - Analysis of Algorithms and Data Structures
    • MATH1500  - Introduction to Calculus
    • MATH1700  - Calculus 2
    • STAT1000   - Basic Statistical Analysis 1

    If you are interested in services from me, please contact me by my e-mail, or my phone number.  I am not just limited to the topics above.

      I am able to cover many subjects ranging from software applications, to programming, to other mathematical discourses.  In terms of my main interests, I do not go past entry university physics, and I much prefer discrete mathematics (so if you are needing assistance in a discrete mathematics course (any) I can do those, based on the topics).  I am always interested in learning more concepts, or to share my knowledge on a subject.  If you have any questions, let me know!

    Back To Top of Page

     

    Last Updated: February 14, 2012