Prove Total correctness of the following code block, and list all axioms andinference rules used to determine this:{ radicand> 100}root = 1.0one = 1.0tenth = 0.1hundredththousandth0.01= 0.001while(root * root < radicand ) {) {=if ( (root + one) * (root + one) < radicand) {root =root + one;} else ifroot root + tenth;} else if ( (root + hundredth) * (root + hundredth) <radicand){( (root + tenth) * (root + tenth) < radicandroot = root + hundredth;root + thousandth;} else {}root

1. If radicand > 100, then root < radicand.2. If (root + tenth) * (root + tenth) <…

Answered: Prove Total

Engineering

Computer Science

Prove Total

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: Prove the following statement using a proof by contradiction. 1. For every integer n, if n² is odd,…

A: 1) Proof by contradiction is a method of mathematical or logical reasoning in which we assume the…

Q: T(n)=7T(n/2)+n, where T (1)=1 b. Use induction to prove your result. Use induction to prove the…

A: Suppose n is a power of 2, say n=2^k, and suppose T(1)=1. ThenT(n)=7T(n/2)+n…

Q: For the next recurrence, solve it using the master theorem and indicate whether it can actually be…

Q: The solution to the recurrence cquation: T (2)=3T (2) - 1,T(1) = 1 is:

A: The answer for the recurrence equation is

Q: Solve the recurrence: Qn 3Qn-1+10Qn-2 Qo = 2 Q1 10 %3D

Q: Use Mathemabieal nduction to Show that n-n is diusıble by 3

A: Given: use mathematical induction to show that n3-n divisible by 3

Q: lain Master Theorem .Using Master Theorem solved the following recurrence. T(n) =4T(n/4) + log2…

A: Explain Master Theorem .Using Master Theorem solved the following recurrence. T(n) =4T(n/4) +…

Q: T(n) = T(vn) +1. Solve the following recurrence relationships

A: Here, 1 denotes that the time required to compare and return the value is constant. The Master's…

Q: Use a direct proof to show that the sum of three odd integers is odd.

Q: • Find the Mean Recurrence Time trj = 1/ Pj

A: The solution to find mean recurrence time is given below.

Q: Who am I? If you multiply me by -6 and add 18, the result is -114

A: Here in this question we have given data .let's there b e some unknown and result is -114 when you…

Q: solve the following recurrence using master theorem T(n)=81T(n/3)+n^4

A: In this question we have given a recurrence and we need to find the solution of the recurrence using…

Q: 2) Make a multiplication table , for the field of all nonz polynomials of degree n-1 or less. A) n=2…

A: It is defined as the algebraic expressions that consist of variables and coefficients. Variables are…

Q: Question 2: Solve the following recurrence using the "Master Theorem Method" T(n) = 5T() + n² lg n

A: Answer..

Q: What is the multiplicative inverse of 53 , in 53 mod 15? (Note: p is not prime - use euclidian…

A: The answer is (along with stepwise calculations)

Q: - 5. Show that ₁(2i − 1) = n² using a proof by induction. 6. Show that n 1 using a proof by…

A: QUESTION 5 Base case: n = 1 1(2i - 1) = 1(2(1) - 1) = 1(2 - 1) = 1(1) = 1 Inductive case: n = k…

Q: Solve the following recurrence equation. T(n) = 2T(n/2) + n2

A: T(n) = 2T(n/2) + n² Here we need to use substitution method to solve. @ 1st step, substitute n by…

Q: Solve the recurrence: T (n) = 2T (n) + n? first by directly adding up the work done in %3D each…

A: ANSWER: Master Theorem: A theorem giving an answer in asymptotic terms for repeat relations of the…

Q: Find the iteration formula for Taylor method if n = 3.

A: The above question is solved in step 2 :-

Q: Use induction to prove that every integer n ≥ 2 can be written as a product of primes.

A: Use induction to prove that every integer n ≥ 2 Prime number must satisfy the following two…

Q: Prove by cases for any integer n ,the number (n3-n) is even.

A: hay! in the following c++ code I proved any integer n , the number (n3-n) is even. PLEASE CHECKOUT…

Q: Find and simplify the generating function for ({01,0111}*0)*11*.

A: Answer: We have drawn the Machine function that will generate the string or accept the…

Q: 5. For whichn the number of MOLS of order n is n- 1?

A: Any set of MOLS of order n is equivalent to a set in standard form, which of course has the same…

Q: Generate all permutations of {3, 8, 2} using the Johnson-Trotter algorithm. Show the steps.

A: Initialize the first permutation with <1 <2 ... <nwhile there exists a mobile integer find…

Q: Prave that if 3nt4 is Hen

A: GIVEN: Prove that if 3n+4 is odd, then n is odd We can prove this in two ways Proof by…

Q: Q4) Solve the following recurrences using the Master Theorem. If it is not possible to solve it…

