• Discrete

     

    My email - dorrelr@gcsnc.com

     

     

     

     

     

    Welcome to Discrete Mathematics for Computer Science.  This SENIOR level math course focuses on math theories not covered in other courses.  This course aims to introduce discrete structures that are the backbone of computer science. Discrete mathematics is the study of mathematical structures that are countable or otherwise distinct and separable. The mathematics of modern computer science is built almost entirely on discrete mathematics, such as logic, combinatorics, proof, and graph theory. At most universities, an undergraduate-level course in discrete mathematics is required for students who plan to pursue careers as computer programmers, software engineers, data scientists, security analysts, and financial analysts. Students will be prepared for college-level algebra, statistics, and discrete mathematics courses. The course is divided into Set Theory, Graph Theory, Recursion, Matrix Operations, Combinatorics, Logic, and Number Theory. 

     

    There may be a Guilford County Final Exam (GCFE) for this course that counts as 20% of the Final Grade.