Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

(c) For each of the following function pairs, mark the one with faster asymptotic grows. (i) f(n)= n and g(n) = n [1 mark]

(c) For each of the following function pairs, mark the one with faster asymptotic grows. (i) f(n) = n and  

(c) For each of the following function pairs, mark the one with faster asymptotic grows. (i) f(n)= n and g(n) = n [1 mark] (ii) f(n) = 1000 1000 + 1002" and g(n) = 0.00001n! [1 mark] (iii) f(n)= log n+1 and g(n) = 30 (iv) f(n)= 4n and g(n) = 8 log n (v) f(n) (log, n) (log, n) and g(n) = n log n = [1 mark] [1 mark] [1 mark] (d) (i) Provide a (low-level) Turing machine over input alphabet = {a,b} with runtime f(n) = 4 steps for all words which start with a and f(n) = 1 steps else. [2 marks] (ii) Provide a high-level Turing machine with worst-case runtime of O(n!) (and not lower than O(n!)) and best-case runtime of O(n) (and not lower than O(n)). [3 marks]

Step by Step Solution

There are 3 Steps involved in it

Step: 1

c i fn n3 and gn n6 Asymptotically gn n6 grows faster than fn n3 ii fn 1000n1000 1002n and gn 000001... blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Discrete and Combinatorial Mathematics An Applied Introduction

Authors: Ralph P. Grimaldi

5th edition

201726343, 978-0201726343

More Books

Students also viewed these Programming questions

Question

What other bills do I have to pay?

Answered: 1 week ago