Scribd
Upload
11 views5 pages

Computer Math Fundamentals Course Guide

MATH18584 is a 4-credit course designed to develop mathematical skills essential for understanding modern digital computers, covering topics such as number systems, logic, functions, and discrete mathematics. The course includes in-class exercises, assignments, a midterm, and a final exam, with a focus on applying discrete mathematics to solve computing problems. It is a required course for various Computer Systems Technology programs and emphasizes essential employability skills like communication and critical thinking.

Uploaded by

ompateldemo
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views5 pages

Computer Math Fundamentals Course Guide

MATH18584 is a 4-credit course designed to develop mathematical skills essential for understanding modern digital computers, covering topics such as number systems, logic, functions, and discrete mathematics. The course includes in-class exercises, assignments, a midterm, and a final exam, with a focus on applying discrete mathematics to solve computing problems. It is a required course for various Computer Systems Technology programs and emphasizes essential employability skills like communication and critical thinking.

Uploaded by

ompateldemo
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

MATH18584

Computer Math Fundamentals


I: Administrative Information II: Course Details III: Topical Outline(s) Printable Version

Section I: Administrative Information


Total hours: 56.0
Credit Value: 4.0
Credit Value Notes: N/A
Effective: Winter 2021
Prerequisites: N/A
Corequisites: N/A
Equivalents: N/A
Pre/Co/Equiv Notes: N/A
Program(s): CST-Information Systems Eng, CST-Software Dev & Network Eng, CST-
Software Engineering, CST-Systems Analyst, Computer Programming, Internet
Communications Techno
Program Coordinator(s): Simon Hood, Paul Bonenfant, Ann Cadger, Felix Carapaica,
Satyendra Narayan
Course Leader or Contact: Samar Haddad
Version: 20210118_00
Status: Approved (APPR)

Section I Notes: This course is delivered twice per week for 2 hours each time.

Section II: Course Details


Detailed Description
Students develop the mathematical skills needed to understand the operation of modern
digital, binary computers. They solve problems using the concepts, structures and
methods of computational/discrete mathematics. Students acquire the applied
mathematical foundations (e.g. Number systems, logic, functions, sets matrices, graphs,
and trees) upon which computer applications are built.

Program Context

CST-Information Systems Eng Program Coordinator(s): Paul Bonenfant


The purpose of this required course is to lay the mathematical foundations
required for success in other program streams such as computer architecture,
programming and data base management systems. Subsequent mathematics
courses rely on the discrete mathematics concepts learned in this course.

CST-Software Dev & Network Program Coordinator(s): Simon Hood


Eng
The purpose of this required course is to lay the mathematical foundations
required for success in other program streams such as computer architecture,
programming and data base management systems. Subsequent mathematics
courses rely on the discrete mathematics concepts learned in this course.

CST-Software Engineering Program Coordinator(s): Satyendra


Narayan
The purpose of this required course is to lay the mathematical foundations
required for success in other program streams such as computer architecture,
programming and data base management systems. Subsequent mathematics
courses rely on the discrete mathematics concepts learned in this course.

CST-Systems Analyst Program Coordinator(s): Paul Bonenfant


The purpose of this required course is to lay the mathematical foundations
required for success in other program streams such as computer architecture,
programming and data base management systems. Subsequent mathematics
courses rely on the discrete mathematics concepts learned in this course. This
program is now known as Computer Systems Technology - Information Systems
Engineering.

Computer Programming Program Coordinator(s): Ann Cadger


The purpose of this required course is to lay the mathematical foundations
required for success in other program streams such as computer architecture,
programming and data base management systems. Subsequent mathematics
courses rely on the discrete mathematics concepts learned in this course.

Internet Communications Program Coordinator(s): Felix Carapaica


Techno
The purpose of this required course is to lay the mathematical foundations
required for success in other program streams such as computer architecture,
programming and data base management systems and internet
communications. Subsequent mathematics courses rely on the discrete
mathematics concepts learned in this course.

Course Critical Performance and Learning Outcomes

Critical Performance:
By the end of this course, students will have demonstrated the ability to apply
discrete mathematics and its applications to analyze and solve foundational problems
in applied computing.

Learning Outcomes:

To achieve the critical performance, students will have demonstrated the ability to:

1. Translate between decimal, binary and hexadecimal number systems to


support communications across human and computer languages.
2. Apply logical operators to the solution of mathematical logic problems in
applied computing.
3. Represent Boolean functions in applied computing as combinatorial circuits.
4. Apply notation, vocabulary and diagramming techniques pertaining to
mathematical sets.
5. Manipulate a variety of algebraic and transcendental functions in order to
solve applied mathematical problems.
6. Solve problems involving discrete objects using set operations.
7. Apply modulus arithmetic to the solution of practical computing problems.
8. Solve applied mathematical problems involving linear equations using
algebraic techniques.
9. Solve applied mathematical problems involving relationships between discrete
objects using graph models.
10. Solve searching and sorting problems using simple mathematical trees.
11. Solve applied mathematical problems involving basic matrices using matrix
operations.
Evaluation Plan
Students demonstrate their learning in the following ways:

