Please solve faster using java1 (csci 250) Problem #1: [25 pts] Binary number calculatorWrite a Java program that creates an array data of size 8, representing a binary number of 8 bits.The user must fill/enter the elements of this array only by inputting 0 or 1. If the user enters any differentnumber, the program must stop and display all invalid entries.If all entered digits are valid binary digits, the program must calculate and output the special decimalnumber represented by this binary number as shown in the below example:If the array data is111Result = 1X 2° +O X 2'+1 X 23 +O X 25 +O X 2'0 + 0 + 01 X 2' +O X 2'+O X 2* +Result =148 + 0 +13Then the result is calculated by multiplying the value ofthen adding all the answers. (shown in the above example)data array at each indexithresult of 2 indexSample run1:Enter the digits consisting of (0s or 1s): 2 5 4 1 3 2 5 7The following entries are invalid:237Sample run2:Enter the digits consisting of (0s or 1s): 1 1 1 1 3 0 0 2The following entries are invalid:3Sample run3:Enter the digits consisting of (Os or 1s): 1 1 1 1 0 0 0 0The number in decimal is 15Sample run4:Enter the digits consisting of (Os or 1s): 1 0 1 1 0 0 0 0The number in decimal is 13Page 3 of 8

import java.util.Scanner;import java.lang.Math; public class Main{ public static void…

Problem #1: [25 pts] Binary number calculator Write a Java program that creates an array data of size 8, representing a binary number of 8 bits. The user must fill/enter the elements of this array only by inputting 0 or 1. If the user enters any different number, the program must stop and display all invalid entries. If all entered digits are valid binary digits, the program must calculate and output the special decimal number represented by this binary number as shown in the below example: If the array data is 1 1 0 X 2'+ 1 X 22 + 1 X 2'+ O X 25 + O X 24+ O X 2'+ + 0 + 0 + 0 + Result = 1 X 2° + O X 2' Result = 1 4 8 13 Then the result is calculated by multiplying the value of the data array at each index with the result of 2 mdex then adding all the answers. (shown in the above example) Sample run1: Enter the digits consisting of (0s or 1s): 2 5 4 1 3 2 5 7 The following entries are invalid: 4 3 7 Sample run2: Enter the digits consisting of (0s or 1s): 1 1 1 1 3 0 0 2 The following entries are invalid: 3 Sample run3: Enter the digits consisting of (0s or 1s): 1 1 1 1 0 0 0 0 The number in decimal is 15 Sample run4: Enter the digits consisting of (0s or 1s): 1 0 1 1 0 00 0 The number in decimal is 13 Page 3 of 8

Problem #1: [25 pts] Binary number calculator Write a Java program that creates an array data of size 8, representing a binary number of 8 bits. The user must fill/enter the elements of this array only by inputting 0 or 1. If the user enters any different number, the program must stop and display all invalid entries. If all entered digits are valid binary digits, the program must calculate and output the special decimal number represented by this binary number as shown in the below example: If the array data is 1 1 0 X 2'+ 1 X 22 + 1 X 2'+ O X 25 + O X 24+ O X 2'+ + 0 + 0 + 0 + Result = 1 X 2° + O X 2' Result = 1 4 8 13 Then the result is calculated by multiplying the value of the data array at each index with the result of 2 mdex then adding all the answers. (shown in the above example) Sample run1: Enter the digits consisting of (0s or 1s): 2 5 4 1 3 2 5 7 The following entries are invalid: 4 3 7 Sample run2: Enter the digits consisting of (0s or 1s): 1 1 1 1 3 0 0 2 The following entries are invalid: 3 Sample run3: Enter the digits consisting of (0s or 1s): 1 1 1 1 0 0 0 0 The number in decimal is 15 Sample run4: Enter the digits consisting of (0s or 1s): 1 0 1 1 0 00 0 The number in decimal is 13 Page 3 of 8

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Data Structures and algorithms (C/C++) Write methods to insert node at beginning insert node at end insert after postion deletion at beginning deletion at end deletion after position deletion by value display count number of nodes List reversal
2. First Even Road by CodeChum Admin I've been newly assigned as the city's road planner but this job seems tougher than I thought! Almost all of the roads in this city are uneven. To fix these, I need to find an even road as a reference. Fortunately, the mayor told me that there's 1 even road somewhere and if I persevere, I could find it. Could you please help me with this? Instructions: Your task is to ask the user for the number of rows and columns of a 2D array. Then, print the row number of the row where the sum of all of its elements is even. For this problem, it is guaranteed that there is one and only one such row. Input 1. Number of rows 2. Number of columns 3. Elements of the 2D array Output Note that the row number starts at 0, not 1.
2. First Even Road by CodeChum Admin I've been newly assigned as the city's road planner but this job seems tougher than I thought! Almost all of the roads in this city are uneven. To fix these, I need to find an even road as a reference. Fortunately, the mayor told me that there's 1 even road somewhere and if I persevere, I could find it. Could you please help me with this? Instructions: Your task is to ask the user for the number of rows and columns of a 2D array. Then, print the row number of the row where the sum of all of its elements is even. For this problem, it is guaranteed that there is one and only one such row. Input 1. Number of rows 2. Number of columns 3. Elements of the 2D array Output Note that the row number starts at 0, not 1. Enter·#·of·rows:·3 Enter·#·of·columns:·3 Enter·elements: 2·7·4 1·1·2 0·5·0 Even·row:·1
2. First Even Road by CodeChum Admin I've been newly assigned as the city's road planner but this job seems tougher than I thought! Almost all of the roads in this city are uneven. To fix these, I need to find an even road as a reference. Fortunately, the mayor told me that there's 1 even road somewhere and if I persevere, I could find it. Could you please help me with this? Instructions: Your task is to ask the user for the number of rows and columns of a 2D array. Then, print the row number of the row where the sum of all of its elements is even. For this problem, it is guaranteed that there is one and only one such row. Input 1. Number of rows 2. Number of columns 3. Elements of the 2D array Output Note that the row number starts at 0, not 1. Enter # of rows: 3 Enter # of columns: 3 Enter elements: 2 7 4 1 1 2 0 5 0 Even row: 1
Explain the concept of mouse acceleration and its impact on pointer movement.
Virtua l-8086 definition Mode-matching is the process of associating a method call with the proper method.
Design an Algorithms (psuedo c++) An algorithm that solves scheduling problem by brute force
thjfghfh
Please explain the concept of testability and provide a quick overview of the compiler.
what is the best Algorithm for natural Language processing?{ Please share the code and Algorithm )
In what ways does debugging help?
Counting semaphores are a special type of semaphor. What are some of the things they're utilised for?