Math 180
Mathematics for Computer Science

Instructor

Ernest Boyd, Wissink 273, 389-1452
Office Hours: 9:00 - 9:50 am, MWHF; 10:00 - 10:50 am, TH; 11:00 - 11:50 am, MWHF.

Textbook

Math 180 Lecture Notes by Ernest Boyd. Download these notes below.

Course Content

We will look at problems introducing the kinds of mathematics used in computer science, in order to prepare you for more advanced courses. Topics include sets, logic circuits, number bases, combinatorics, discrete functions, matrices, graphs, trees and analysis of algorithms. Students anticipating graduate studies in computer science should continue these topics in Math 375. Prerequisites for Math 180 are basic high school algebra or Math 112 including logarithms.

Schedule

8:00 - 8:50 am, MTHF, Academic Computer Center Room 116 Wissink Hall

Tests

Tuesday, Feb. 12
Friday, Mar. 21
Friday, Apr. 25

Final exam

Tuesday, May 6, 8 - 10 am

Grading Policy

Each test will be graded on its own scale normalized to 100%. The final will also be graded on a scale normalized to 100%. All of the homework collected will be totaled and graded as one test. At the end of the semester the five grades will be averaged and compared to the average of the scales. Grading will reflect the mathematical correctness of the answer and the quality of the presentation in terms of completeness and organization. Late assignments will be penalized. Assignments over one week late will receive no credit. Active participation in the class discussions will also be factored into the evaluations. Make-up tests will be given only in special cases, when an excused absence has been prearranged. Incompletes will follow the university's policy as expressed in the student bulletins and the faculty handbook. No incomplete will be given to repeat the entire course.

MSU provides students with disabilities reasonable accommodation to participate in educational programs, activities or services. Students with disabilities requiring accommodation to participate in class activities or meet course requirements should first register with the Office of Disability Services, located in 0132 Memorial Library, telephone 389-2825, TDD 711 and then contact me as soon as possible.



Lecture Notes

  1. Introduction
  2. Chapter 1 - Sets
  3. Chapter 2 - Mathematical Induction
  4. Chapter 3 - Symbolic Logic
  5. Review for Test
  6. Chapter 4 - Representation of Numbers
  7. Chapter 5 - Combinatorics
  8. Review for Test
  9. Chapter 6 - Discrete Functions
  10. Chapter 7 - Matrix Algebra
  11. Chapter 8 - Graphs and Trees
  12. Review for Test
  13. Chapter 9 - Analysis of Algorithms


Homework Assignments

  1. Hand in Homework 1.5 on Tuesday, Jan 22..
  2. Hand in Homework 1.10 on Thursday, Jan. 24.
  3. Hand in Homework 1.13 on Friday, Jan. 25.
  4. Hand in Homework 2.5 on Tuesday, Jan. 29.
  5. Hand in Homework 2.12 on Friday, Feb. 1.
  6. Hand in Homework 3.2 on Friday, Feb. 1.
  7. Hand in Homework 3.5 on Monday, Feb. 4.
  8. Hand in Homework 3.11 on Thursday, Feb. 7.
  9. Hand in Homework 4.7 on Tuesday, Feb. 19.
  10. Hand in Homework 4.12 on Thursday, Feb. 21.
  11. Hand in Homework 4.17 on Friday, Feb. 22.
  12. Hand in Homework 4.20 on Tuesday, Feb. 26.
  13. Hand in Homework 5.8 on Friday, Feb. 29.
  14. Hand in Homework 5.14 on Monday, Mar. 3.
  15. Hand in Homework 5.19 on Tuesday, Mar. 4.
  16. Hand in Homework 5.29 on Friday, Mar. 7.
  17. Hand in Homework 5.35 on Tuesday, Mar. 18.
  18. Hand in Homework 5.41 on Tuesday, Mar. 18.
  19. Hand in Homework 6.8 on Friday, Mar. 28.
  20. Hand in Homework 6.11 on Tuesday, Apr. 1.
  21. Hand in Homework 6.13 on Thursday, Apr. 3.
  22. Hand in Homework 6.27 on Thursday, Apr. 10.
  23. Hand in Homework 7.5 on Monday, Apr. 14.
  24. Homework due Monday, Apr. 21.

Mathematica Supplements

  1. Truth Tables
  2. Converting between Number Bases
  3. Second Order Recurrence Relation
  4. Fibonacci Sequence
  5. Generating Functions
  6. Order of Complexity
  7. Matrices See the first three Mathematica supplements for Math 247, Linear Algebra
  8. Weighted Graph for Example of Dijkstra's Algorithm

Use this link to go to Ernest Boyd's Home Page


E-mail Ernest Boyd