Evaluation Plan: IN-CLASS


In-Class Exercises (10 x 1%) 10.0%
Assignments (4 x 5%) 20.0%
Midterm Exam 30.0%
Final Exam 40.0%
Total 100.0%

Evaluation Notes and Academic Missed Work Procedure:


To pass the course, students must achieve a 50% weighted average across the
midterm and final exam as well as at least 50% overall in the course. Calculators are
prohibited on all exams. Students must submit/complete all assignments, in-class
activities and projects by the scheduled due date and write all tests on the specified
date/time. Exceptions will only be made under extraordinary circumstances. Refer to
the School of Applied Computing's Academic Procedures for Evaluations for more
details regarding missed work: Procedures for Evaluations

Provincial Context
The course meets the following Ministry of Colleges and Universities requirements:

Essential Employability Skills


Essential Employability Skills emphasized in the course:

 Communication Skills - Communicate clearly, concisely and correctly in the


written, spoken, visual form that fulfills the purpose and meets the needs of
the audience.
 Information Management Skills - Analyze, evaluate, and apply relevant
information from a variety of sources.
 Information Management - Locate, select, organize and document information
using appropriate technology and information systems.
 Critical Thinking & Problem Solving Skills - Use a variety of thinking skills to
anticipate and solve problems.
 Critical Thinking & Problem Solving - Apply a systematic approach to solve
problems.
 Numeracy - Execute mathematical operations accurately.
 Communication Skills - Respond to written, spoken, or visual messages in a
manner that ensures effective communication.

Prior Learning Assessment and Recognition


PLAR Contact (if course is PLAR-eligible) - Office of the Registrar
Students may apply to receive credit by demonstrating achievement of the course
learning outcomes through previous relevant work/life experience, service, self-study
and training on the job. This course is eligible for challenge through the following
method(s):

 Challenge Exam and Interview


Notes: PLAR consists of a Challenge Exam and Interview.

Section III: Topical Outline


Some details of this outline may change as a result of circumstances such as weather cancellations, College and
student activities, and class timetabling.
Instruction Mode: In-Class
Professor: Multiple Professors
Resource(s):
Type Description
Discrete Mathematics and Its Applications, Rosen, H. K., McGraw Hill, 8th Edition, ISBN
Optional Textbook
9781260091991, 2018

Applicable student group(s): Computer Programmer, Computer Systems Technology


- Systems Analyst, Computer Systems Technician - Software Engineering, Computer
Systems Technology - Software Development and Network Engineering, Internet
Communications Technology.
Course Details:

Module 1: Computer Mathematics


- Number Systems
- Arithmetic Operations, 2’s complement, Negative Binary Numbers
- Logic, Boolean Algebra, Truth Tables
- Logic Gates and Circuits
- Minimization of Circuits and K-maps
- (Assignment 5%)
- (In-Class Exercises 3 x 1%)

Module 2: Discrete Structures


- Sets
- Functions
- Summation
- Series expansion
- Graphs and Trees
- (Assignment 5%)
- (In-Class Exercises 2 x 1%)
- (Midterm Exam 30%)

Module 3: Problem Solving


- Modular Arithmetic
- Translating into Mathematical Form
- Linear Equations
- Word Problems
- Solving Systems of Linear Equations
- (Assignment 5%)
- (In-Class Exercises 3 x 1%)

Module 4: Matrices
- Matrix Operations
- Adjacency Matrices
- Determinant and Inverse of a Matrix
- Solving Systems of Linear Equations using Matrices
- Transition Matrices
- (Assignment 5%)
- (In-Class Exercises 2 x 1%)
- (Final Exam 40%)

Sheridan Policies

All Sheridan policies can be viewed on the Sheridan policy website.


Academic Integrity: The principle of academic integrity requires that all work submitted for evaluation and course
credit be the original, unassisted work of the student. Cheating or plagiarism including borrowing, copying, purchasing
or collaborating on work, except for group projects arranged and approved by the professor, or otherwise submitting
work that is not the student's own, violates this principle and will not be tolerated. Students who have any questions
regarding whether or not specific circumstances involve a breach of academic integrity are advised to review the
Academic Integrity Policy and procedure and/or discuss them with the professor.

Copyright: A majority of the course lectures and materials provided in class and posted in SLATE are protected by
copyright. Use of these materials must comply with the Acceptable Use Policy, Use of Copyright Protected Work Policy
and Student Code of Conduct. Students may use, copy and share these materials for learning and/or research
purposes provided that the use complies with fair dealing or an exception in the Copyright Act. Permission from the
rights holder would be necessary otherwise. Please note that it is prohibited to reproduce and/or post a work that is
not your own on third-party commercial websites including but not limited to Course Hero or OneNote. It is also
prohibited to reproduce and/or post a work that is not your own or your own work with the intent to assist others in
cheating on third-party commercial websites including but not limited to Course Hero or OneNote.

