Analyze the given function below that takes a list of numbers with size (n) and returns the number of even and odd numbers in the list. Answer the questions below: def function(List): oddCount = 0 evenCount = 0 for i in range(len(List)): if List[i]%2 == 0: evenCount += 1 else: oddCount += 1 print ('Number of Odds = ', oddCount) print ('Number of Evens = ', evenCount) 1. Count the number of steps required by the function in terms of n? 2. What is the time complexity of the algorithm. 3. Find number of operations if (n = 100)
Analyze the given function below that takes a list of numbers with size (n) and returns the number of even and odd numbers in the list. Answer the questions below: def function(List): oddCount = 0 evenCount = 0 for i in range(len(List)): if List[i]%2 == 0: evenCount += 1 else: oddCount += 1 print ('Number of Odds = ', oddCount) print ('Number of Evens = ', evenCount) 1. Count the number of steps required by the function in terms of n? 2. What is the time complexity of the algorithm. 3. Find number of operations if (n = 100)
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
Analyze the given function below that takes a list of numbers with size (n) and returns the number of even and odd numbers in the list. Answer the questions below:
def function(List):
oddCount = 0
evenCount = 0
for i in range(len(List)):
if List[i]%2 == 0:
evenCount += 1
else:
oddCount += 1
print ('Number of Odds = ', oddCount)
print ('Number of Evens = ', evenCount)
1. Count the number of steps required by the function in terms of n?
2. What is the time complexity of the
3. Find number of operations if (n = 100)
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 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.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