Fast review mode: answers are shown by default so you can skim quickly. Hide them if you want to self-test.
Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Topics studied in discrete mathematics include integers, graphs, and statements in logic. Discrete structures can be finite or infinite.
Other useful Discrete math topics (for Computer Science) include number bases, mathematical induction, sets, relations, functions, congruence, recursion, combinations and permutations, probability, graphs, trees, logic, Boolean algebra, and proof techniques.
Discrete mathematics has numerous uses in computer science. It is often used in programming languages, software development, cryptography, algorithms etc. It includes various topics such as graph theory, set theory, probability theory, etc.
Join 4M+ learners. Unlock unlimited quizzes, wrong-answer tracking, flashcards + reminders, study guides, and 1-on-1 challenges.