Discrete Mathematics concerns processes that consist of a sequence of individual steps. The ideas of discrete mathematics underline the science and technology specific to computer applications. The Discrete Mathematics course provides the mathematical basis and concepts for applications in computer science: elementary logic, the logic of quantified statements, methods of proof, set theory, discrete functions, relations, counting and probabilities, sequences and mathematical induction, recursion, graphs, trees, and Boolean algebra.
This compressed and intensive summer section meets twice per week for 8 weeks. Students must attend every lesson. REGISTRATION: No registration is permitted after the course has started without department approval. No class June 1.
This course offering is in progress and full. Please check back next term, subscribe to receive email updates or
contact us with your comments or questions.
In Progress and Full
Upon successful completion of this course, the student will be able to:
Prove that an argument is valid using a truth table or valid argument forms.
Prove mathematical arguments using Direct Proof and Counterexample.
Solve problems in set theory and relate its concepts to enumeration problems and probability.
Solve problems in basic counting theory involving combinations and permutations.
Work with discrete mathematics functions and use them in applications.
Design finite-state automata and finite-state machines.
Apply the basic concepts and formulas of probability and distinguish between independent and mutually exclusive events.
Compute event probabilities using probabilities trees.
Apply mathematical induction to the solution of problems.
Understand properties of integers.
Represent computing problems in the form of a graph and tree.
Diagram and identify properties of graphs and trees.
Illustrate basic graph algorithms such as minimal spanning trees and shortest path.
Use tree structure on problems related to searching and sorting.
Carry out operations using sigma notation.
Effective as of Spring/Summer 2011
COMP 2121 is offered as a part of the following programs:
If you are taking this course, but are not taking it through either Distance
Education or Online Learning, nor at the BCIT Downtown Campus (DTC), please purchase books for this course at the BCIT Burnaby Bookstore.
Discrete Mathematics with Applications
If you have a comment or question about this course, please complete and submit the form below.
Interested in being notified about future offerings of COMP 2121 - Discrete Mathematics?
If so, fill out the information below and we'll notify you by email when courses for each new term are displayed here.