SE Mock Online Test 1-CG

Transcription

1 SE Mock Online Test 1-CG 1. address * For gentle slope line, slope m is -1<m<1 1<m<2 0<m< A line connecting the points (1,1) and (5,3) is to be drawn, using DDA algorithm. Find the value of x and y increments X-increments = 1; y-increments =1 X-increments = 0.5; y-increments =1 X-increments = 1; y-increments = The centre of display screen is computed as X max,y max Xmax/2,ymax/2 Xmax/3,ymax/ The path the electron beam takes at the end of each refresh cycle is called horizontal retrace vertical retrace diagonal retrace left to right retrace 1/6

2 6. 5. The resolution offered by SVGA is? 1024 x 768 Pixels 720 x 348 Pixels 800 X 600 Pixels 640 x 350 Pixels Persistence can be defined as Intensity of a pixel Pixels per unit area The duration of phosphorescence exhibited by a phosphor Number of pixels in an image Slope equation of line is y=mx+b Dx/Dy y=m+b y=mb+x Which of the following algorithm follows "Error Term"? Bresenham's Line Drawing Algorithm Bresenham's Circle Drawing Algorithm DDA Line Algorithm Mid-point Circle Drawing Algorithm If a line whose end point is (10, 12) and start point is (20, 20), then slope m =? Display file can be implemented using data structure. array linked list paging all of above 2/6

3 The value of initial decision parameter in Bresenham's circle drawing algorithm is: 5/4-r 3-r 3-2r 1-2r A pixel of 256 gray scale levels image or graphics object takes space in memory. 1 bit 1 byte 1 nibble 3 bytes Bresenhams s circle algorithm uses the to generate circle. 8 way symmetry 4 way symmetry 6 way symmetry 12 way symmetry Digital analyser is the vector generation algorithm which step along the line to determine the pixels which should be turned difference,on differential,off differential,on difference,off Which are the character generation methods? Stroke Principle Method Star bust Method Bitmap Method All of the Above Seed fill Algorithm for filling polygon is algorithm. Recursive Non Recursive Both A and B 3/6

4 If a line joining any two of its interior points lies not completely inside are called Convex Polygon Concave Polygon Complex Polygon All of above The path the electron beam takes at the end of each refresh cycle is called horizontal retrace vertical retrace diagonal retrace left to right retrace Scan lines are used to scan from Top to bottom Bottom to top all of above The process of mapping a world window in world coordinate system to viewport are called Viewing Transformation View Port Clipping window Screen coordinate system The region against which an object is to be clipped is called? Clip window or clipping window Drawing window Image window 4/6

5 Cohen -Sutherland subdivision line clipping algorithm uses regions with different codes The region code 0000 represents the Viewing window Left clipping window Right clipping window Bottom clipping window If the boundary is specified in a single color, and if the algorithm proceeds pixel by pixel until the boundary color is encountered is called Scan-line fill algorithm Boundary-fill algorithm Flood-fill algorithm Parallel curve algorithm The rectangle portion of the interface window that defines where the image will actually appear are called Transformation viewing View Port Screen coordinate system Clipping window Which approaches are used for determine whether a particular point is inside or outside of a polygon Even-odd method Winding number method Both a & b 5/6

6 If there are even no. of intersection then point in question is inside outside can not predict none of above If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called Positively oriented Negatively oriented Both a & b How to find intersection point of scan line with edge By help of slope By help of vertex By taking seed point Cant predict In Cohan Sutherland outcode/line clipping algorithm left top corner of window is defined with following bits Powered by 6/6