DIS-algo (n): =========== r = 0 i = n* n while i 1 do for j = 1 to i do r = r + 1 i = 1/2 return r In the above, i/2 is integer division, i.e., it returns an integer, truncating any decimal part of the result of the division- so, as one concrete example (not necessarily one that comes up in this exercise!), 5/2 would return 2, not 2.5. (a) What is the final value of r returned by this function? Express it as a function of n. (b) Express the running time (as a function of n) of DIS-algo using e-notation. (c) Express the space complexity (as a function of n) of DIS-algo using e-notation.

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
DIS-algo (n):
===========
r = 0
in n
while i 1 do
for j = 1 to i do
r = r + 1
i = 1/2
return r
In the above, i/2 is integer division, i.e., it returns an integer, truncating any decimal
part of the result of the division- so, as one concrete example (not necessarily one
that comes up in this exercise!), 5/2 would return 2, not 2.5.
(a) What is the final value of r returned by this function? Express it as a function
of n.
(b) Express the running time (as a function of n) of DIS-algo using e-notation.
(c) Express the space complexity (as a function of n) of DIS-algo using -notation.
As usual, be sure to give concise but convincing explanations for your answers.
NOTE: Here are some hints, which might be especially helpful for part la of this
exercise:
• You are welcome to assume that the input value n is a power of 2, if it simplifies
your analysis.
•Using summation notation may help.
There's a common "trick" in algorithm analysis involving summation-
for some exponent x, = (). Here's a quick derivation of that:
1 12
2x
2x
because 1 1 for any r
by properties of exponents
This "trick" might be useful in your analysis of this algorithm.
. Please be careful of off-by-one errors!
=
-note that
Transcribed Image Text:DIS-algo (n): =========== r = 0 in n while i 1 do for j = 1 to i do r = r + 1 i = 1/2 return r In the above, i/2 is integer division, i.e., it returns an integer, truncating any decimal part of the result of the division- so, as one concrete example (not necessarily one that comes up in this exercise!), 5/2 would return 2, not 2.5. (a) What is the final value of r returned by this function? Express it as a function of n. (b) Express the running time (as a function of n) of DIS-algo using e-notation. (c) Express the space complexity (as a function of n) of DIS-algo using -notation. As usual, be sure to give concise but convincing explanations for your answers. NOTE: Here are some hints, which might be especially helpful for part la of this exercise: • You are welcome to assume that the input value n is a power of 2, if it simplifies your analysis. •Using summation notation may help. There's a common "trick" in algorithm analysis involving summation- for some exponent x, = (). Here's a quick derivation of that: 1 12 2x 2x because 1 1 for any r by properties of exponents This "trick" might be useful in your analysis of this algorithm. . Please be careful of off-by-one errors! = -note that
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

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