Implement the following functions (in C#, C/C++, Python or Java - if other language let me know in advance) and provide the results for each of the n in the table below. n = {2, 10, 100, 1000, 10000} Function I: for( double į0.0; j
Implement the following functions (in C#, C/C++, Python or Java - if other language let me know in advance) and provide the results for each of the n in the table below. n = {2, 10, 100, 1000, 10000} Function I: for( double į0.0; j
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
RRSEARCH DO TO CODR..
![Final count result for:
Function
I-lg(n)
II -n²
III - 1.02¹
n=2
n=10
n = 100
n=1000 n=10000
What do you observe for each function as n gets larger?
If you change n = 1.02 to n = 1.03 what do you observe (may want to estimate loopcount before
and printing values before looping 1.02/1.03")?
Note: If implemented correctly no loop should take much longer than 30 seconds to complete
for n = 1.02 on any CPU in Ghz range. Make sure you know your IDE's abort (e.g. Ctrl-C).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fcc402f91-5be3-463c-84e5-d725a37a8ae2%2Fed58b19e-4a66-483b-aef0-c9b41b67c4bd%2Fr2rj0t5_processed.png&w=3840&q=75)
Transcribed Image Text:Final count result for:
Function
I-lg(n)
II -n²
III - 1.02¹
n=2
n=10
n = 100
n=1000 n=10000
What do you observe for each function as n gets larger?
If you change n = 1.02 to n = 1.03 what do you observe (may want to estimate loopcount before
and printing values before looping 1.02/1.03")?
Note: If implemented correctly no loop should take much longer than 30 seconds to complete
for n = 1.02 on any CPU in Ghz range. Make sure you know your IDE's abort (e.g. Ctrl-C).
![submission notes below regarding submitting code:
Implement the following functions (in C#, C/C++, Python or Java - if other language let me know in
advance) and provide the results for each of the n in the table below.
n = {2, 10, 100, 1000, 10000}
Function I:
for( double į = 0.0; i<1g(n); ++i) {
sum +=į;
++count;
}
cout << "for n="<<n<<": count = " <<count << endl;
Function II:
for( double į = 0.0; j<n²; ++i) {
sum += į;
++count;
}
cout << "for n="<<n<<": count =
Function III:
for(int i=0.0; j<1.02²; ++i) {
sum += i;
++count;
<<count << endl;
}
cout << "for n="<<n<<": count = << count << endl;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fcc402f91-5be3-463c-84e5-d725a37a8ae2%2Fed58b19e-4a66-483b-aef0-c9b41b67c4bd%2Focrczpm_processed.png&w=3840&q=75)
Transcribed Image Text:submission notes below regarding submitting code:
Implement the following functions (in C#, C/C++, Python or Java - if other language let me know in
advance) and provide the results for each of the n in the table below.
n = {2, 10, 100, 1000, 10000}
Function I:
for( double į = 0.0; i<1g(n); ++i) {
sum +=į;
++count;
}
cout << "for n="<<n<<": count = " <<count << endl;
Function II:
for( double į = 0.0; j<n²; ++i) {
sum += į;
++count;
}
cout << "for n="<<n<<": count =
Function III:
for(int i=0.0; j<1.02²; ++i) {
sum += i;
++count;
<<count << endl;
}
cout << "for n="<<n<<": count = << count << endl;
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY