Q1: consider the algorithm below,Step 1:Input the two line endpoints, storing the left endpoint in (Xs, Y1)and Right endpoint in (X2, Y2)Plot the point (X1, Y1)Calculate the constants, Ax, Ay, 2Ay and (2Ay - 2Ax) and get thefirst value for the decision parameter as:Step 2:Step 3:Po = 2Ay - AxStep 4:At each Xk along the line, starting at K=0, perform the followingtest: if Pk < 0, the next point to plot is (X+1, Yk) andPk+1 - Pk + 2AyOtherwise the next point to plot is (X+1, Yk+1) and:Pk+1 = Pk + 2Ay - 2AxStep 5:Repeat step 4, Ax times.Explain each step then compare it with DDA algorithm.Q2: use the necessary transformation to generate figure3 from figure2.(4,3)(7,3)(0,3)(3,3)(-2,0)(1,0)Figure 3Figure 2Q3:Use the necessary transformation to generate Figure2 from Figurel.(2, 2)(0, 2)(1,3)(3,3)(0,0)(2,0)(-2,0)(1,1)(3,1)(0,-2)(2,-2)Figure 1Figure 2

Note: As you have asked multiple questions, as per our policy we will solve the first question for…

Q1: consider the algorithm below, Step 1: Input the two line endpoints, storing the left endpoint in (X1, Y1) and Right endpoint in (X2, Y2) Step 2: Step 3: Plot the point (X1, Y1) Calculate the constants, Ax, Ay, 2Ay and (2Ay - 2Ax) and get the first value for the decision parameter as: Po - 2Ay - Ax At each Xk along the line, starting at K-0, perform the following test: if Pk < 0, the next point to plot is (Xx+1, Yk) and Pk+1 - Pk + 2Ay Step 4: Otherwise the next point to plot is (Xx+1, Yk+1) and: Pk+1 - Pk+ 2Ay - 2Ax Step 5: Repeat step 4, Ax times. Explain each step then compare it with DDA algorithm. Q2: use the necessary transformation to generate figure3 from figure2. (4,3) (7,3) (0,3) (3,3) (-2,0) (1,0) Figure 3 Figure 2 Q3:Use the necessary transformation to generate Figure2 from Figurel. (2, 2) (0, 2) (1,3) (3,3) (0,0) (2,0) (-2,0) (1,1) (3,1) (0,-2) (2,-2) Figure 1 Figure 2

Q1: consider the algorithm below, Step 1: Input the two line endpoints, storing the left endpoint in (X1, Y1) and Right endpoint in (X2, Y2) Step 2: Step 3: Plot the point (X1, Y1) Calculate the constants, Ax, Ay, 2Ay and (2Ay - 2Ax) and get the first value for the decision parameter as: Po - 2Ay - Ax At each Xk along the line, starting at K-0, perform the following test: if Pk < 0, the next point to plot is (Xx+1, Yk) and Pk+1 - Pk + 2Ay Step 4: Otherwise the next point to plot is (Xx+1, Yk+1) and: Pk+1 - Pk+ 2Ay - 2Ax Step 5: Repeat step 4, Ax times. Explain each step then compare it with DDA algorithm. Q2: use the necessary transformation to generate figure3 from figure2. (4,3) (7,3) (0,3) (3,3) (-2,0) (1,0) Figure 3 Figure 2 Q3:Use the necessary transformation to generate Figure2 from Figurel. (2, 2) (0, 2) (1,3) (3,3) (0,0) (2,0) (-2,0) (1,1) (3,1) (0,-2) (2,-2) Figure 1 Figure 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

Consider a circle with point (cx, cy) at its center and radius r, and a vertical line that crossestwo points (px, py1) and (px, py2). Read these data from the user, and determine if the line has anyintersection with the circle. If yes, also display the x and y coordinates of the intersection(s). Draw aflowchart to show the algorithm.
Given two variables A and B, with integer values, write an algorithm that changes the values of the variables, without creating a new variable.ex: A = 3, B = 5 -> A = 5, b = 3)
ANALYSIS & DESIGN OF ALGORITHMS subject 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.
Write this using java Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. m = 0 m > 0 m < 0 m = 1 m > 1 swap the rolls of x and y m < 1 m = infinity ( needs special test case) Include appropriate tests for ‘special case’ conditions. Insteadof “WritePixel” write to the screen the coordinates of the pixel that would be drawn. Please provide photos that it works and so I can understand the code better
Write an algorithm that prompts the user for the radius, in inches, and price of a pizza, and then reads in those values. Finally, have the algorithm compute and output the pizza’s cost per square inch.
Design an algorithm for checking whether two given words are anagrams, i.e., whether one word can be obtained by permuting the letters of the other. (For example, the words tea and eat are anagrams.)
Correct answer will be upvoted else downvoted. Computer science. in the event that |a|>0 (the length of the string an is more prominent than nothing), erase the principal character of the string a, that is, supplant a with a2a3… an; in the event that |a|>0, erase the last character of the string a, that is, supplant a with a1a2… an−1; if |b|>0 (the length of the string b is more prominent than nothing), erase the main character of the string b, that is, supplant b with b2b3… bn; in the event that |b|>0, erase the last character of the string b, that is, supplant b with b1b2… bn−1. Note that after every one of the tasks, the string an or b might become vacant. For instance, in the event that a="hello" and b="icpc", you can apply the accompanying grouping of tasks: erase the principal character of the string a ⇒ a="ello" and b="icpc"; erase the primary character of the string b ⇒ a="ello" and b="cpc"; erase the principal character of the string b ⇒…
A good algorithm should be free from ambiguity” briefly discuss
Course:Artificial Intelligence Topic:Sample Neural Network to calculate total error using Forward pass backpropagation. Problem:Implement forward pass backpropagation for 100(for two input 200)random numbers.(Set range for random numbers 0.01-1.00) using C++/Python with short explanation with key points.
q3" Theta (θ) is an asymptotic representation used to represent ___________ of an algorithm. a. Worst case b. Average case c. None d. Best case
Perform a descriptive algorithm for the process of buying clothes in a warehouse where there is a variety for women, men and children, describe the income, the request for a garment, the proof and the payment of the same
With a fancy calculator, finding square roots is easy. But what if you only had a basic four-function calculator? Assuming that number holds the value that you want to calculate the square root of, the following algorithm approximates the square root of a number: Get a guess from a human Square the guess If the squared guess is within 0.1 of the original number, we will accept the guess as our answer If it is not, try again with a different guess and keep trying until we get an answer that is close enough This algorithm relies on a human to make the guesses, though it wouldn't be too hard to also design an algorithm for making an appropriate guess. What would be a flowchart for this?