0% acharam este documento útil (0 voto)
8 visualizações9 páginas

Sis Num

sistemas

Enviado por

Teresa Oliveira
Direitos autorais
© All Rights Reserved
Levamos muito a sério os direitos de conteúdo. Se você suspeita que este conteúdo é seu, reivindique-o aqui.
Formatos disponíveis
Baixe no formato PDF, TXT ou leia on-line no Scribd
0% acharam este documento útil (0 voto)
8 visualizações9 páginas

Sis Num

sistemas

Enviado por

Teresa Oliveira
Direitos autorais
© All Rights Reserved
Levamos muito a sério os direitos de conteúdo. Se você suspeita que este conteúdo é seu, reivindique-o aqui.
Formatos disponíveis
Baixe no formato PDF, TXT ou leia on-line no Scribd

Sistema de Numerao Decimal

Dgitos Decimais:

0
1
2
3
4
5
6
7
8
9

SISTEMAS DIGITAIS
Mdulo 1

Sistema de Numerao Binrio


Este sistema o
utilizado pelos
computadores.

Dgitos Binrios:

0
1

1
2
4
8
16
32

26
27
28
29
210

100
101
102
103
104

1
10
100
1000
10 000

Sistema de Numerao Hexadecimal

Potncias de base 2

20
21
22
23
24
25

Potncias de base 10

64
128
256
512
1024

Dgitos Hexadecimal:

0
1
2
3
4
5
6
7
8
9

AB
CD
EF

Potncias de base 16

160
161
162
163
164

1
16
256
4096

65 536

SISTEMAS DE NUMERAO BINRIA E DECIMAL

SISTEMAS DE NUMERAO BINRIA E DECIMAL

Os computadores so formados por circuitos digitais

bit - unidade mnima de informao com que os

sistemas informticos trabalham

A informao e os dados so codificados em zeros (0) e


uns (1) .

Binary Digit
BIT

(0 , 1)

UNIDADE MNIMA DE INFORMAO

SISTEMAS DE NUMERAO BINRIA E DECIMAL

Binary Digit

Sistema de numerao binria utiliza combinaes


dos dgitos 0 e 1

Toda a informao que circula dentro de um sistema


informtico organizada em grupos de bits

Os mais frequentes so os mltiplos de 8 bits:

BIT

0 ,1

1 byte - 8 bits
1 Kbyte - 1024 bytes
1 Mbyte - 1024 Kbytes
1 Gbyte - 1024 Mbytes
1 Tbyte - 1024 Gbytes

8, 16, 32, etc.

SISTEMAS DE NUMERAO BINRIA E DECIMAL

1 Byte 8 bits 256 combinaes possveis

No sistema binrio (0 e 1), para determinar o


nmero de combinaes com n bits, basta calcular
2n

SISTEMAS DE NUMERAO BINRIA E DECIMAL

2 bit 22=4 combinaes possveis

0 0
0 1
1 0

Exemplos:
1 bit 21=2 combinaes possveis (0 e 1)

SISTEMAS DE NUMERAO BINRIA E DECIMAL

3 bit 23=8 combinaes possveis


0 0 0
0 0 1

1 1

SISTEMAS DE NUMERAO BINRIA E DECIMAL

4 bit 24=16 combinaes


possveis

0 0 0 0

0 0 0 1
0 0 1 0

0 1 0

0 0 1 1

0 1 1

0 1 0 0

1 0 0

0 1 0 1

1 0 1

0 1 1 0

1 1 0

. . . .

1 1 1

1 1 1 1

SISTEMAS DE NUMERAO BINRIA E DECIMAL

DECIMAL
0123456789
BINRIO
01

0
1
2
3
4
5
6
7
8
9

CONVERSES ENTRE BASES

Converso de decimal para binrio

0000
0001
0010
0011
0100
0101
0110
0111
1000
1001

Efectuar divises sucessivas por 2 at se obter o quociente 1


Agrupar o ltimo quociente e todos os restos da diviso
encontrados por ordem inversa.

Exemplo:

20 2
0 10 2
0 5 2
1 2 2
0 1

CONVERSES ENTRE BASES

20(10) = 10100(2)

CONVERSES ENTRE BASES

Converses Decimal Binrio

Converso de binrio para decimal


a)

b)
c)

1987
375
1234

Comeando a ler o nmero da direita para a esquerda:


- Primeiro digito representa a potncia de base 2 e expoente 0;
- Segundo digito representa a potncia de base 2 e expoente 1;
- Terceiro digito representa a potncia de base 2 e expoente 2;
- nsimo digito representa a potncia de base 2 e expoente n-1;

Somar as multiplicaes parciais efectuadas entre o dgito e a


potncia a ele atribuda

CONVERSES ENTRE BASES

CONVERSES ENTRE BASES

Converses Binrio- Decimal

a) 1101000
b) 10001111
c) 11110011

Converso de binrio para decimal

Exemplo:

10100(2) = 20(10)

1 x 24 + 0 x 23 + 1 x 22 + 0 x 21 + 0 x 20
16

0 = 20(10)

CONVERSES ENTRE BASES

CONVERSES ENTRE BASES

Tabela de correspondncia
Base 16

Base10

Base 8

0
1
2
3
4
5
6
7
8
9
A
B
C
D
E
F

0
1
2
3
4
5
6
7
8
9

0
1
2
3
4
5
6
7

8= 23
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

Base Binria
4= 22
2= 21
0
0
0
0
0
1
0
1
1
0
1
0
1
1
1
1
0
0
0
0
0
1
0
1
1
0
1
0
1
1
1
1

Converso Binrio para Octal


1= 20
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1

23 = 8

Passo 1: dividir o nmero binrio em grupos de 3 bits (da direita para a


esquerda)

Passo 2: tratar cada grupo como um nmero independente e


converter em dgitos decimais usando a tabela de correspondncia

CONVERSES ENTRE BASES

CONVERSES ENTRE BASES

Converso Binrio para Hexadecimal

Converso Octal para Binrio

24 = 16

Inverter os passos

Passo 1: dividir o nmero binrio em grupos de 4 bits (da direita para a


esquerda)

Passo 2: tratar cada grupo como um nmero independente e converter


em dgitos decimais usando a tabela de correspondncia.

Passo 3: substituir todos os nmeros decimais maiores que 9 pelas suas


respectivas representaes em hexadecimal

Converso Binrio para Octal

Exemplo:
1 0 1 0 1 1 2 53 8
5

CONVERSES ENTRE BASES

CONVERSES ENTRE BASES

Converso Hexadecimal para Binrio

Inverter os passos

Converso Binrio para Hexadecimal

Exemplo:
1

0010

1 (2) 2B (16)

Exerccios:

Qual o valor octal de 1110001 (2)?

Qual o valor binario de 740 (8)?

Qual o valor hexadecimal de 1110001 (2)?

Qual o valor binrio de 2AF01 (16)?

; 1011

26

Aritmtica Binria

Adio binria

Fazer as contas coluna a coluna, da direita para a esquerda, fazendo


o transporte de um (<e vai um>) quando for o caso
Operaes bsicas:

Operaes Aritmticas Binrias

Aritmtica Binria
Exercicios - Adio binria

1010+101

111+101

1111+111+11

Exemplos

1 1
101
+1101
10 010

11
11001
+10011
101 100

Aritmtica Binria

0+0=0
0+1=1
1+0=1
1 + 1 = 0 (1 mais 1 igual a 0 e vai 1)

Subtrao binria

Fazer as contas coluna a coluna, da direita para a esquerda, fazendo o


transporte de um (<e vai um>) quando for o caso
Operaes bsicas:

0-0=0
0 - 1 = 1 ( 0 menos1 igual a 1 e vai 1)
1-0=1
1-1=0

Exemplos
1
110
-101
001

1
1110
- 0101
100 1

Aritmtica Binria

Aritmtica Binria

Exercicios - Subtrao binria

Subtrao Binria - Mtodo do Complemento para 2

1101 - 1010

1111 - 0101

Complemento para 2 transforma um nmero positivo em negativo


Para realizar o complemento de dois

Nmero de dgito dos operandos devem ser o mesmo


Trocar os uns pelos zeros e vice-versa e adicionar um ao resultado
0101001 (41d) 1010110+1 = 1010111

Exemplo: 1 1 1 0 1 0 1
1. Completa-se o nmero de dgitos do diminuidor: 0101

Aritmtica Binria
Exercicios - Mtodo do Complemento para 2

1 0 01 1 - 0 1 1 1 0

1010 + 1=1011

3. Soma-se os dois operandos

1110 + 1011 = 11001

4. Despreza-se o transporte final:

1001

Aritmtica Binria

2. Inverter os digitos e adicionar um ao resultado:

Multiplicao

Semelhante multiplicao decimal

exceto pelo fato da soma final dos produtos se fazer em binrio


Operaes bsicas:

1 1 0 1 1 0 - 1 10

0x0=0
0x1=0
1x0=0
1x1=1

Exemplos:

1011 x 1101

Aritmtica Binria

Aritmtica Binria

101 x 100

110 x 101

011 x 011

Aritmtica Binria

Exercicios - Multiplicao binria

Diviso
Pode ser feita de maneira idntica diviso decimal

exceto pelo fato das multiplicaes e subtraes internas ao processo


serem feitas em binrio

Exemplos: 1 1 0 1 1 : 101

Aritmtica Binria

Diviso

Exercicios - Diviso binria

Exemplos: 1 0 1 0 1 0 1 : 101

11010 : 100

11000 : 111

11100101 : 1101

Common questions

Com tecnologia de IA

