What is the time complexity of the following three algorithms? Express your answer in terms of Big- O notation and justify your answer: A) def display_names_with_ID (names): ID = 0; for n in names: print ("ID for ", n, "is", ID) ID = ID + 1
What is the time complexity of the following three algorithms? Express your answer in terms of Big- O notation and justify your answer: A) def display_names_with_ID (names): ID = 0; for n in names: print ("ID for ", n, "is", ID) ID = ID + 1
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
100%
Please answer and explain the questions in image.
The 1st and 2nd image is marked. Please explain how to get the answers.
Charity only this much available sorry.
Please explain
![B)
def find_item (mylist, item) :
if len (mylist)
return False
== 0:
else:
n = len (mylist)//2
print ("Midpoint =", mylist[n] )
if mylist [n] == item:
return True
else:
if item<mylist [n]:
return find item (mylist[:n], item)
else:
return find_item (mylist [n+1:], item)
C)
print ("Times tables grid")
n = 10
for i in range (1, n+1) :
print (i, end="\t")
for i in range (0, 75):
print ("=", end='')
print ()
for i in range (1, n+1):
for j in range (1, n+1):
print (i * j, end="\t")](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbfed9390-ffb3-4e7f-865b-91b425e8e5f7%2F995cb51a-be0f-4433-a597-53bfb8a8a750%2F5183hc_processed.jpeg&w=3840&q=75)
Transcribed Image Text:B)
def find_item (mylist, item) :
if len (mylist)
return False
== 0:
else:
n = len (mylist)//2
print ("Midpoint =", mylist[n] )
if mylist [n] == item:
return True
else:
if item<mylist [n]:
return find item (mylist[:n], item)
else:
return find_item (mylist [n+1:], item)
C)
print ("Times tables grid")
n = 10
for i in range (1, n+1) :
print (i, end="\t")
for i in range (0, 75):
print ("=", end='')
print ()
for i in range (1, n+1):
for j in range (1, n+1):
print (i * j, end="\t")
Transcribed Image Text:Section 1- Algorithm Efficiency
Question 1.1
Assume that each of the expressions below gives the processing time T(n) spent by an algorithm for
solving a problem of input size n. Specify the dominant term having the steepest increase in n. What
is O() in each case? Give your answers by completing the table.
Expression
Dominant term
0()
5+ n+ 0.25n
500n + 50n*log(n)
200 + n/2
n + 2n + 0.5n² + 3n?
n+n5 + n05 + 20n
3n + n² + 7n + 10
Question 1.2
What is the time complexity of the following three algorithms? Express your answer in terms of Big-
O notation and justify your answer:
A)
def display_names_with_ID(names):
ID = 0;
for n in names:
print ("ID for ", n, "is", ID)
ID = ID + 1
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