Divisibility Test A number x is said to be divisible by a number y if when x is divided by y (x%y) the remainder is zero. A number is said to be a prime number if it is divisible by 1 and by itself only. Write a menu-driven program in C++ using a class with two overloaded functions divide(). Based on the choice given by the user any one of the two functions must get invoked. One function needs to check for the divisibility of a number by another number and another divide() function needs to check whether a number is prime or composite. Functions are said to be overloaded when their names are same. But the functions must differ in their signature. For example : If Choice is 1 then the function to check for divisibility gets invoked. Denominator must be checked for "Divisible By Zero" exception. If numerator = 10 and denominator = 5 then 10 is divisible by 5 If numerator = 11 and denominator = 5 then 11 is not divisible by 5 In the main function at the end of the case, the result must be printed as "Divisible" or "Not Divisible" based on the return value. For Choice 2 the function to check prime is invoked 7 is a Prime number 9 is a composite number. In the main function at the end of the case, the result must be printed as "Prime Number " or "Composite Number" based on the return value. For any other choices, the program must exit.
Divisibility Test A number x is said to be divisible by a number y if when x is divided by y (x%y) the remainder is zero. A number is said to be a prime number if it is divisible by 1 and by itself only. Write a menu-driven program in C++ using a class with two overloaded functions divide(). Based on the choice given by the user any one of the two functions must get invoked. One function needs to check for the divisibility of a number by another number and another divide() function needs to check whether a number is prime or composite. Functions are said to be overloaded when their names are same. But the functions must differ in their signature. For example : If Choice is 1 then the function to check for divisibility gets invoked. Denominator must be checked for "Divisible By Zero" exception. If numerator = 10 and denominator = 5 then 10 is divisible by 5 If numerator = 11 and denominator = 5 then 11 is not divisible by 5 In the main function at the end of the case, the result must be printed as "Divisible" or "Not Divisible" based on the return value. For Choice 2 the function to check prime is invoked 7 is a Prime number 9 is a composite number. In the main function at the end of the case, the result must be printed as "Prime Number " or "Composite Number" based on the return value. For any other choices, the program must exit.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Vellure lastitute of TechnoleD
Registration number: 20MID0220
Divisibility Test
A number x is said to be divisible by a number y if when x is divided by y (x%y) the remainder is zero. A number is said to be a prime number if it is divisible by 1 and by itself only.
Write a menu-driven program in C++ using a class with two overloaded functions divide(). Based on the choice given by the user any one of the two functions must get invoked. One function needs to check
for the divisibility of a number by another number and another divide() function needs to check whether a number is prime or composite.
Functions are said to be overloaded when their names are same. But the functions must differ in their signature.
For example :
If Choice is 1 then the function to check for divisibility gets invoked.
Denominator must be checked for "Divisible By Zero" exception.
If numerator = 10 and denominator = 5 then 10 is divisible by 5
If numerator = 11 and denominator = 5 then 11 is not divisible by 5
In the main function at the end of the case, the result must be printed as "Divisible" or "Not Divisible" based on the return value.
For Choice 2 the function to check prime is invoked
7 is a Prime number
9 is a composite number.
In the main function at the end of the case, the result must be printed as "Prime Number " or "Composite Number" based on the return value.
For any other choices, the program must exit.
MacBook Pro
&
@
#3
$
%3D
2
3
4
7
8.
9
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 5 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY