Answered: Calculate the weakest precondition of…

Calculate the weakest precondition of the following program with respect to the postcondition (4 ≤ y ≤ 22). if (x < y) else x := 3y; else y := 3x; if (x <10) y 3x6; y := 2x+3; y := y 5;

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

Are the following expressions equivalent?(a) (x >= 1) and (x < 10)(b) (1 <= x < 10)
Given the recursive function below where n is an integer: if n = 0 or n = 1 or n = 2 f(n) = {f(n – 2) + f(n – 4) otherwise Which of the following statements is true? IMPORTANT: There is no "Check" button for this question. You can change the answer as many times as you like. Select one: O a. The function terminates if and only if n is 1 or even. O b. The function terminates if and only if n24. O . The function terminates if and only if n=1 or n is even and greater or equal to 0. O d. The function terminates if and only if n is 0, 1 or 2. O e. The function terminates if and only if n20.
Write a Python program that plays the rock-paper-scissors game, that following happens: Rock breaks scissors Paper covers rock Scissors cut paper There is a tie (both players picked the same thing) Fulfillments: Your program should have at least 2 functions, including a main() function (no global variables or global code other than a call to main within an if-statement) You should use at least one multi-way if-statement (using "elif"). You should use at least one logical "and" or "or" in your program You should always output who won (unless there's a tie). Every function (except main) needs to have a comment in a triple-quoted string at the beginning, briefly explaining what it does. Have a repeat function that asks the user if they want to exit the game (ask the user whether he/she wants to continue the game.)
Gordon Ramsay has N strange bottles of sauces. The i-th bottle is opened by tapping exactly A¡ times. Ramsay needs to open K bottles as soon as possible for cooking a dish for the customer. As a challenge someone shuffled the bottles! Ramsay knows the values A;; however, he doesn't know which bottle is which. He'd like to minimize the worst-case number of taps. Create a C++ program to print the minimal number of taps for the worst-case. Input: 1 21 58 Output: 8
..5-- I have a python programing question In 1937, a German mathematician named Lothar Collatz formulated an intriguing hypothesis (it still remains unproven) which can be described in the following way: 1. take any non-negative and non-zero integer number and name it c0; 2. if it's even, evaluate a new c0 as c0 ÷ 2; 3. otherwise, if it's odd, evaluate a new c0 as 3 × c0 + 1; 4. if c0 ≠ 1, skip to point 2. The hypothesis says that regardless of the initial value of c0, it will always go to 1. Of course, it's an extremely complex task to use a computer in order to prove the hypothesis for any natural number (it may even need artificial intelligence), but you can use Python to check some individual numbers. Maybe you'll even find the one which would disprove the hypothesis. Write a program which reads one natural number and executes the above steps as long as c0remains different from 1(c0 != 1). Moreover, we'll add another task - we want you to count the steps needed to achieve the goal.…
Justin receives 52 weekly paychecks per year. Each week, he contributes a specific percentage of his gross weekly pay to his retirement plan at work. His employer also contributes to his retirement plan, but at a different rate. Justin wants a program that calculates and displays the total annual contribution made to his retirement plan by him and his employer. Desk-check your solution’s algorithm using $640 as the gross weekly pay, 6% as Justin’s contribution rate, and 4% as the employer’s contribution rate. Then desk-check it using your own set of data.
In a competition, four different functions are observed. All the functions use a single for loop and within the for loop, same set of statements are executed. Consider the following for loops: a) for (i = 0; i-1; i/= 2) 4 2 logn If n is the size of input (positive), which function is most efficient (if the task to be performed is not an issue)?
Implement programs involving the use of while, do..while and for loop statement. Objectives: Topics Covered: Implementing programs using loops. Description FRIDAY THE 13TH When will Friday the 13th occur in 1990? Write a program that will find all months in 1990 in which the 13th falls on a Friday. You need to know the following. 1. January 1, 1990 was on a Monday. 2. September, April, June, and November have thirty days, all the rest have 31 except for February which has 28 except in leap years when it has 29. 3. 1990 is not a leap year. Note: To make it fair for everyone, you may not use any built-in date functions from your computer language. Sample Output if Applicable Sample Run In 1990, Friday the 13th occurs in the months: APRIL
Python Programming Part 2 Direction: Use PYTHON to solve this problem. Description: This part tests for two things. The program must identify all resistors in series or in parallel with each other and calculate the equivalent resistance for each group of resistors. Recall that total resistance of resistors in series are added up while the total conductance of those in parallel are added up. Input Format: The first line of the input consists of 1 integer N which is the total number of resistors. The next N lines will consist of 3 strings and an integer R each separated by a space. The first string is the resistor name, the second and third strings are the node names where the resistor terminals are connected, and R is its resistance value. Output Format: One line for each group of resistors in series or parallel. Each line starts with a list of resistors arranged in lexicographical order (see Lexicographic order - Wikipedia) followed by their total resistance rounded off to the nearest…
This program computes quotients and remainders Verify that it is partially correct with respect to the intial assertion "a and d are positive integers" and the final assertion "q and r are integers such that a = dq + r and 0 ≤ r < d". r = a;q = 0; while (r ≥ d){r = r - d;q = q + 1;}
Program Sample outputs Amount°you°wish•to°prepay:°$844 With $84°you°can•buy°6 meals and•will have°a•balance°of°$6. Amount°you®wish to°prepay:°$1954 With $195°you°can•buy°15°meals and•will•have°a•balance°of°$0.
38. The geometric mean g of n numbers x; is defined as the nth root of the product of x;: g=Vx1x2X3•…Xn (This is useful, for example, in finding the average rate of return for an investment which is something you'd do in engineering economics). If an investment returns 15% the first year, 50% the second, and 30% the third year, the average rate of return would be (1.15*1.50*1.30)") Compute this.