i. ii. 1. int count = 0; 2. for (int i n; i>0; i /= 2) for (int j = 0; j< i; j++) count += 1; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) PRINT "HELLO JUET !" ; 3. 4.
i. ii. 1. int count = 0; 2. for (int i n; i>0; i /= 2) for (int j = 0; j< i; j++) count += 1; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) PRINT "HELLO JUET !" ; 3. 4.
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
Q1. 1 and 2
![Q1. Analyze the time complexity for following code segments/ functions.
i.
1. int count = 0;
2. for (int i = n; i> 0; i /= 2)
3.
4.
ii.
for (i=1; i<=n; i++)
for (j=1; j<=log(i); j++)
PRINT "HELLO JUET !";
for (int j= 0; j<i; j++)
count += 1;
iii.
iv.
void fun(int n, int arr[])
1. {
int i = 0
for(; i<n; i++)
4.
if (n==1)
return;
for (int i=1; i<=n; i++)
{
2.
3.
for (int j=1; j<=n; j++)
{
for(j=0;j <n && arr[i] < arr[j];j++)
Print'i+j";
5.
printf("*");
break;
6. }
}
}
v.
vi.
void function (int n)
{
int count = 0;
for (int i=n/2; i<=n; i++)
for (int j=1; j<=n; j = 2 * j)
1.For I = 1 to n-1
For J = 0 to (n-I-1)
If a[J] > a[J+1] then,
Set temp = a[J]
Set a[J] = a[J+1]
Set a[J+1] = temp
2.
3.
4.
for (int k=1; k<=n; k = k * 2)
5.
count++;
6.
}
vii.
viii.
void function (int n)
{
1. For I = 0 to n-2
2.
min=I
int count = 0;
for (int i=n/2; i<=n; i++)
for (int j=1; j+n/2<3n; j = j++)
for (int k=1; k<=n; k = k * 2)
For J= I+1 to (n-1)
If a[min] > a[J]
3.
4.
5.
min=J
count++;
6.
Set temp = a[min]
Set a[min] = a[I]
Set a[I] = temp
}
7.
8.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2c1942f5-ed89-403f-a29a-84a0b42f5f33%2Fc56e6099-dd6b-4974-9fcd-328ba3d63cff%2Fezdd5ia_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Q1. Analyze the time complexity for following code segments/ functions.
i.
1. int count = 0;
2. for (int i = n; i> 0; i /= 2)
3.
4.
ii.
for (i=1; i<=n; i++)
for (j=1; j<=log(i); j++)
PRINT "HELLO JUET !";
for (int j= 0; j<i; j++)
count += 1;
iii.
iv.
void fun(int n, int arr[])
1. {
int i = 0
for(; i<n; i++)
4.
if (n==1)
return;
for (int i=1; i<=n; i++)
{
2.
3.
for (int j=1; j<=n; j++)
{
for(j=0;j <n && arr[i] < arr[j];j++)
Print'i+j";
5.
printf("*");
break;
6. }
}
}
v.
vi.
void function (int n)
{
int count = 0;
for (int i=n/2; i<=n; i++)
for (int j=1; j<=n; j = 2 * j)
1.For I = 1 to n-1
For J = 0 to (n-I-1)
If a[J] > a[J+1] then,
Set temp = a[J]
Set a[J] = a[J+1]
Set a[J+1] = temp
2.
3.
4.
for (int k=1; k<=n; k = k * 2)
5.
count++;
6.
}
vii.
viii.
void function (int n)
{
1. For I = 0 to n-2
2.
min=I
int count = 0;
for (int i=n/2; i<=n; i++)
for (int j=1; j+n/2<3n; j = j++)
for (int k=1; k<=n; k = k * 2)
For J= I+1 to (n-1)
If a[min] > a[J]
3.
4.
5.
min=J
count++;
6.
Set temp = a[min]
Set a[min] = a[I]
Set a[I] = temp
}
7.
8.
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 2 steps
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