Discrete Maths

Beschreibung

Definition cards of key terms in Discrete Math module of Fundamentals of Computing module of Computer Science course.
Miki Rana
Karteikarten von Miki Rana, aktualisiert more than 1 year ago
Miki Rana
Erstellt von Miki Rana vor etwa 9 Jahre
40
3

Zusammenfassung der Ressource

Frage Antworten
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
Zusammenfassung anzeigen Zusammenfassung ausblenden

ähnlicher Inhalt

Electronic Document Preparation Management
Cameolee Smith
Discrete Maths
Matthew Cheng
Französisch Zeitformen
Salome Guldener
A2 Konjunktiv Präteritum (hätte / wäre)
Anna Kania
Molekulare Genetik
Gökhan Yesilyayla
Wortschatz Französisch 1. Angaben zur Person
l_u_n_a_19
Vetie - Tierzucht & Genetik - S III
Fioras Hu
Bevölkerungssoziologie
Max H
Vetie: Virofragen 2015
Johanna Tr
MS-1.3 Foliensatz 6-7
Markus Voßmann
Reprospass 4
S J