# Data representation and boolean logic notes

## How does Boolean logic work?

In computing, the term Boolean means a result that can only have one of two possible values: true or false.

Boolean logic takes two statements or expressions and applies a logical operator to generate a Boolean value that can be either true or false.

To return the result, operators like AND, OR, NOT, etc. are used..

## How is data represented in the computer?

Data in a computer system is represented in binary format, as a sequence of 0s and 1s, denoting 'off' and 'on' states respectively.

The smallest component of this binary representation is known as a bit, which stands for 'binary digit'..

## What is Boolean logic in computer science notes?

Boolean logic is a form of algebra where variables are truth values and lie between 0 and 1.

It implies that all values are either true or false.

There are certain logical operations in Boolean algebra, such as conjunction and disjunction.

It is aimed at simple decision-making..

## What is data representation in computational thinking?

Data representation, a fundamental concept in computing, refers to the various ways that information can be expressed digitally.

The interpretation of this data plays a critical role in decision-making procedures in businesses and scientific research..

## What is data representation in short notes?

Data refers to the symbols that represent people, events, things, and ideas.

Data can be a name, a number, the colors in a photograph, or the notes in a musical composition.

Data Representation refers to the form in which data is stored, processed, and transmitted..

- Data Representation refers to the methods used to represent information stored in a computer.

Computers store lots of different types of information: discrete information like numbers and letters, or continuous information like sounds and images.

They use numeric codes to represent that data. - Equally important, Boolean logic is today seen as the foundations of the "information age," or what we also call the "computer age." This is because each "value" in these logical statements or equations reduces down to either being true or false, with zero ambiguity.

The logic is binary.

Rating 4.7 (249) 11 Computer Science-Data Representation -Notes1) Binary Number System. A Binary number system has only two digits that are 0 and 1.2) Octal number system.

### Boolean Algebra

1. Boolean Algebra was introduced by George Boole in 1854.
2. However, it is Claude Shannon ### de Morgan’s Law

The complement of the union of two sets is equal to the intersection of their complements and the complement of the intersection og two sets is ### Truth Table

1. A truth table is a chart of 1’s and 0’s, arranged to indicate the results of al…
2 ### Logic Circuits

1. A digital electronic circuit which is built up from certain elementary circ…
2 ### Logic Gates

1. Are elementary electronic circuits that performs basic logical function (Boo…
2 ## How do you represent a Boolean function?

0 = AB+C This function computes the logical AND of A and B and then logically ORs this result with C

If A=1, B=0, and C=1, then F 0 returns the value one (1•0 + 1 = 1)

Another way to represent a boolean function is via a truth table The previous chapter used truth tables to represent the AND and OR functions

Those truth tables took the forms:

## What is Boolean logic?

However, one important point must be made with respect to such cir- cuitry – any algorithm you can implement in software you can also implement directly in hard- ware

This suggests that boolean logic is the basis for computation on all modern computer systems

Any program you can write, you can specify as a sequence of boolean equations

Any logic with four truth values

In logic, a **four-valued logic** is any logic with four truth values.

Several types of four-valued logic have been advanced.

Inference rule in logic, proof theory, and automated theorem proving

In mathematical logic and automated theorem proving, **resolution** is a rule of inference leading to a refutation-complete theorem-proving technique for sentences in propositional logic and first-order logic.

For propositional logic, systematically applying the resolution rule acts as a decision procedure for formula unsatisfiability, solving the Boolean satisfiability problem.

For first-order logic, resolution can be used as the basis for a semi-algorithm for the unsatisfiability problem of first-order logic, providing a more practical method than one following from Gödel's completeness theorem.