An algorithm takes 10 seconds for an input size of 50. If the algorithm is quadratic, approx- imately how long does it take to solve a problem of size 100? (a) 10 seconds (b) 20 seconds (c) 40 seconds (d) 100 seconds (e) none of the above An algorithm takes 30 seconds for an input of size 1000. If the algorithm is quadratic, how large a problem can be solved in two minutes? (a) 2000 (b) 4000 (c) 6000 (d) 60000 (e) none of the above

An algorithm takes 10 seconds for an input size of 50. If the algorithm is quadratic, approx- imately how long does it take to solve a problem of size 100? (a) 10 seconds (b) 20 seconds (c) 40 seconds (d) 100 seconds (e) none of the above An algorithm takes 30 seconds for an input of size 1000. If the algorithm is quadratic, how large a problem can be solved in two minutes? (a) 2000 (b) 4000 (c) 6000 (d) 60000 (e) none of the above

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

Similar questions

2) A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are T1(n) = 3 n logn and T2(n) = nº/5 . a) Which algorithm is better? Why? b) If we run both algorithms at the same time with an input size of 10°, which algorithm produces results faster than the other one? Why?
Design a reasonably efficient algorithm for solving each of the following problems and determine its efficiency class. For a given positive integer n, find the pair of integers whose sum is n and whose product is as large as possible.
Discrete math problem: Is the set of odd negative integers finite, countably infinite, or uncountable? If it is countably infinite, exhibit a one-to-one correspondence between the set of positive integers and that set.
The search algorithm developed will be used for users to search the catalog for all items matching the search keyword(s), and there are a total of 15000 items in the catalog. During development, three different algorithms were created. • Algorithm A runs in constant time, with a maximum runtime of 1.10 seconds and returns all matching results. ● Algorithm B runs in logarithmic time, with a maximum runtime of 0.3 seconds, and returns only the first result. ● Algorithm C runs in linear time, with a maximum runtime of 1.50 seconds and returns all matching results. Which algorithm would be the least suitable for the requirements stated? In your answer, justify your choice by explaining why you picked that algorithm, and why you did not pick the other two algorithms.OND OND OND DAD
A linear program is given as follows: Minimize x1+x2+x3 subject to 2x1 – 6x2 + 3x3 ≥ 50 3x1 + 4x2 -x3 ≥ 40 4x1 – x2 + 5x3 ≥ 60 x1, x2 ≥ 0 Solve the problem using a linear programming solver (e.g., linprog in python). What is the optimum solution? What are the values of x1, x2 and x3 for this optimum solution? Instructions: Submit the following The new form of the problem (if you have changed the form) for linear programming solver input Code to solve the problem Answers of questions ‘a’ and ‘b’
Exists a computer algorithm for every conceivable problem?Explain.
مسئله ۱: حل مشكله التحسين الخطى التالية باستخدام طریقهٔ Large:M Max Z = x, +8x, Subject to (1) X, +3x, 56 2x, + x, = 8 X1, X, 20 نصائح: احصل على منطقة الإجابات المحتملة باستخدام طريقة الرسم. احصل أيضا على الإجابة وأجب عنها في بيئة برامج LINGO Python ,i Question 1: Solve the following linear optimization problem using the Large M method
Use a software program or a graphing utility to solve the system of linear equations. (If there is no solution, enter NO SOLUTION. If the system has an infinite number of solutions, set x5 = t and solve for x1, x2, X3, and x4 in terms of t.) X1 X2 + 2x3 + 2x4 + 6х5 — 3x1 2x2 + 4x3 + 4×4 + 12x5 19 X2 X3 - X4 3x5 = -5 2x1 2x1 2x2 + 4x3 + 5x4 + 15x5 = 17 2x2 + 4x3 + 4x4 + 13x5 19 (X1, X2, X3, X4, X5)
The time complexity of an algorithm gives an indication of the amount of time the algorithm will take to run completely. (a) Is the time complexity of an algorithm based on the best-case or the worst-case scenario of the Algorithm?
3) For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in timet, assuming that the algorithm to solve the problem takes f (n) microseconds. 1 1 second minute hour day month year century lgn n n lg n n2 n3 2" п!
Subject: Theory of Computation Design a brute-force algorithm for solving this problem (below) and demonstrate that this algorithm's time complexity grows exponentially with input length. Adding 2 binary numbers, w is the length of the input which is the number of digits in the numbers. Suppose the input has the same number of digits
(i) The time complexity of an'algorithm gives an indication of the amount of time the algorithm will take to run completely. (a) Is the time complexity of an algorithm based on the best-case or the worst-case scenario of the Algorithm? (b) Give the tight upper bound for the algorithms with the following time functions. Use the big O notation for your answers. 1. n°+3n+1 2. 2n + logn 3. n+n'+2" (c) Which of the algorithms in (i)(b) is most efficient?