Nov 23, 2024  
2015-2016 HillBook (Class of 2019) 
    
Catalog Navigation
  Hill Book Home
  Mission and History
  Academic Life & the Curriculum
  Academic Partnerships & Resources
  International and Experiential Learning Programs
  Academic Policies and Procedures
  The Cornerstone Program of General Education
  Programs of Study
  Course Descriptions
  Admission Requirements
  Financial Information and Scholarships
  Faculty and Staff Listing
  Archived HillBook Catalogs
HELP
2015-2016 HillBook (Class of 2019) [ARCHIVED HILL BOOK]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CSC 201 - Discrete Mathematics For Computer Science I

Three Credits
Fall Semester

Discrete mathematical models for applications in computer science. Mathematical induction, graphs, trees, sets, equivalence relations, functions, and partially ordered sets. Asymptotic complexity, Big-O, and Big Omega, recursion and recurrence equations, finite and infinite sums. Predicate logic and first order logic. Basic counting methods, simple combinatorics. Probability and Markov Chains. Linear algebra, applications of linear algebra in computer science.

Prerequisite(s): MTH 126 , CSC 104 .


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)