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...
icon
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).
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;
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
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY