(3) The big-O estimate for the number additions used in the segment of the algorithm is O(n). t:m0 for i:=1 to n for j:=1 to n tmt+i+j True (4) f(x)=x²+2x+1 is 0 (x²) True False False (5) The big-O estimate for the function f(n)-n log(n² + 1) + n² log n is O (n log(n² + 1)). True False True (6) Below are the correct steps to find ged (5532, 50) using the Euclidean algorithm. 5322= 50-1060 +22 50=22-2+6 22=6-3+4 6=4-1+2 4=2-2+0 So, gcd (5322, 50) = gcd (50, 22) = gcd (22, 6) = gcd (6, 4) = 4 False
(3) The big-O estimate for the number additions used in the segment of the algorithm is O(n). t:m0 for i:=1 to n for j:=1 to n tmt+i+j True (4) f(x)=x²+2x+1 is 0 (x²) True False False (5) The big-O estimate for the function f(n)-n log(n² + 1) + n² log n is O (n log(n² + 1)). True False True (6) Below are the correct steps to find ged (5532, 50) using the Euclidean algorithm. 5322= 50-1060 +22 50=22-2+6 22=6-3+4 6=4-1+2 4=2-2+0 So, gcd (5322, 50) = gcd (50, 22) = gcd (22, 6) = gcd (6, 4) = 4 False
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
Answer the given question with a proper explanation and step-by-step solution.
state whether the question true or false
Transcribed Image Text:(3) The big-O estimate for the number additions used in the segment of the algorithm is O(n).
t:=0
for i:=1 to n
for j:=1 to n
t=t+i+j
True
False
(4) f(x)=x²+2x+1 is 0 (x²)
True
False
(5) The big-O estimate for the function f(n) = n log(n² + 1) + n² log n is O (n log(n² + 1)).
True
False
(6) Below are the correct steps to find gcd (5532, 50) using the Euclidean algorithm.
5322=50-1060 +22
50=22-2+6
22=6-3+4
6=4-1+2
True
4=2-2+0
So, gcd (5322, 50) = gcd (50, 22) = gcd (22, 6) = gcd (6, 4) = 4
False
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 2 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