1.Find the exact step counts (growth function) and time complexity for following algorithms - i. ii. iii. 1.Input m and n 2.If m == n 1. Initialize i=0 Algorithm Add(a,b,c,m,n) 1. for i :=1to m do 2. For i=0 to n-1 3. Print "Same" 3. Read an integer in Arr[i] 2. for i:=1to n do 4. For i=0 to n-1 Print Arr[i] 4. Sum=m+n 3. C[ij]:=a[i, j]+b[ij]; 5. Print Sum 5. 6.Else Print “Not same" vi. iv. V. 1. sum = 0 Algorithm Sum (a,n) 1 s:=0.0; 1.int i, j, k = 0; 2. for i = 1 to n: 2.for (i =1; i<= n*n; i++) 3. for j = i to n: for (j = 1; j<= n; j = j+1) k = k + n/2; 3. for i :=1to n do 4. 3 S:=s+a[i]; 4. sum += a[i][j] 4 return s; 5. print(sum) vii. 1. Set i=0 2. Repeat step 3-6 till i<=n 3. viii. ix. 1. Set I=n void fun(int n, int arr[]) 1. { 2. 2. While I>1 int i = 0, j= 0; 3. Set J=n 3. J=1 4. While J>0 for(; i
1.Find the exact step counts (growth function) and time complexity for following algorithms - i. ii. iii. 1.Input m and n 2.If m == n 1. Initialize i=0 Algorithm Add(a,b,c,m,n) 1. for i :=1to m do 2. For i=0 to n-1 3. Print "Same" 3. Read an integer in Arr[i] 2. for i:=1to n do 4. For i=0 to n-1 Print Arr[i] 4. Sum=m+n 3. C[ij]:=a[i, j]+b[ij]; 5. Print Sum 5. 6.Else Print “Not same" vi. iv. V. 1. sum = 0 Algorithm Sum (a,n) 1 s:=0.0; 1.int i, j, k = 0; 2. for i = 1 to n: 2.for (i =1; i<= n*n; i++) 3. for j = i to n: for (j = 1; j<= n; j = j+1) k = k + n/2; 3. for i :=1to n do 4. 3 S:=s+a[i]; 4. sum += a[i][j] 4 return s; 5. print(sum) vii. 1. Set i=0 2. Repeat step 3-6 till i<=n 3. viii. ix. 1. Set I=n void fun(int n, int arr[]) 1. { 2. 2. While I>1 int i = 0, j= 0; 3. Set J=n 3. J=1 4. While J>0 for(; 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...
Related questions
Question
Only 9
![1.Find the exact step counts (growth function) and time complexity for following algorithms -
iii.
Algorithm Add(a,b,c,m,n)
1. for i:=1tom do
i.
ii.
1.Input m and n
2.If m == n
1. Initialize i =0
2. For i=0 to n-1
3.
Print "Same"
3.
Read an integer in Arr[i]
2.
for i :=1to n do
4. For i=0 to n-1
Print Arr[i]
4.
Sum=m+n
3.
c[ij]:=a[i, j]+b[ij];
5.
Print Sum
5.
6.Else Print "Not same"
vi.
iv.
v.
1. sum = 0
Algorithm Sum (a,n)
1 s:=0.0;
1.int i, j, k = 0;
2. for i = 1 to n:
2.for (i =1; i<=n*n; i++)
for (j = 1; j <= n; j = j +1)
k = k + n/2;
3.
for j = i to n:
for i :=1to n do
s:=s+a[i];
3.
2
4.
4.
sum += a[i][j]
4 return s;
5. print(sum)
vii.
1. Set i=0
2. Repeat step 3-6 till i<=n
3.
viii.
ix.
void fun(int n, int arr[])
1. {
int i= 0, j= 0;
for(; i<n; ++i)
while(j <n && arr[i] < arr[j])
j+t:
1. Set I =n
2. While I>1
Set J=n
3.
J=1
2.
4.
While J>0
4.
Whilę J<n
3.
5.
J= J/2
5.
K=1
4.
6.
i=i+1
6.
While K <n
5.
7.
K += 2
6. }
8.
J *= 2
9.
I/= 2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3843d3c3-e0dd-4627-87f9-1c5ac4ff00ea%2F5b1d0ec1-2bd9-42e3-bfd1-fa0f8f9b7dad%2Ftl7ee5t_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1.Find the exact step counts (growth function) and time complexity for following algorithms -
iii.
Algorithm Add(a,b,c,m,n)
1. for i:=1tom do
i.
ii.
1.Input m and n
2.If m == n
1. Initialize i =0
2. For i=0 to n-1
3.
Print "Same"
3.
Read an integer in Arr[i]
2.
for i :=1to n do
4. For i=0 to n-1
Print Arr[i]
4.
Sum=m+n
3.
c[ij]:=a[i, j]+b[ij];
5.
Print Sum
5.
6.Else Print "Not same"
vi.
iv.
v.
1. sum = 0
Algorithm Sum (a,n)
1 s:=0.0;
1.int i, j, k = 0;
2. for i = 1 to n:
2.for (i =1; i<=n*n; i++)
for (j = 1; j <= n; j = j +1)
k = k + n/2;
3.
for j = i to n:
for i :=1to n do
s:=s+a[i];
3.
2
4.
4.
sum += a[i][j]
4 return s;
5. print(sum)
vii.
1. Set i=0
2. Repeat step 3-6 till i<=n
3.
viii.
ix.
void fun(int n, int arr[])
1. {
int i= 0, j= 0;
for(; i<n; ++i)
while(j <n && arr[i] < arr[j])
j+t:
1. Set I =n
2. While I>1
Set J=n
3.
J=1
2.
4.
While J>0
4.
Whilę J<n
3.
5.
J= J/2
5.
K=1
4.
6.
i=i+1
6.
While K <n
5.
7.
K += 2
6. }
8.
J *= 2
9.
I/= 2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
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