Discrete Math Review Flashcards

(48 cards)

1
Q

is a branch of mathematics that
assumes only distinct separated values.

A

DISCRETE MATHEMATICS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

WHY DO WE NEED TO STUDY DISCRETE MATH?

A

Mathematical language of computer science

Develops mathematical reasoning by learning
propositional logic and different method of proof

▪ Gateway to more advanced courses in all parts of
mathematical science

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

or the building up of
machines made up of
electronic devices that
behave logically through
Boolean operations is
based on logic.

A

HARDWARE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

side, database management
systems, programming
languages and artificial
intelligence are based on logic.

A

SOFTWARE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

is the study of reasoning.

It focuses on the relationship among statements and not on the content of the statements.

Its building blocks are called propositions.

A

LOGIC

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

are propositions that are assumed
to be true.

A

AXIOMS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

are statements used to
create new concepts in terms of existing ones

A

DEFINITIONS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

is a proposition that has been
proven to be true.

A

THEOREM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

is a theorem that is useful in
proving another theorem

A

LEMMA

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

It is a statement that
follows with little or no proof required from an
already proven statement

A

COROLLARY

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

is a sequence of statements. The
statements are arguments that establishes the
truth value of a proposition

A

PROOF

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

A number is equal to itself

A

REFLEXIVE AXIOMS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

follows Euclid’s Common Notion
One: “Things equal to the same thing are equal to each
other.

A

Axiom of Equality

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

which states that every polynomial equation over the field
of complex numbers of degree higher than 1 has a
complex solution or using a formula: P(x) = anxn + … +
a1x + a0 = 0

A

FUNDAMENTAL THEOREM OF ALGEBRA

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

is a declarative sentence that is either true or false but not both. The area of logic that deals with this is called the propositional logic.

A

PROPOSITION

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

is a tool for the analysis of proof. The truth or falsehood of a proposition is called its
truth value.

A

LOGIC

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

can only have two
truth values.

A

TRUTH VALUE

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Propositions, the truth value of which cannot be immediately determined is a

A

PROPOSITIONAL FUNCTION.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

stand for (and can be replaced by) elements from
their DOMAIN.

A

Variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

The domain is often denoted by

A

U (the UNIVERSAL).

21
Q

are formed from existing propositions
using logical operators.

A

COMPOUND PROPOSITIONS

22
Q

Logical multiplication/AND operation.

All propositions must
be true so that the
compound proposition
to be TRUE

A

CONJUNCTION ^

23
Q

Logical addition /OR operation

Only one true value is
needed to make the
compound proposition
TRUE

A

DISJUNCTION v

24
Q

not operation / inversion

Operator reverses the
truth value of the
proposition

25
a diagram in rows and columns showing how the truth or falsity of a proposition varies with that of its components.
TRUTH TABLE
26
proposition p is called the antecedent or hypothesis proposition q is called the consequent or conclusion
CONVERSE if q, then p q → p
27
proposition p is called the antecedent or hypothesis proposition q is called the consequent or conclusion
CONTRAPOSITIVE If not q, then not p ¬q → ¬p
28
p if and only if q p is equivalent to q
BI-CONDITIONAL
29
also known as deductive logic or logical deduction is the process of reasoning from one or more statements (premises) to reach a logically certain conclusion.
DEDUCTIVE REASONING,
30
Puzzles that can be solved using logical deduction are LOGIC PUZZLES also known as
QUIZZLES
31
is one in which the present state of the combination of the logic inputs decides the output
COMBINATIONAL LOGIC CIRCUIT
32
comprises of input, logic gates and output variables.
COMBINATIONAL CIRCUIT
33
means combining two or more logic gates to form a required function where the output at a given time depends only on the input.
COMBINATIONAL LOGIC
34
keystone of modern electronics. HEART and BRAINS of most circuits.
INTEGRATED CIRCUIT (IC)
35
are fundamental building blocks of a combinational circuit. are electronic circuits that implement the basic functions of Boolean Algebra.
LOGIC GATES
36
is a symbol with two possible values 0 and 1. can be used to represent truth values either true or false.
BIT
37
Information is usually represented using ___________ which are lists of zeroes and ones. It is series of zero or more bits.
BIT STRING
38
is the number of bits in the string.
LENGTH OF THE STRING
39
is a branch of algebra in which the values of the variables are truth values usually denoted 0 and 1. It is used to analyze and simplify the digital (logic) circuits.
BOOLEAN ALGEBRA
40
It was named after (BOOLEAN ALGEBRA)
GEORGE BOOLE
41
adapted by (BOOLEAN ALGEBRA)
CLAUDE SHANON
42
are found in computer, cell phones, cars, televisions, wrist watches and other devices.
DIGITAL CIRCUITS
43
are used to implement digital circuits.
LOGIC GATES
44
represent logical values. Because of this, it’s possible to combine the basic building blocks of a digital circuit using just the rules of logic.
DIGITAL CIRCUITS
45
This forms the algebraic expression showing the operation of the logic circuit
BOOLEAN ALGEBRA.
46
This forms the table showing the operation of the logic circuit
TRUTH TABLE.
47
This is a graphical representation of a logic circuit that shows the wiring and connections of each individual logic gate,
LOGIC DIAGRAM.
48
It is a table representation but gives more information than a table.
K-MAP