All categories

3 years ago

-Convert the 1's complement 10111010 to decimal

Computers and Technology

2 answers:

OLEGan [10]3 years ago

8 0

Answer:

the first compliment of 01000101 is 69

Explanation:

given,

binary numbers - 10111010

so first compliment of the binary numbers

1st compliment of binary number = 01000101

now conversion of 1st compliment into decimal

01000101 = 0 × 2⁷ + 1 × 2⁶ + 0 × 2⁵ + 0 × 2⁴ + 0 × 2³ +1 × 2² + 0 × 2¹ + 1 × 2⁰

= 1 × 2⁶ + 1 × 2² + 1 × 2⁰

= 64 + 4 + 1

= 69

the first compliment of 01000101 is 69

frez [133]3 years ago

7 0

Answer:

Explanation:

We are given a 1's complement of a number.So to convert it to the original number we have again take the 1's complement of the given 1's complement to convert it to the original number.We can do that by converting all 0's to 1's adn all 1's to 0's.

1's complement= 10111010

original number=01000101

Then to convert the binary number to the decimal number we have multiply each bit with the respective exponent of 2.The exponent of the LSB is 0 and it increases as we move to MSB by 1.

So the calculations are as following:-

(01000101)₂ = (0 × 2⁷) + (1 × 2⁶) + (0 × 2⁵) + (0 × 2⁴) + (0 × 2³) + (1 × 2²) + (0 × 2¹) + (1 × 2⁰) = (69)₁₀

You might be interested in

2. The factorial of a positive integer n is the product of the integers from 1 to n. You can express the factorial of a positive

Molodets [167]

Answer:

import java.io.*;

import java.util.Scanner;//importing the scanner.

class Factorial {

public static void main (String[] args) {

Scanner fact=new Scanner(System.in);//creating a scanner object for taking the input.

int t,n;//t for number of times the user want to calculate the factorial and n for factorial.

System.out.println("How many times you want to calculate the factorial");

t=fact.nextInt();//taking input of t.

while(t>0)

{

int f=1;//f for calculating the variable.

n=fact.nextInt();//taking input of n .

if(n>10||n<1)//if n is out of range then again taking input.

{

while(n>10 || n<1)

{

System.out.println("Please Enter the Valid Input");

n=fact.nextInt();

}

for(int i=1;i<=n;i++)//calculating the factorial.

{

f*=i;

}

System.out.println("The factorial is: "+ f);

}

else // if n is in range then definitely calculating the factorial.

{

for(int i=1;i<=n;i++)// calculating the factorial.

{

f*=i;

}

System.out.println("The factorial is: "+ f);

}

Output:-

How many times you want to calculate the factorial

-5

Please Enter the Valid Input

The factorial is: 24

The factorial is: 120

Explanation:

The above written code is for calculating the factorial of an integer the number of times user want to calculate the factorial.The code wants user to enter again until the value entered by the user is in range.If the value is in range then it definitely calculates the factorial.

6 0

3 years ago

A certain program takes 26.67 seconds to run on 3 processors and 16 s to run on 7 processors. Find the execution time on one pro

brilliants [131]

Answer:

The explanation for the question is listed in the section below on Explanation.

Explanation:

The time needed for a program to execute in 26.67 seconds on 3 processors. Time expected to run the program, therefore, should be as follows:

The time to run on one processor = $\frac{26.67}{3}$ = 8.89 seconds.

The time needed for a program to execute in 26.67 seconds on 7 processors, should be:

Time = $\frac{16}{7}$ = 2.2857 seconds.

Whenever the amount of processors increases the performance or speed should increase.

The time is taken in percentage = $\frac{26.67}{16}$ ×100% = 170 %

As the number of processors increases from 3 to 7, the time required according to each processor increases by 70%.

In one processor the execution time should be as follows:

26.67+(26.67×0.7) = 45.339

= 45 seconds

Therefore. the execution period for a single processor is about 45 seconds.

The work is performed in parallel, whereas the program is already being parallelized. The overall function ought to be shared between the processor. The time is shortened to around half. Hence the duration taken will be 8 seconds after parallelization.

Theoretical execution time would be Tp > T infinity.

Thus, T infinity<45

The theoretical processing interval on processor count P1/2 would therefore be less than 8 seconds. Because, the time required during parallelization was just that.

5 0

3 years ago

(2) Design pseudocode for a program that accepts numbers from the user until the special number 555 is entered (you should use a

elena-s [515]

Answer:

Pseudocode is explained below

Explanation:

# Create a variable to count the numbers.

numberOfNumbers = 0

# Create a variable to store the sum of numbers.

sumOfNumbers = 0

# Create a constant to store the special numbers.

constant specialNumber = 222

# Start the loop.

while True:

{

# Prompt the user to enter a number.

num = input("Enter a number: ")

# Break the loop if the number is

# equal to the special number.

if num == 222:

{

break

}

# Otherwise, add the number in the current

# sum and increment the number of values.

else:

{

sumOfNumbers = sumOfNumbers + num

numberOfNumbers = numberOfNumbers + 1

}

# Display the values.

print("The number of numbers = ", numberOfNumbers)

print("The sum of numbers = ", sumOfNumbers)

7 0

3 years ago

A network administrator enters the command ipv6 router ospf 110 in global configuration mode. What is the result of this command

Zepler [3.9K]

Answer:

The OSPFv3 AS number will be assigned an ID of 110

Explanation:

If we don't have ipv4 addressing previously, we are going to assign the router-id manually.

We are going to receive a message about the assignation manually.

We can assign a router-id with the next line:

#router-id 1.1.1.1

If we already have the ipv4 addressing, the router going to assign the router-id automatically.

4 0

4 years ago

Which of the following is not included in the manufacturing industry cluster?

max2010maxim [7]

Printing is not included in the manufacturing industry cluster

6 0

3 years ago

Read 2 more answers