C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN: 9781337102087
Author: D. S. Malik
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Related questions
Concept explainers
Question
- Following are the various algorithms time complexities expressions. Find the dominant terms and specify the Big-Oh complexity of each
algorithm .
S. No. |
Expression |
Dominant term(s) |
O (. . .) |
|
1. |
75 + 0.001n1.3 + 0.025n + (1000)4 |
|
|
|
2. |
500n + 100n + 50n log10 n |
|
|
|
3. |
(10n1.5)4 + 0.3n + 5n6.5 + 2.5 · n2.75 |
|
|
|
4. |
150n3 + n2 log2 n + n(log2 n)4 |
|
|
|
5. |
3 log10 n + log2 log2 n |
|
|
|
6. |
100n4 + 0.01n2 + 200(log2 n)4 |
|
|
|
7. |
n3 + 0.01n + 100n2 + 5n3 |
|
|
|
8. |
2n0.5 + n0.35 + 0.5n0.25 |
|
|
|
9. |
0.01n2 log2 n + n(log2 n) |
|
|
|
10. |
50n3 log3 n + n5 log3 n + 100n4 |
|
|
Transcribed Image Text:Following are the various algorithms time complexities expressions. Find the dominant terms and
specify the Big-Oh complexity of each algorithm.
Expression
75 + 0.001n.3 +0.025n + (1000)
500n + 100n + 50n log1o n
(10n1.5)4 +0.3n + 5nº.5 + 2.5 · n².75
150n3 + n² log2 n+n(log2 n)*
3 log10 n + log2 log, n
100n4 + 0.01n² + 200(log2 n)
n3 + 0.01n + 100n? + 5n3
2n0.3 +n0.35 +0.5n0.25
0.01n² log2 n + n(log2 n)
50n3 log3 n + n log3 n + 100nt
S. No.
Dominant term(s)
O(.)
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
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 nowThis is a popular solution!
Step by stepSolved 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.Similar questions
- please read the question carefully and answer the question carefullyarrow_forwardExercise: Find the function s(n) that indicates the number of sums performed by the following segment of an algorithm: for i = 2 to n+1 do for j = 1 to i+2 do p = p + n +jarrow_forwardQ12: Assume that each of the expressions below gives the processing time T(n) spent by an algorithm for solving a problem of size n. Select the dominant term(s) having the steepest increase in n and specify the lowest Big-Oh complexity of each algorithm. For example, the dominant term in 0.1n + 10m'is 10n and it is O(n). Expression Dominant term(s) 0(...) 5+ 0.001n + 0.025n 500n + 100n'5 + 50n logio n 0.3n + 5n + 2.5 · n75 n° log,n + n(log, n) n log;n+n log, n 100n + 0.01n 0.01n + 100narrow_forward
- 9. Give a big-O estimate for the number of operations, where an operation is an addition or a multiplication, used in this segment of an algorithm.arrow_forwardDesign an algorithm for determining the day of the week of any date since January 1, 1700. For example, August 17, 2001 was a Friday.arrow_forward1. We are given the following algorithm segment as below: for j := 1 to 2n for k:=1 to 2n a[j] = 2 * k + j - 1; next j next k a. What is the number of elementary operations per loop iteration? b. What is the total number of loop iterations? c. What is the total number of elementary operations? d. What is the order of the algorithm segment (0)?arrow_forward
- Please see attachedarrow_forwardDesign an algorithm for computing for any positive integer n. Besides assignment and comparison, your algorithm may only use the four basic arithmetical operations.arrow_forward1. A certain computer algorithm executes four times as many operations when it is run with an input of size n as when it is run with an input of size n – 1. Here, n > 1 is an integer. When the algorithm is run with an input of size 1, it executes 12 operations. How many operations does the algorithm execute when it is run with an input of size 5? How many operations does the algorithm execute when it is run with an input of size n?arrow_forward
- 5. Consider the algorithm that takes an input n and runs the following pseudocode: for i := 1 to 5 for j := 1 to n k := 7.i+1 next j k := k + 3 – 2 - i next iarrow_forwardConsider the problem of computing the sum of the first n cubes: S(n) = 13 + 23 + … + n3. Design two algorithms as follows: Recursive algorithm Non-recursive algorithm Analyze the time efficiency of your two algorithms and compare which is better.arrow_forwardAnswer question 1. There are two algorithms given in pseudo code.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning