Michael J. Grant Campus
MATHEMATICS DEPARTMENT
Fall 2009 Syllabus — Computer
Mathematics Concepts
INSTRUCTOR INFORMATION
Name: Alexander Kasiukov
Office: Academic
wing of the
Phone: (631) 851-6484
Email: kasiuka@sunysuffolk.edu
Web Page: http://www2.sunysuffolk.edu/kasiuka/
Office
Hours: See schedule. Additional tutoring is available in the Center
for Academic Excellence, Room MA 129
COURSE INFORMATION
Name of
Course: Computer
Mathematics Concepts
Catalog Number: MAT 107 (MA 17)
Section Number: 93428
Number of Credits: 4
Number of Contact
Hours:
4
Prerequisite: C or better in Algebra I
or equivalent
Grading: A-B-C-D-F-W
Meets: Tuesday, Thursday: 9:30—11:10 AM,
Final Exam: Tuesday, December 15, 2009
Textbook: Chu,
Notes: Credit given for this course or
MAT 101 (MA 21), A Survey of Mathematical
Reasoning, but not for both.
Course
Fee.
Course Philosophy:
For students pursuing a Computer Technology degree program.
Stresses problem-solving and computer mathematics concepts. Taught with a
computer lab component. Topics include number systems, computer arithmetic,
sets, logic, functions, vectors, matrices, sequence, selection and repetition,
and problem solving.
Topic Outline:
I.
Numbers and Operations
1.
Fundamental concepts
2.
Numbers and exponents
3.
Order of operations
4.
Evaluation of expressions
II.
Binary and Hexadecimal Number System
1.
Binary number system
2.
Hexadecimal number system
3.
Negative binary numbers
4.
Applications (memory dump in hex, two's complement, ASCII representation)
III.
Sets
1.
Properties of sets
2.
Operations on sets
3.
Venn diagrams
IV.
Logic
1.
Conjunction
2.
Disjunction
3.
Negation
4.
DeMorgan's Law
5.
Conditional and biconditional
V.
Relations and Functions
1.
Function definition
2.
Mathematical functions
3.
Built-in functions
4.
Mod function
VI.
Subscripts, Vectors, and Matrices
1.
Vectors or one-dimensional arrays
2.
Summation (sigma) and product (pi)
3.
Matrices or two-dimensional arrays
VII. Problem
Solving Using All Concepts Learned throughout the Semester, Specifically
Dealing with Decisions and Looping (Sequence, Selection, and Repetition)
VIII.
Computer Measurements (optional)
IX.
Loop Computations (optional)
X.
Recursion (optional)
Learning
Objectives:
Upon successful completion of this course, students should be able to:
1.
Perform the basic
operations of set theory including intersection, union, and complement;
2.
Understand binary number
system, conversion to decimal and hexadecimal systems;
3.
Distinguish between
integer/real number representation in computer;
4.
Translate verbal
statements into symbolic forms of conjunction, disjunction, and negation;
5.
Perform matrix
manipulations, including addition and subtraction;
6.
Convert word problem
specifications into algorithms that can be used to develop computer solutions.
POLICIES AND PROCEDURES
Procedures for accomplishing the Course
Objectives:
·
Individual
work of a student
·
Participation
in problem solving in class
·
Preparation
of the assigned homework and reading
·
Instructor's
office hours.
·
Utilization
of free tutoring and supplementary materials available in the
Student Requirements for completion of
the course:
Students must attend class, do homework assignment, take all
the quizzes and the comprehensive final exam.
Grading:
There will be approximately 15—20 quizzes, given regularly
(at least once a week) in class. They will last no more than 20 minutes each
and will cover current material. There will be a final exam at the end of the
course. It will cover all the material of the course. If a test (i.e. a quiz or
the final exam) is missed, then the grade 0 is assigned for that test.
Final score of a student =
sum of all quiz scores (out of
75 possible)
+
the final exam score
(out of 25 possible).
Letter grade of a student =
A, if the final score
is 90 and above;
B+, if the final score
is 85—89;
B, if the final score
is 80—84;
C+, if the final score
is 75—79;
C, if the final score
is 70—74;
D+, if the final score
is 65—69;
D, if the final score
is 60—64;
F, if the final score
is below 60;
W, if the student withdraws
officially, by returning a withdrawal slip with my signature to the Registrar's
Office before mid-semester (as defined by the academic calendar).
Attendance:
All students are expected to
attend every session of each course for which they are registered. Students are
responsible for all that transpires in class whether or not they are in
attendance. The College defines excessive absence or lateness as more than the
equivalent of one week of class meetings during the semester. Excess absence or
lateness may lead to failure in a course or removal from the class roster.
Make-ups:
Make-up tests will be given
only for documented emergencies, and then only at my discretion and
convenience. However, if you have a good reason, please do ask for
consideration.
Disruptions:
Disruptive behaviors, as
defined by the Student Handbook, will not be tolerated. College policy allows
for the removal of disruptive students from class for the remainder of a class
session in progress. Repeated disruptions in the classroom will lead to disciplinary
action as specified in the Student Handbook. Pagers and cell phones are to be
turned off at all times. If anyone wishes to reach you in an emergency, he or
she should call the Mathematics Department Secretary (see the phone number
above).
Use of Calculators and Computers:
Calculators are permitted in this
course. We will extensively use computers in the class.
Students with special needs:
If you are a student who has a
disability and need reasonable accommodations, then please give me an advance
notice about your special needs. If you have specific questions about obtaining
these accommodations, you can call the