Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
Bartleby Related Questions Icon

Related questions

Question

Write a class basicMaths and use constructor to pass a number. Create a function FindNumber takes one number

as a parameter and Ñnds if it is positive or negatieve number.

Create another class intermediateMaths with same functions and redeÑne the FindNumber functionality by

Ñnding the number as even or odd number.

Create another class advanceMaths with same functions and redeÑne the FindNumber functionality by Ñnd the

number as prime number or composite number.

Consider the following example code for the logic of prime number:

[画像:QUESTION 3 Write a class basicMaths and use constructor to pass a number. Create a function FindNumber takes one number as a parameter and finds if it is positive or negatieve number. Create another class intermediateMaths with same functions and redefine the FindNumber functionality by finding the number as even or odd number. Create another class advanceMaths with same functions and redefine the FindNumber functionality by find the number as prime number or composite number. Consider the foliowing example code for the logic of prime number: bool FindNumber(int n) { bool isPrime = true; for(int i = 2; i <=n/2; ++i) { if(n % i == 0) { isPrime = false; break; } if (isPrime) return true; else return false; int main() { if(FindNumber(27)) cout << "This is a prime number"; else cout << "This is not a prime number"; } ]
expand button
Transcribed Image Text:QUESTION 3 Write a class basicMaths and use constructor to pass a number. Create a function FindNumber takes one number as a parameter and finds if it is positive or negatieve number. Create another class intermediateMaths with same functions and redefine the FindNumber functionality by finding the number as even or odd number. Create another class advanceMaths with same functions and redefine the FindNumber functionality by find the number as prime number or composite number. Consider the foliowing example code for the logic of prime number: bool FindNumber(int n) { bool isPrime = true; for(int i = 2; i <=n/2; ++i) { if(n % i == 0) { isPrime = false; break; } if (isPrime) return true; else return false; int main() { if(FindNumber(27)) cout << "This is a prime number"; else cout << "This is not a prime number"; }
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Similar questions
    Recommended textbooks for you
    Text book image
    Computer Networking: A Top-Down Approach (7th Edi...
    Computer Engineering
    ISBN:9780133594140
    Author:James Kurose, Keith Ross
    Publisher:PEARSON
    Text book image
    Computer Organization and Design MIPS Edition, Fi...
    Computer Engineering
    ISBN:9780124077263
    Author:David A. Patterson, John L. Hennessy
    Publisher:Elsevier Science
    Text book image
    Network+ Guide to Networks (MindTap Course List)
    Computer Engineering
    ISBN:9781337569330
    Author:Jill West, Tamara Dean, Jean Andrews
    Publisher:Cengage Learning
    Text book image
    Concepts of Database Management
    Computer Engineering
    ISBN:9781337093422
    Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
    Publisher:Cengage Learning
    Text book image
    Prelude to Programming
    Computer Engineering
    ISBN:9780133750423
    Author:VENIT, Stewart
    Publisher:Pearson Education
    Text book image
    Sc Business Data Communications and Networking, T...
    Computer Engineering
    ISBN:9781119368830
    Author:FITZGERALD
    Publisher:WILEY