sum= 0;for (int i = 0; i 1) {sum++;i= 1/2;}= 2*log2 (n)We denote by Ta(n), Tb (n), Te(n) the running time of the three fragments.1. Give evaluations for Ta(n), Tb (n), Te(n).2. Is T(n) = O(Ta(n)) ? Answer YES or NO and justify your answer.3. Is Te(n) = (Ta(n)) ? Answer YES or NO and justify your answer.

Answered: (a) sum= 0; for (int i = 0; i 1) {…

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

Related questions

Concept explainers

Question

sum= 0;
for (int i = 0; i<n; i++) {
sum++;
}
=n
(b) sum = 0;
for (int i = 0; i< 2*n; i++) {
sum++;
}
= 2*n
(c) sum= 0; i=n*n;
while (i > 1) {
sum++;
i= 1/2;
}
= 2*log2 (n)
We denote by Ta(n), Tb (n), Te(n) the running time of the three fragments.
1. Give evaluations for Ta(n), Tb (n), Te(n).
2. Is T(n) = O(Ta(n)) ? Answer YES or NO and justify your answer.
3. Is Te(n) = (Ta(n)) ? Answer YES or NO and justify your answer.

Expert Solution

Step 1

Fragment:

A fragment is a portion of code that is incomplete or lacks the necessary syntax to be considered a complete statement or expression. It may be a part of a function, a class definition, or a conditional statement that is missing some essential elements. Fragments can cause errors or unexpected behavior in a program if they are not properly completed or removed. Developers may use fragments to experiment with code or temporarily remove a section of code for testing or debugging purposes.

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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