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

Example 13:Write an Algorithm to evaluate the following equation: 1 1+2 Y = - + 2A А 1+2 + 3 + ЗА 1+ 2 +3 + 4 N Terms ... ...... 4A
Actual timings. Instrument FrequencyCounter to use Stopwatch and StdDrawto make a plot where the x-axis is the number of calls on get() or put() and the y-axisis the total running time, with a point plotted of the cumulative time after each call.Run your program for Tale of Two Cities using SequentialSearchST and again usingBinarySearchST and discuss the results. Note : Sharp jumps in the curve may be explained by caching, which is beyond the scope of this question.
Write an algorithm for the following problem. The input consist of three integers a,b, and w. Assume that you live in a country that has two types of coins, one wortha dollars and the other b dollars. Both you and the storekeeper have a pocket full ofeach. You must pay him w dollars. You can give him any number of coins, and hemay give you change with any number of coins. Your algorithm must determinewhether or not this is possible and, if so, describe some way of doing it (not necessarily the optimal way). [Hint: Compute GCD(a, b), and use the three values g, u,and v. Consider the two cases when g divides w and when it does not. (If you wantto find the optimal number of coins, basically you change a solution by using thefact that ( bg ) · a − (ag ) · b = 0.)]
Write the Evaluate Expression (Continuation) algorithm. Eval(f, xvalue, yvalue, zvalue) (f, xvalue, yvalue, zvalue) pre-cond: f is an expression with three variables: x, y, and z, and the three real values to give to these variables are xvalue, yvalue, and zvalue. post-cond: The returned value is the expression's evaluation at these x, y, and z values. The phrase remains the same.
M Maha الاسم الاجابات التي انت س 1 / 2 درجة ۵۱+ Find the error in the following code x=-10:1:10; y=-10:2:10; plot(x,y) .A Plot is not available in MATLAB .B Syntax of plot is wrong .C Length of x and y should be same .D No error الرجاء قم بأختيار الاجابة الصحيحة
Write equivalent expressions for each of the following by using De Morgan’s Law. A. !(x < 5) B. !(y > 2 && !found ) C. !(c == ‘r’ || (( y > 2) && !found ))
Correct answer will be upvoted else Multiple Downvoted. Computer science. You are remaining on the OX-hub at point 0 and you need to move to an integer point x>0. You can take a few leaps. Assume you're at present at point (y might be negative) and hop for the k-th time. You can: either leap to the point y+k or on the other hand leap to the point y−1. What is the base number of hops you want to arrive at the point x? Input The main line contains a solitary integer t (1≤t≤1000) — the number of experiments. The solitary line of each experiment contains the single integer x (1≤x≤106) — the objective point. Output For each experiment, print the single integer — the base number of leaps to arrive at x. It very well may be demonstrated that we can arrive at any integer point x.
An algorithm should be clear of ambiguity if it has been thoroughly thought out.
help - python