Discrete Mathematics for Computer Science, I&C SCI 6D
Covers essential tools from discrete mathematics used in computer science with an emphasis on the process of abstracting computational problems and analyzing them mathematically. Topics include mathematical induction, combinatorics, and recurrence relations.
Credit: 4 quarter units /
2.67 semester units credit
UC Irvine, Information and Computer Science
Course Credit:Upon successful completion, all online courses offered through cross-enrollment provide UC unit credit. Some courses are approved for GE, major preparation and/or, major credit or can be used as a substitute for a course at your campus.
If "unit credit" is listed by your campus, consult your department, academic adviser or Student Affairs division to inquire about the petition process for more than unit credit for the course.
General Education: Vb - Formal Reasoning
UC Los Angeles:
Units toward degree (see your advisor)
Course Equivalence: UCR CS 11/MATH 11 - Intro to Discrete Structures
UC San Diego:
General Education: TMC 1 course toward lower division disciplinary breadth if noncontiguous to major; ERC - 1 quantitative/formal skills; Revelle Math (must also take 2 calculus courses); Warren - Formal Skills; May be counted depending on major/PofC, Transfer students may use for UD GE depending on major, Seventh - 1 course towards Alternatives - Quantitative Reasoning; Muir: 1 course in Natural Sciences theme in "Math and Statistics"
UC San Francisco:
UC Santa Barbara:
General Education: Possible Area C and/or Quantitative Relationships after petition
Course Equivalence: Likely equivalent to CMPSC 40 after petition
UC Santa Cruz:
General Education: MF
I&C SCI 6B
More About The Course
Induction and Recursion: sequences, summations, regular and strong inductive proofs, recursive algorithms and analysis, solving linear homogeneous recurrence relations.
Number theory: modular arithmetic, prime factorizations, Euclid's algorithm, number representatino, fast exponentiation, the RSA cyrptosystem.
Combinatorics: sum product, and bijection rules, permutations, combinations, counting by complement, the inclusion-exclusion principle, permutations with repetitions, counting multisets, generating permutations and combinations, binomial coefficients and combinatorial identities.