a) Give a formula for triangular numbers (show first 7 elements of triangular numbers with explanation). b) Give a formula for Fibonacci numbers (show first 5 elements with explanation). c) How does Hanoi Tower work? (explain).

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
Question 6:
a) Give a formula for triangular numbers (show first 7 elements of triangular numbers with
explanation).
b) Give a formula for Fibonacci numbers (show first 5 elements with explanation).
c) How does Hanoi Tower work? (explain).
d) Give a pseudocode for factorial (show how it works).
Question 7:
d) Show that 5x² + 25x - 9 is 0(x²).
e) Suppose a computer can perform 10¹2 bit operations per second. Find the largest problem
size that could be solved in 1 second if an algorithm requires: n³ and 3¹.
f)
Suppose a computer can perform 10¹2 bit operations per second. Find the time it would
take an algorithm that requires n³ + logn operations with a problem size of: n = 3000 and
n = 10⁹.
Question 8:
Calculate time and space complexity for given algorithms.
a) procedure function(){
answer = 0
for i=1 to n
for j = 1 to log(i)
answer += 1
print(answer) }
b) {
int i;
for (i=1;i<n³; i = i*5)
print ("Hello World"); }
c) for (i = 1; i <n; i++){
for (k = 1; k <= i; k = k + 1)
print ("Hello World"); }
Transcribed Image Text:Question 6: a) Give a formula for triangular numbers (show first 7 elements of triangular numbers with explanation). b) Give a formula for Fibonacci numbers (show first 5 elements with explanation). c) How does Hanoi Tower work? (explain). d) Give a pseudocode for factorial (show how it works). Question 7: d) Show that 5x² + 25x - 9 is 0(x²). e) Suppose a computer can perform 10¹2 bit operations per second. Find the largest problem size that could be solved in 1 second if an algorithm requires: n³ and 3¹. f) Suppose a computer can perform 10¹2 bit operations per second. Find the time it would take an algorithm that requires n³ + logn operations with a problem size of: n = 3000 and n = 10⁹. Question 8: Calculate time and space complexity for given algorithms. a) procedure function(){ answer = 0 for i=1 to n for j = 1 to log(i) answer += 1 print(answer) } b) { int i; for (i=1;i<n³; i = i*5) print ("Hello World"); } c) for (i = 1; i <n; i++){ for (k = 1; k <= i; k = k + 1) print ("Hello World"); }
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Knowledge Booster
Binary numbers
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
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