Apr 25, 2024  
2010-2011 HillBook (Class of 2014) 
    
Catalog Navigation
  Hill Book Home
  Letter from the President
  Mission and History
  Campus Contacts and Resources
  Academic Calendar 2010-2011
  The Curriculum
  The Cornerstone Program of General Education
  Programs of Study
  Course Descriptions
  Academic Policies and Procedures
  Admissions
  Financial Information and Scholarships
  Student Life
  Community Standards and College Policies
  Faculty and Staff Listing
HELP
2010-2011 HillBook (Class of 2014) [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 and Spring Semesters

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)