Q2. The following algorithm returns the product of two numbers, a and b. The parameters x and y are natural numbers. First, prove the correctness of the algorithm. Then, analyze the time complexity of the algorithm in the worst case scenario. function mult(a, b) if b = 0: return 0 else if b is odd: return (mult (2a, b/2 )+a) else: return (mult (2a, b/2 ))

Q2. The following algorithm returns the product of two numbers, a and b. The parameters x and y are natural numbers. First, prove the correctness of the algorithm. Then, analyze the time complexity of the algorithm in the worst case scenario. function mult(a, b) if b = 0: return 0 else if b is odd: return (mult (2a, b/2 )+a) else: return (mult (2a, b/2 ))

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 The periodic function sin⁡(2x) has multiple roots between x values of -5π and 5π. If xL = -15 and xU = 15, which of the following statements is true using a bracketed method? Select one: a. All roots will be returned b. The middle root will be returned c. The chosen bracket is invalid for bracketed methods d. A single root will be returned e. The algorithm will be stuck in an infinite loop Q2 Consider x and y to represent data points (xi,yi), where i = 1, 2, 3, … n. What is the length of pafter running the following command? p = polyval(x,y) Select one: a. n b. n - 1 c. n + 1 d. Empty variable e. 1 Q3 Consider a system of linear equations in the form of AX = B, where X is the unknown vector. Which of the following can be used to solve for X? Select one: a. X = A\B b. X = B./A c. X = inv(B)*A d. X = inv(A)./B e. X = B\A
You are a computer research scientist at Tesla, and your task is to create a computer vision application for self-driving cars to detect object and avoid collision. You know that Graham's scan is a method of computing the convex hull of a finite set of points in the plane. You decide to apply this algorithm to achieve the goal of your task. a) Suppose Graham's scan executes n points, where n >= 3. Prove that, at the end of the program, the stack S consists of, from bottom to top, exactly the vertices of convex hull in counter-clockwise order.
2. A celebrity among a group of n people is a person who knows nobody but is known by everybody else. Design a decrease-and-conquer algorithm that identifies a celebrity among n people, or outputs "no celebrity identified" if there is no such person, by only asking the question "Do you know him/her?" to people. Analyze the efficiency of the algorithm.
In the divided and conquer algorithm for computing the maxima set of a given set A of n points in 2D, we split the points into left and right halves, recur on each half, and then merge the results. Let MSL and MSR be the return value of these recursive calls. Which of the following statements is true about these sets. Select all that apply. MSR is a maximum set of the right half. Every point in MSL belongs in the maximum set of A. MSL is a maximum set of the left half. Every point in MSR belongs in the maximal set of A.
Python answer only. Correct answer will upvoted else downvoted. It is the ideal opportunity for your very first race in the game against Ronnie. To make the race intriguing, you have wagered a dollars and Ronnie has wagered b dollars. Yet, the fans appear to be frustrated. The fervor of the fans is given by gcd(a,b), where gcd(x,y) means the best normal divisor (GCD) of integers x and y. To make the race seriously invigorating, you can perform two kinds of activities: Increment both an and b by 1. Diminishing both an and b by 1. This activity must be performed if both an and b are more noteworthy than 0. In one action, you can play out any of these activities. You can perform self-assertive (potentially zero) number of moves. Decide the greatest energy the fans can get and the base number of moves needed to accomplish it. Note that gcd(x,0)=x for any x≥0. Input The principal line of input contains a solitary integer t (1≤t≤5⋅103) — the number of experiments.…
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. Today the kindergarten has another gathering of n kids who should be situated during supper. The seats at the table are numbered from 1 to 4n. Two children can't sit on a similar seat. It is realized that two children who sit on seats with numbers an and b (a≠b) will enjoy if: gcd(a,b)=1 or, a partitions b or b separates a. gcd(a,b) — the greatest number x with the end goal that an is distinct by x and b is detachable by x. For instance, if n=3 and the children sit on seats with numbers 2, 3, 4, then, at that point, they will enjoy since 4 is isolated by 2 and gcd(2,3)=1. On the off chance that children sit on seats with numbers 4, 6, 10, they won't enjoy. The educator truly doesn't need the wreck at the table, so she needs to situate the children so there are no 2 of the child that can enjoy. All the more officially, she needs no pair of seats an and b that the children…
Algorithms Question Three points P, Q, and R are said to be collinear if they are on a single line. To check whether the 3 points lie on the same line, we use the distance formula. If P, Q and R are three collinear points, then: Distance from P to Q + Distance from Q to R = Distance from P to R PQ + QR = PR The distance between two points (x1, y1) and (x2, y2) is given by Hence, we can easily find the distance between the points P, Q and R, with the help of this formula. Design an algorithm (pseudocode) to check whether three points are collinear. In your solution include the input and the output.
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two or more digits, those digits are summed and the process is repeated. This is continued as long as necessary to obtain a single digit. For example, consider the positive integer 24. Adding the 2 and the 4 yields a value of 6. Since 6 is a single digit, 6 is the digital root of 24. Now consider the positive integer 39. Adding the 3 and the 9 yields 12. Since 12 is not a single digit, the process must be repeated. Adding the 1 and the 2 yields 3, a single digit and also the digital root of 39. Input File: The input file will contain a list of positive integers, one per line. The end of the input will be indicated by an integer value of zero. Output File: For each integer in the input, output its digital root on a separate line of the output. Example Input: 24 39…
Find the maximum value of the following function F(x)=2x3 , using the genetic algorithm, performing two iterations.
Correct answer will be upvoted else Multiple Downvoted. Computer science. You are given a positive number x. Observe the littlest positive integer number that has the amount of digits equivalent to x and all digits are unmistakable (extraordinary). Input The principal line contains a solitary positive integer t (1≤t≤50) — the number of experiments in the test. Then, at that point, t experiments follow. Each experiment comprises of a solitary integer number x (1≤x≤50). Output Output t replies to the experiments: on the off chance that a positive integer number with the amount of digits equivalent to x and all digits are diverse exists, print the littlest such number; in any case print - 1.
Write a recursive algorithm with the following prototype: int divide(int x, int y); that returns x/y (integer division). You need not test for divide by 0. THE FUNCTION MUST BE RECURSIVE. (hint: base case should be when x<y)
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 //…