The next question has to do with a bisection process, which is very common in mathematical software. For example, the bisection method for finding a root of a function starts with an interval, [a, b], where f(a) and f(b) have different signs. It then computes the midpoint of the interval, c = (a + b) / 2. It then replaces either a or b by c so that the signs of the new f(a) and f(b) are still different, thus guaranteeing that the new interval [a, b], which is either the left or right half of the previous interval, still brackets a root. In the next 2 questions, assume B = 2 and p = 24. 13. If a = 1 and b = 2, how many times can bisection occur before there are no floating-point numbers in the interval (a, b) (in other words, a and b are adjacent floating-point numbers)?

The next question has to do with a bisection process, which is very common in mathematical software. For example, the bisection method for finding a root of a function starts with an interval, [a, b], where f(a) and f(b) have different signs. It then computes the midpoint of the interval, c = (a + b) / 2. It then replaces either a or b by c so that the signs of the new f(a) and f(b) are still different, thus guaranteeing that the new interval [a, b], which is either the left or right half of the previous interval, still brackets a root. In the next 2 questions, assume B = 2 and p = 24. 13. If a = 1 and b = 2, how many times can bisection occur before there are no floating-point numbers in the interval (a, b) (in other words, a and b are adjacent floating-point numbers)?

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

Adam begins to master programming. The main undertaking is drawing a fox! Notwithstanding, that ends up being excessively hard for a novice, so she chooses to draw a snake all things being equal. A snake is an example on a n by m table. Mean c-th cell of r-th column as (r, c). The tail of the snake is situated at (1, 1), then, at that point, it's body reaches out to (1, m), then, at that point, goes down 2 lines to (3, m), then, at that point, goes left to (3, 1, etc. Your undertaking is to draw this snake for Adam: the unfilled cells ought to be addressed as speck characters ('.') and the snake cells ought to be loaded up with number signs ('#'). Consider test tests to comprehend the snake design for the programming concepts.
Lee has discovered what he thinks is a clever recursive strategy for printing the elements in a sequence (string, tuple, or list). He reasons that he can get at the first element in a sequence using the 0 index, and he can obtain a sequence of the rest of the elements by slicing from index 1. This strategy is realized in a function that expects just the sequence as an argument. If the sequence is not empty, the first element in the sequence is printed and then a recursive call is executed. On each recursive call, the sequence argument is sliced using the range 1:. Here is Lee’s function definition: Write a program that tests this function and add code to trace the argument on each call. Does this function work as expected? If so, are there any hidden costs in running it?
Lee has discovered what he thinks is a clever recursive strategy for printing the elements in a sequence (string, tuple, or list). He reasons that he can get at the first element in a sequence using the 0 index, and he can obtain a sequence of the rest of the elements by slicing from index 1. This strategy is realized in a function that expects just the sequence as an argument. If the sequence is not empty, the first element in the sequence is printed and then a recursive call is executed. On each recursive call, the sequence argument is sliced using the range 1:. Here is Lee’s function definition: def printAll(seq): if seq: print(seq[0]) printAll(seq[1:]) Write a program that tests this function and add code to trace the argument on each call. Does this function work as expected? If so, are there any hidden costs in running it?
Run my function on {(1,4),(0,6),(3,5),(2,9),(7,8)}. Is the output what you expect? Find the problem and fix it, writing a correct version of the function. Again, use the same function name, i.e., count_crossings_and_nestings. Demonstrate that the new version works by testing it on the example provided. Now write a well-documented version of your function count_crossings_and_nestings. Add a document string and plenty of comments.
A robot moves in a 2D lattice. The robot can only move north (N), south (S), east (E), and west (W) by a certain number of steps. Assume that the robot always starts at (0,0), and that the x axis is oriented east, while the y axis is oriented north. Write a Python function that, given a set of moves, calculates the final position of the robot. For example, if the set of moves provided as input is: N 2 E 4 S 1 W 3 then the final position of the robot is (1,1). The integer that follows a move is always positive. Follow this code skeleton: def robot_move (moves): X = 0 y = 0 # your code here return (x,y) The moves are provided as an array of tuples. The array can have any number of moves in any order. The example above is passed as input as follows: [('N',2), ('E',4), ('S',1), ('W',3)]
Your main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of order n to standard drawing. Think recursively: sierpinski() should draw one filled equilateral triangle (pointed downwards) and then call itself recursively three times (with an appropriate stopping condition). It should draw 1 filled triangle for n = 1; 4 filled triangles for n = 2; and 13 filled triangles for n = 3; and so forth. Sierpinski.java When writing your program, exercise modular design by organizing it into four functions, as specified in the following API: public class Sierpinski { // Height of an equilateral triangle with the specified side length. public static double height(double length) // Draws a filled equilateral triangle with the specified side length // whose bottom vertex is (x, y). public static void filledTriangle(double x, double y, double length) // Draws a Sierpinski triangle of order n, such that the largest filled //…
Write a Python function that takes in three parameters - an adjacency matrix of a simple directed graph, a start node, and an end node; and returns "True" if there is a way to get from the start node to the end node using the provided edges. You can use this file as a starter code: path.py ↓ For example: Using the same graph given above. Consider your function with the same adjacency matrix given above as input and: If the start node is 1 and the end node is 4 then your function should return True. If the start node is 2 and the end node is 4 then your function should return False. Input: This function will have three parameters. First is an adjacency matrix in the form of a list of lists (as given above). Then the start_node and the end_node will be integers. Note that python indexing starts from 0 and not from 1, so the naming of the nodes will also follow the python convention and start from 0 instead of 1. Output: Boolean value: True or False.
Write an iterative function that determines the number of even elements in an array a of integers of size n. The function should return the number of elements that are even in array a of size n. Propose an appropriate prototype for your function and then write its code. Write a recursive function to solve the above problem. Propose an appropriate prototype for your function and then write its code.
This is for a Java Progrsm problem but If you could fully explain it to me then I should be okay to try to create this program based off your explaination. Thank you! Trigonometry is needed A pipe is to be carried around a right-angled corner of two intersecting corridors. Suppose that the widths of the two intersecting corridors are 5 feet and 8 feet. Your objective is to find the length of the lingest pipe, rounded to the nearest foot, that can be carried level around the right-angled corner. What I have to do is the following: Write a program that prompts the user to input the widths of both the hallways/ The program then outputs the length of the longest pipe, rounded to the nearest foot, that can be carried level around the right-angled cprner. Note that the length of the pipe os goven by l = AB + BC = 8 /SIN 0 (Omega) + 5 / cos 0(Omega), where 0 < > Omega < pi/ 2
Write in python programming language: The Longest Subsequence Problem is a well-studied problem in Computer Science, where given a sequence of distinct positive integers, the goal is to output the longest subsequence whose elements appear from smallest to largest, or from largest to smallest. For example, consider the sequence S= [9,7,4,10,6,8,2,1,3,5]. The longest increasing subsequence of S has length three ([4,6,8] or [2,3,5]), and the longest decreasing subsequence of S has length five([9,7,4,2,1] or [9,7,6,2,1]). And if we have the sequence S = [531,339,298,247,246,195,104,73,52,31], then the length of the longest increasing subsequence is 1 and the length of the longest decreasing subsequence is 10. Question: Find a sequence with nine distinct integers for which the length of the longest increasing subsequence is 3, and the length of the longest decreasing subsequence is 3. Briefly explain how youconstructed your sequence. Let S be a sequence with ten distinct integers. Prove by…
Describe an efficient way of putting a VECTOR representing a deck of n cards into random order in C++. You may use the function randomlnt(n), which returns a random number between 0 and n-1, inclusive. Your method should guarantee that every possible ordering is equally likely. What is the running time of your function?
Although the plot function is designed primarily for plotting standard xy graphs, it can be adapted for other kinds of plotting as well. b. Make a plot of the curve, which is defined parametrically by the equations x = 2cosθ + cos2θ, y = 2sinθ - sin2θ, where 0 < θ < 2π. Take a set of values of θ between zero and 2π and calculate x and y for each from the equations above, then plot y as a function of x. b. Taking this approach a step further, one can make a polar plot r = f(θ) for some function f by calculating r for a range of values of θ and then converting r and θ to Cartesian coordinates using the standard equations x = r cosθ, y = r sinθ. Use this method to make a plot of the function r = ecosθ – 2 cos(4θ) + sin5 (θ/12) in the range 0 <= θ <= 24π. use python code to answer the highlight one