(a) Find the total number of additions and multiplications that must be performed when the following algorithm is executed. Show your work carefully. for i :=1 to n for j = i to n a:= 2 - (5 -i+j+1) next j next i (b) Find an order for the algorithm segment of part (a) from among the following: log2 n, n, n - logą n, n², nº, and n*. Give a reason for your answer.
(a) Find the total number of additions and multiplications that must be performed when the following algorithm is executed. Show your work carefully. for i :=1 to n for j = i to n a:= 2 - (5 -i+j+1) next j next i (b) Find an order for the algorithm segment of part (a) from among the following: log2 n, n, n - logą n, n², nº, and n*. Give a reason for your answer.
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
Related questions
Question
how to step-by-step solve these?
![3|x2|<|3x2 + 17x + 5| for all x>1
express this statement using Q-notation
(a) Consider the following algorithm segment:
for i := 1 to n
for j := 1 to i
x := 5 · i +8. j
13x2 + 17x + 5|<25 |x리 for all x > 1
express this statement using O-notation
next j
next i
(b) How many additions and multiplications are performed when the inner loop of this algo-
rithm segment is executed? How many additions and multiplications are performed when
the entire algorithm segment is executed?
3]x리 < |3x리 < |3x2+ 17x + 5|< 25 |x레 for all x > 1
(c) Find an order for this algorithm segment from among the following: log, n, n, n · log, n,
n2, n3, and n', Give a reason for your answer.
Express this statement using 0-notation
Express the following statement using N-notation.:
| 12z*(3r + 4)
for all real numbers r> 2.
I+2
Consider the statement:
3 [교리 < |3r2 + 17x +5| < 25 |교기|
for all r> 1.
Express this statement using 0-notation.
Express the following statement using O-notation:
| 12r(3r + 4)|
S 36 |z |
for all real numbers r> 2.
z+2
(a) Find the total number of additions and multiplications that must be performed when the
following algorithm is executed. Show your work carefully.
for i := 1 to n
for j = i ton
a := 2 · (5 - i+j+1)
next j
next i
(b) Find an order for the algorithm segment of part (a) from among the following: log, n, n,
n · log, n, n?, n³, and n*. Give a reason for your answer.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1335c700-525a-41f9-bf83-29f58a10191b%2F908d4fd6-74d3-4f7e-a769-144138edd74a%2F9hfbivj_processed.png&w=3840&q=75)
Transcribed Image Text:3|x2|<|3x2 + 17x + 5| for all x>1
express this statement using Q-notation
(a) Consider the following algorithm segment:
for i := 1 to n
for j := 1 to i
x := 5 · i +8. j
13x2 + 17x + 5|<25 |x리 for all x > 1
express this statement using O-notation
next j
next i
(b) How many additions and multiplications are performed when the inner loop of this algo-
rithm segment is executed? How many additions and multiplications are performed when
the entire algorithm segment is executed?
3]x리 < |3x리 < |3x2+ 17x + 5|< 25 |x레 for all x > 1
(c) Find an order for this algorithm segment from among the following: log, n, n, n · log, n,
n2, n3, and n', Give a reason for your answer.
Express this statement using 0-notation
Express the following statement using N-notation.:
| 12z*(3r + 4)
for all real numbers r> 2.
I+2
Consider the statement:
3 [교리 < |3r2 + 17x +5| < 25 |교기|
for all r> 1.
Express this statement using 0-notation.
Express the following statement using O-notation:
| 12r(3r + 4)|
S 36 |z |
for all real numbers r> 2.
z+2
(a) Find the total number of additions and multiplications that must be performed when the
following algorithm is executed. Show your work carefully.
for i := 1 to n
for j = i ton
a := 2 · (5 - i+j+1)
next j
next i
(b) Find an order for the algorithm segment of part (a) from among the following: log, n, n,
n · log, n, n?, n³, and n*. Give a reason for your answer.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education