Match the hardware device with the "category" into which it falls. Remember to choose

Wich is the correct process for selecting an entire row in a spreadsheet?

umka21 [38]

CTRL - (select sentence) - ALT

4 0

3 years ago

Write a function called factor that determines for a pair of integers whether the second integer is a factor of the first. The f

Aleks04 [339]

<h2>Answer:</h2>

//import the Scanner class to allow for user's input

import java.util.Scanner;

//Declare the class and call it FactorClass

public class FactorClass {

//Declare the function factor

//It returns either true or false, therefore the return type is boolean

//It receives two arguments - a and b

public static boolean factor(int a, int b){

//Check if a is divisible by b.

//Return true if yes

if(a % b == 0){

return true;

}

//return false if a is not divisible by b

return false;

} // End of method factor

//The main method to test the function factor()

public static void main(String[] args) {

//Create an object of the Scanner class

Scanner input = new Scanner(System.in);

//Prompt the user to enter the pair of numbers

System.out.println("Enter the pair of numbers (separated by a space)");

//grab and store the first number in a variable

int firstnum = input.nextInt();

//grab and store the second number in another variable

int secondnum = input.nextInt();

//With the variables, call the factor() method

//If it returns true, print the adequate message

if(factor(firstnum, secondnum)){

System.out.println(secondnum + " is a factor of " + firstnum);

}

//If it returns false, print the adequate message

else{

System.out.println(secondnum + " is NOT a factor of " + firstnum);

}

} // End of main method

} // End of class declaration

==============================================================

<h2>Sample Output 1:</h2>

>> Enter the pair of numbers separated by a space

8 4

>> 4 is a factor of 8

==============================================================

<h2>Sample Output 2:</h2>

>> Enter the pair of numbers separated by a space

9 4

>> 4 is NOT a factor of 9

==============================================================

<h2>Explanation:</h2>

The above code has been written in Java and it contains comments explaining every segment of the code. Kindly go through the comments for better understanding of the code.

For simplicity, the code is re-written as follows with little or no comments;

import java.util.Scanner;

//Declare the class and call it FactorClass

public class FactorClass {

public static boolean factor(int a, int b) {

if(a % b == 0){

return true;

}

//return false if a is not divisible by b

return false;

} // End of method factor

//The main method to test the function factor()

public static void main(String[] args) {

//Create an object of the Scanner class

Scanner input = new Scanner(System.in);

//Prompt the user to enter the pair of numbers

System.out.println("Enter the pair of numbers (separated by a space)");

//grab and store the first number in a variable

int firstnum = input.nextInt();

//grab and store the second number in another variable

int secondnum = input.nextInt();

if(factor(firstnum, secondnum)){

System.out.println(secondnum + " is a factor of " + firstnum);

}

else{

System.out.println(secondnum + " is NOT a factor of " + firstnum);

}

3 0

3 years ago

Which set of symbols can be used to determine which calculations to perform first?

Monica [59]

Answer:

parentheses

Explanation: hope i helped <3 °ω°

5 0

3 years ago

Read 2 more answers

In what ways are computers being used to improve our quality of life

serg [7]

Explanation:

makes info easy to get

improves communication

enhances education

etc

plsss mark me brainliesttt

3 0

3 years ago

Matching parentheses. An math expression may have a number of parentheses like (, ), [, ], { and }. Each openning parenthesis (,

Solnce55 [7]

C++ Code

#include
using namespace std;

bool match(const char exp[],const int s)
{
// declare a character array to perform stack operations
char stack[s];

// declare top and initialize to -1 and flag to 0
int top=-1,i,flag=0;

// visit all characters in the expression string
for(i=0;i {
// if the character is [ or ( or { then push it into stack
if(exp[i]=='[' || exp[i]=='(' || exp[i]=='{')
{
top++;
stack[top]=exp[i];
}
// if the character is ] or ) or } then check conditions
else if(exp[i]==']' || exp[i]==')' || exp[i]=='}')
{
// check stack is empty or not
if(top!=-1)
{
// check all possible failure conditions
if(exp[i]==')' && (stack[top] == '{' || stack[top]=='['))
{
flag = 1;
break;
}
else if(exp[i]==']' && (stack[top] == '{' || stack[top]=='('))
{
flag = 1;
break;
}
else if(exp[i]=='}' && (stack[top] == '(' || stack[top]=='['))
{
flag = 1;
break;
}
top--;
}
else
{
flag=1;
break;
}
}
}
// after visiting all characters of expression string check if stack is not empty and flag is 1. if any one of the condition is true return false. otherwise return true

if(top>=0 || flag==1)
return false;
else
return true;
}

int main()
{

// declare character array to store expression
char exp[10000];
cout<<"Enter an Expression"<
// read expression from user
cin.getline(exp, 10000);
int s=0;

// find the length of the expression string
for(int i=0;exp[i]!='\0';i++)
{
s++;
}

// call the match function
bool status = match(exp,s);

// print the result based on value returned by match() function
if(status == 1)
cout<<"true"< else
cout<<"false"<
}

Sample Input/Output is attached

3 0

2 years ago