Question 4: (15 Marks) Find the running times of each of the following functions (in big-O notation), and arrange them in increasing complexity. [Note: your answer should provide a detailed explanation that support your final conclusion] a) T(n) = ET(i) b) T(n) = 6 T( n /2 )+ O( n) c) T(n) = T(n - 2) + log n with T(0) = 1 | Note: You should submit all your answers for the above-mentioned questions in one big word file (one after the other). The file should contain the following items for each question: Criterion Unsatisfactory Average Good O 100% Complete and in a professional format O Explanation of the pseudo-code is provided O looks efficient in terms of running time and of Algorithm Design O Incomplete. O Complete but looks like an essay not a professional algorithm. memory usage O Comments on the efficiency O Organized work, Implementation Using Python Incomplete Completed 100% O Comments on the code Poor use of white with correct use of space, variables, Screen shot of the run and comments. space and naming. (indentation, blank lines, ambiguous naming variables) Organized indentation with good use of yaciables O Tested with any simple input case study. Documented briefly in terms of (input, output, functions purposes) of O No answer Complexity analysis O Completed 100%. Explanation isRFOvidad O Incomplete answer or partially correct. O Irelevant text or no answer. O some effort but the report is not organized Report O logiAal representation of the arguments in terms of problem's categories, solving technique, complexity, memory consumption and ending with a correct conclusion.
Question 4: (15 Marks) Find the running times of each of the following functions (in big-O notation), and arrange them in increasing complexity. [Note: your answer should provide a detailed explanation that support your final conclusion] a) T(n) = ET(i) b) T(n) = 6 T( n /2 )+ O( n) c) T(n) = T(n - 2) + log n with T(0) = 1 | Note: You should submit all your answers for the above-mentioned questions in one big word file (one after the other). The file should contain the following items for each question: Criterion Unsatisfactory Average Good O 100% Complete and in a professional format O Explanation of the pseudo-code is provided O looks efficient in terms of running time and of Algorithm Design O Incomplete. O Complete but looks like an essay not a professional algorithm. memory usage O Comments on the efficiency O Organized work, Implementation Using Python Incomplete Completed 100% O Comments on the code Poor use of white with correct use of space, variables, Screen shot of the run and comments. space and naming. (indentation, blank lines, ambiguous naming variables) Organized indentation with good use of yaciables O Tested with any simple input case study. Documented briefly in terms of (input, output, functions purposes) of O No answer Complexity analysis O Completed 100%. Explanation isRFOvidad O Incomplete answer or partially correct. O Irelevant text or no answer. O some effort but the report is not organized Report O logiAal representation of the arguments in terms of problem's categories, solving technique, complexity, memory consumption and ending with a correct conclusion.
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
![Question 4: (15 Marks)
Find the running times of each of the following functions (in big-O notation), and
arrange them in increasing complexity. [Note: your answer should provide a detailed
explanation that support your final conclusion]
a) T(n) = ET(i)
b) T(n) = 6 T( n /2 )+ O( n)
c) T(n) = T(n - 2) + log n
with T(0) = 1
|
Note:
You should submit all your answers for the above-mentioned questions in one big
word file (one after the other). The file should contain the following items for each
question:
Criterion
Unsatisfactory
Average
Good
O 100% Complete and in a professional format
O Explanation of the pseudo-code is provided
O looks efficient in terms of running time and of
Algorithm Design
O Incomplete.
O Complete but
looks like an essay
not a professional
algorithm.
memory usage
O Comments on the efficiency
O Organized work,
Implementation
Using Python
Incomplete
Completed 100%
O Comments on the code
Poor use of white
with correct use of
space, variables,
Screen shot of the run and comments.
space
and naming.
(indentation, blank
lines, ambiguous
naming
variables)
Organized indentation with good use of yaciables
O Tested with any simple input case study.
Documented briefly in terms of (input, output,
functions purposes)
of
O No answer
Complexity
analysis
O Completed 100%.
Explanation isRFOvidad
O Incomplete
answer or partially
correct.
O Irelevant text or
no answer.
O some effort but
the report is not
organized
Report
O logiAal representation of the arguments in terms
of problem's categories, solving technique,
complexity, memory consumption and ending with
a correct conclusion.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F46a2c432-198a-4076-8de2-90bb97eaa1b3%2Fa8a5e402-78ec-4440-a117-eacafa16a3a2%2Flp5t8yv_processed.png&w=3840&q=75)
Transcribed Image Text:Question 4: (15 Marks)
Find the running times of each of the following functions (in big-O notation), and
arrange them in increasing complexity. [Note: your answer should provide a detailed
explanation that support your final conclusion]
a) T(n) = ET(i)
b) T(n) = 6 T( n /2 )+ O( n)
c) T(n) = T(n - 2) + log n
with T(0) = 1
|
Note:
You should submit all your answers for the above-mentioned questions in one big
word file (one after the other). The file should contain the following items for each
question:
Criterion
Unsatisfactory
Average
Good
O 100% Complete and in a professional format
O Explanation of the pseudo-code is provided
O looks efficient in terms of running time and of
Algorithm Design
O Incomplete.
O Complete but
looks like an essay
not a professional
algorithm.
memory usage
O Comments on the efficiency
O Organized work,
Implementation
Using Python
Incomplete
Completed 100%
O Comments on the code
Poor use of white
with correct use of
space, variables,
Screen shot of the run and comments.
space
and naming.
(indentation, blank
lines, ambiguous
naming
variables)
Organized indentation with good use of yaciables
O Tested with any simple input case study.
Documented briefly in terms of (input, output,
functions purposes)
of
O No answer
Complexity
analysis
O Completed 100%.
Explanation isRFOvidad
O Incomplete
answer or partially
correct.
O Irelevant text or
no answer.
O some effort but
the report is not
organized
Report
O logiAal representation of the arguments in terms
of problem's categories, solving technique,
complexity, memory consumption and ending with
a correct conclusion.
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 with 2 images
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