Intellectual Property: Sheridan's Intellectual Property Policy generally applies such that students own their own
work. Please be advised that students working with external research and/or industry collaborators may be asked to
sign agreements that waive or modify their IP rights. Please refer to Sheridan's IP Policy and Procedure.

Respectful Behaviour: Sheridan is committed to provide a learning environment that supports academic
achievement by respecting the dignity, self-esteem and fair treatment of every person engaged in the learning
process. Behaviour which is inconsistent with this principle will not be tolerated. Details of Sheridan's policy on
Harassment and Discrimination, Academic Integrity and other academic policies are available on the Sheridan policy
website.

Accessible Learning: Accessible Learning coordinates academic accommodations for students with disabilities. For
more information or to register, please see the Accessible Learning website (Statement added September 2016)

Course Outline Changes: The information contained in this Course Outline including but not limited to faculty and
program information and course description is subject to change without notice. Any changes to course curriculum
and/or assessment shall adhere to approved Sheridan protocol. Nothing in this Course Outline should be
viewed as a representation, offer and/or warranty. Students are responsible for reading the Important Notice and
Disclaimer which applies to Programs and Courses.

Common questions

Powered by AI

Students can challenge the course content through prior learning assessment and recognition (PLAR) mechanisms, which include a Challenge Exam and Interview. This allows students who can demonstrate achievement of course learning outcomes through previous relevant work/life experience, service, or self-study to receive credit without completing the actual course, thus recognizing pre-existing competencies in the subject matter .

The course addresses accessibility through the provision of coordinated academic accommodations for students with disabilities, encouraging respect and equitable treatment. Additionally, principles of respectful behavior and a commitment to maintaining a learning environment that supports academic achievement by respecting the dignity and fair treatment of every individual are emphasized. These measures ensure that students from diverse backgrounds are provided with an inclusive learning experience .

The instructional resources available to students include an optional textbook titled "Discrete Mathematics and Its Applications" by Rosen, McGraw Hill, 8th Edition. This resource supports the learning process by providing comprehensive coverage of the essential topics in discrete mathematics, which are foundational to understanding the concepts applied in solving computational problems. Access to these resources enables students to reinforce classroom learning with detailed explanations and examples .

The role of Essential Employability Skills in the course curriculum is to equip students with crucial capabilities such as communication, information management, critical thinking, problem-solving, and numeracy. The course emphasizes these skills to prepare students for real-world scenarios where they must analyze and apply information, communicate effectively, and execute mathematical operations accurately, which are all necessary for effective functioning in technical and professional environments .

Student performance in the course is evaluated through in-class exercises, assignments, a midterm exam, and a final exam, contributing 10%, 20%, 30%, and 40% to the total evaluation, respectively. To pass the course, students must achieve a 50% weighted average across the midterm and final exam, as well as at least a 50% overall in the course. Calculators are prohibited on all exams, and exceptions for missed work are made only under extraordinary circumstances .

The course enforces strict policies on academic integrity and intellectual property, which prohibit cheating, plagiarism, and unauthorized collaboration. Students are required to submit original and unassisted work unless specified otherwise for group projects. Intellectual property policies ensure that students own their work unless modified by agreements with external collaborators. These policies are significant as they maintain the credibility of academic work, encourage fairness, and protect both student and institutional rights, fostering an environment of trust and respect within the academic community .

The course aligns with provincial education requirements by incorporating Essential Employability Skills prescribed by the Ministry of Colleges and Universities. These include communication, information management, critical thinking, problem-solving, and numeracy, which are integrated into the curriculum to ensure that students develop not only specific mathematical abilities but also broader competencies required for the professional and academic success anticipated by provincial standards .

The course ensures the application of mathematical skills to practical computing problems through its curriculum, which integrates mathematical theories with real-world applications. Topics such as logical operators, Boolean functions, set operations, and graph models are taught with an emphasis on solving practical computing problems like circuit designs, data organization, and optimized computations. By focusing on solving applied mathematical problems, such as using modular arithmetic and linear equations, students learn to seamlessly transition from theoretical concepts to practical solutions in a computing context .

The course "Computer Math Fundamentals I" is designed to develop foundational mathematical concepts such as number systems, logic, functions, sets, matrices, graphs, and trees. These concepts are crucial as they lay the mathematical groundwork necessary for understanding and succeeding in subsequent courses within the programming curriculum, including computer architecture, programming, and database management systems. Mastery of discrete mathematics is essential for students to analyze and solve foundational problems encountered in applied computing .

By the end of the course, students are expected to have demonstrated the ability to apply discrete mathematics to analyze and solve foundational problems in applied computing. Specific learning outcomes include translating between different number systems, applying logical operators, representing Boolean functions, using set operations, applying modulus arithmetic, solving linear equations, using graph models for discrete relationships, and solving problems using matrices and mathematical trees .

You might also like