Determine the cost function T(n) of the following code fragment. Hint. Assume worst case for numeric choices. // bool TEST is defined and set by external process before executing this function. It will either be TRUE or FALSE at the start of this function and may change in the middle of execution. for(int i = 0; i < n; ++i) { if(TEST) { } for(int j = 0; j

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
icon
Related questions
Question

11. Please Show Your Work!!! Type your scratch work! Thanks

Determine the cost function T(n) of the following code fragment. Hint. Assume
worst case for numeric choices.
// bool TEST is defined and set by external process before executing this function.
It will either be TRUE or FALSE at the start of this function and may change in the
middle of execution.
for(int i = 0; i<n; ++i) {
if(TEST) {
}
for(int j = 0; j<n; ++i) {
score += i+j;
}
} else {
}
score +=i*j;
Assume operator ^ takes a fixed constant amount of time.
REQUIRED: Show line by line costs of T(n) and final T(n).
What is the final order of growth expression with asymptotic assumptions in terms of
O(...)?
Transcribed Image Text:Determine the cost function T(n) of the following code fragment. Hint. Assume worst case for numeric choices. // bool TEST is defined and set by external process before executing this function. It will either be TRUE or FALSE at the start of this function and may change in the middle of execution. for(int i = 0; i<n; ++i) { if(TEST) { } for(int j = 0; j<n; ++i) { score += i+j; } } else { } score +=i*j; Assume operator ^ takes a fixed constant amount of time. REQUIRED: Show line by line costs of T(n) and final T(n). What is the final order of growth expression with asymptotic assumptions in terms of O(...)?
Expert Solution
Step 1

Solution:

 

The cost function T(n) of the given code fragment can be calculated as follows:

  1. Initialization of variables: The initialization of the variable i takes constant time, so the cost is 1.

  2. For loop: The for loop runs n times. Each iteration performs a constant amount of work,

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Predicate
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.
Similar questions
  • SEE MORE QUESTIONS
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