Discrete Maths

Descripción

Definition cards of key terms in Discrete Math module of Fundamentals of Computing module of Computer Science course.
Miki Rana
Fichas por Miki Rana, actualizado hace más de 1 año
Miki Rana
Creado por Miki Rana hace alrededor de 9 años
40
3

Resumen del Recurso

Pregunta Respuesta
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
Mostrar resumen completo Ocultar resumen completo

Similar

Electronic Document Preparation Management
Cameolee Smith
Discrete Maths
Matthew Cheng
LITERATURA MEDIEVAL
sanzjavier14
Mapa Conceptual - Ajedrez
Adrià Matoses
PRIMERA AUTORIDAD RESPONDIENTE
jhovanymunoz
Present Simple
Billy Yañez
Diseño experimental
Ahtziri Sequeira
TÁCTICA 1.1 HISTORIA Y TRADICIONES
antonio del valle
FACTORES QUE INTERVIENEN EN EL MARKETING
Juan Carlos Pimiento Lancheros
PRESENT SIMPLE 1
Silvia Francisco Llorente
ERLIJIOAK Prueba
Txemi López