Fundamentals Of Computing an der University Of Newcastle-upon-Tyne | Karteikarten & Zusammenfassungen

Lernmaterialien für Fundamentals of Computing an der University of Newcastle-upon-Tyne

Greife auf kostenlose Karteikarten, Zusammenfassungen, Übungsaufgaben und Altklausuren für deinen Fundamentals of Computing Kurs an der University of Newcastle-upon-Tyne zu.

TESTE DEIN WISSEN

What does commutative mean?

Lösung anzeigen
TESTE DEIN WISSEN

It doesn't matter which way round we write the arguments

Lösung ausblenden
TESTE DEIN WISSEN

What is the domain and how is it denoted?

Lösung anzeigen
TESTE DEIN WISSEN

The domain is the set of input elements X and is denoted dom f.

Lösung ausblenden
TESTE DEIN WISSEN

What is the codomain and how is it denoted?

Lösung anzeigen
TESTE DEIN WISSEN

The codomain is the set of output elements Y and is denoted cod f.

Lösung ausblenden
TESTE DEIN WISSEN

What is an injective function?

Lösung anzeigen
TESTE DEIN WISSEN

An injective function is a function which maps each input element to a different result value.

Lösung ausblenden
TESTE DEIN WISSEN

What is the identity rule?

Lösung anzeigen
TESTE DEIN WISSEN

A Union with an empty set equals A

Lösung ausblenden
TESTE DEIN WISSEN

What are the two ways you can define a relation?

Lösung anzeigen
TESTE DEIN WISSEN

1) Property - state the property that defines when the relation is true

2) Subset - define the actual subset of elements the relation is true for

Lösung ausblenden
TESTE DEIN WISSEN

What does reflexive mean?

Lösung anzeigen
TESTE DEIN WISSEN

The relation is reflexive is R(x,x) holds for every value of x that is in A

Lösung ausblenden
TESTE DEIN WISSEN

What does symmetric mean?

Lösung anzeigen
TESTE DEIN WISSEN

A relation is symmetric if whenever R(x,y) holds, R(y,x) also holds for any x,y in A.

Lösung ausblenden
TESTE DEIN WISSEN

What does transitive mean?

Lösung anzeigen
TESTE DEIN WISSEN

A relation is transitive if whenever R(x,y) and R(y,z) hold, R(x,z) also holds for any x,y,z in A.

Lösung ausblenden
TESTE DEIN WISSEN

What is a function?

Lösung anzeigen
TESTE DEIN WISSEN

A rule for mapping elements between two sets.

Lösung ausblenden
TESTE DEIN WISSEN

How many rows will a truth table have if there are n propositions?

Lösung anzeigen
TESTE DEIN WISSEN

The truth table will have 2^n rows

Lösung ausblenden
TESTE DEIN WISSEN

What is a tautology?

Lösung anzeigen
TESTE DEIN WISSEN

A tautology is a propositional formula that always evaluates to true regardless of the values given to its propositions.

Lösung ausblenden
  • 164 Karteikarten
  • 92 Studierende
  • 0 Lernmaterialien

Beispielhafte Karteikarten für deinen Fundamentals of Computing Kurs an der University of Newcastle-upon-Tyne - von Kommilitonen auf StudySmarter erstellt!

Q:

What does commutative mean?

A:

It doesn't matter which way round we write the arguments

Q:

What is the domain and how is it denoted?

A:

The domain is the set of input elements X and is denoted dom f.

Q:

What is the codomain and how is it denoted?

A:

The codomain is the set of output elements Y and is denoted cod f.

Q:

What is an injective function?

A:

An injective function is a function which maps each input element to a different result value.

Q:

What is the identity rule?

A:

A Union with an empty set equals A

Mehr Karteikarten anzeigen
Q:

What are the two ways you can define a relation?

A:

1) Property - state the property that defines when the relation is true

2) Subset - define the actual subset of elements the relation is true for

Q:

What does reflexive mean?

A:

The relation is reflexive is R(x,x) holds for every value of x that is in A

Q:

What does symmetric mean?

A:

A relation is symmetric if whenever R(x,y) holds, R(y,x) also holds for any x,y in A.

Q:

What does transitive mean?

A:

A relation is transitive if whenever R(x,y) and R(y,z) hold, R(x,z) also holds for any x,y,z in A.

Q:

What is a function?

A:

A rule for mapping elements between two sets.

Q:

How many rows will a truth table have if there are n propositions?

A:

The truth table will have 2^n rows

Q:

What is a tautology?

A:

A tautology is a propositional formula that always evaluates to true regardless of the values given to its propositions.

Fundamentals of Computing

Erstelle und finde Lernmaterialien auf StudySmarter.

Greife kostenlos auf tausende geteilte Karteikarten, Zusammenfassungen, Altklausuren und mehr zu.

Jetzt loslegen

Die all-in-one Lernapp für Studierende

Greife auf Millionen geteilter Lernmaterialien der StudySmarter Community zu
Kostenlos anmelden Fundamentals of Computing
Erstelle Karteikarten und Zusammenfassungen mit den StudySmarter Tools
Kostenlos loslegen Fundamentals of Computing