Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
1. Determine the time function for the given algorithm and then approximate the growth rate in asymptotic big oh as the input n increases towards infinity. int n, sum = 0, x; cout<<"Enter the number of items to be read: "; cin>>n; for(int i=0; i>x; sum = sum + x; k++; cout<<"Sum="<

1. Determine the time function for the given algorithm and then approximate the growth rate in asymptotic big oh as the input n increases towards infinity. int n, sum = 0, x; cout<<"Enter the number of items to be read: "; cin>>n; for(int i=0; i>x; sum = sum + x; k++; cout<<"Sum="<

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Answer the given question with a proper explanation and step-by-step solution.

 Data Structures and Algorithm.

C++ Programming Language
Answer the following questions by writing the solutions in MS Word and submit on the due date shown. This is a written assignment. The first page should show your Id, Name, Program, Assignment number and Due Date. 1. Determine the time function for the given algorithm and then approximate the growth rate in asymptotic big oh as the input n increases towards infinity. int n, sum = 0, x; cout<<"Enter the number of items to be read:"; cin>>n; for(int i = 0; i<n; i++){ for(int j = 0; j<n; j/2}{ int k = 0; while(k <n){ } cout<<"Read x: "; cin>>x; sum sum + x; k++; cout<<"Sum="<<sum<<endl; sum = 0; 2. Answer the following questions which are related to Big Oh Notation a. If a function in terms of n is f(n) = 8n² + 1000n + O(logion), express it in O-notation. b. If g(n) = 4n²+ O(n), and statement f(n) = O(g(n)), explain this relationship and finally confirm whether the statement is true or false. c. List any two functions for h(n) to satisfy the statement f(n) = 2(h(n)). d. Write a block of code (not a full program) in C++ whose time function is T(n) = 4logan +5 e. Order the following functions by growth rate, in other words in ascending order by smallest growth rate to the largest: N, VN, N15, N², N logN, 2/N, N/2, 2, 37, logN, N³ 1
Transcribed Image Text:Answer the following questions by writing the solutions in MS Word and submit on the due date shown. This is a written assignment. The first page should show your Id, Name, Program, Assignment number and Due Date. 1. Determine the time function for the given algorithm and then approximate the growth rate in asymptotic big oh as the input n increases towards infinity. int n, sum = 0, x; cout<<"Enter the number of items to be read:"; cin>>n; for(int i = 0; i<n; i++){ for(int j = 0; j<n; j/2}{ int k = 0; while(k <n){ } cout<<"Read x: "; cin>>x; sum sum + x; k++; cout<<"Sum="<<sum<<endl; sum = 0; 2. Answer the following questions which are related to Big Oh Notation a. If a function in terms of n is f(n) = 8n² + 1000n + O(logion), express it in O-notation. b. If g(n) = 4n²+ O(n), and statement f(n) = O(g(n)), explain this relationship and finally confirm whether the statement is true or false. c. List any two functions for h(n) to satisfy the statement f(n) = 2(h(n)). d. Write a block of code (not a full program) in C++ whose time function is T(n) = 4logan +5 e. Order the following functions by growth rate, in other words in ascending order by smallest growth rate to the largest: N, VN, N15, N², N logN, 2/N, N/2, 2, 37, logN, N³ 1
Expert Solution
steps

Step by step

Solved in 4 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Computational Systems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS