Math 509 Foundational mathematics (3 cr. hrs.)

DAKOTA STATE UNIVERSITY
Fall 2008

 

MEETING TIMES AND LOCATION

INSTRUCTOR CONTACT INFORMATION

CATALOG DESCRIPTION
A foundational course in number theory, abstract algebra, linear algebra and discrete mathematics.

COURSE MATERIALS:
Textbooks (required):

COURSE DELIVERY METHOD AND INSTRUCTIONAL METHODS:

CLASS ROOM POLICIES:

COURSE GOALS
Student Learning Outcomes:

  1. Improving the general knowledge of mathematics adequate to apply to computer security theory
  2. Understanding of the basics of discrete mathematics such as Functions, Proofs, and Reasoning
  3. Learning algorithm design and analysis; apply it to classical problems in graph theory
  4. Expertise in combinatorics and number theory to be applied mainly for cryptographic study.

EVALUATION PROCEDURE:
 
Assessments The weights for the different assessments are as follows: The final letter grade will be based on the following scale:

Note: Numbers with fractions will be rounded to the next whole number. E.g. 89.2 will be rounded to 90 and hence it is an 'A'.

 HARDWARE AND SOFTWARE REQUIREMENTS:

To successfully complete this course, you need, 

Hardware Software
  • Pentium,
  • 64 MB RAM
  • VGA or Super VGA monitor
  • Mouse
  • CD-ROM drive
  • 5 GB of free hard drive space
  • 10 MB of free hard drive space after installation
  • Internet connection
  • Windows XP operating system
  • Microsoft Office XP
  • Browser*
  • E-mail**
  • Java 2 Standard Edition 5***
  • * With JRE (Java Run-Time Environment) plugin installed (for Java applets to work).
    **You can connect to pluto.dsu.edu from your browser and access your OutLook email.
    *** Available for free at http://java.sun.com/j2se/1.5.0/download.jsp

    COURSE OUTLINE:
     This is a tentative course schedule. Changes are possible.

    Unit Topics
    1 Introduction, sets, relations, functions.
    2 Statements, proofs, logical reasoning, deductive and inductive styles.
    3 Graph theory (shortest path algorithms, spanning trees, cycle detection), algorithm analysis, complexity theory.
    4 Permutations and Combinations.
    5 Probability theory.

    ACADEMIC SUCCESS SUPPORT

    As your professor, I am personally committed to supporting YOUR academic success in this course.  For that reason, if you demonstrate any academic performance or behavioral problems which may impede your success, I will personally discuss and attempt to resolve the issue with you.  If the situation persists, I will forward my concern to the Student Development Office and your academic advisor to seek their support and assistance in the matter.  My goal is to make your learning experience in this course as meaningful and successful as possible.

    IMPORTANT DATES

    September 11th - Last day to drop a full semester class and receive a full refund

    November 17th - Last day to drop a full semester class or withdraw from all classes/University and receive a grade of "W" - NO REFUND.

    FREEDOM IN LEARNING

    Under Board of Regents and University policy student academic performance may be evaluated solely on an academic basis, not on opinions or conduct in matters unrelated to academic standards. Students should be free to take reasoned exception to the data or views offered in any course of study and to reserve judgment about matters of opinion, but they are responsible for learning the content of any course of study for which they are enrolled. Students who believe that an academic evaluation reflects prejudiced or capricious consideration of student opinions or conduct unrelated to academic standards should contact the Dean, College of BIS to initiate a review of the evaluation.

    NOTE: Please go through the syllabus and inform us if you do not understand something or if you feel changes are needed. We will promptly discuss the matter and explain to you or make appropriate changes.