Recommended Books :
1. H.F. Mattson, Jr. (1993). Discrete Mathematics with Applications. John Wiley & Sons, Inc. New York.2. Michael O. Albertson and J. Hutchinson (1988). Discrete Mathematics with Algorithms. John Wiley & Sons. Singapore.
BSCS-411: Discrete Mathematics
By Miss Saima Ashraf
Discrete mathematics focuses on mathematical structures that are distinct and separate, rather than continuous. It is a foundational course for computer science, covering topics such as logic, set theory, graph theory, combinatorics, and algorithms. Discrete mathematics provides the theoretical groundwork for understanding algorithms and computational processes.
Course Outline
Find the comprehensive outline of our course curriculum as directed by the university.
View OutlineCourse Documents
Centralized access to all the documents and resources provided by our course instructors.
View Docs