In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. As a normal form, it is useful in automated theorem proving.
Brown University
Spring 2023
CSCI 0220 provides a foundation in discrete math and probability theory. Key topics include logic, set theory, number theory, combinatorics, graph theory, and probability. No prior math background assumed. Aims to develop problem solving, communication, and collaboration skills. Introduces new concepts and ways of thinking to enable analyzing problems arising in computer science. Beginner-friendly introduction to core mathematical concepts underlying many aspects of CS.
No concepts data
+ 26 more concepts