Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates:

Line AB: A(-6,2) and B(-1,8)

Line CD: C(-1,5) and D(4,8)

Line EF: E(-2,3) and F(1,2)

Which of the following line(s) is/are candidate for clipping?

(A) AB (B) CD

(C) EF (D) AB and CD
by

1 Answer

Answer :

(D) AB and CD
by

Related questions

Write down Cohen-Sutherland Line clipping algorithm.

Description : Write down Cohen-Sutherland Line clipping algorithm.

Last Answer : Step 1: Scan end points for the line P1(x1, y1) and P2(x2, y2) Step 2: Scan corners for the window as (Wx1, Wy1) and (Wx2, Wy2) Step 3: Assign the region codes for endpoints P1 and P2 by ... if any of the end point of it appear outside the window. Step 8: Draw the remaining line. Step 9: Exit

Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)

Description : Consider a window bounded by the lines : x = 0; y= 0; x = 5 and y = 3. The line segment joining (–1, 0) and (4, 5), if clipped against this window will connect the points (A) (0, 1) and (2, 3) (B) (0, 1) and (3, 3) (C) (0, 1) and (4, 3) (D) (0, 1) and (3, 2)

Last Answer : (A) (0, 1) and (2, 3)

Describe Sutherland-Hodgeman algorithm for polygon clipping.

Description : Describe Sutherland-Hodgeman algorithm for polygon clipping.

Last Answer : In Sutherland-Hodgeman, a polygon is clipped by processing the polygon boundary as a whole against each window edge. Clipping window must be convex. This could be accomplished by processing all polygon ... is successively passed to process next edge of clipping window. Step 7: Stop. 

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Description : Consider a line AB with A = (0,0) and B = (8, 4). Apply a simple DDA algorithm and compute the first four plots on this line. (1) [(0, 0), (1, 1), (2, 1), (3, 2)] (2) [(0, 0), (1, 1.5), (2, 2), (3, 3)] (3) [(0, 0), (1, 1), (2, 2.5), (3, 3)] (4) [(0, 0), (1, 2), (2, 2), (3, 2)]

Last Answer : [(0, 0), (1, 1), (2, 1), (3, 2)] 

E and F are respectively the mid-points of the non-parallel sides AD and BC of a trapezium ABCD. Prove that EF||AB and EF = 1/2 (AB +CD). -Maths 9th

Description : E and F are respectively the mid-points of the non-parallel sides AD and BC of a trapezium ABCD. Prove that EF||AB and EF = 1/2 (AB +CD). -Maths 9th

Last Answer : Solution :-

ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Description : ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Last Answer : Since R is the mid point of EF . ∴ AR is the median in △AEF. As, a median of a triangle divides it into two triangles of equal area . ∴ ar(△AER) = ar(△AFR)

ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Description : ABCD is a square. E and F are respectively the mid - points of BC and CD. If R is the mid point of EF. -Maths 9th

Last Answer : Since R is the mid point of EF . ∴ AR is the median in △AEF. As, a median of a triangle divides it into two triangles of equal area . ∴ ar(△AER) = ar(△AFR)

EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Description : EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Last Answer : AB || CD and a transversal EF intersects them ∴ ∠EGB = ∠GHD ( Corresponding Angles) ⇒ 2 ∠EGM = 2 ∠GHL ∵ GM and HL are the bisectors of ∠EGB and ∠EHD respectively. ⇒ ∠EGM = ∠GHL But these angles form a pair of equal corresponding angles for lines GM and HL and transversal EF. ∴ GM || HL.

EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Description : EF is the transversal to two parallel lines AB and CD. GM and HL are the bisector of the corresponding angles EGB and EHD.Prove that GL parallel to HL. -Maths 9th

Last Answer : AB || CD and a transversal EF intersects them ∴ ∠EGB = ∠GHD ( Corresponding Angles) ⇒ 2 ∠EGM = 2 ∠GHL ∵ GM and HL are the bisectors of ∠EGB and ∠EHD respectively. ⇒ ∠EGM = ∠GHL But these angles form a pair of equal corresponding angles for lines GM and HL and transversal EF. ∴ GM || HL.

Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) algorithm, then .............. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Description : Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (preemptive scheduling) ... end of Ready queue are not counted). (A) 3 (B) 2 (C) 4 (D) 5

Last Answer : (A) 3

Find the back bearing of the following lines having fore bearing as given below: (i) PQ = N 55° 0' E (ii) EF == 280° 0' (iii) CD = S 58° 30' W (iv) OM= 180° 0'

Description : Find the back bearing of the following lines having fore bearing as given below: (i) PQ = N 55° 0' E (ii) EF == 280° 0' (iii) CD = S 58° 30' W (iv) OM= 180° 0'

Last Answer : i) F.B OF PQ = N 55°0 ’ E  B.B Of PQ = S 55°0 ’W  ii) F.B. Of EF = 280°0 ’   B.B OF EF = F.B -180°= 280°0 ’ -180° = 100°0 ’  iii) F.B OF CD = S 58°30’W  B.B OF CD = N 58°30’ E  iv) F.B OF GH = 180°  B.B OF GH = F.B -180°=180°-180°= 0°

l,m and n are three parallel lines intersected by transversal p and q such that l,m and n cut-off equal intersepts AB and BC on p (Fig.8.55). Show that l,m and n cut - off equal intercepts DE and EF on q also. -Maths 9th

Description : l,m and n are three parallel lines intersected by transversal p and q such that l,m and n cut-off equal intersepts AB and BC on p (Fig.8.55). Show that l,m and n cut - off equal intercepts DE and EF on q also. -Maths 9th

Last Answer : Given:l∥m∥n l,m and n cut off equal intercepts AB and BC on p So,AB=BC To prove:l,m and n cut off equal intercepts DE and EF on q i.e.,DE=EF Proof:In △ACF, B is the mid-point of ... a triangle, parallel to another side, bisects the third side. Since E is the mid-point of DF DE=EF Hence proved.

What is the output of the following? x = ['ab', 'cd'] for i in x: x.append(i.upper()) print(x) a) [‘AB’, ‘CD’]. b) [‘ab’, ‘cd’, ‘AB’, ‘CD’]. c) [‘ab’, ‘cd’]. d) none of the mentioned

Description : What is the output of the following? x = ['ab', 'cd'] for i in x: x.append(i.upper()) print(x) a) [‘AB’, ‘CD’]. b) [‘ab’, ‘cd’, ‘AB’, ‘CD’]. c) [‘ab’, ‘cd’]. d) none of the mentioned

Last Answer : d) none of the mentioned

What is the output of the following? x = ['ab', 'cd'] for i in x: i.upper() print(x) a) [‘ab’, ‘cd’]. b) [‘AB’, ‘CD’]. c) [None, None]. d) none of the mentioned

Description : What is the output of the following? x = ['ab', 'cd'] for i in x: i.upper() print(x) a) [‘ab’, ‘cd’]. b) [‘AB’, ‘CD’]. c) [None, None]. d) none of the mentioned

Last Answer : a) [‘ab’, ‘cd’].

The line x – 4y = 6 is the perpendicular bisector of the segment AB and the co-ordinates of B are (1, 3). Find the co-ordinates of A. -Maths 9th

Description : The line x – 4y = 6 is the perpendicular bisector of the segment AB and the co-ordinates of B are (1, 3). Find the co-ordinates of A. -Maths 9th

Last Answer : Co-ordinates of A are \(\bigg(rac{3 imes9+1 imes5}{3+1},rac{3 imes6+1 imes-2}{3+1}\bigg)\) = \(\bigg(rac{32}{4},rac{16}{4}\bigg)\), i.e. (8, 4)Now, \(x\) - 3y + 4 = 0 ⇒ -3y = -\(x\) - 4 ⇒ y = \(rac{x}{3}+rac{4} ... 8) [Using, y - y1 = m (x - x1)]⇒ 3y - 12 = \(x\) - 8 ⇒ 3y - \(x\) = 4.

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission. a. 8 MSS b. 14 MSS c. 7 MSS d. 12 MSS

Description : Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is ... the end of the tenth transmission. a. 8 MSS b. 14 MSS c. 7 MSS d. 12 MSS

