tput This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also note that there are two variables name num, one in the main algorithm and another in the sub-algorithm. They are not related. Assume input is a positive integer. Write pre- post-conditions for each of these algorithms (the main one and the sub-algorithm). Note that the prime sub-algorithm is similar to the algorithm in Ex 1) but instead of reading input and producing outputs, it has a parameter num, and it returns the result. Also note that the =true is in gray color, which means it can be ignored. Note that since the sub-program is called several times, it's better that you use separate trace tables, one for each call, as shown below. num i←2 start i←i + 1 i T prime(i) = true T i≤ num end F prime(num) start flag ← true d-2 flag = true and d≤ num/2 T num mod d=0 LT flag ←false d

tput This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also note that there are two variables name num, one in the main algorithm and another in the sub-algorithm. They are not related. Assume input is a positive integer. Write pre- post-conditions for each of these algorithms (the main one and the sub-algorithm). Note that the prime sub-algorithm is similar to the algorithm in Ex 1) but instead of reading input and producing outputs, it has a parameter num, and it returns the result. Also note that the =true is in gray color, which means it can be ignored. Note that since the sub-program is called several times, it's better that you use separate trace tables, one for each call, as shown below. num i←2 start i←i + 1 i T prime(i) = true T i≤ num end F prime(num) start flag ← true d-2 flag = true and d≤ num/2 T num mod d=0 LT flag ←false d

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

Related questions

Q: for i: = 1 to 4n S:= 0 for j:= 1 to i - 1 s:= s+j• (i - j+ 1) next j r:= s? next i (a) What is the…

A: LINE 1 - for i := 1 to 2nLINE 2 - s := 0LINE 3 - for j := 1 to…

Q: Which assertion is false? CPU cycles are needed for time's complexity. Less memory is needed for…

A: It is not true that space complexity requires less RAM in this case. The term "space complexity"…

Q: Determine the runtime of the following algorithm in terms of the Θ bound. Please justify your…

A: There are two loops and here we refer them as outer loop and inner loop

Q: Trace the Euclidean algorithm by filling in the table below to compute gcd(664, 80). Use as many…

A: Here in this question we have asked to calculate the gcd of two number i.e gcd( 664 ,80) using…

Q: Question 1) Is 2"+1 = 0(2¹)? Question 2) Is 2²n = 0(2¹)? Question 3) Explain why the statement, “The…

A: NOTE :- Below i explain the answer in my own words by which you understand it well. O(f(n2))…

Q: Assume that the time complexity of an algorithm is denoted by Tn, where n is the size of the input.…

A: Numerous calculations are recursive. At the point when we investigate them, we get a repeat…

Q: For p = 7, q= 11, e = 13, and n = pq, find the multiplicative inverse of e, reduced modulo (n) using…

A: Hello student Greetings Hope you are doing great. Thank You!!! The extended Euclidean algorithm is…

Q: Consider the two algorithms: Algorithm A, whose time complexity is O(n²) and Algorithm B, whose time…

A: A measure known as time complexity indicates how long an algorithm takes to execute in relation to…

Q: Deploy the Euclidean algorithm to calculate the greatest common divisor of nį = 168 and n2 = 120. +…

A: Euclidean algorithm to find GCD(n1,n2): If n1=0 then GCD(n1,n2)=n2, since the GCD(0,n2)=n2, and we…

Q: 2. Find an expression involving n that gives the total number of operations performed by the…

A: Consider for i:=0 to n as i-loop for j:=0 to i as j-loop

Q: number of operations

A: Explanation: m=0; for( i = 1 to n) for( j = i+1 to n) m= max(ai,aj,m) Then here,…

Q: 4. Suppose that four algorithms have been devised for a certain problem. The expression of the time…

A: Dear Student, The answer to your question is given below -

Q: Give the total number of additions used in this segment of an algorithm. Give a big-O estimate for…

A: a) The line t:=t+2+3 only contains one addition operation. This line of code contains two addition…

Q: Perform an experimental analysis on the two algorithms & Visualize their running times as a function…

A: Below find the solution import java.io.FileWriter;import java.io.IOException;public class HW3…

Q: 3. Determine the running time of the following algorithms. Write summations to represent loops and…

A: Order of growth defines efficiency of an algorithm. The order of growth of an algorithm is an…

Q: John tells you that a certain algorithm runs in time N(n² + 200n), and Bill tells you that the same…

A: Solution:

Q: Consider a sequential search algorithm. Given a value, the algorithm scans a linear array until the…

A: Linear Search: The simplest search algorithm is linear Search. It sequentially traverses the array…

Q: Imagine that we have a data set of 10 items. We run an algorithm on that data set, and it performs…

A: Step 1:Step 2:Step 3:Step 4:

Concept explainers

Intermediate SQL Concepts