Converting decimal to binary involves dividing the decimal number repeatedly by 2 and recording remainders, then reading them in reverse order to form the binary equivalent . Conversely, to convert binary to octal, the binary number is grouped into sets of three digits from right to left, each group converted to its octal number based on the powers of 2, and these octal numbers concatenated . Each conversion serves distinct roles: decimal-to-binary is crucial for encoding human-readable numbers into machine-readable format, while binary-to-octal facilitates error checking and simplification, as octal representation reduces the length of binary codes by a third. This compression aids in debugging and simplifies calculations in system architectures.

The mathematical principle for converting decimal to binary is based on dividing the decimal number by 2 and tracking remainders, which represent binary digits starting from the least significant bit (LSB) to the most significant bit (MSB). Continued division until the quotient reaches 0 exemplifies how base 10 numbers utilize powers of 2 to form binary equivalents . Each division step correlates to an respective power of 2 (binary place value), illustrating binary's representation by constructing numbers from binary place values combined additively.

Binary multiplication can be challenging due to its reliance solely on 0 and 1, limiting flexibility found in decimal systems which use digits 0-9 . First, the binary system necessitates frequent 'carry over' operations as every addition beyond 1 results in a binary 'carry'. Second, the multiplied results require subsequent summation in binary form, often lengthening the calculation and increasing the chance of error if not systematically aligned . These factors complicate binary multiplication compared to decimal counterparts, where multipliers are handled with greater ease and precision, leveraging a wider numeric range.

The binary numbering system is crucial in computing because computers operate using binary digits (bits), which are the smallest units of data. In computing, all data is represented in binary form, using only 0s and 1s . Binary numbers can be converted to decimal and other numeral systems. The conversion between binary and decimal systems, for instance, involves interpreting each binary digit as a power of two and summing these values to get a decimal equivalent . This process is essential for interfacing with human-readable formats. Similarly, binary can be converted to hexadecimal by grouping binary digits into sets of four, which simplifies representation and verification processes .

Two's complement facilitates binary subtraction by allowing addition processes to handle subtractions, simplifying circuit design. Acknowledge a number's negative as flipping all bits and adding one, which efficiently manages positive and negative integers in computation without separate subtraction operations. This method enhances uniformity, as the same hardware can manage addition and subtraction . Two's complement is preferred as it elegantly handles overflow and provides a broader range for representation of negative numbers, accommodating easier arithmetic operations in binary systems.

The conversion from binary to hexadecimal consists of dividing the binary number into groups of four digits (bits) from right to left and converting each group to its hexadecimal equivalent using a mapping table . Hexadecimal notations are preferable in computer science for memory addresses, color codes in web design, and assembly language coding, as they compress binary data significantly, making complex patterns easier to read, understand, and debug. Hexadecimal representation requires fewer digits, reducing error potential in manual processing and aiding effective communication among systems engineers and software developers.

Converting between octal and binary involves treating each octal digit as an independent entity and converting it into a group of three binary digits (bits). This alignment emerges from octal's base-8 system directly mapped to binary's base-2 grouping (2^3=8), facilitating straightforward transformations. These strategies highlight the close mathematical relationship between numeral systems, illustrating base powers' role in systematic conversions—particularly seen in group-based manipulations reflecting multiples of smaller, common bases.

Hexadecimal and octal systems significantly enhance digital technology by improving readability and reducing error rates. Hexadecimal compresses binary representation into four-digit groups enabling concise memory addressing, machine language simplification, and efficient data representation in systems programming due to its compact format . Octal accomplishes similar compression with three-digit groups, often employed in Unix file permissions, making human-readable expressions easier to interpret and manage compared to verbose binary . These systems refine direct system interaction, easing debugging and code comprehension, illustrating them as bridges simplifying complex base-2 computations for human interaction, while retaining precision essential for computational accuracy.

Data storage hierarchy begins at the bit, the smallest unit, signifying binary computation where data is represented in 0s and 1s . One byte consists of 8 bits and can represent 256 combinations, reflecting 2^8 possibilities . Larger data units build on this, with kilobytes (1 KB = 1024 bytes), megabytes (1 MB = 1024 KB), gigabytes (1 GB = 1024 MB), and terabytes (1 TB = 1024 GB). Each step in this hierarchy involves multiplication by 1024, aligning with binary systems using base-2 exponentiation, indicative of binary computational needs where storage scales exponentially with data complexity.

Binary arithmetic simplifies operations by using only two digits, 0 and 1. In binary addition, similar to decimal, the operation is performed digit by digit, right to left, carrying over any excess beyond the digit range (1 in binary equates to a carry of 1 if the sum is 10 binary). In binary subtraction, the concept of borrowing is similar, but is complicated by only having two digits, requiring a specific rule: 0 - 1 equals 1 with a borrow (or 'go one'). Subtraction can also be performed using the two's complement method, where numbers are negated by inverting the digits and adding one, allowing addition to be used instead of subtraction . These operations are fundamental for computing as binary forms the basis of machine-level calculations.

Você também pode gostar