Maria Jose Sierra Cordoba

9C

Informatica

2011

What is a Protoboard?
A breadboard (protoboard) is a construction
base for a one-of-a-kind electronic circuit, a
prototype. In modern times the term is commonly
used to refer to a particular type of breadboard,
the solderless breadboard (plugboard).Because
the solderless breadboard does not require
soldering, it is reusable, and thus can be used for temporary prototypes and
experimenting with circuit design more easily. Other, often historic,
breadboard types don't have this property. This is also in contrast to
stripboard (veroboard) and similar prototyping printed circuit boards, which
are used to build more permanent soldered prototypes or one-offs, and
cannot easily be reused. A variety of electronic systems may be prototyped by
using breadboards, from small analog and digital circuits to complete central
processing units (CPUs).The hole pattern for a typical etched prototyping
PCB (printed circuit board) is similar to the node pattern of the solderless
breadboards shown above.
What is a seven segment display?
A seven-segment display, or seven-segment
indicator, is a form of electronic display device
for displaying decimal numerals that is an
alternative to the more complex dot-matrix
displays. Seven-segment displays are widely used
in digital clocks, electronic meters, and other
electronic devices for displaying numerical
information.
What is a programmation language?
A programming language is an artificial language designed to express
computations that can be performed by a machine, particularly a computer.
Programming languages can be used to create programs that control the
behavior of a machine, to express algorithms precisely, or as a mode of
human communication.The earliest programming languages predate the
1

Maria Jose Sierra Cordoba

9C

Informatica

2011

invention of the computer, and were used to direct the behavior of machines
such as Jacquard looms and player pianos. Thousands of different
programming languages have been created, mainly in the computer field, with
many more being created every year. Most programming languages describe
computation in an imperative style, i.e., as a sequence of commands,
although some languages, such as those that support functional
programming or logic programming, use alternative forms of description.A
programming language is usually split into the two components of syntax
(form) and semantics (meaning) and many programming languages have
some kind of written specification of their syntax and/or semantics. Some
languages are defined by a specification document, for example, the C
programming language is specified by an ISO Standard, while other
languages, such as Perl, have a dominant implementation that is used as a
reference.
Examples:

Alphabetical

Generational
Categorical
Chronological
What is a truth table?
A truth table is a mathematical table used in logicspecifically in connection
with Boolean algebra, boolean functions, and propositional calculusto
compute the functional values of logical expressions on each of their
functional arguments, that is, on each combination of values taken by their
logical variables (Enderton, 2001). In particular, truth tables can be used to
tell whether a propositional expression is true for all legitimate input values,
that is, logically valid. Practically, a truth table is composed of one column for
each input variable (for example, A and B), and one final column for all of the
possible results of the logical operation that the table is meant to represent
(for example, A XOR B). Each row of the truth table therefore contains one
2

Maria Jose Sierra Cordoba

9C

Informatica

2011

possible configuration of the input variables (for instance, A=true B=false),

and the result of the operation for those values. See the examples below for
further clarification. Ludwig Wittgenstein is credited with their invention in the
Tractatus Logico-Philosophicus although Peirce and Jevons are suggested to
have been aware of them before.[1]
Truth table for all binary logical operators
Here is a truth table giving definitions of all 16 of the possible truth functions
of 2 binary variables (P,Q are thus boolean variables):

PQ0 1 2 3 4 5 6 7 8 9 1 1
0 1
TT FFFFFFFFTTT T
TF FFFFTTTTFFF F
FT FFTTFFTTFFT T
FF FTFTFTFTFTF T
where T = true and F = false.

1
2
T
T
F
F

1
3
T
T
F
T

1
4
T
T
T
F

1
5
T
T
T
T

Maria Jose Sierra Cordoba

9C

Informatica

2011