A query is a request for data or information from one or more database tables. This information could be presented in the form of pictorials, graphs, or complicated findings which helps in easy interpretation. Structured Query Language (SQL) is the most widely used programming language for retrieving and organizing data from relational databases. Collection of tables with rows and columns is referred to as a database. SQL is the language of databases. It makes it easier to extract specific data from databases, which can then be used for analysis.

Question

num
01
6
output
This exercise uses sub-algorithms. Trace it for when input value is 6 and complete the trace tables. Also
note that there are two variables name num, one in the main algorithm and another in the sub-algorithm.
They are not related. Assume input is a positive integer. Write pre- post-conditions for each of these
algorithms (the main one and the sub-algorithm). Note that the prime sub-algorithm is similar to the
algorithm in Ex 1) but instead of reading input and producing outputs, it has a parameter num, and it
returns the result. Also note that the =true is in gray color, which means it can be ignored. Note that since
the sub-program is called several times, it's better that you use separate trace tables, one for each call, as
shown below.
start
num
i ← 2
i←i + 1
i
T
prime(i) = true
T
i≤ num
end
F
F
prime(num)
start
flag ← true
d-2
flag = true and
d≤num/2
num mod d=0
T
flag ←false
d+ d + 1
ret flag
F
num flag d
2
returned value
num flag
3
d
num flag d
4
returned value
returned value

Trace the following flowchart for when input values are 12, 3, -3, 6, 11, 3, -1, -2 and complete the trace
table. Also, write pre- post-conditions for this flowchart.
start
cnt1 (0
cnt2-0
i (1
i←i+1
num
num<0
T
cnt1 a cnt1 +1
i<1
i←i+1
num
is 4
cnt1=cnt2
"yes"
(end)
T
num>0
T
cnt2 cnt2 + 1
F
is 4
T
F
F
"no"
F

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Sub Algorithms

VIEW

Step 2: Flow chart Table given

VIEW

Step 3: Flowchart For the table

VIEW

Solution

VIEW

Step by step

Solved in 4 steps

SEE SOLUTION Check out a sample Q&A here

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

Suppose that we reach a point in algorithm where we then to decide to execute one of set of steps if the variable x has a value greater than or equal to zero or another set of steps if x has a value less than 0. In pseudo-code, show how one would address this situation in an algorithm.
QUESTION 11 Algorithm one has time complexity f, that is O(n°) and algorithm two has time complixity f2 that is 0(10n°). Which algorithm is faster for large inputs? Algorithm one is faster. Algorithm two is faster. The two algorithms are equally fast. We can not tell from the information given.
For each of the following algorithm in pseudo-code, indicate the time efficiency using BigTheta (Θ) notation. You need to 1) identify the basic operation, and 2) justify your results by doing summation or listing and solving the recurrence relation of T(n), which is the number of basic operations.It is your decision to make on the method you use to solve the recurrence. Question 1) for i = 3 to n dofor j = 1 to i doa[i][j]= 0; Question 2) Algorithm f(n): if n==1 return 1; return 2*f(n-1)+ n*n*n;
Please provide a correct answer with a full explanation by yourself. Don't copy. Thank you.
5
Question 1 Suppose a large group of people in a room were all born in the same year. Consider the following three algorithms, which are each intended to identify the people in the room who have the earliest birthday based on just the month and day. For example, a person born on February 10 is considered to have an earlier birthday than a person born on March 5. Which of the three algorithms will identify the correct people? I. All the people in the room stand up. All standing people form pairs where possible, leaving at most one person not part of a pair. For each pair, the person with the earlier birthday remains standing, while the other person in the pair sits down. If there is a tie, both people sit down. Any individual not part of a pair remains standing. Continue doing this until only one person remains standing. That person has the earliest birthday. II. All the people in the room stand up. All standing people form pairs with another standing person that they have not previously…
Determine the expected case running time of the algorithm. Fully justify your solution. Determine the best case running time of the algorithm and state what condition must be true forit to occur. No justification is needed! Determine the worst case running time of the algorithm and state what condition must be true forit to occur. No justification is needed!
Algorithm
A binary searching algorithm has logarithmic ?(log?) performance. It takes a second to find an item in a list of 10,000 entries. How long do you expect it to take to find an item in a list of 50,000,000 entries? How did you arrive at your answer?
Construct a trace table to trace the action of the algorithm below for the input variables given. a := 53, d := 11 r:= a, q := 0 while (r 2 d) r:=r- d 9 := q + 1 end while iteration 1 2 3 a 53 d 11 53
Analysis of Algorithm: The number of operations executed by algorithms A and B is 40n2 and 2n3, respectively. Determine a n0 such that A is better than B for n >= n0
No plagarism please! Correct and detailed answer will be Upvoted else downvoted. Thank you!