Discrete Maths

Description

Definition cards of key terms in Discrete Math module of Fundamentals of Computing module of Computer Science course.
Miki Rana
Flashcards by Miki Rana, updated more than 1 year ago
Miki Rana
Created by Miki Rana over 9 years ago
40
3

Resource summary

Question Answer
Reflexive When every element of R is related to itself e.g. R1={(1, 1), (1, 2), (2, 2), (2, 3), (3, 3)} on the set {1, 2, 3} but not {1, 2, 3, 4, 5}
Symmetric When (a, b) Є R and (b, a) Є R
Anti-Symmetric When (a, b) Є R and (b, a) isn't Є R
Transitive When (a, b), (b, c), (a, c) Є R
What is Domain, Codomain and Range?
Injective One-to-one relationship. Each mapping from A to B is unique and doesn't map onto an already mapped image
Surjective Every element of b Є B has an a Є A such that f(a) = b Also when codomain = range
Bijective Function which is injective and surjective. Basically one-to-one without any extra b's
Invertible The inverse function that assigns b Є B to a Є A Only possible if function is bijective
Proposition Declarative statement where it's either T or F, not both
Not Proposition Questions & Instructions because cannot assign a Truth Value -Are you Bob? -Drive slow
Negation Complement of set
Conjunction Intersection of set (AND)
Disjunction Union of set (OR)
Truth Table
Show full summary Hide full summary

Similar

Electronic Document Preparation Management
Cameolee Smith
Discrete Maths
Matthew Cheng
Sociology- Family and Households Flashcards
Heloise Tudor
Themes in Pride and Prejudice
laura_botia
Science Additional B3 - Animal and Plant Cells Flashcards
Stirling v
French Revolution quiz
Sarah Egan
Principios de Vuelo
Adriana Forero
Historical Context of The Handmaid's Tale
Summer Pearce
Salesforce Admin 201 Exam Chunk 6 (156-179)
Brianne Wright
1PR101 2.test - Část 9.
Nikola Truong