
Concept explainers
(Count positive and negative numbers and compute the average of numbers) Write a
Enter an integer, the input ends if it is 0: 1 2 -1 3 0
The number of positives is 3
The number of negatives is 1
The total is 5.0
The average is 1.25
Enter an integer, the input ends if it is 0: 0
No numbers are entered except 0

Count positive and negative numbers and compute the average of numbers
Program Plan:
- Include the required import statement.
- Define the class
- Define the main() method using public static main.
- Declare and initialize the required variables.
- Declare the input scanner.
- Read an input from the user.
- Using while loop, check whether the integer is “0” or not
- Check whether the integer is greater than “0”.
- If so, increment the positive counter.
- Check whether the integer is less than “0”.
- If so, increment the negative counter.
- Calculate the sum of integers.
- Read the next input.
- Check whether the integer is greater than “0”.
- Display the sum and average of integers.
- Define the main() method using public static main.
The below program is used to count number of positives and number of negatives which are presented as inputs and finally calculate its sum and average as follows:
Explanation of Solution
Program:
//import statement
import java.util.Scanner;
//class Excersise_1
public class Excersise_1 {
// main function
public static void main(String[] args) {
// declare and initialize the required variables
int count_Positive = 0, count_Negative = 0;
int counter = 0, sum = 0, integer;
// declare the input scanner
Scanner in = new Scanner(System.in);
// print the instruction
System.out.print("Enter an integer, the input ends if it is 0: ");
// read the integer value from user
integer = in.nextInt();
// using while loop, check the integer
while (integer != 0) {
// check if it is positive
if (integer > 0)
/* if so, increment the positive counter */
count_Positive++;
// check if it is negative
else if (integer < 0)
/* if so, increment the negative counter */
count_Negative++;
// calculate the total of integer
sum += integer;
// increment the counter
counter++;
// Read the next integer
integer = in.nextInt();
}
// check the counter is 0
if (counter == 0)
// if so, no inputs are read
System.out.println("No numbers are entered except 0");
else {
// print the number of positive integers
System.out.println("The number of positives is " + count_Positive);
// print the number of negative integers
System.out.println("The number of negatives is " + count_Negative);
// print the sum
System.out.println("The total is " + sum);
// print the overall average
System.out.println("The average is " + sum * 1.0 / counter);
}
}
}
Enter an integer, the input ends if it is 0: 1
2
-1
3
0
The number of positives is 3
The number of negatives is 1
The total is 5
The average is 1.25
Want to see more full solutions like this?
Chapter 5 Solutions
Introduction to Java Programming and Data Structures Comprehensive Version (11th Edition)
Additional Engineering Textbook Solutions
Web Development and Design Foundations with HTML5 (8th Edition)
Electric Circuits. (11th Edition)
Concepts Of Programming Languages
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
SURVEY OF OPERATING SYSTEMS
Problem Solving with C++ (10th Edition)
- . 6. Find the dual of the Boolean expressions. (swap + with and O with 1; do not complement variables). a) A + BC b) (X + Y)(X + Z) c) P+Q+ RSarrow_forward5. Simplify the following Boolean expression. Show each simplification step and identity used. a) ABAB + ABC b) (MN)(M + P) + MParrow_forwardBoolean Algebra HW #4 Show all intermediate steps (truth tables, algebraic steps, and justifications such as identities or theorems) for full credit. 1. Evaluate the following expression when A = 1, B = O, C = 1, D = 0 F = AB + CD + (A+B)C 2. Find F, the complement of function F, Write your answer using overbars. F(W,X,Y,Z) = WX+YZ+XZ 3. Determine the truth table for the function F=XY+XZ 4. Show with a truth table that the following is true: X(Y+Z) = XY+XZ 5. Simplify the following Boolean expression. Show each simplification step and identity used. a) AB + AB + ABC b) (M+N)(M + P) + MP 6. Find the dual of the Boolean expressions. (swap + with and O with 1; do not complement variables). a) ABC b) (X + Y)(X + Z) c) P+Q+ RS 7. Convert Standard POS form to Canonical POS form. • (A+B)(Ā + C) (B+C) 8. Given that F(a, b, c, d) = Em(1, 3, 4, 6, 8, 9, 12) (i) Write the product of maxterms (canonical POS) for F. (ii) Write the canonical SOP and canonical POS for F.arrow_forward
- Consider the following statement, which is intended to assign the value of the expression, the variable result Assume that the double variables. x-ya and b have been properly declared and initialized. (xy) to double result = missing code /: 17 Mark for Review Which of the following can replace / missing code / so that the statement works as intended? Math.sqrt((x + y) 2/ Math.abs(a, b)) Math.sqrt((x + y) 2/ Math.abs(a - b)) Math.sqrt(Math.pow(x + y, 2) / Math. abs(a, b)) Math.sqrt(Math.pow(x + y, 2) / Math.abs (a - b))arrow_forwardConsider the following code segment, which is intended to print the digits of the two-digit int number num in reverse order. For example, if num has the value 75, the code segment should print 57. Assume that num has been properly declared and initialized. /missing code */ System.out.print (onesDigit); System.out.print (tensDigit); 14 Mark for Review Which of the following can be used to replace / missing code so that the code segment works as intended? int onesDigit num 10; int tensDigit num / 10; int onesDigit- num / 10; int tensDigit num 10; int onesDigit -10/num; int tensDigit 10 num; -Undo int onesDigit num 100; Undo int tensDigit-num / 100;arrow_forwardThe following code segment is intended to round yal to the nearest integer and print the result double val--0.7 int roundedVal (int) (val +0.51 System.out.println(roundedValu 25 Mark for Review Which of the following best describes the behavior of the code segment? The code segment does not work as intended because the expression (val +0.5) should be cast to a double instead of an int The code segment does not work as intended because val should be cast to an int before 0.5 is added to it. Highlights & Notes Reference Undo Undo The code segment does not work as intended because the expression -Unda positive ר .arrow_forward
- In the following code segment, mon and tue are properly declared String variables. String strl-mon.substring(9. mon.indexOf(" "). String str2-tue.substring(tue.indexOf(" ") + 1). System.out.println(strl+and+str2): க 21 Mark for Review For which of the following values of mon and tue will the code segment print "cloudy and foggy"? mon tue "cloudy today" "foggy tomorrow" mon tue "cloudy today" "tomorrow foggy" mon tue "today cloudy" "foggy tomorrow" mon tue "today cloudy" "tomorrow foggy"arrow_forwardG Consider the following code segment, which is intended to assign to num a random integer value between min and max, inclusive, each with an equal chance of being assigned to num. Assume that min and max are integer variables and that the value of max is greater than the value of min. 24 Mark for Review Which of the following can replace /* missing code */ so that the code segment works as intended? double rn = Math.random();_ int num = /* missing code */ ;_ D (int) (rn * max) + min ABC (A) (int) (rn * (max- min)) + min (B (int) (rn * (max min)) + 1 (int) (rn * (max min + 1)) + minarrow_forwardWrite the truth table for each of the following logic functions: (a) FX Y+X'. Y'. Z (b) FW' X + Y' · Z' + X' · Z (c) F=W+X' · (Y' + Z) . . (d) F A B+ B' C+C' D + D' A .arrow_forward
- Use the theorems of switching algebra to simplify each of the following logic functions: (a) F W X Y Z (W X Y . Z'+W X Y Z (b) FA B+ A . B C D+A B.D. E' + A B C W X Y Z+W X Y' - Z) E + C D E .arrow_forwardWrite the canonical sum and product for each of the following logic functions: (a) F = Σx,y(1,2) (c) F=ΣA,B,C(2,4,6,7) = (b) FПAB(0,1,2) (d) F=Пw.x,y(0,1,3,4,5)arrow_forwardFor the following truth table: a) Write the canonical SOP. Row × Y Z F 0 0 0 0 0 b) Write the canonical POS. | 0 0 1 2 0 1 0 1 3 0 1 1 0 4 1 0 0 0 5 1 0 1 1 6 1 1 0 0 7 1 1 1 1arrow_forward
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageProgramming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning




