Scribd
Upload
3 views9 pages

Operaciones en Números Octales y Binarios

The document discusses binary number arithmetic and conversion between number bases. It contains code for adding numbers in octal, and recursively converting decimal numbers to binary, octal and hexadecimal. Functions are defined to perform addition of octal numbers, and to convert a decimal number to binary, octal and hexadecimal through recursive calls.

Uploaded by

Lector Pross
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views9 pages

Operaciones en Números Octales y Binarios

The document discusses binary number arithmetic and conversion between number bases. It contains code for adding numbers in octal, and recursively converting decimal numbers to binary, octal and hexadecimal. Functions are defined to perform addition of octal numbers, and to convert a decimal number to binary, octal and hexadecimal through recursive calls.

Uploaded by

Lector Pross
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

SUMA, RESTA, MULTIPLICACION Y DIVISION EN NUMEROS

BINARIOS
package programa;

import [Link];

public class Programa {

static int a, b;

public static void main(String[] args)

Scanner leer = new Scanner([Link]);

[Link]("Introduzca el primer octal");

String valor = [Link]();

try

int valord = [Link](valor, 8 );

catch (NumberFormatException e)

[Link]("El primer número debe ser octal");

[Link]("Introduzca el segundo octal");

String valorb = [Link]();

try

{
int valordb = [Link](valorb, 8 );

catch (NumberFormatException e)

[Link]("El segundo número debe ser octal");

String res = "";

int val;

int mayor = [Link]() > [Link]() ? [Link]() : [Link]();

int acarreo = 0;

boolean seguir = true;

for (int cont = mayor-1; cont >= 0; cont--)

val = 0;

try

a = [Link]([Link](cont));

catch (StringIndexOutOfBoundsException e)

a = 0;

seguir = false;

try

b = [Link]([Link](cont));
}

catch (StringIndexOutOfBoundsException e)

b = 0;

seguir = false;

val = a + b;

if (acarreo > 0)

val += acarreo;

acarreo = 0;

if (val >= 10)

acarreo = val/10;

if (val > 7)

val -= 8;

res += val;

if (!seguir)

if (val > 0) res += val;

else if (acarreo > 0) res += val;


}

res = new StringBuffer(res).reverse().toString();

[Link](res);

SUMA DE NUMEROS EN SISTEMA OCTAL


package programa;

import [Link];

public class Programa {

static int a, b;

public static void main(String[] args)

Scanner leer = new Scanner([Link]);

[Link]("Introduzca el primer octal");

String valor = [Link]();


try

int valord = [Link](valor, 8 );

catch (NumberFormatException e)

[Link]("El primer número debe ser octal");

[Link]("Introduzca el segundo octal");

String valorb = [Link]();

try

int valordb = [Link](valorb, 8 );

catch (NumberFormatException e)

[Link]("El segundo número debe ser octal");

String res = "";

int val;

int mayor = [Link]() > [Link]() ? [Link]() : [Link]();

int acarreo = 0;

boolean seguir = true;

for (int cont = mayor-1; cont >= 0; cont--)

val = 0;

try

a = [Link]([Link](cont));
}

catch (StringIndexOutOfBoundsException e)

a = 0;

seguir = false;

try

b = [Link]([Link](cont));

catch (StringIndexOutOfBoundsException e)

b = 0;

seguir = false;

val = a + b;

if (acarreo > 0)

val += acarreo;

acarreo = 0;

if (val >= 10)


acarreo = val/10;

if (val > 7)

val -= 8;

res += val;

if (!seguir)

if (val > 0) res += val;

else if (acarreo > 0) res += val;

res = new StringBuffer(res).reverse().toString();

[Link](res);

}
Convertir decimal a binario, octal y hexadecima
import [Link];
public class Ejemplo1
{
public static void main(String[]args){
Scanner leer = new Scanner([Link]);
[Link]("Ingrese una cifra: ");
int cifra = [Link]();
[Link]("\nbinario:\t");
binario(cifra);
[Link]("\noctal:\t\t");
octal(cifra);
[Link]("\nHexadecimal:\t");
hexadecimal(cifra);

//SE IMPLEMENTA UN METODO RECURCIVO PARA TRANSFORMARA A BINARIO LA


CIFRA
public static void binario(int N){
if(N == 1) [Link]("1");
else{
binario(N/2);
[Link](N%2);
}
}

//SE IMPLEMENTA UN METODO RECURCIVO PARA TRANSFORMARA A OCTAL LA CIFRA


public static void octal(int N){
if(N < 8) [Link](N);
else {
octal(N/8);
[Link](N%8);
}
}

//SE IMPLEMENTA UN METODO RECURCIVO PARA TRANSFORMARA A HEXADECIMAL LA


CIFRA
public static void hexadecimal(int N){
if(N < 16){
if(N == 10) [Link]("A");
if(N == 11) [Link]("B");
if(N == 12) [Link]("C");
if(N == 13) [Link]("D");
if(N == 14) [Link]("E");
if(N == 15) [Link]("F");
if(N < 10) [Link](N);
}
else{
hexadecimal(N/16);
[Link](N%16);
}
}
}

You might also like