A: T(n) = 4T(n2) +1 By using Master Theorem- a = 4b = 2k = 0p = 0 Now, a = 4 and bk = 20 = 1Clearly, a…

Q: Coler the following tecutence ving re (1)-1

A: The answer for following recurrence is

Q: Solve the recurrence by using repeated substitution. Show the work. T(n) = T(n-1) + n

A: REPEATED SUBSTITUTION METHOD: Following are the steps to implement the repeated substitution on any…

Q: The Collatz conjecture says that you will always eventually reach the number 1. This conjecture has…

A: python program: # taking input from the user N = eval(input("N:")) # if the input is non-positive…

Q: Use induction to show that 4n < 2nfor all n ≥5

A: SEE THE ANSWER IN SECOND STEP

Q: Find the value of x for the following sets of congruence using the Chinese remainder theorem. a. x ≡…

A: Answer

Q: Find the greatest common divisor of 1,234,567 and 7,654,321.

Concept explainers

Problems on numbers

Number theory is one of the most appealing topics in mathematics. Given one or more numeric values, a numeric algorithm performs some computation. The use of number theory in computing is important for applications like in the case of cryptographic algorithms. Number theory is also used in various applications such as calculating hash functions or in information security. Euclid’s algorithm is one of the oldest number-theoretic algorithms which is used to calculate the greatest common divisor of two numbers.

Question

Prove Total correctness of the following code block, and list all axioms and
inference rules used to determine this:
{ radicand> 100}
root = 1.0
one = 1.0
tenth = 0.1
hundredth
thousandth
0.01
= 0.001
while(root * root < radicand ) {
) {
=
if ( (root + one) * (root + one) < radicand) {
root =root + one;
} else if
root root + tenth;
} else if ( (root + hundredth) * (root + hundredth) <
radicand){
( (root + tenth) * (root + tenth) < radicand
root = root + hundredth;
root + thousandth;
} else {
}
root

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

VIEW

Step 2

VIEW

Step by step

Solved in 2 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

For each of the following recurrences, solve them using the master theorem and indicate whether it can actually be solved with the theorem or not. If so, indicate the selected case.
Example of Longest Increasing Subsequence.
explain difference of minimal sum and complete sum of prime implicant
Use the substitution method to solve the recurrence equation: T(n) = 2T(n/2) + n and Use the iteration method to solve the recurrence equation: T(n) = T(n/2) + n
For each of the following recurrences, solve them using the master theorem and indicate whether it can actually be solved with the theorem or not. If so, indicate the selected case.
Note: for the following problems f, refers to the n-th Fibonacci number. 2. Use induction to prove that f, and fn+1 are coprime for any ne N.
Prove or disprove
Solving the following Recurrences Using Induction Consider the recurrence t,=2tn-1 +1, n21 with initial condition to=0. Obtain the solution using the substitution method.
QUESTION 3 Find k, if any, such that AB = BA where 25 4 -5 A = and B= 3 k
Find the limit. lim log,(1 + 6*)