Last Answer : c. 7 MSS

In Fig. 6.20, find x if AB| |CD| |EF. -Maths 9th

Description : In Fig. 6.20, find x if AB| |CD| |EF. -Maths 9th

Last Answer : Solution :-

In ΔABC and ΔDEF, AB = DE, AB || DE, BC = EF and BC || EF. Vertices A, B and C are joined to vertices D, E and F respectively (see Fig. 8.22). Show that (i) quadrilateral ABED is a parallelogram (ii) quadrilateral BEFC is a parallelogram (iii) AD || CF and AD = CF (iv) quadrilateral ACFD is a parallelogram (v) AC = DF (vi) ΔABC ≅ ΔDEF. -Maths 9th

Description : In ΔABC and ΔDEF, AB = DE, AB || DE, BC = EF and BC || EF. Vertices A, B and C are joined to vertices D, E and F respectively (see Fig. 8.22). Show that (i) quadrilateral ABED is a parallelogram ( ... CF and AD = CF (iv) quadrilateral ACFD is a parallelogram (v) AC = DF (vi) ΔABC ≅ ΔDEF. -Maths 9th

Last Answer : . Solution: (i) AB = DE and AB || DE (Given) Two opposite sides of a quadrilateral are equal and parallel to each other. Thus, quadrilateral ABED is a parallelogram (ii) Again BC = EF and BC || EF ... (Given) BC = EF (Given) AC = DF (Opposite sides of a parallelogram) , ΔABC ≅ ΔDEF [SSS congruency]

Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d<0, then d=4x+6 and x=x+1 (4) If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Description : Below are the few steps given for scan-converting a circle using Bresenham's Algorithm. Which of the given steps is not correct? (1) Compute d = 3 – 2r (where r is radius) (2) Stop if x> y (3) If d

Last Answer : If d≥0,then d=4 *(x-y)+10, x=x+1 and y=y+1

Unix command to change the case of first three lines of file “shortlist” from lower to upper (1) $ tr ‘[a-z]’ ‘[A-Z]’ shortlist | head-3 (2) $ head-3 shortlist | tr ‘[a-z]’ ‘[A-Z]’ (3) $ tr head-3 shortlist ‘[A-Z]’ ‘[a-z]’ (4) $ tr shortlist head-3 ‘[a-z]’ ‘[A-Z]’

Description : Unix command to change the case of first three lines of file “shortlist” from lower to upper (1) $ tr ‘[a-z]’ ‘[A-Z]’ shortlist | head-3 (2) $ head-3 shortlist | tr ‘[a-z]’ ‘[A-Z]’ (3) $ tr head-3 shortlist ‘[A-Z]’ ‘[a-z]’ (4) $ tr shortlist head-3 ‘[a-z]’ ‘[A-Z]’

Last Answer : (2) $ head-3 shortlist | tr ‘[a-z]’ ‘[A-Z]’ 

The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Description : The reverse polish notation equivalent to the infix expression ((A + B) * C + D)/(E + F + G) (A) A B + C * D + EF + G + / (B) A B + C D * + E F + G + / (C) A B + C * D + E F G + +/ (D) A B + C * D + E + F G + /

Last Answer : (A) A B + C * D + EF + G + /

Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Description : Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G (A) ABD^ + EF – / G+ (B) ABD + ^EF – / G+ (C) ABD + ^EF / – G+ (D) ABD^ + EF / – G+

Last Answer : (A + B^ D) / (E – F) + G

What does this white circle mean in the upper left hand corner of an ios pic?

Description : What does this white circle mean in the upper left hand corner of an ios pic?

Last Answer : Need Answer

Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current node N to the goal node. Then f(N) = h(N) is used in which one of the following algorithms ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Description : Consider f(N) = g(N) + h(N) Where function g is a measure of the cost of getting from the start node to the current node N and h is an estimate of additional cost of getting from the current ... ? (A) A* algorithm (B) AO* algorithm (C) Greedy best first search algorithm (D) Iterative A* algorithm

Last Answer : (C) Greedy best first search algorithm

The Traditional ideal spot is a. near the upper-left corner of its circle. b. near the lower-right of its circle. c. near the center of its circle. d. near the lower-left of its circle. e. near the upper-right of its circle.

Description : The Traditional ideal spot is a. near the upper-left corner of its circle. b. near the lower-right of its circle. c. near the center of its circle. d. near the lower-left of its circle. e. near the upper-right of its circle.

Last Answer : c. near the center of its circle.

......... is used to pointing / selecting the screen co-ordinates by detecting the light. A) Light Pen B) Bar Code Reader C) Digital Camera D) Smart Cards

