Course Description

Discrete Mathematics for Computer Science, I&C SCI 6D

Syllabus(opens in a new tab) Notify me when available

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.

Key Information

Academic Calendar(opens in a new tab)

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.

UC Berkeley:
Unit Credit

UC Davis:
Unit Credit

UC Irvine:
General Education: Vb - Formal Reasoning

UC Los Angeles:
Unit Credit

UC Merced:
Unit Credit (see your Academic Advisor)

UC Riverside:
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; 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:
Unit Credit

UC Santa Barbara:
Course Equivalence: Likely equivalent to CMPSC 40 after petition
General Education: Possible Area C and/or Quantitative Relationships after petition

UC Santa Cruz:
General Education: MF

Prerequisites

I&C SCI 6B

More About The Course

Topics Covered: 

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.

Course Creator

Sandra Irani
Sandy Irani graduated with a degree in Electrical Engineering and Computer Science from Princeton University in 1986. She completed her PhD in Computer Science at University of California, Berkeley in 1991 and the following year was a recipient of the University of California President's Postdoctoral Fellowship. In the Fall of 1992, she joined the faculty of University of California at Irvine where she is currently a full professor. She served as chair of the Computer Science Department from 2005 to 2008. Her research has focused on the application of algorithm design and analysis to computing systems. In particular, she has specialized in the area of on-line algorithms and their applications to scheduling and resource allocation. In the last few years she has been working in Quantum Computation and Quantum Information Science. Sandy Irani graduated with a degree in Electrical Engineering and Computer Science from Princeton University in 1986. She completed her PhD in Computer Science at University of California, Berkeley in 1991 and the following year was a recipient of the University of California President's Postdoctoral Fellowship. In the Fall of 1992, she joined the faculty of University of California at ...

Sandy Irani graduated with a degree in Electrical Engineering and Computer Science from Princeton University in 1986. She completed her PhD in Computer Science at University of California, Berkeley in 1991 and the following year was a recipient of the University of California President's Postdoctoral Fellowship. In the Fall of 1992, she joined the faculty of University of California at Irvine where she is currently a full professor. She served as chair of the Computer Science Department from 2005 to 2008. Her research has focused on the application of algorithm design and analysis to computing systems. In particular, she has specialized in the area of on-line algorithms and their applications to scheduling and resource allocation. In the last few years she has been working in Quantum Computation and Quantum Information Science.

* To be notified, please provide all requested information
Please enter valid email.

We'll notify you when Discrete Mathematics for Computer Science, I&C SCI 6D becomes available

First Name:*
Last Name:*
Email:*
Term(s) you're interested in:*