(17*) (4x3 marks + 2x4 marks) 1. Give an analysis of the running time (Big-Oh notation) for each of the following 4 program fragments. Note: the running time corresponds here to the number of times the operation sum++ is executed. sqrt is the function that returns the square root of a given number. } Program Running time (Big-Oh notation) sum = 0; for (i=0;i

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
(17*) (4x3 marks + 2x4 marks)
1. Give an analysis of the running time (Big-Oh notation) for each of the following 4 program
fragments. Note: the running time corresponds here to the number of times the operation sum++ is
executed. sqrt is the function that returns the square root of a given number. )
Program
Running time (Big-Oh notation)
sum
0;
for (i=0;i<sqrt(n)/2;i++)
sum++;
A for (j=0 ;j<sqrt(n)/4;j++)
sum++;
for (k=0;k<8+j;k++)
sum++;
sum =
0;
for (i=0;i<sqrt(n)/2;i++)
for (j=i;8+i;j++)
В
for(k=j;k<8+j;k++)
sum++;
0;
for (i=1;i<2*n;i++)
sum
%3D
for (j=1;j<i*i;j++)
for (k=1;k<j;k++)
if (j%i==1)
C
sum++;
sum = 0;
for (i=1;i<2*n;i++)
for (j=1;j<i*i;j++)
for (k=1;k<j;k++)
if jäi)
CS Scanned with CaScanner
Sumti;
Transcribed Image Text:(17*) (4x3 marks + 2x4 marks) 1. Give an analysis of the running time (Big-Oh notation) for each of the following 4 program fragments. Note: the running time corresponds here to the number of times the operation sum++ is executed. sqrt is the function that returns the square root of a given number. ) Program Running time (Big-Oh notation) sum 0; for (i=0;i<sqrt(n)/2;i++) sum++; A for (j=0 ;j<sqrt(n)/4;j++) sum++; for (k=0;k<8+j;k++) sum++; sum = 0; for (i=0;i<sqrt(n)/2;i++) for (j=i;8+i;j++) В for(k=j;k<8+j;k++) sum++; 0; for (i=1;i<2*n;i++) sum %3D for (j=1;j<i*i;j++) for (k=1;k<j;k++) if (j%i==1) C sum++; sum = 0; for (i=1;i<2*n;i++) for (j=1;j<i*i;j++) for (k=1;k<j;k++) if jäi) CS Scanned with CaScanner Sumti;
Expert Solution
steps

Step by step

Solved in 2 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