Description : ......... is used to pointing / selecting the screen co-ordinates by detecting the light. A) Light Pen B) Bar Code Reader C) Digital Camera D) Smart Cards

Last Answer : A) Light Pen

Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Description : Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at cylinder 23 and moving in the direction ... . The disk head movement using SCAN-scheduling algorithm is: (1) 172 (2) 173 (3) 227 (4) 228

Last Answer : (2) 173

Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by Image (A) {(11,0.8), (13,1), (15,1)} (B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} (C) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Description : Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by (A) {(11,0.8), (13,1), (15,1)} ( ... ,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Last Answer : (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U and wants S & T process E holds T and wants V process F holds W and wants S process G holds V and wants U Is the system deadlocked ? If yes, ............. processes are deadlocked. (A) No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Description : Consider a system with seven processes A through G and six resources R through W. Resource ownership is as follows: process A holds R and wants T process B holds nothing but wants T process C holds nothing but wants S process D holds U ... No (B) Yes, A, B, C (C) Yes, D, E, G (D) Yes, A, B, F

Last Answer : (C) Yes, D, E, G

Let R and S be two fuzzy relations defined as: Image Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Description : Let f and g be the functions from the set of integers to the set integers defined by f(x) = 2x + 3 and g(x) = 3x + 2 Then the composition of f and g and g and f is given as (A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7 (C) 5x + 5, 5x + 5 (D) None of the above

Last Answer : (A) 6x + 7, 6x + 11 Explanation: fog(x)=f(g(x))=f(3x+2)=2(3x+2)+3=6x+7 gof(x)=g(f(x))=g(2x+3)=3(2x+3)+2=6x+11

Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? (A) (a) and (b) (B) (c) and (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Description : Consider the following statements: (a) Depth - first search is used to traverse a rooted tree. (b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal ... (d) (C) (a) , (b) and (c) (D) (a), (b) , (c) and (d)

Last Answer : (D) (a), (b) , (c) and (d)

Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: Image I: {B} II: {B, C} III: {A, D} IV: {C, D} If different symbols stand for different values in the table (e.g., d1 is definitely not equal to d2), then which of the above could not be the candidate key for the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Description : Consider the following database table having A, B, C and D as its four attributes and four possible candidate keys (I, II, III and IV) for this table: I: {B} II: {B, C} III: {A, D} IV: {C, D} If ... the database table? (A) I and III only (B) III and IV only (C) II only (D) I only

Last Answer : (C) II only

5. In a parallelogram ABCD, E and F are the mid-points of sides AB and CD respectively (see Fig. 8.31). Show that the line segments AF and EC trisect the diagonal BD. -Maths 9th

Description : 5. In a parallelogram ABCD, E and F are the mid-points of sides AB and CD respectively (see Fig. 8.31). Show that the line segments AF and EC trisect the diagonal BD. -Maths 9th

Last Answer : . Solution: Given that, ABCD is a parallelogram. E and F are the mid-points of sides AB and CD respectively. To show, AF and EC trisect the diagonal BD. Proof, ABCD is a parallelogram , AB || CD also, ... (i), DP = PQ = BQ Hence, the line segments AF and EC trisect the diagonal BD. Hence Proved.

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

Write down Cyrus-Beck line clipping algorithm.

Description : Write down Cyrus-Beck line clipping algorithm.

Last Answer : Step 1: Read end points of line P1 and P2. Step 2: Read vertex coordinates of clipping window. Step 3: Calculate D = P2 - P1. Step 4: Assign boundary point b with particular edge. Step 5: Find ... parametric equation of line P1P2. Step 12: Draw line segment P(tL) to P(tU). Step 13: Stop.

Write the midpoint subdivision algorithm for line clipping.

Description : Write the midpoint subdivision algorithm for line clipping.

Last Answer : Step 1: Scan two end points for the line P1(x1, y1) and P2(x2, y2). Step 2: Scan corners for the window as (x1, y1) and (x2, y2). Step 3:Assign the region codes for ... 5 for both subdivided line segments until you get completely visible and completely invisible line segments. Step 6: Exit.

Explain Cyrusblek line clipping algorithm.

Description : Explain Cyrusblek line clipping algorithm.

Last Answer : Cyrus Beck Line Clipping algorithm: Cyrus Beck Line Clipping algorithm is used to clip 2D/3D lines against convex polygon/polyhedron. Cyrus Beck Line clipping algorithm is actually, a parametric line-clipping algorithm. ... Step 12 : Draw line segment P(tL) to P(tU). Step 13 : Stop. 

Explain midpoint subdivision line clipping algorithm.

Description : Explain midpoint subdivision line clipping algorithm.

Last Answer : Step 1: Scan two end points for the line P1(x1, y1) and P2(x2, y2). Step 2: Scan corners for the window as (Wx1, Wy1) and (Wx2, Wy2). Step 3: Assign the region ... through 5 for both subdivided line segments until you get completely visible and completely invisible line segments. Step 6: Exit.

Explain scan line algorithm of polygon clipping.

Description : Explain scan line algorithm of polygon clipping.

Last Answer : For each scan line crossing a polygon, the area-fill algorithm locates the intersection points of the scan line with the polygon edges. These intersection points are then sorted from left to right ... 4 : Fill all those pair of coordinates that are inside polygons and ignore the alternate pairs.

The Karnaugh map for a Boolean function is given as Image The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Description : The Karnaugh map for a Boolean function is given as The simplified Boolean equation for the above Karnaugh Map is (A) AB + CD + AB’ + AD (B) AB + AC + AD + BCD (C) AB + AD + BC + ACD (D) AB + AC + BC + BCD

Last Answer : (B) AB + AC + AD + BCD

If the electricity represented by the wave form in 'B' were applied to the left side of the illustrated circuit, the output on the right side would be ____________. EL-0064 A. direct current with the top lead positive with repect to the lower lead B. direct current, half wave rectified with a ripple frequency of 60 hz C. direct current with the top lead negative with repect to the lower lead D. clipped to a value equal to the square root of 3 times the input voltage value

Description : If the electricity represented by the wave form in 'B' were applied to the left side of the illustrated circuit, the output on the right side would be ____________. EL-0064 A. direct current with the ... lower lead D. clipped to a value equal to the square root of 3 times the input voltage value

Last Answer : Answer: C

Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Description : Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively. (A) 10, 9 (B) 9, 9 (C) 10, 10 (D) 9, 10

Last Answer : (D) 9, 10

Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further, Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............

Description : Let us consider that the original point is (x,y) and new transformed point is (x’,y’). Further, Shx and Shy are shearing factors in x and y directions. If we perform the y-direction shear relative to x=xref then the transformed point is given by ............ 

Last Answer : (C) x’ = x y’ = Shy(x - xref) + y

Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to represent M, N, R1 and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3

Last Answer : Answer: 4

In the adjoining figure, P and Q have co-ordinates (4, 6)and (0, 3) respectively. Find (i) the co-ordinates of R (ii) Area of quadrilateral OAPQ. -Maths 9th

Description : In the adjoining figure, P and Q have co-ordinates (4, 6)and (0, 3) respectively. Find (i) the co-ordinates of R (ii) Area of quadrilateral OAPQ. -Maths 9th

Last Answer : Let the line 2x + 3y - 30 = 0 divide the join of A(3, 4) and B(7, 8) at point C(p, q) in the ratio k : 1. Then,p = \(rac{7k+3}{k+1}\), q = \(rac{8k+4}{k+1}\)As the point C lies on the line 2x + 3y - 30 ... {3}{2}+1},rac{8 imesrac{3}{2}+4}{rac{3}{2}+1}\bigg)\) = \(\big(rac{27}{5},rac{32}{5}\big)\).