Answered: Find the average of two numbers (x1,…

Engineering

Computer Science

Find the average of two numbers (x1, x2) and print" pass "if the average is more than 50 and "not pass" if less than it

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

Related questions

Q: Assume that start and end are integers. Return the average all of the numbers from start to end…

A: def average(start,end): avg = (start+end)/2.0 return avg x = average(3,5)print('The average is…

Q: Compute the acceleration of gravity for a given distance from the earth's center, distCenter,…

A: We are going to compute the acceleration of gravity using Java program.Program approach:Use the…

Q: The following statement should determine if x is not greater than 20. What is wrong with it?

A: Answer: Given statement error is highlighted with red font if (!x>20)

Q: ask the user to enter two numbers, and have your program tell them which number is larger of the…

A: 1) Since you have not specified the programming language, I have written program in python…

Q: Convert hex number OxAC to decimal. Also, 167 decimal to hex and binary numbers (It's small value.…

A: The concept of converting the number between different number systems is important in computer…

Q: Get the no. Of people.

A: Since the programming language is not mentioned, I have done the code using Python 3. Make sure you…

Q: Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to…

A: The question is asking to find the minimum number of steps required to reduce a given positive…

Q: Check to see if the average is in the range 80 to 89 (not including 80 or 89). if (average…

A: Please find the answer below :

Q: If x, and y are positive numbers both are less than one, then maximum value of floor(x + y) ?is 1 2…

A: Ans: If x and y are positive numbers both are less than one , then maximum value of floor(x + y) is:…

Q: Complete the following program so that it prints the odd numbers from 3 through 501 inclusive. for i…

A: Here is the complete code with some modifications for space and a statement to find the odd number.…

Q: write a program to print the summation

A: Given X is from 1 to 10. We need to write a program to print the summation of every two consecutive…

Q: w do you calculate the number of vowels and consonants in a string

A: To calculate the number of vowels and consonants in a string, you can follow these steps in most…

Question

Find the average of two numbers (x1, x2) and
print" pass "if the average is more than 50 and
"not pass" if less than it

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Write a code which take integer from user and reverse the number using while loop (Number could contain n no of digits). Example: Input: 2548 Output: 845
Some students have organized an election to determine the new leaders of their school club. Each member of the club has a unique ID that they can use when they vote. However, the election managers suspect that some members have voted twice. Write a program to read in member IDs and check if there are any repeated values. If an ID has already been used, output a line in this format: REPEAT: The ID BE45N6 has already been counted! Stop reading input after reading the value "STOP". Then output a line showing how many unique members voted in this format: After excluding repeats, 45 unique members voted. p5.cpp O O New I Full Screen #include using namespace std; 4 5 int main() { 7 // TODO: Write your code here cout "REPEAT: The ID " <« "AAOOAO" << " has already been counted!" <« endl; 10 cout « "After excluding repeats, e « " unique members voted." endl; 11 12 13
Find the decimal value of the postfix (RPN) expression. Round answers to one decimal place (e.g. for an answer of 13.45 you would enter 13.5): 336733/+*+
The subcontrary of “Some munchkins are singing over the rainbow” is: a. Some munchkins are not singing over the rainbow b. All munchkins are singing over the rainbow c. Some things that are singing over the rainbow are munchkins d. No munchkins are singing over the rainbow
Read n numbers then check whether the number 17 within the numbers that 3 you have read. If it is not there then print "Not Found" else print "Found X Times".
nput Format You will be given two positive integers, a and b (a<b), separated by a newline. Output Format For each integer in the inclusive interval : If 1<=n<=9 , then print the English representation of it in lowercase. That is "one" for , "two" for , and so on. Else if n>9 and it is an even number, then print "even". Else if n> 9 and it is an odd number, then print "odd". Sample Input 8 11 Sample Output eight nine even odd
Your task is to take an integer number n & prints the difference between the product of its digits and the sum of its digits.
Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - 1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ). Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 : n = 4 / 2 = 2Step 2 : n = 2 / 2 = 1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 : n = 7 - 1 = 6Step 2 : n = 6 / 3 = 2 Step 3 : n = 2 / 2 = 1 SolutionDp///.
Let P(x, y) is "x + 2y = xy," where x and y are integers. Given: (1) ForEvery x ThereExists y P(x, y). (2) ThereExists y ForEvery x P(x, y). Select one of the following choices: a. (1) and (2) are True. ○ b. (1) and (2) are False. c. (1) is False and (2) is True. ○ d. (1) is True and (2) is False.
Given a positive integer 'n', find and return the minimum number of steps that 'n' has to take to get reduced to 1. You can perform any one of the following 3 steps:1.) Subtract 1 from it. (n = n - 1) ,2.) If its divisible by 2, divide by 2.( if n % 2 == 0, then n = n / 2 ) ,3.) If its divisible by 3, divide by 3. (if n % 3 == 0, then n = n / 3 ). Write brute-force recursive solution for this.Input format :The first and the only line of input contains an integer value, 'n'.Output format :Print the minimum number of steps.Constraints :1 <= n <= 200 Time Limit: 1 secSample Input 1 :4Sample Output 1 :2 Explanation of Sample Output 1 :For n = 4Step 1 : n = 4 / 2 = 2Step 2 : n = 2 / 2 = 1 Sample Input 2 :7Sample Output 2 :3Explanation of Sample Output 2 :For n = 7Step 1 : n = 7 - 1 = 6Step 2 : n = 6 / 3 = 2 Step 3 : n = 2 / 2 = 1 SolutionDp///.
Convert the decimal number 34492.696289062 into a HEX NUMBER showing the steps (Note : The problem should be solved in separate paper with steps and scanned copy should be submitted along with other answers Final answer must be entered in the boxes provided below. For Hexadecimal digits from A to F, enter their equivalent decimal value in the corresponding box; do not enter the letter; (For eg, if answer is A, ther enter 10, for B, enter 11 and so on) Enter only one digit in each box. Also fill the unused boxes with zeros) However, in your written submissions, use the letters A to F instead of the values The integer part = The fractional part =
Given integers numInput1 and numInput2, output "numInput1 is less than 20." if numInput1 is less than 20. End with a newline. Assign numInput2 with 6 if numInput2 is less than 15. Otherwise, output "numInput2 is greater than or equal to 15.". End with a newline. Ex: If the input is -20 65, then the output is: numInput1 is less than 20. numInput2 is greater than or equal to 15. numInput2 is 65. NOTE: Write in Java language!