2.7 The "divide and average" method, an old-time method for approximating the square root of any positive number a can be formulated as x = x + a/x 2 (a) Write well-structured pseudocode to implement this algorithm as depicted in Fig. P2.7. Use proper indentation so that the structure is clear. (b) Develop, debug, and document a program to implement this equation in either a high-level language or a macro language of your choice. Structure your code according to Fig. P2.7. F SquareRoot = 0 T a > 0 tol = 10-6 x = a/2 y = (x + a/x)/2 | = |(y = x)/y|| e x = y F e < tol T SquareRoot = x

2.7 The "divide and average" method, an old-time method for approximating the square root of any positive number a can be formulated as x = x + a/x 2 (a) Write well-structured pseudocode to implement this algorithm as depicted in Fig. P2.7. Use proper indentation so that the structure is clear. (b) Develop, debug, and document a program to implement this equation in either a high-level language or a macro language of your choice. Structure your code according to Fig. P2.7. F SquareRoot = 0 T a > 0 tol = 10-6 x = a/2 y = (x + a/x)/2 | = |(y = x)/y|| e x = y F e < tol T SquareRoot = x

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

Q1. a) The Little Man Computer (LMC) is an instructional model of a computer used to teach students all of the basic features of a modern computer in a simplified way. The following Little Man program is supposed to add two input numbers and output the result, i.e., OUT = IN1 + IN2 Mailbox Mnemonic code Numeric code 00 IN 901 01 STO 99 399 02 IN 901 03 ADD 99 199 04 OUT 902 05 COB 000 i) Change the program above to add the numbers 157 and 13. (Hint: these numbers are constants and therefore can pre-exist into memory before the execution of the program). No need to write both mnemonics and numeric codes (opcodes), either one is fine. Please refer to the instruction set provided for all the LMC instruction mnemonics and opcodes.
When writing programs, what is a recursive functior.? A. A function that calls another function A function that calls itself only once C A function that calls itself or another function that eventually calls the original function A recursive function is any composite function that eventually calls itself only once.
Python program (recursive function) A recursive function is a function defined in terms of itself via self-referential expressions. This means that the function will continue to call itself and repeat its behavior until some condition is met to return a result. Write a python recursive functionprod that takes x as an argument, and returns the result where, result=1*1/2*1/3*….*1/n Include a screenshot that shows a python program that uses the above function and prints the rounded result to three decimal placesafter prompting the user to enter a number, x. Use x=3. N.B: The code should be included please.
c programming Task 3: Complete armstrong_task3.c by implementing armstrong_recursive function. int armstrong_recursive (int arm); It performs same operation as in Task 1, however in a recursive manner. A number to be checked whether it is armstrong or not is given as an input and the function returns the summation of the digits. If the returned value is equal to the given input value then it is an armstrong number.
Problem 1 (Sum of Digits) Write and test a recursive function called sum_of_digits(number) that takes a positive number as input and returns the sum of all digits in that number. Sample run: >>> print(sum_of_digits(3)) 3 >>> print(sum_of_digits(30)) 3 Page 1 of 4 >>> print(sum_of_digits(24)) 6 >>> print(sum_of_digits(2471)) 14
3. You are expected to write a recursive function called powy(base, exponent) that, when called, returns baseponent As an example, powy( 6, 5 ) =6*6*6*6*6. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship baseponent - base baseponent - 1 and the terminating condition occurs when exponent is equal to 1, because base' = base
If you have trouble reading the picture please let me know. 8. (a) Write behavioral Verilog code for a module called “Sort2” (pictured below) with three inputs s, a, b and two outputs x, y. The module’s function is also described below; in the function table, a “–” represents a don’t care. Also the function table has s, a as inputs, but the outputs x, y are expressed in terms of the third input b. In words, the “function table” to the left translates to the following: When s = 0, the smallest value among a and b goes to x and the other value goes to y. When s = 1, the largest value among a and b goes to x and the other value goes to y. (b) Structurally connect copies (or instantiations) of the module Sort2 to construct the module Bitonic with four inputs a0,a1,a2,a3 and four outputs z0,z1,z2,z3 shown below; each box in the figure below represents an instantiation of Sort2. Further, the inputs and outputs of the instantiations are located as in the figure above; namely, input to…
C program. pls follow the objectives
Q1) Write a program in C + + language to find the result of executing the sequence of iteration sentences S= 4/2+8/4+12/6+16/8+20/10