Final CG PDF

WHEEBOX + LOCAL PDF

13248_CS 346 COMPUTER GRAPHICS

Time : 1hr
Max Marks : 50

1) All questions are Multiple Choice Questions having single correct option.

2) Attempt any 50 questions out of 60.

3) Use of calculator is allowed.

4) Each question carries 1 Mark.

5) Specially abled students are allowed 20 minutes extra for examination.

6) Do not use pencils to darken answer.

7) Use only black/blue ball point pen to darken the appropriate circle.

8) No change will be allowed once the answer is marked on OMR Sheet.

9) Rough work shall not be done on OMR sheet or on question paper.

10) Darken ONLY ONE CIRCLE for each answer.

Q.no 1. Z -buffer algorithm are

A : Simplest algorithm

B : Complex algorithm

C : Largest algorithm

D : Smallest algorithm

Q.no 2. The transformation in which an object is moved from one position to another in
circular path around a specified pivot point is called

A : Translation

B : Scaling

C : Rotation

D : Reflection

Q.no 3. Scan lines are used to scan from

A : Top to bottom

B : Bottom to top
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 1/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Top to right

D : Top to left

Q.no 4. Which is not image file format

A : bmp

B : jpg

C : tiff

D : png

Q.no 5. The types of projection are

A : Parallel projection and perspective projection

B : Perpendicular and perspective projection

C : Parallel projection and Perpendicular projection

D : Perpendicular and isometric projection

Q.no 6. The color code “000” is for________.

A : White

B : Black

C : Blue

D : Green

Q.no 7. The transformation that produces a parallel mirror image of an object are called

A : Rotation

B : Reflection

C : Translation

D : Scaling

Q.no 8. Which color s produced with the blue and red dots

A : Blue

B : Yellow

C : Magenta

D : White

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 2/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 9. A Process which divides each segment of the picture into its visible and invisible
portion, allowing the invisibleportion to be discarded is called___.

A : Clipping

B : Windowing

C : Segmenting

D : Viewing

Q.no 10. A process with the help of which images or picture can be produced in a more
realistic way is called

A : Fractals

B : Quad-tree

C : Rendering

D : Clipping

Q.no 11. If we multiply any matrix A with identity matrix then we get the matrix.

A : Identity matrix

B : Translation matrix

C : Scaling matrix

D : Original matrix

Q.no 12. The viewing transformation is formed by

A : Translations

B : Translation and scaling

C : Translation, scaling and reflection

D : Translation, scaling and rotation

Q.no 13. _________ is a basic approach used to fill the polygon

A : even-odd method

B : winding number method

C : A and B

D : Thumb rule

Q.no 14. The hardware devices contain

A : Color printer / black white printer

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 3/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Office

C : Audio Player

D : Menu

Q.no 15. Symbolic representation of some object or process is called ................

A : Icons

B : Menu

C : List

D : Label

Q.no 16. The process of selecting and viewing the picture with different views is called

A : Viewing

B : Clipping

C : Windowing

D : Segmenting

Q.no 17. The flat panel displays are________ in appearance

A : Flat

B : Curved

C : Round

D : Hexagonal

Q.no 18. The region against which an object is to be clipped is called__?

A : Clip window or clipping window

B : Drawing window

C : Image window

D : Viewport

Q.no 19. A _______ transformation alters the size of an object.

A : Scaling

B : Rotation

C : Translation

D : Shear
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 4/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 20. Polygon filling algorithms those fill interior-defined regions are called _______
algorithms.

A : Flood fill

B : Boundary fill

C : Scan line

D : Edge fill

Q.no 21. Plasma panel are also called

A : Liquid crystal display

B : Gas discharge display

C : Non emissive display

D : Emissive display

Q.no 22. Identify the input mode in which the application program initiates data entry

A : Sample

B : request

C : Event

D : Read

Q.no 23. The rectangle portion of the interface window that defines where the image will
actually appear are called

A : Transformation viewing

B : View port

C : Clipping window

D : Screen coordinate system

Q.no 24. The result of logical AND operation with endpoint region codes is a nonzero value.
Which of the following statement is true

A : The line is completely inside the window

B : The line is completely outside the window

C : The line is partially inside the window

D : The line is already clipped

Q.no 25. The animation can be divided into

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 5/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : One part

B : Two parts

C : Three parts

D : Four parts

Q.no 26. A joystick is a

A : Graphics input device

B : Graphics output device

C : Produces sound

D : Display Images

Q.no 27. The DDA algorithm is a faster method for calculating pixel positions than direct use
of line equation using y = mx + because

A : it eliminates floating point addition

B : it eliminates floating point multiplication

C : it eliminates rounding operation that drift away from true line path

D : it eliminates addition

Q.no 28. In view-port clipping of 3D viewing, the region code contains ___number of bits

A:6

B:4

C:5

D:7

Q.no 29. Identify the colors produced in beam penetration method

A : Red, Green, Blue, White

B : Red, Green, Blue

C : Green, Red, White, Orange

D : Red, Orange, Yellow, Green

Q.no 30. Each screen point is referred to as

A : Resolution

B : Pixel

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 6/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Persistence

D : Dot Pitch

Q.no 31. Plasma device converts

A : Electrical energy into light

B : Light into electrical energy

C : Light into graphical energy

D : Light into electromagnetic energy

Q.no 32. The region code of a point is 1001. The point is in the________region of window

A : Top right

B : Top left

C : Bottom left

D : Bottom right

Q.no 33. Which of the following is not a type of perspective projection____________

A : Isometric

B : One point

C : Two point

D : Three point

Q.no 34. BSP stands for

A : Binary Space Product

B : Binary search Product

C : Binary Search Partition

D : Binary Space Partition

Q.no 35. Graphics is one of the_________ major key element in design of multimedia
application

A : Five

B : Three

C : Four

D : Eight

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 7/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 36. Identify the odd one out

A : Icon

B : Slider

C : Spin box

D : Locator

Q.no 37. The rectangle space in which the world definition of region is displayed are called

A : Screen coordinate system

B : Clipping window or world window

C : World coordinate system

D : Viewport

Q.no 38. In odd-even rule If the number of interactions is Even, then the point (x,y) is an

A : Exterior point

B : Interior point

C : Partial point

D : Invisible

Q.no 39. In the following which algorithm is used to calculate visibility

A : BSP tree

B : DDA

C : Circle generation

D : Flood fill

Q.no 40. Which of the following alogoritm is not used object space method

A : DDA

B : Z-buffer

C : Scanline

D : A-buffer

Q.no 41. The division of the computer screen into rows and columns that define the no. of
pixels to display a picture is called

A : Persistence

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 8/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Resolution

C : Encapsulated post script

D : Vector

Q.no 42. Which surface algorithm is based on perspective depth ?

A : Depth comparison

B : Z-buffer or depth-buffer algorithm

C : subdivision method

D : back-face removal

Q.no 43. The method which uses array of dots for generating a character is called

A : Stoke method

B : Bitmap method

C : Star bust method

D : Pixmap method

Q.no 44. In non-zero winding number rule If the total sum of this direction value is non-zero,
then this point to be tested is an

A : Interior point

B : Exterior point

C : Partial point

D : Invisible

Q.no 45. The translation distances (dx, dy) is called as

A : Translation vector

B : Shift vector

C : Both a and b

D : Neither a nor b

Q.no 46. Why we need removal of hidden surface

A : for displaying realistic view

B : Download image

C : Hide Image

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 9/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Clip window

Q.no 47. A Pixel is represented dy a tuple Xw,Yw,w in______

A : Normalised Device Coordinates

B : Homogeneous coordinates system

C : 3D coordinate system

D : 2D coordinate system

Q.no 48. The basic geometric structures that describes a scene on display is called ________

A : Attributes

B : Output primitive

C : Lines

D : Curves

Q.no 49. In which method of CRT, convergence problem occur

A : Beam penetration method

B : Shadow mask method

C : DVST

D : Beam mask Method

Q.no 50. The object space or the space in which the application model is defined is called
____________

A : World co-ordinate system

B : Screen co-ordinate system

C : World window

D : Interface window

Q.no 51. A vector can be defined as

A : Intersection b/w two point position

B : Difference b/w two point position

C : Comparison b/w two point position

D : Intersection b/w two portion

Q.no 52. Give the value_______to all the edges which are going to upward direction in non-
zero winding number rule
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 10/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A:0

B : -1

C:1

D:2

Q.no 53. Coordinates of window are knows as_______

A : Screen coordinates

B : World coordinates

C : Device coordinates

D : Cartesian coordinates

Q.no 54. A composite transformation matrix can be made by determining the ________of
matrix of the individual transformation

A : Sum

B : Product

C : Difference

D : Multiple

Q.no 55. The projection that can be viewed as the projection that has a centre of projection at
a finite distance from the plane of projection are called

A : Parallel projection

B : Perspective projection

C : Isometric projection

D : Oblique projection

Q.no 56. The orthographic projection can display more than one face of an object, such an
orthographic projection is called__________ orthographic projection

A : Axonometric

B : Isometric

C : Parallel

D : Perspective

Q.no 57. Slope of the line joining the points (1, 2) and (3, 4) is

A:0

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 11/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B:1

C:2

D:3

Q.no 58. The video memory that is used to hold the image displayed on screen is known as

A : Display processor

B : LUT

C : Frame buffer

D : Display file

Q.no 59. The intensity of a grayscale pixel is expressed within a given range between a
minimum and a maximum

A : 1 and 2

B : 2 and 1

C : 0 and 1

D : 0 and 2

Q.no 60. An example of impact device is

A : Electrostatic printer

B : Inkjet printer

C : Line printer

D : Laser printer

Q.no 1. The object space in which the application model is defined

A : Screen coordinate system

B : Clipping window or world window

C : World coordinate system

D : Windows viewport

Q.no 2. GUI means

A : Graphical user interface

B : Graphical user interaction

C : Graphics uniform interaction

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 12/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Graphics uniform interface

Q.no 3. Bresanham circle algorithm uses the approach of

A : Midpoint

B : Point

C : Line

D : Polygon

Q.no 4. Random scan systems are designed for

A : Line drawing application

B : Pixel drawing application

C : Color drawing application

D : Image drawing application

Q.no 5. DVST means

A : Direct view storage tube

B : Domain view storage tube

C : Direct view store tube

D : Domain view store tube

Q.no 6. Flood fill algorithm cannot be applied if

A : More than one boundary colour

B : More than one interior colour

C : Single boundary colour

D : Single interior colour

Q.no 7. In 3D viewing, the world co-ordinate position of the objects is converted into viewing
co-ordinates by _________transformation.

A : Viewing

B : Projection

C : Workstation

D : 3D

Q.no 8. Computer of present time have much higher memory and storage capacity

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 13/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Much smaller

B : Much bigger

C : Much slower

D : Much lesser

Q.no 9. Cyan color is produced when the blue and green are activated

A : Equally

B : Unequally

C : Completely

D : Partially

Q.no 10. When projection lines are perpendicular to the view plane then such type of
projection is called

A : Parallel

B : Perspective

C : Orthographic

D : Oblique

Q.no 11. In which polygon object appears only partially

A : Convex polygon

B : Concave polygon

C : Visible Polygon

D : Invisible Polygon

Q.no 12. The process of coloring the area of a polygon is called

A : Polygon filling

B : Polygon flow

C : Aliasing

D : Antialiasing

Q.no 13. How many types of parallel projection are

A:1

B:2

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 14/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C:3

D:4

Q.no 14. The shape of the object gets by _________transformation.

A : Scaling

B : Rotation

C : Translation

D : Shear

Q.no 15. Which of the following transformation is not used in rotation about arbitrary point
in 2D?

A : Scaling

B : Rotation

C : Translation

D : Shearing

Q.no 16. If the angle Q is positive then the rotation direction will be

A : Clockwise

B : Anticlockwise

C : Parallel

D : Perpendicular

Q.no 17. A bitmap is ..............bit(s) per pixels.

A:0

B:1

C:2

D:4

Q.no 18. The first viewing parameter in perspective projection we must

A : Viewing window

B : Shift vector

C : View reference plane

D : View reference point

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 15/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 19. Beam penetration method is used in

A : Random scan system

B : Raster scan system

C : Printer

D : Scanner

Q.no 20. ______identifies the picture portions that are exterior to the clip window

A : Interior clipping

B : Exterior clipping

C : Extraction

D : Removing

Q.no 21. _________ is a basic approach used to fill the polygon

A : seed fill

B : scan fill

C : A and B

D : Line fill

Q.no 22. Identify the features of DVST from the following

A : Monochromatic, Flicker free, Low resolution

B : Monochromatic, Flicker free

C : Color screens, Refresh monitors, High resolution

D : Expensive, Low resolution

Q.no 23. The standard aspect ratio for PC is

A : 0.2534722222222222

B : 0.16874999999999998

C : 0.12638888888888888

D : 0.21041666666666667

Q.no 24. The rotation axis that is perpendicular to the xy plane and passes through the pivot
point is known as

A : Rotation

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 16/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Translation

C : Scaling

D : Shearing

Q.no 25. Each pixel has ________basic color components

A : Two or three

B : One or two

C : Three or four

D : No color

Q.no 26. .............. is a type of window which is invoked by an application when multiple inputs
are required to specify the desired action

A : Panel

B : Icon

C : Dialog box

D : Menu

Q.no 27. Which of the following clipping algorithm follows the Divide and Conquer strategy?

A : 4-bit algorithm

B : Cyrus break algorithm

C : Cohen- Sutherland algorithm

D : Midpoint algorithm

Q.no 28. TIFF (tagged image file format )are used for

A : Vector graphics

B : Bitmap

C : Pixmap

D : Gif

Q.no 29. The screen cordinates system used in following method

A : Object Space Method

B : Even-odd method

C : Winding rule method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 17/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Image space method

Q.no 30. A display controller serves to pass the contents of

A : Frame buffer to monitor

B : Monitor to frame buffer

C : Application to monitor

D : Monitor to graphics

Q.no 31. To increase the energy of these slow moving electron and create a bright picture in
DVST , the screen is maintained at a

A : Low positive potential

B : High negative potential

C : High positive potential

D : Low Negative Potential

Q.no 32. Which function call sets up the size of the output area

A : glViewport()

B : gluPerspective()

C : viewport()

D : glDisplayfunc()

Q.no 33. In cohen- sutherland subdivision line clipping algorithm,any line that has one in the
same bit position in the region codes for each end point are

A : Completely inside the clipping rectangle

B : Completely outside the clipping rectangle

C : Completely left to the clipping rectangle

D : Completely right to the clipping rectangle

Q.no 34. By changing the dimensions of the viewport, the _________ and ___________ of the
objects being displayed can be manipulated

A : Number of pixels and image quality

B : X co-ordinate and Y co-ordinate

C : Size and proportions

D : Pixel and co-ordinates

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 18/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 35. Identify the features of Vector display

A : High resolution, Jagged lines, Lack in color depth

B : Smooth lines, Poor resolution, Black & White

C : High resolution, Lack in color depth, Smooth lines

D : Inexpensive, monochromatic, smooth lines

Q.no 36. In the Cohen Sutherland line clipping algorithm, if the codes of the two point P&Q
are 0101 & 0001 then the line segment joining the points P&Q will be _________the clipping
window

A : Totally outside

B : Partially outside

C : Totally inside

D : Inside

Q.no 37. A segment is a

A : Small part of the whole scene

B : The complete scene

C : The collection of all pictures of the scene

D : Collection of picture

Q.no 38. The oblique projections are classified as ______ and ___________ projections

A : Cavalier and Cabinet

B : Serial & Parallel

C : Parallel & Perspective

D : Isometric & diametric

Q.no 39. joystick are often used to control

A : Typing

B : Video games

C : Voice

D : Display

Q.no 40. Color information can be stored in________

A : Main memory
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 19/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Secondary memory

C : Graphics card

D : Frame buffer

Q.no 41. Refreshing on raster scan displays is carried out at the rate of

A : 60 to 80 frames per sec

B : 40 to 60 frames per sec

C : 30 to 60 frames per sec

D : 90 to 120 frames per sec

Q.no 42. When a display file is divided into number of subparts then each part is called
as____

A : Segment

B : Page

C : Image

D : Structure

Q.no 43. Which of the following is the disadvantage of Cyrus Beck line clipping algorithm

A : It avoids calculation

B : It is non-iterative

C : Clipping window can be convex

D : Cyrus Beck algorithm is a direct line intersections computation for all planes which form the
boundary of the given convex polygon

Q.no 44. Which of the following clipping algorithm follows the Divide and Conquer strategy?

A : 4-bit algorithm

B : Midpoint algorithm

C : Cyrus break algorithm

D : Cohen- Sutherland algorithm

Q.no 45. The number of matrices required to rotate an object about a point (1,1)
are___________

A:1

B:2

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 20/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C:3

D:4

Q.no 46. A shadow mask CRT has _____ phosphor color dots at each pixel position

A:1

B:2

C:3

D:0

Q.no 47. Z-buffer algorithm is used for

A : Framebuffer removal

B : Hidden line removal

C : Rendering

D : Animation

Q.no 48. If we take mirror reflection of a point (-x, y) along the origin then the point
Becomes_________

A : (x, -y)

B : (-y, -x)

C : (-x, y)

D : (y, x)

Q.no 49. There are 2 types of polygons. They are?

A : Convex and concave

B : Square and rectangle

C : Hexagon and square

D : Octagon and convex

Q.no 50. The algorithm which displays line-type attributes by plotting pixel spans is

A : Raster line algorithm

B : Raster scan algorithm

C : Random line algorithm

D : Random scan algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 21/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 51. Higher persistence phosphorus needs _________ refresh rate

A : Lower

B : Higher

C : Medium

D : Large

Q.no 52. The complex graphics operations are_______

A : Selection

B : Separation

C : Clipping

D : Displying

Q.no 53. In which transformation the shape of an object can be modified in x-direction ,y-
direction as well as in both the direction depending upon the value assigned to shearing
variables

A : Reflection

B : Shearing

C : Rotation

D : Scaling

Q.no 54. An object is viewed by using perspective transformation. The maximum number of
principal vanishing point(s) possible is

A:1

B:2

C:3

D : Infinite

Q.no 55. Which of the following is a hidden surface removal algorithm?

A : DDA

B : Breshenham’s

C : Z-buffer

D : Cohen Sutherland

Q.no 56. Refreshing is not needed in DVST because of the presence of_____

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 22/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Primary gun

B : Flood gun

C : Focusing anode

D : Control grid

Q.no 57. The point (x,y) becomes (y,x) in____________transformation

A : Reflection about origin y-axis

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 58. A fast and simple method for rendering an object with polygon surface is

A : Constant-intensity shading

B : Flat shading

C : Both a & b

D : Flattening

Q.no 59. Identify impact printer from the following

A : Drum Plotter

B : Inkjet printer

C : Electrostatic printer

D : Dot-matrix printer

Q.no 60. The movement of different attributes of image would make the image dynamic and
such a dynamic effect is termed as ________

A : Picture

B : Animation

C : Painting

D : Video

Q.no 1. Displays a list of commands

A : Menu

B : List

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 23/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Icon

D : Checkbox

Q.no 2. A pixel may be defined as

A : Smallest size object

B : Larger size object

C : Medium size object

D : Big Object

Q.no 3. Reflection about X-axis followed by reflection about Y-axis is equivalent to_______

A : Reflection about line Y= X

B : Reflection about origin

C : Reflection about line Y=-X

D : Reflection about Y-axis

Q.no 4. CRT means

A : Common ray tube

B : Cathode ray tube

C : Common ray teen

D : Cathode run Tube

Q.no 5. Solid pattern in random scan display is to fill

A : Difficult

B : Easy

C : Not fill

D : Imposible

Q.no 6. The region code 0000 represents the______.

A : Viewing window

B : Left clipping window

C : Right clipping window

D : Bottom clipping window

Q.no 7. Intensity representation of an image is called_________

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 24/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Frame buffer

B : Picture definition

C : Display list

D : Brightness

Q.no 8. Intensity representation of an image is called

A : Frame Buffer

B : Picture definition

C : Display list

D : Brightness

Q.no 9. Which of the following statement is not correct with respect to homogeneous
coordinates

A : It is used to combine transformations

B : Each point is represented as (xw,yw,w)

C : It is used for representing translation in matrix form

D : Homogeneous coordinates are represented in 2*2 matrix form

Q.no 10. Two consecutive rotation transformation r1 and r2 are

A : Additive

B : Multiplicative

C : Subtractive

D : Divide

Q.no 11. If blue is represented as 001 the yellow is represented as

A : A Monitor that have color capability

B : A Monitor that have no color capability

C : Raster scan display

D : Random scan display

Q.no 12. The color code “000” is for________.

A : White

B : Black

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 25/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Blue

D : Green

Q.no 13. How many types of keyboard

A:1

B:2

C:3

D:4

Q.no 14. Graphics with limited features is known as

A : Active graphics

B : Passive graphics

C : Grayscale image

D : Color Image

Q.no 15. The types of parallel projection are

A : Orthographic projection and quadric projection

B : Orthographic projection and oblique projection

C : oblique projection and quadric projection

D : Isometric projection and quadric projection

Q.no 16. Graphics output devices are

A : Graphics tablet, mouse

B : Keyboard

C : Light pen, joystick

D : Monitor, sound

Q.no 17. For the cavalier projection, the direction of projection makes a __________ angle
with the view plane.

A : 40 degree

B : 45 degree

C : 63 degree

D : 63.4 Degree

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 26/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 18. The method which is based on the principle of checking the visibility point at each
pixel position on the projection plane are called

A : Object-space method

B : image-space method

C : Both a & b

D : None of these

Q.no 19. The region against which an object is clipped is called a_________

A : Clip window

B : Boundary

C : Enclosing rectangle

D : Clip square

Q.no 20. In Cohen-sutherland subdivision line clipping algorithm, bit 4 in region code is set if
_____

A : end point of line is to the left of the window

B : end point of line is to the right of the window

C : end point of line is to the below of the window

D : end point of line is to the above of the window

Q.no 21. In 3D viewing, mismatch between 3D objects and 2D displays is compensated by

introducing_______

A : Transformation

B : Projection

C : Rotation

D : Translation

Q.no 22. 0 (Zero) degree of red color in hue image will correspond to

A : Boundary

B : Edges

C : White region

D : Black region

Q.no 23. GIF stands for

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 27/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Global Image Format

B : Graphics Interchange Format

C : Graphics Image Format

D : Global Interchange Format

Q.no 24. If both codes are 0000, (bitwise OR of the codes yields 0000) line lies
__________________ the window

A : completely outside

B : completely inside

C : half inside half outside

D : can’t say anything

Q.no 25. A line with end point codes as 0000 and 0000 is

A : partially invisible

B : completely visible

C : trivially visible

D : completely invisible

Q.no 26. In 3D viewing, the _________transformation is used to convert 3D description of

objects in viewing co-ordinates to the 2D projection co-ordinates

A : Viewing

B : Projection

C : Workstation

D : 3D

Q.no 27. In line clipping, the portion of line which is _____________ of window is cut and the
portion that is _____________ the window is kept

A : inside, outside

B : exact copy, different

C : outside, inside

D : different, an exact copy

Q.no 28. A technique by which the vertical and /or horizontal scan frequency of video signal
can be changed for different purpose and applications is called

A : Scan conversion
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 28/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Polygon filling

C : Two dimensional graphics

D : Anti-aliasing

Q.no 29. The shortest distance between any two dots of the same color is called

A : Resolution

B : Dot Pitch

C : Pixel Depth

D : PPI

Q.no 30. The transformation that produces a parallel mirror image of an object are called

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 31. Find out the odd ones

A : Boundary fill

B : 4-connected

C : Back-Face Detection

D : 8-connected

Q.no 32. A polygon, in which the line segment joining any two points within the polygon lies
completely inside the polygon, is called ________ polygon

A : Convex

B : Concave

C : Closed

D : Complete

Q.no 33. Give the value_______to all the edges which are going to downward direction in non-
zero winding number rule

A:0

B : -1

C:1
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 29/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D:2

Q.no 34. In view-port clipping of 3D viewing, the region code contains ___number of bits

A:6

B:4

C:5

D:7

Q.no 35. A wireless mouse works on

A : Infra blue radiation

B : Infra-red radiation

C : Infra green radiation

D : Infra black radiation

Q.no 36. A transformation that slants the shape of an object is called

A : Reflection

B : Shear

C : Distortion

D : Scaling

Q.no 37. A plotter is capable of

A : Printing a map

B : Scanning images

C : Produced sound

D : Drawing

Q.no 38. Dragging in computer graphics can be achieved through which of the following
transformation

A : translation

B : rotation

C : scaling

D : mirror reflection

Q.no 39. Line end point codes of 4 lines are given below. Which one of the following is totally
invisible
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 30/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : 1010, 0110

B : 0000, 0000

C : 1001, 0000

D : 0001, 0100

Q.no 40. A particular font and associated styles can be set using the function

A : setTextfont (tf)

B : setfont (tf)

C : setFont (tf)

D : setTextFont()

Q.no 41. If the resultant object is given along with the set of transformations applied on it,
then to find the original object we have to use___________

A : Affine transformation

B : Reverse transformation

C : Normal transformation

D : Inverse transformation

Q.no 42. The range that specifies the gray or grayscale levels is___________

A : The value range from -1 to 1

B : The value range from 0 to -1

C : The value range from 0 to 1

D : Any one of the above

Q.no 43. Solid pattern in random scan display is ____ to fill

A : Difficult

B : Easy

C : Not fill

D : Imposible

Q.no 44. If the pixel is already filled with desired color then leaves it otherwise fills it. this is
called

A : Flood fill algorithm

B : Boundary fill algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 31/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Scan line polygon filling algorithm

D : Scan Conversion Algorithm

Q.no 45. Pen or inkjet plotters use the following devices

A : Drum

B : Flat bed

C : Both a & b

D : None of these

Q.no 46. The rubber band method is also applicable to ________objects

A : Scale

B : Scalar

C : Vector

D : Rotate

Q.no 47. The projection in which the projection plane is allowed to intersect the x, y and z-
axes at equal distances

A : Wire frame model

B : Constructive solid geometry methods

C : Isometric projection

D : Back face removal

Q.no 48. The method which is based on the principle of checking the visibility point at each
pixel position on the projection plane are called

A : Image-space methods

B : Both Object-space methods

C:a&b

D : Pixel Space

Q.no 49. When the angle between the projectors and the plane of projection is not equal to
900 then the projection is

A : Orthographic

B : Isometric

C : Perspective

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 32/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Oblique

Q.no 50. The size of these dot in inkjet printer usually lies between

A : 50 to60 microns in diameter

B : 20 to30 microns in diameter

C : 30 to40 microns in diameter

D : 10 to20 microns in diameter

Q.no 51. The space in which the image is displayed are called

A : Screen coordinate system

B : Clipping window

C : World coordinate system

D : Space coordinate system

Q.no 52. The process of extracting a portion of a database or a picture inside or outside a
specified region are called

A : Transformation

B : Projection

C : Clipping

D : Mapping

Q.no 53. Which surface algorithm is based on perspective depth

A : Depth comparison

B : Z-buffer or depth-buffer algorithm

C : subdivision method

D : back-face removal

Q.no 54. _________as the most commonly used boundary presentation for a 3-D graphics
object

A : Data polygon

B : Surface polygon

C : System polygon

D : None of these

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 33/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 55. Cohen-Sutherland subdivision line clipping algorithm uses ________ regions with
different codes.

A:8

B:6

C:4

D:9

Q.no 56. Bresenham’s line drawing is superior then DDA because

A : It does not require floating point arithmetic

B : No round -up is required

C : Both (a) & (b)

D : it is easily computable

Q.no 57. The function of scan line polygon fill algorithm are

A : Find intersection point of the boundary of polygon and scan line

B : Find intersection point of the boundary of polygon and point

C : Find intersection point only

D : Find the Boundary

Q.no 58. In beam penetration method of color CRT, which layer is red and which is green

A : Outer is red and inner is green

B : Inner is red and outer is green

C : Inner is red and inner is green

D : Outer green and inner red

Q.no 59. The orthographic projections have the projectors where

A : The direction of these projectors is parallel to the view plane

B : The direction of these projectors is perpendicular to the image plane

C : The direction of these projectors is perpendicular to the view plane

D : The direction of these projectors is parallel to the image plane

Q.no 60. Sutherland Hodgeman algorithm works well for______

A : Concave polygon

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 34/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Convex polygon

C : Smooth curves

D : Line segment

Q.no 1. GUI means

A : Graphical user interface

B : Graphical user interaction

C : Graphics uniform interaction

D : Graphics uniform interface

Q.no 2. Cyan color is produced when the blue and green are activated

A : Equally

B : Unequally

C : Completely

D : Partially

Q.no 3. CAD means

A : Car aided design

B : Computer art design

C : Computer aided design

D : Car Art design

Q.no 4. Which is not image file format

A : bmp

B : jpg

C : tiff

D : png

Q.no 5. The electron beam in DVST is designed to draw directly to

A : Phosphor

B : Storage mesh

C : Glass

D : Screen
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 35/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 6. The line segments of polygon are called as _________

A : Edges

B : Vertices

C : Line

D : Ellipse

Q.no 7. The best hidden surface removal algorithm is ?

A : Depth buffer

B : Area subdivision

C : Depends on the application

D : Painters

Q.no 8. A position in plane known as

A : Line

B : Point

C : Graphics

D : Object

Q.no 9. Tablet is

A : Logical interactive device

B : Data generation device

C : Physical interactive device

D : None of these

Q.no 10. Which of the following is not a rigid body transformation

A : Translation

B : Rotation

C : Shearing

D : Reflection

Q.no 11. Pick out the odd one out

A : LED

B : LCD
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 36/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Gas Discharge tube

D : Plasma Panel

Q.no 12. A Special form of the one-point perspective projection takes place when the
vanishing point is placed centrally within the figure. This type of projection is called a
_________ projection.

A : Parallel

B : Perspective

C : Tunnel

D : Cavalier

Q.no 13. RGB model are used for

A : Computer display

B : Printing

C : Painting

D : Scanning

Q.no 14. How many types of polygon filling

A : Two

B : One

C : Three

D : Four

Q.no 15. The distance of a line from the projection plane determines

A : Its size on projection plane

B : Its length on projection plane

C : Its width on projection plane

D : Its height on projection plane

Q.no 16. The function of scan line polygon fills algorithm are

A : Find intersection point of the boundary of polygon and point

B : Find the Point

C : Both a & b

D : Find intersection point of the boundary of polygon and scan line

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 37/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 17. Raster scan is _______ expensive than random scan

A : More

B : Less

C : Both a & b

D : Too much

Q.no 18. ______refers to pixel spacing.

A : Pixmap

B : Resolution

C : Pixel depth

D : Persistence

Q.no 19. Which of the following 2D transformation is not represented in matrix form in non-
homogeneous coordinate system

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 20. Symbolic representation of some object or process is called ................

A : Icons

B : Menu

C : List

D : Label

Q.no 21. In the following which algorithm is used to calculate visibility

A : BSP tree

B : DDA

C : Circle generation

D : Flood fill

Q.no 22. In Cohen-Sutherland subdivision line clipping algorithm, bit 1 in region code is set if

A : end point of line is to the left of the window

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 38/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : end point of line is to the right of the window

C : end point of line is to the below of the window

D : end point of line is to the above of the window

Q.no 23. The intersection of three primary RGB color produces

A : White color

B : Black color

C : Magenta color

D : Blue color

Q.no 24. The end points of polygon are called as

A : Vertices

B : Edges

C : Line

D : Circle

Q.no 25. The rectangle space in which the world definition of region is displayed are called

A : Screen coordinate system

B : Clipping window or world window

C : World coordinate system

D : Viewport

Q.no 26. Vector display is well suited for

A : Animation

B : Line drawing applications

C : Cartoons

D : Video

Q.no 27. In ............... input mode, the input devices initiates data input to the application
program.

A : Sample

B : request

C : Event

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 39/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Read

Q.no 28. We translate a two-dimensional point by adding

A : Translation distances

B : Translation difference

C : X and Y

D : Reflection

Q.no 29. Gray scale is used in____________

A : A Monitor that have color capability

B : A Monitor that have no color capability

C : Random scan display

D : Raster scan display

Q.no 30. _________as the most commonly used boundary presentation for a 3-D graphics
object

A : Data polygon

B : Surface polygon

C : System polygon

D : None of these

Q.no 31. What is the use of homogeneous coordinates and matrix representation

A : To treat all 3 transformations in a consistent way

B : To scale

C : To rotate

D : To shear the object

Q.no 32. A segment is a

A : Small part of the whole scene

B : The complete scene

C : The collection of all pictures of the scene

D : Collection of picture

Q.no 33. A joystick is a

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 40/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Graphics input device

B : Graphics output device

C : Produces sound

D : Display Images

Q.no 34. In translation transformation Ty indicates

A : Scaling factor along Y direction

B : Translation factor along Y direction

C : Tilting factor along Y direction

D : Shearing factor along y direction

Q.no 35. Identify different type of computer graphics

A : Monochrome and Color

B : CRT and Flat panel

C : Vector an Raster

D : Monitors and Hardcopy devices

Q.no 36. A method used to test lines for total clipping is equivalent to the__

A : logical XOR operator

B : logical OR operator

C : logical AND operator

D : Logical NOT operator

Q.no 37. Non-impact use various techniques to combine three color pigment ______ to
produce a range of color patterns

A : Cyan , magenta and yellow

B : Cyan , white and black

C : Cyan , white and yellow

D : Black , magenta and yellow

Q.no 38. In the Cohen Sutherland line clipping algorithm, if the codes of the two point P&Q
are 0101 & 0001 then the line segment joining the points P&Q will be _________the clipping
window

A : Totally outside

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 41/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Partially outside

C : Totally inside

D : Inside

Q.no 39. To generate a rotation , we must specify

A : Rotation angle ϴ

B : Distances dx and dy

C : Rotation distance

D : Rotation difference

Q.no 40. Two dimensional color model are

A : RGB and CMKY

B : RBG and CYMK

C : RGB and CMYK

D : RBG and CMKY

Q.no 41. _______is very important in creating animated images on the screen

A : Image transformation

B : Morphing

C : Clipping

D : Image reflection

Q.no 42. If a point (x, y) is reflected about an axis which is normal to the XY plane and
passing through the origin, the reflected point (X,Y) is:-

A : (x,-y)

B : (-x,y)

C : (-x,-y)

D : (y,x)

Q.no 43. A wireless mouse consists of ______parts

A : One

B : Two

C : Three

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 42/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Four

Q.no 44. In the Cohen Sutherland Out code Algorithm, the four bits in the outcode are set on
the basis of positions of the line end points to the ________ of clipping window regions in the
order

A : Top, Bottom, Right, Left

B : Right, Top, Bottom, Left

C : Top, Right, Left, Bottom

D : Bottom, Right, Left, Top

Q.no 45. According to Cohen-Sutherland algorithm, a line is completely outside the window if
_______.

A : The region codes of line endpoints have a '1' in same bit position.

B : The endpoints region code are nonzero values

C : If L bit and R bit are nonzero.

D : The region codes of line endpoints have a '0' in same bit position.

Q.no 46. ________ is the ratio of horizontal points to vertical points necessary to produce
equal length lines in both directions

A : Dot Pitch

B : Resolution

C : Aspect Ratio

D : Height-Width Ratio

Q.no 47. Which surface algorithm is based on perspective depth ?

A : Depth comparison

B : Z-buffer or depth-buffer algorithm

C : subdivision method

D : back-face removal

Q.no 48. The algorithm which displays line-type attributes by plotting pixel spans is

A : Raster line algorithm

B : Raster scan algorithm

C : Random line algorithm

D : Random scan algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 43/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 49. A major disadvantage of DVST in interactive computer graphics is

A : Ability to selectively erase part of an image

B : Inability to selectively erase part of image from screen

C : Inability to produce bright picture

D : Ability to produce bright picture

Q.no 50. In odd-even rule If the number of interactions is odd, then the point (x,y) is an

A : Exterior point

B : Interior point

C : Partial point

D : Invisible

Q.no 51. The intensity of a grayscale pixel is expressed within a given range between a
minimum and a maximum

A : 1 and 2

B : 2 and 1

C : 0 and 1

D : 0 and 2

Q.no 52. The right bit (R bit)of the region code of a point (X,Y) is '1' if

A : X > XWMIN

B : X< XWMIN

C : X< XWMAX

D : X>XWMAX

Q.no 53. The object space or the space in which the application model is defined is called
____________

A : World co-ordinate system

B : Screen co-ordinate system

C : World window

D : Interface window

Q.no 54. An object is viewed by using perspective transformation. The maximum number of
principal vanishing point(s) possible is

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 44/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A:1

B:2

C:3

D : Infinite

Q.no 55. Which of the following is not true w.r.t polygon clipping

A : Line clipping algorithms are not used for polygon clipping

B : The shape of polygon may change after clipping

C : The sequence of clipping w.r.t. window edges is fixed

D : Change in Polygon

Q.no 56. Higher persistence phosphorus needs _________ refresh rate

A : Lower

B : Higher

C : Medium

D : Large

Q.no 57. Identify impact printer from the following

A : Drum Plotter

B : Inkjet printer

C : Electrostatic printer

D : Dot-matrix printer

Q.no 58. _______is known as standard graphics objects

A : Octree

B : Polygon surfaces

C : Ellipsoid

D : Raster image

Q.no 59. The translation distances (dx, dy) is called as

A : Translation vector

B : Shift vector

C : Both a and b
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 45/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Neither a nor b

Q.no 60. In which method of CRT, convergence problem occur

A : Beam penetration method

B : Shadow mask method

C : DVST

D : Beam mask Method

Q.no 1. Two Basic ways of projecting objects onto the view plane are _________ and _______.

A : Serial, Parallel

B : Serial, Perspective

C : Parallel, Perspective

D : Parallel, Isometric

Q.no 2. The process of selecting and viewing the picture with different views is called

A : Viewing

B : Clipping

C : Windowing

D : Segmenting

Q.no 3. The first viewing parameter in perspective projection we must

A : Viewing window

B : Shift vector

C : View reference plane

D : View reference point

Q.no 4. Intensity representation of an image is called

A : Frame Buffer

B : Picture definition

C : Display list

D : Brightness

Q.no 5. The surfaces that is blocked or hidden from view in a 3D scene are known as

A : Hidden surface
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 46/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Frame buffer

C : Quad tree

D : Clipping

Q.no 6. A pixel may be defined as

A : Smallest size object

B : Larger size object

C : Medium size object

D : Big Object

Q.no 7. Which graphics application provides a proper dialogue box to help the user

A : MS excel

B : MS Paint

C : MS word

D : MS access

Q.no 8. If the angle Q is positive then the rotation direction will be

A : Clockwise

B : Anticlockwise

C : Parallel

D : Perpendicular

Q.no 9. Two consecutive rotation transformation r1 and r2 are

A : Additive

B : Multiplicative

C : Subtractive

D : Divide

Q.no 10. When projection lines are perpendicular to the view plane then such type of
projection is called

A : Parallel

B : Perspective

C : Orthographic

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 47/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Oblique

Q.no 11. The transformation in which an object can be shifted to any coordinate position in
three dimensional plane are called

A : Translation

B : Scaling

C : Rotation

D : Shearing

Q.no 12. The hardware devices contain

A : Color printer / black white printer

B : Office

C : Audio Player

D : Menu

Q.no 13. Which of the following co-ordinates are NOT used in 2D viewing transformation

A : modelling co-ordinates

B : viewing co-ordinates

C : vector co-ordinates

D : device co-ordinates

Q.no 14. The method which is based on the principle of checking the visibility point at each
pixel position on the projection plane are called

A : Object-space method

B : image-space method

C : Both a & b

D : None of these

Q.no 15. Z -buffer algorithm are

A : Simplest algorithm

B : Complex algorithm

C : Largest algorithm

D : Smallest algorithm

Q.no 16. The display controller converts 0s and 1s into_______

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 48/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : TV monitor

B : Video signal

C : Electronics signal

D : Light signals

Q.no 17. Which color s produced with the blue and red dots

A : Blue

B : Yellow

C : Magenta

D : White

Q.no 18. In which polygon object appears only partially

A : Convex polygon

B : Concave polygon

C : Visible Polygon

D : Invisible Polygon

Q.no 19. Which device is used to grasp a ‘virtual object’?

A : Space ball

B : Data glove

C : Digitizer

D : Touch panels

Q.no 20. The simplest output primitive is _______

A : Straight line

B : Straight line segment

C : Point

D : Circle

Q.no 21. GIF stands for

A : Global Image Format

B : Graphics Interchange Format

C : Graphics Image Format

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 49/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Global Interchange Format

Q.no 22. In Bresenham’s circle generation algorithm, if (x,y) is the current pixel position then
the y value of the next pixel position is

A : Y or y+1

B : y alone

C : y+1 or y-1

D : y or y-1

Q.no 23. Identify the string device from the following

A : Mouse

B : Webcam

C : Keyboard

D : Joystick

Q.no 24. Surface information in A-buffer includes

A : RGB intensity components

B : Vector

C : Raster

D : pixmap

Q.no 25. A plotter is capable of

A : Printing a map

B : Scanning images

C : Produced sound

D : Drawing

Q.no 26. GKS is

A : GEOMETRIC KERNAL SYSTEM

B : GRAPGICAL KARNEL SIFTWARE

C : GRAPHICAL KARNEL SYSTEM

D : GEOMETRIC KERNEL SOFTWARE

Q.no 27. In view-port clipping of 3D viewing, the region code contains ___number of bits

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 50/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A:6

B:4

C:5

D:7

Q.no 28. For a seed-fill method, If a given point is (x, y) and we want to access (x-1, y-1) in the
same iteration, we use which of the following

A : 4-connected method

B : 5-connected method

C : 7-connected method

D : 8-connected method

Q.no 29. A line with end point codes as 0000 and 0000 is

A : partially invisible

B : completely visible

C : trivially visible

D : completely invisible

Q.no 30. In a boundary fill algorithm for filling polygon, boundary defined regions may be
either _________ connected or __________ connected

A : 2,4

B : 4,8

C : 8,16

D : 8,6

Q.no 31. A joystick is consisting of a

A : Pen

B : Stick

C : Microphone

D : Pick

Q.no 32. Each pixel has ________basic color components

A : Two or three

B : One or two
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 51/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Three or four

D : No color

Q.no 33. The rectangle portion of the interface window that defines where the image will
actually appear are called

A : Transformation viewing

B : View port

C : Clipping window

D : Screen coordinate system

Q.no 34. To increase the energy of these slow moving electron and create a bright picture in
DVST , the screen is maintained at a

A : Low positive potential

B : High negative potential

C : High positive potential

D : Low Negative Potential

Q.no 35. Which of the following is not a hidden surface removal algorithm

A : Depth comparison, Z-buffer, back-face removal

B : Scan line algorithm, priority algorithm

C : BSP method, area subdivision method

D : DDA Algorithm

Q.no 36. Dragging in computer graphics can be achieved through which of the following
transformation

A : translation

B : rotation

C : scaling

D : mirror reflection

Q.no 37. In which projection ,the plane normal to the projection has equal angles with these
three axes

A : Wire frame model

B : Constructive solid geometry methods

C : Isometric projection
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 52/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Back face removal

Q.no 38. Identify the features of Vector display

A : High resolution, Jagged lines, Lack in color depth

B : Smooth lines, Poor resolution, Black & White

C : High resolution, Lack in color depth, Smooth lines

D : Inexpensive, monochromatic, smooth lines

Q.no 39. Color information can be stored in________

A : Main memory

B : Secondary memory

C : Graphics card

D : Frame buffer

Q.no 40. Identify the input mode in which the application program initiates data entry

A : Sample

B : request

C : Event

D : Read

Q.no 41. Each successive transformation matrix _________ the product of the preceding
transformation

A : pre-multiplies

B : post-multiplies

C : adds

D : subtracts

Q.no 42. Why we need removal of hidden surface

A : for displaying realistic view

B : Download image

C : Hide Image

D : Clip window

Q.no 43. Refreshing on raster scan displays is carried out at the rate of

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 53/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : 60 to 80 frames per sec

B : 40 to 60 frames per sec

C : 30 to 60 frames per sec

D : 90 to 120 frames per sec

Q.no 44. The complex graphics operations are_______

A : Selection

B : Separation

C : Clipping

D : Displying

Q.no 45. The movement of different attributes of image would make the image dynamic and
such a dynamic effect is termed as ________

A : Picture

B : Animation

C : Painting

D : Video

Q.no 46. A shadow mask CRT has _____ phosphor color dots at each pixel position

A:1

B:2

C:3

D:0

Q.no 47. The distance of a line from the projection plane determines

A : Its size on projection plane

B : Its length on projection plane

C : Its width on projection plane

D : Its height on projection plane

Q.no 48. When a circle is subjected to translational sweep, a .................is formed

A : Ellipse

B : Cone

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 54/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Sphere

D : Cylinder

Q.no 49. Grey scale images have a maximum color depth of

A : 8bit

B : 16bit

C : 24bit

D : 32bit

Q.no 50. Sutherland-Hodgeman algorithm is used for

A : Line clipping

B : Point clipping

C : Polygon clipping

D : Hybrid clipping

Q.no 51. If the resultant object is given along with the set of transformations applied on it,
then to find the original object we have to use___________

A : Affine transformation

B : Reverse transformation

C : Normal transformation

D : Inverse transformation

Q.no 52. Which attributes of image transformation rotate the image by a given angle

A : ROTATE-X

B : ROTATE-Y

C : Both a & b

D : None of these

Q.no 53. ___________is a simple object space algorithm that removes about half of the total
polygon in an image as about half of the faces of objects are back faces

A : Wire frame model

B : Constructive solid geometry methods

C : Isometric projection

D : Back face removal

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 55/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 54. A Pixel is represented dy a tuple Xw,Yw,w in______

A : Normalised Device Coordinates

B : Homogeneous coordinates system

C : 3D coordinate system

D : 2D coordinate system

Q.no 55. A vector can be defined as

A : Intersection b/w two point position

B : Difference b/w two point position

C : Comparison b/w two point position

D : Intersection b/w two portion

Q.no 56. Non impact use various techniques to combine three color pigment ______ to
produce a range of color patterns

A : Cyan , magenta and yellow

B : Cyan , white and black

C : Cyan , white and yellow

D : Black , magenta and yellow

Q.no 57. Refreshing is not needed in DVST because of the presence of_____

A : Primary gun

B : Flood gun

C : Focusing anode

D : Control grid

Q.no 58. The projection that can be viewed as the projection that has a centre of projection at
a finite distance from the plane of projection are called

A : Parallel projection

B : Perspective projection

C : Isometric projection

D : Oblique projection

Q.no 59. The physical cordinates system used in following method

A : Object Space method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 56/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Image space Method

C : Even-add method

D : winding rule method

Q.no 60. The interactive computer graphics involves________ way communication b/w
computer and the user

A : One

B : Two

C : Three

D : four

Q.no 1. The object space in which the application model is defined

A : Screen coordinate system

B : Clipping window or world window

C : World coordinate system

D : Windows viewport

Q.no 2. Resolution can be defined by

A : Number of component

B : Number of small square boxes

C : Number of pixels

D : Number of pixels per unit length

Q.no 3. The region code 0000 represents the______.

A : Viewing window

B : Left clipping window

C : Right clipping window

D : Bottom clipping window

Q.no 4. DVST means

A : Direct view storage tube

B : Domain view storage tube

C : Direct view store tube

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 57/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Domain view store tube

Q.no 5. A bitmap is ..............bit(s) per pixels.

A:0

B:1

C:2

D:4

Q.no 6. Higher the number of pixels,_______ the image quality

A : Bad

B : Better

C : Smaller

D : Large

Q.no 7. A method used to test lines for total clipping is equivalent to the _______

A : Logical XOR

B : Logical OR

C : Logical AND

D : Logical NOT

Q.no 8. For the cavalier projection, the direction of projection makes a __________ angle with
the view plane.

A : 40 degree

B : 45 degree

C : 63 degree

D : 63.4 Degree

Q.no 9. ______refers to pixel spacing.

A : Pixmap

B : Resolution

C : Pixel depth

D : Persistence

Q.no 10. The region against which an object is clipped is called a_________

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 58/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Clip window

B : Boundary

C : Enclosing rectangle

D : Clip square

Q.no 11. The function of a plotter is like a

A : Monitor

B : Projector

C : Printer

D : Sound

Q.no 12. The process of mapping a world window in world coordinate system to viewport are
called

A : Transformation viewing

B : Viewport

C : Clipping window

D : Screen coordinate system

Q.no 13. Which of the following is not a rigid body transformation

A : Translation

B : Rotation

C : Shearing

D : Reflection

Q.no 14. The line segments of polygon are called as _________

A : Edges

B : Vertices

C : Line

D : Ellipse

Q.no 15. Raster graphics are composed of

A : Pixels

B : Paths

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 59/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Palette

D : Vector

Q.no 16. Polygon filling algorithms those fill interior-defined regions are called _______
algorithms.

A : Flood fill

B : Boundary fill

C : Scan line

D : Edge fill

Q.no 17. A Process which divides each segment of the picture into its visible and invisible
portion, allowing the invisibleportion to be discarded is called___.

A : Clipping

B : Windowing

C : Segmenting

D : Viewing

Q.no 18. In 3D viewing, the world co-ordinate position of the objects is converted into viewing
co-ordinates by _________transformation.

A : Viewing

B : Projection

C : Workstation

D : 3D

Q.no 19. A _______ transformation alters the size of an object.

A : Scaling

B : Rotation

C : Translation

D : Shear

Q.no 20. Graphics output devices are

A : Graphics tablet, mouse

B : Keyboard

C : Light pen, joystick

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 60/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Monitor, sound

Q.no 21. The standard aspect ratio for PC is

A : 0.2534722222222222

B : 0.16874999999999998

C : 0.12638888888888888

D : 0.21041666666666667

Q.no 22. In odd-even rule If the number of interactions is Even, then the point (x,y) is an

A : Exterior point

B : Interior point

C : Partial point

D : Invisible

Q.no 23. Find out the odd ones

A : Boundary fill

B : 4-connected

C : Back-Face Detection

D : 8-connected

Q.no 24. A method used to test lines for total clipping is equivalent to the__

A : logical XOR operator

B : logical OR operator

C : logical AND operator

D : Logical NOT operator

Q.no 25. Each screen point is referred to as

A : Resolution

B : Pixel

C : Persistence

D : Dot Pitch

Q.no 26. In Cohen-Sutherland subdivision line clipping algorithm, bit 1 in region code is set if

A : end point of line is to the left of the window

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 61/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : end point of line is to the right of the window

C : end point of line is to the below of the window

D : end point of line is to the above of the window

Q.no 27. The process of removal of hidden surfaces is termed as _______________

A : clipping

B : copying

C : culling

D : shorting

Q.no 28. In the following which algorithm is used to calculate visibility

A : BSP tree

B : DDA

C : Circle generation

D : Flood fill

Q.no 29. A technique by which the vertical and /or horizontal scan frequency of video signal
can be changed for different purpose and applications is called

A : Scan conversion

B : Polygon filling

C : Two dimensional graphics

D : Anti aliasing

Q.no 30. A display controller serves to pass the contents of

A : Frame buffer to monitor

B : Monitor to frame buffer

C : Application to monitor

D : Monitor to graphics

Q.no 31. A touch screen display is not an

A : Input device

B : Output device

C : Both a & b

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 62/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Neither input nor output

Q.no 32. The intersection of three primary RGB color produces

A : White color

B : Black color

C : Magenta color

D : Blue color

Q.no 33. Which of the following clipping algorithm follows the Divide and Conquer strategy?

A : 4-bit algorithm

B : Cyrus break algorithm

C : Cohen- Sutherland algorithm

D : Midpoint algorithm

Q.no 34. In translation transformation Ty indicates

A : Scaling factor along Y direction

B : Translation factor along Y direction

C : Tilting factor along Y direction

D : Shearing factor along y direction

Q.no 35. _________ is a basic approach used to fill the polygon

A : seed fill

B : scan fill

C : A and B

D : Line fill

Q.no 36. Which of the following alogoritm is not used object space method

A : DDA

B : Z-buffer

C : Scanline

D : A-buffer

Q.no 37. device is used to specify scalar values

A : Locator
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 63/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Stroke

C : Valuator

D : String

Q.no 38. In line clipping, the portion of line which is _____________ of window is cut and the
portion that is _____________ the window is kept

A : inside, outside

B : exact copy, different

C : outside, inside

D : different, an exact copy

Q.no 39. The DDA algorithm is a faster method for calculating pixel positions than direct use
of line equation using y = mx + because

A : it eliminates floating point addition

B : it eliminates floating point multiplication

C : it eliminates rounding operation that drift away from true line path

D : it eliminates addition

Q.no 40. The oblique projections are classified as ______ and ___________ projections

A : Cavalier and Cabinet

B : Serial & Parallel

C : Parallel & Perspective

D : Isometric & diametric

Q.no 41. Which of the following is a hidden surface removal algorithm?

A : DDA

B : Breshenham’s

C : Z-buffer

D : Cohen Sutherland

Q.no 42. Which of the following alogoritm is not used object space method

A : Back face detection

B : Painters algorithm

C : Both a & b
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 64/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : DDA

Q.no 43. The object space or the space in which the application model is defined is called
____________

A : World co-ordinate system

B : Screen co-ordinate system

C : World window

D : Interface window

Q.no 44. Which method are used to get and set the position of a pixel, object or text in active
area of a desktop

A : Drugging method

B : Basic positioning method

C : Sketching method

D : Gravity field method

Q.no 45. The space in which the image is displayed are called

A : Screen coordinate system

B : Clipping window

C : World coordinate system

D : Space coordinate system

Q.no 46. In color raster system, the number of color choices available depends
on_____________

A : colors in frame buffer

B : Amount of storage provided per pixel in frame buffer

C : RGB color

D : Pixel in lookup table

Q.no 47. The orthographic projection can display more than one face of an object, such an
orthographic projection is called__________ orthographic projection

A : Axonometric

B : Isometric

C : Parallel

D : Perspective
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 65/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 48. ________is used to select limited choices of predictable values

A : Menu

B : Slider

C : Spin boxes

D : Text field

Q.no 49. Plasma panel is an __ device

A : Emissive

B : Non emissive

C : Expensive

D : Non Expensive

Q.no 50. The size of these dot in inkjet printer usually lies between

A : 50 to60 microns in diameter

B : 20 to30 microns in diameter

C : 30 to40 microns in diameter

D : 10 to20 microns in diameter

Q.no 51. The point (x,y) becomes (y,x) in____________transformation

A : Reflection about origin y-axis

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 52. The algorithm which displays line-type attributes by plotting pixel spans is

A : Raster line algorithm

B : Raster scan algorithm

C : Random line algorithm

D : Random scan algorithm

Q.no 53. Bresenham’s line drawing is superior then DDA because

A : It does not require floating point arithmetic

B : No round -up is required

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 66/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Both (a) & (b)

D : it is easily computable

Q.no 54. If the pixel is already filled with desired color then leaves it otherwise fills it. this is
called

A : Flood fill algorithm

B : Boundary fill algorithm

C : Scan line polygon filling algorithm

D : Scan Conversion Algorithm

Q.no 55. Choice devices are suitable to select __________

A : Scalar values

B : Menu options

C : Text input

D : Picture components

Q.no 56. Z-buffer algorithm is used for

A : Framebuffer removal

B : Hidden line removal

C : Rendering

D : Animation

Q.no 57. The orthographic projections have the projectors where

A : The direction of these projectors is parallel to the view plane

B : The direction of these projectors is perpendicular to the image plane

C : The direction of these projectors is perpendicular to the view plane

D : The direction of these projectors is parallel to the image plane

Q.no 58. The range that specifies the gray or grayscale levels is___________

A : The value range from -1 to 1

B : The value range from 0 to -1

C : The value range from 0 to 1

D : Any one of the above

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 67/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 59. When the angle between the projectors and the plane of projection is not equal to
900 then the projection is

A : Orthographic

B : Isometric

C : Perspective

D : Oblique

Q.no 60. With 3 bits per pixel, we can accommodate 8 grey levels. If we use 8 bits per pixel
then what is the value of grey levels

A : 18 grey levels

B : 128 grey levels

C : 256 grey levels

D : No color

Q.no 1. Which of the following co-ordinates are NOT used in 2D viewing transformation

A : modelling co-ordinates

B : viewing co-ordinates

C : vector co-ordinates

D : device co-ordinates

Q.no 2. Random scan systems are designed for

A : Line drawing application

B : Pixel drawing application

C : Color drawing application

D : Image drawing application

Q.no 3. Intensity representation of an image is called

A : Frame Buffer

B : Picture definition

C : Display list

D : Brightness

Q.no 4. In Cohen-sutherland subdivision line clipping algorithm, bit 2 in region code is set if
_____.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 68/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : end point of line is to the left of the window

B : end point of line is to the right of the window

C : end point of line is to the below of the window

D : end point of line is to the above of the window

Q.no 5. How many types of parallel projection are

A:1

B:2

C:3

D:4

Q.no 6. Raster scan is _______ expensive than random scan

A : More

B : Less

C : Both a & b

D : Too much

Q.no 7. _________ is a basic approach used to fill the polygon

A : even-odd method

B : winding number method

C : A and B

D : Thumb rule

Q.no 8. Identify odd one out

A : Vector based

B : Hardware based

C : Bitmap based

D : Scan line based

Q.no 9. The function of scan line polygon fills algorithm are

A : Find intersection point of the boundary of polygon and point

B : Find the Point

C : Both a & b
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 69/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Find intersection point of the boundary of polygon and scan line

Q.no 10. Beam penetration method is used in

A : Random scan system

B : Raster scan system

C : Printer

D : Scanner

Q.no 11. A position in plane known as

A : Line

B : Point

C : Graphics

D : Object

Q.no 12. If the angle Q is positive then the rotation direction will be

A : Clockwise

B : Anticlockwise

C : Parallel

D : Perpendicular

Q.no 13. Scan lines are used to scan from

A : Top to bottom

B : Bottom to top

C : Top to right

D : Top to left

Q.no 14. The color code “000” is for________.

A : White

B : Black

C : Blue

D : Green

Q.no 15. Displays a list of commands

A : Menu
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 70/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : List

C : Icon

D : Checkbox

Q.no 16. The viewing transformation is formed by

A : Translations

B : Translation and scaling

C : Translation, scaling and reflection

D : Translation, scaling and rotation

Q.no 17. CAD means

A : Car aided design

B : Computer art design

C : Computer aided design

D : Car Art design

Q.no 18. Two types of coordinates are

A : Positive and negative coordinates

B : Absolute and relative coordinates

C : Positive and absolute coordinates

D : Absolute and negative coordinates

Q.no 19. A process with the help of which images or picture can be produced in a more
realistic way is called

A : Fractals

B : Quad-tree

C : Rendering

D : Clipping

Q.no 20. If blue is represented as 001 the yellow is represented as

A : A Monitor that have color capability

B : A Monitor that have no color capability

C : Raster scan display

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 71/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Random scan display

Q.no 21. If both codes are 0000, (bitwise OR of the codes yields 0000) line lies
__________________ the window

A : completely outside

B : completely inside

C : half inside half outside

D : can’t say anything

Q.no 22. Which of the following is not a type of perspective projection____________

A : Isometric

B : One point

C : Two point

D : Three point

Q.no 23. The rectangle portion of the interface window that defines where the image will
actually appear are called

A : Transformation viewing

B : View port

C : Clipping window

D : Screen coordinate system

Q.no 24. In order to avoid Flicker in monitor having low refresh rate the techniques used is

A : Refreshing

B : Vertical refreshing

C : Interfacing

D : horizontal refreshing

Q.no 25. GPU stands for

A : Graphical Processing Unit

B : Graphical Percentage Unit

C : Good Processing Unit

D : Graphical Product Unit

Q.no 26. Which function call sets up the size of the output area
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 72/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : glViewport()

B : gluPerspective()

C : viewport()

D : glDisplayfunc()

Q.no 27. In raster scan display, the frame buffer holds

A : Line drawing commands

B : Scanning instructions

C : Image Resolution

D : Intensity information

Q.no 28. In the Cohen Sutherland line clipping algorithm, if the codes of the two point P&Q
are 0101 & 0001 then the line segment joining the points P&Q will be _________the clipping
window

A : Totally outside

B : Partially outside

C : Totally inside

D : Inside

Q.no 29. With the display intensity corresponding to a given color index ci calculated as

A : Intensity=0.5[max(r, g, b)+ max(r, g, b)]

B : Intensity=0.5[min(r, g, b)+ min(r, g, b)]

C : Intensity=0.5[max(r, g, b)- max(r, g, b)]

D : Intensity=0.5[min(r, g, b)+ max(r, g, b)]

Q.no 30. Dragging in computer graphics can be achieved through which of the following
transformation

A : translation

B : rotation

C : scaling

D : mirror reflection

Q.no 31. Line end point codes of 4 lines are given below. Which one of the following is totally
invisible

A : 1010, 0110
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 73/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : 0000, 0000

C : 1001, 0000

D : 0001, 0100

Q.no 32. The end points of polygon are called as

A : Vertices

B : Edges

C : Line

D : Circle

Q.no 33. A technique by which the vertical and /or horizontal scan frequency of video signal
can be changed for different purpose and applications is called

A : Scan conversion

B : Polygon filling

C : Two dimensional graphics

D : Anti-aliasing

Q.no 34. Any CRT based display must be refreshing at least_______ times a second

A : 20

B : 30

C : 40

D : 10

Q.no 35. Mapping the world co-ordinates into physical device co-ordinates is called___

A : translation

B : homogeneous transformation

C : co-ordinate conversion

D : Viewing transformation

Q.no 36. GIF stands for

A : Global Image Format

B : Graphics Interchange Format

C : Graphics Image Format

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 74/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Global Interchange Format

Q.no 37. Identify the colors produced in beam penetration method

A : Red, Green, Blue, White

B : Red, Green, Blue

C : Green, Red, White, Orange

D : Red, Orange, Yellow, Green

Q.no 38. In which projection ,the plane normal to the projection has equal angles with these
three axes

A : Wire frame model

B : Constructive solid geometry methods

C : Isometric projection

D : Back face removal

Q.no 39. TIFF (tagged image file format )are used for

A : Vector graphics

B : Bitmap

C : Pixmap

D : Gif

Q.no 40. Each pixel has ________basic color components

A : Two or three

B : One or two

C : Three or four

D : No color

Q.no 41. When a display file is divided into number of subparts then each part is called
as____

A : Segment

B : Page

C : Image

D : Structure

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 75/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 42. Give the value_______to all the edges which are going to upward direction in non-
zero winding number rule

A:0

B : -1

C:1

D:2

Q.no 43. The translation distances (dx, dy) is called as

A : Translation vector

B : Shift vector

C : Both a and b

D : Neither a nor b

Q.no 44. Which of the following clipping algorithm follows the Divide and Conquer strategy?

A : 4-bit algorithm

B : Midpoint algorithm

C : Cyrus break algorithm

D : Cohen- Sutherland algorithm

Q.no 45. When a circle is subjected to translational sweep, a .................is formed

A : Ellipse

B : Cone

C : Sphere

D : Cylinder

Q.no 46. The name of a visible surface detection algorithm are

A : Back face detection

B : Back face removal

C : Ray tracing

D : Cyrus beck

Q.no 47. The method which is based on the principle of checking the visibility point at each
pixel position on the projection plane are called

A : Image-space methods
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 76/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Both Object-space methods

C:a&b

D : Pixel Space

Q.no 48. Each successive transformation matrix _________ the product of the preceding
transformation

A : pre-multiplies

B : post-multiplies

C : adds

D : subtracts

Q.no 49. Slope of the line joining the points (1, 2) and (3, 4) is

A:0

B:1

C:2

D:3

Q.no 50. If we take mirror reflection of a point (-x, y) along the origin then the point
Becomes_________

A : (x, -y)

B : (-y, -x)

C : (-x, y)

D : (y, x)

Q.no 51. Coordinates of window are knows as_______

A : Screen coordinates

B : World coordinates

C : Device coordinates

D : Cartesian coordinates

Q.no 52. Identify impact printer from the following

A : Drum Plotter

B : Inkjet printer

C : Electrostatic printer
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 77/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Dot-matrix printer

Q.no 53. ________can be produced by interpolating shading patterns across the polygon
surfaces to eliminate or reduce the presence of polygon edge boundaries

A : Rasterizing

B : Rendering

C : Smoothing

D : Vector

Q.no 54. An example of impact device is

A : Electrostatic printer

B : Inkjet printer

C : Line printer

D : Laser printer

Q.no 55. Which of the following is not true w.r.t polygon clipping

A : Line clipping algorithms are not used for polygon clipping

B : The shape of polygon may change after clipping

C : The sequence of clipping w.r.t. window edges is fixed

D : Change in Polygon

Q.no 56. ________ is the ratio of horizontal points to vertical points necessary to produce
equal length lines in both directions

A : Dot Pitch

B : Resolution

C : Aspect Ratio

D : Height-Width Ratio

Q.no 57. A fast and simple method for rendering an object with polygon surface is

A : Constant-intensity shading

B : Flat shading

C : Both a & b

D : Flattening

Q.no 58. Which of the following is the disadvantage of Cyrus Beck line clipping algorithm
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 78/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : It avoids calculation

B : It is non-iterative

C : Clipping window can be convex

D : Cyrus Beck algorithm is a direct line intersections computation for all planes which form the
boundary of the given convex polygon

Q.no 59. The rubber band method is also applicable to ________objects

A : Scale

B : Scalar

C : Vector

D : Rotate

Q.no 60. In odd-even rule If the number of interactions is odd, then the point (x,y) is an

A : Exterior point

B : Interior point

C : Partial point

D : Invisible

Q.no 1. Which of the following 2D transformation is not represented in matrix form in non-
homogeneous coordinate system

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 2. Z -buffer algorithm are

A : Simplest algorithm

B : Complex algorithm

C : Largest algorithm

D : Smallest algorithm

Q.no 3. The display controller converts 0s and 1s into_______

A : TV monitor

B : Video signal
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 79/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Electronics signal

D : Light signals

Q.no 4. Two consecutive rotation transformation r1 and r2 are

A : Additive

B : Multiplicative

C : Subtractive

D : Divide

Q.no 5. Polygon filling algorithms those fill interior-defined regions are called _______
algorithms.

A : Flood fill

B : Boundary fill

C : Scan line

D : Edge fill

Q.no 6. Which of the following is not a rigid body transformation

A : Translation

B : Rotation

C : Shearing

D : Reflection

Q.no 7. The algorithm used for filling the interior of a polygon is called

A : Flood fill algorithm

B : Boundary fill algorithm

C : Scan line polygon fill algorithm

D : Circle Generation algorithm

Q.no 8. Which of the following is not a line clipping algorithms

A : Cohen- Sutherland algorithm

B : Line clipping

C : Mid-point Subdivision algorithm

D : Depth Buffer algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 80/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 9. Which of the following transformation is not used in rotation about arbitrary point in
2D?

A : Scaling

B : Rotation

C : Translation

D : Shearing

Q.no 10. In which polygon object appears only partially

A : Convex polygon

B : Concave polygon

C : Visible Polygon

D : Invisible Polygon

Q.no 11. The electron beam in DVST is designed to draw directly to

A : Phosphor

B : Storage mesh

C : Glass

D : Screen

Q.no 12. Computer of present time have much higher memory and storage capacity

A : Much smaller

B : Much bigger

C : Much slower

D : Much lesser

Q.no 13. The transformation in which an object is moved from one position to another in
circular path around a specified pivot point is called

A : Translation

B : Scaling

C : Rotation

D : Reflection

Q.no 14. Higher the number of pixels,_______ the image quality

A : Bad
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 81/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Better

C : Smaller

D : Large

Q.no 15. Types of computer graphics are

A : Vector and raster

B : Scalar and raster

C : Vector and scalar

D : Raster and Scalar

Q.no 16. Which is not image file format

A : bmp

B : jpg

C : tiff

D : png

Q.no 17. The transformation that produces a parallel mirror image of an object are called

A : Rotation

B : Reflection

C : Translation

D : Scaling

Q.no 18. Which are not geometric transformations

A : Translation

B : Rotation

C : Scaling

D : Image

Q.no 19. RGB model are used for

A : Computer display

B : Printing

C : Painting

D : Scanning
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 82/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 20. ______identifies the picture portions that are exterior to the clip window

A : Interior clipping

B : Exterior clipping

C : Extraction

D : Removing

Q.no 21. In a boundary fill algorithm for filling polygon, boundary defined regions may be
either _________ connected or __________ connected

A : 2,4

B : 4,8

C : 8,16

D : 8,6

Q.no 22. The transformation that produces a parallel mirror image of an object are called

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 23. The result of logical AND operation with endpoint region codes is a nonzero value.
Which of the following statement is true

A : The line is completely inside the window

B : The line is completely outside the window

C : The line is partially inside the window

D : The line is already clipped

Q.no 24. In following devices which is not a locator device

A : Keyboard

B : Mouse

C : Joystick

D : Sound

Q.no 25. In line clipping, the portion of line which is _____________ of window is cut and the
portion that is _____________ the window is kept

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 83/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : inside, outside

B : exact copy, different

C : outside, inside

D : different, an exact copy

Q.no 26. In ............... input mode, the input devices initiates data input to the application
program.

A : Sample

B : request

C : Event

D : Read

Q.no 27. A joystick is a

A : Graphics input device

B : Graphics output device

C : Produces sound

D : Display Images

Q.no 28. The standard aspect ratio for PC is

A : 0.2534722222222222

B : 0.16874999999999998

C : 0.12638888888888888

D : 0.21041666666666667

Q.no 29. A display controller serves to pass the contents of

A : Frame buffer to monitor

B : Monitor to frame buffer

C : Application to monitor

D : Monitor to graphics

Q.no 30. Two dimensional color model are

A : RGB and CMKY

B : RBG and CYMK

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 84/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : RGB and CMYK

D : RBG and CMKY

Q.no 31. Give the value_______to all the edges which are going to downward direction in non-
zero winding number rule

A:0

B : -1

C:1

D:2

Q.no 32. A particular font and associated styles can be set using the function

A : setTextfont (tf)

B : setfont (tf)

C : setFont (tf)

D : setTextFont()

Q.no 33. A plotter is capable of

A : Printing a map

B : Scanning images

C : Produced sound

D : Drawing

Q.no 34. Identify the input mode in which the application program initiates data entry

A : Sample

B : request

C : Event

D : Read

Q.no 35. Plasma panel are also called

A : Liquid crystal display

B : Gas discharge display

C : Non emissive display

D : Emissive display

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 85/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 36. The screen cordinates system used in following method

A : Object Space Method

B : Even-odd method

C : Winding rule method

D : Image space method

Q.no 37. Plasma device converts

A : Electrical energy into light

B : Light into electrical energy

C : Light into graphical energy

D : Light into electromagnetic energy

Q.no 38. In 3D viewing, mismatch between 3D objects and 2D displays is compensated by

introducing_______

A : Transformation

B : Projection

C : Rotation

D : Translation

Q.no 39. In Bresenham’s circle generation algorithm, if (x,y) is the current pixel position then
the y value of the next pixel position is

A : Y or y+1

B : y alone

C : y+1 or y-1

D : y or y-1

Q.no 40. A polygon, in which the line segment joining any two points within the polygon lies
completely inside the polygon, is called ________ polygon

A : Convex

B : Concave

C : Closed

D : Complete

Q.no 41. The distance of a line from the projection plane determines

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 86/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Its size on projection plane

B : Its length on projection plane

C : Its width on projection plane

D : Its height on projection plane

Q.no 42. The projection in which the projection plane is allowed to intersect the x, y and z-
axes at equal distances

A : Wire frame model

B : Constructive solid geometry methods

C : Isometric projection

D : Back face removal

Q.no 43. Identify an relative locator device from the following

A : Mouse

B : Touch panel

C : Light pen

D : Keyboard

Q.no 44. The video memory that is used to hold the image displayed on screen is known as

A : Display processor

B : LUT

C : Frame buffer

D : Display file

Q.no 45. For a point (2,1,2) if we apply reflection about Y-axis, then the new point will become
___________

A : (2,- 1,2)

B : (- 2,1,- 2)

C : (2,- 1,- 2)

D : (- 2,- 1,2)

Q.no 46. According to Cohen-Sutherland algorithm, a line is completely outside the window if
_______.

A : The region codes of line endpoints have a '1' in same bit position.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 87/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : The endpoints region code are nonzero values

C : If L bit and R bit are nonzero.

D : The region codes of line endpoints have a '0' in same bit position.

Q.no 47. The number of matrices required to rotate an object about a point (1,1)
are___________

A:1

B:2

C:3

D:4

Q.no 48. There are 2 types of polygons. They are?

A : Convex and concave

B : Square and rectangle

C : Hexagon and square

D : Octagon and convex

Q.no 49. A composite transformation matrix can be made by determining the ________of
matrix of the individual transformation

A : Sum

B : Product

C : Difference

D : Multiple

Q.no 50. Refreshing is not needed in DVST because of the presence of_____

A : Primary gun

B : Flood gun

C : Focusing anode

D : Control grid

Q.no 51. Solid pattern in random scan display is ____ to fill

A : Difficult

B : Easy

C : Not fill
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 88/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Imposible

Q.no 52. The size of these dot in inkjet printer usually lies between

A : 50 to60 microns in diameter

B : 20 to30 microns in diameter

C : 30 to40 microns in diameter

D : 10 to20 microns in diameter

Q.no 53. _________as the most commonly used boundary presentation for a 3-D graphics
object

A : Data polygon

B : Surface polygon

C : System polygon

D : None of these

Q.no 54. ________is used to select limited choices of predictable values

A : Menu

B : Slider

C : Spin boxes

D : Text field

Q.no 55. With 3 bits per pixel, we can accommodate 8 grey levels. If we use 8 bits per pixel
then what is the value of grey levels

A : 18 grey levels

B : 128 grey levels

C : 256 grey levels

D : No color

Q.no 56. Under a parallel projection, the point (2, 3,-1) has been viewed at (3, 3, 0),then the
direction of projection should be the vector

A : (1,0,1)

B : (1,0,-1)

C : (0,1,1)

D : (0,-1,1)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 89/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 57. The process of extracting a portion of a database or a picture inside or outside a
specified region are called

A : Transformation

B : Projection

C : Clipping

D : Mapping

Q.no 58. Z-buffer algorithm is used for

A : Framebuffer removal

B : Hidden line removal

C : Rendering

D : Animation

Q.no 59. The algorithm which displays line-type attributes by plotting pixel spans is

A : Raster line algorithm

B : Raster scan algorithm

C : Random line algorithm

D : Random scan algorithm

Q.no 60. Cohen-Sutherland subdivision line clipping algorithm uses ________ regions with
different codes.

A:8

B:6

C:4

D:9

Q.no 1. The first viewing parameter in perspective projection we must

A : Viewing window

B : Shift vector

C : View reference plane

D : View reference point

Q.no 2. LCD stands for

A : Liquid core display

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 90/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Liquid crystal display

C : Liquid crystal diagram

D : Liquid core diagram

Q.no 3. Two Basic ways of projecting objects onto the view plane are _________ and _______.

A : Serial, Parallel

B : Serial, Perspective

C : Parallel, Perspective

D : Parallel, Isometric

Q.no 4. Cyan color is produced when the blue and green are activated

A : Equally

B : Unequally

C : Completely

D : Partially

Q.no 5. The function of a plotter is like a

A : Monitor

B : Projector

C : Printer

D : Sound

Q.no 6. Which of the following statement is not correct with respect to homogeneous
coordinates

A : It is used to combine transformations

B : Each point is represented as (xw,yw,w)

C : It is used for representing translation in matrix form

D : Homogeneous coordinates are represented in 2*2 matrix form

Q.no 7. Graphics with limited features is known as

A : Active graphics

B : Passive graphics

C : Grayscale image

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 91/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Color Image

Q.no 8. If we multiply any matrix A with identity matrix then we get the matrix.

A : Identity matrix

B : Translation matrix

C : Scaling matrix

D : Original matrix

Q.no 9. Solid pattern in random scan display is to fill

A : Difficult

B : Easy

C : Not fill

D : Imposible

Q.no 10. Scan lines are used to scan from

A : Top to bottom

B : Bottom to top

C : Top to right

D : Top to left

Q.no 11. A method used to test lines for total clipping is equivalent to the _______

A : Logical XOR

B : Logical OR

C : Logical AND

D : Logical NOT

Q.no 12. Symbolic representation of some object or process is called ................

A : Icons

B : Menu

C : List

D : Label

Q.no 13. The flat panel displays are________ in appearance

A : Flat
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 92/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Curved

C : Round

D : Hexagonal

Q.no 14. Which of the following co-ordinates are NOT used in 2D viewing transformation

A : modelling co-ordinates

B : viewing co-ordinates

C : vector co-ordinates

D : device co-ordinates

Q.no 15. Which device is used to grasp a ‘virtual object’?

A : Space ball

B : Data glove

C : Digitizer

D : Touch panels

Q.no 16. The process of coloring the area of a polygon is called

A : Polygon filling

B : Polygon flow

C : Aliasing

D : Antialiasing

Q.no 17. ______refers to pixel spacing.

A : Pixmap

B : Resolution

C : Pixel depth

D : Persistence

Q.no 18. _________ is a basic approach used to fill the polygon

A : even-odd method

B : winding number method

C : A and B

D : Thumb rule
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 93/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 19. Graphics output devices are

A : Graphics tablet, mouse

B : Keyboard

C : Light pen, joystick

D : Monitor, sound

Q.no 20. How many types of polygon filling

A : Two

B : One

C : Three

D : Four

Q.no 21. joystick are often used to control

A : Typing

B : Video games

C : Voice

D : Display

Q.no 22. Identify the features of Vector display

A : High resolution, Jagged lines, Lack in color depth

B : Smooth lines, Poor resolution, Black & White

C : High resolution, Lack in color depth, Smooth lines

D : Inexpensive, monochromatic, smooth lines

Q.no 23. Graphics data is computed by processor in form of

A : Electrical signals

B : Analog signals

C : Digital signals

D : Light signals

Q.no 24. Which function call sets up the size of the output area

A : glViewport()

B : gluPerspective()
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 94/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : viewport()

D : glDisplayfunc()

Q.no 25. Each screen point is referred to as

A : Resolution

B : Pixel

C : Persistence

D : Dot Pitch

Q.no 26. _________as the most commonly used boundary presentation for a 3-D graphics
object

A : Data polygon

B : Surface polygon

C : System polygon

D : None of these

Q.no 27. In cohen- sutherland subdivision line clipping algorithm,any line that has one in the
same bit position in the region codes for each end point are

A : Completely inside the clipping rectangle

B : Completely outside the clipping rectangle

C : Completely left to the clipping rectangle

D : Completely right to the clipping rectangle

Q.no 28. A technique by which the vertical and /or horizontal scan frequency of video signal
can be changed for different purpose and applications is called

A : Scan conversion

B : Polygon filling

C : Two dimensional graphics

D : Anti aliasing

Q.no 29. With the display intensity corresponding to a given color index ci calculated as

A : Intensity=0.5[max(r, g, b)+ max(r, g, b)]

B : Intensity=0.5[min(r, g, b)+ min(r, g, b)]

C : Intensity=0.5[max(r, g, b)- max(r, g, b)]

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 95/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Intensity=0.5[min(r, g, b)+ max(r, g, b)]

Q.no 30. Color information can be stored in________

A : Main memory

B : Secondary memory

C : Graphics card

D : Frame buffer

Q.no 31. A touch screen display is not an

A : Input device

B : Output device

C : Both a & b

D : Neither input nor output

Q.no 32. A segment is a

A : Small part of the whole scene

B : The complete scene

C : The collection of all pictures of the scene

D : Collection of picture

Q.no 33. A line with end point codes as 0000 and 0000 is

A : partially invisible

B : completely visible

C : trivially visible

D : completely invisible

Q.no 34. The rectangle space in which the world definition of region is displayed are called

A : Screen coordinate system

B : Clipping window or world window

C : World coordinate system

D : Viewport

Q.no 35. Identify different type of computer graphics

A : Monochrome and Color

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 96/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : CRT and Flat panel

C : Vector an Raster

D : Monitors and Hardcopy devices

Q.no 36. In the following which algorithm is used to calculate visibility

A : BSP tree

B : DDA

C : Circle generation

D : Flood fill

Q.no 37. The process of removal of hidden surfaces is termed as _______________

A : clipping

B : copying

C : culling

D : shorting

Q.no 38. BSP stands for

A : Binary Space Product

B : Binary search Product

C : Binary Search Partition

D : Binary Space Partition

Q.no 39. The shortest distance between any two dots of the same color is called

A : Resolution

B : Dot Pitch

C : Pixel Depth

D : PPI

Q.no 40. Graphics is one of the_________ major key element in design of multimedia
application

A : Five

B : Three

C : Four

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 97/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D : Eight

Q.no 41. A Pixel is represented dy a tuple Xw,Yw,w in______

A : Normalised Device Coordinates

B : Homogeneous coordinates system

C : 3D coordinate system

D : 2D coordinate system

Q.no 42. Refreshing on raster scan displays is carried out at the rate of

A : 60 to 80 frames per sec

B : 40 to 60 frames per sec

C : 30 to 60 frames per sec

D : 90 to 120 frames per sec

Q.no 43. If a point (x, y) is reflected about an axis which is normal to the XY plane and
passing through the origin, the reflected point (X,Y) is:-

A : (x,-y)

B : (-x,y)

C : (-x,-y)

D : (y,x)

Q.no 44. Which of the following is the disadvantage of Cyrus Beck line clipping algorithm

A : It avoids calculation

B : It is non-iterative

C : Clipping window can be convex

D : Cyrus Beck algorithm is a direct line intersections computation for all planes which form the
boundary of the given convex polygon

Q.no 45. A vector can be defined as

A : Intersection b/w two point position

B : Difference b/w two point position

C : Comparison b/w two point position

D : Intersection b/w two portion

Q.no 46. Sutherland Hodgeman algorithm works well for______

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 98/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Concave polygon

B : Convex polygon

C : Smooth curves

D : Line segment

Q.no 47. In which method of CRT, convergence problem occur

A : Beam penetration method

B : Shadow mask method

C : DVST

D : Beam mask Method

Q.no 48. When a display file is divided into number of subparts then each part is called
as____

A : Segment

B : Page

C : Image

D : Structure

Q.no 49. The transformation in which an object is moved in a minimum distance path from
one position to another is called

A : Rotation

B : Replacement

C : Translation

D : Scaling

Q.no 50. Which surface algorithm is based on perspective depth ?

A : Depth comparison

B : Z-buffer or depth-buffer algorithm

C : subdivision method

D : back-face removal

Q.no 51. In odd-even rule If the number of interactions is odd, then the point (x,y) is an

A : Exterior point

B : Interior point
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 99/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Partial point

D : Invisible

Q.no 52. The translation distances (dx, dy) is called as

A : Translation vector

B : Shift vector

C : Both a and b

D : Neither a nor b

Q.no 53. Which of the following clipping algorithm follows the Divide and Conquer strategy?

A : 4-bit algorithm

B : Midpoint algorithm

C : Cyrus break algorithm

D : Cohen- Sutherland algorithm

Q.no 54. The physical cordinates system used in following method

A : Object Space method

B : Image space Method

C : Even-add method

D : winding rule method

Q.no 55. Sutherland-Hodgeman algorithm is used for

A : Line clipping

B : Point clipping

C : Polygon clipping

D : Hybrid clipping

Q.no 56. The function of scan line polygon fill algorithm are

A : Find intersection point of the boundary of polygon and scan line

B : Find intersection point of the boundary of polygon and point

C : Find intersection point only

D : Find the Boundary

Q.no 57. The orthographic projections have the projectors where

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 100/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : The direction of these projectors is parallel to the view plane

B : The direction of these projectors is perpendicular to the image plane

C : The direction of these projectors is perpendicular to the view plane

D : The direction of these projectors is parallel to the image plane

Q.no 58. In beam penetration method of color CRT, which layer is red and which is green

A : Outer is red and inner is green

B : Inner is red and outer is green

C : Inner is red and inner is green

D : Outer green and inner red

Q.no 59. The movement of different attributes of image would make the image dynamic and
such a dynamic effect is termed as ________

A : Picture

B : Animation

C : Painting

D : Video

Q.no 60. A major disadvantage of DVST in interactive computer graphics is

A : Ability to selectively erase part of an image

B : Inability to selectively erase part of image from screen

C : Inability to produce bright picture

D : Ability to produce bright picture

Q.no 1. Intensity representation of an image is called_________

A : Frame buffer

B : Picture definition

C : Display list

D : Brightness

Q.no 2. A Special form of the one-point perspective projection takes place when the vanishing
point is placed centrally within the figure. This type of projection is called a _________
projection.

A : Parallel

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 101/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Perspective

C : Tunnel

D : Cavalier

Q.no 3. The line segments of polygon are called as _________

A : Edges

B : Vertices

C : Line

D : Ellipse

Q.no 4. Reflection about X-axis followed by reflection about Y-axis is equivalent to_______

A : Reflection about line Y= X

B : Reflection about origin

C : Reflection about line Y=-X

D : Reflection about Y-axis

Q.no 5. Which is not image file format

A : bmp

B : jpg

C : tiff

D : png

Q.no 6. Z -buffer algorithm are

A : Simplest algorithm

B : Complex algorithm

C : Largest algorithm

D : Smallest algorithm

Q.no 7. The surfaces that is blocked or hidden from view in a 3D scene are known as

A : Hidden surface

B : Frame buffer

C : Quad tree

D : Clipping
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 102/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 8. Which one is the basic input device in GUI

A : Mouse

B : Graphics tablet

C : Voice system

D : Touch panel

Q.no 9. The best hidden surface removal algorithm is ?

A : Depth buffer

B : Area subdivision

C : Depends on the application

D : Painters

Q.no 10. The color code “000” is for________.

A : White

B : Black

C : Blue

D : Green

Q.no 11. DVST means

A : Direct view storage tube

B : Domain view storage tube

C : Direct view store tube

D : Domain view store tube

Q.no 12. The simplest output primitive is _______

A : Straight line

B : Straight line segment

C : Point

D : Circle

Q.no 13. The types of projection are

A : Parallel projection and perspective projection

B : Perpendicular and perspective projection

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 103/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Parallel projection and Perpendicular projection

D : Perpendicular and isometric projection

Q.no 14. The method which is based on the principle of checking the visibility point at each
pixel position on the projection plane are called

A : Object-space method

B : image-space method

C : Both a & b

D : None of these

Q.no 15. Types of computer graphics are

A : Vector and raster

B : Scalar and raster

C : Vector and scalar

D : Raster and Scalar

Q.no 16. Intensity representation of an image is called

A : Frame Buffer

B : Picture definition

C : Display list

D : Brightness

Q.no 17. A Process which divides each segment of the picture into its visible and invisible
portion, allowing the invisibleportion to be discarded is called___.

A : Clipping

B : Windowing

C : Segmenting

D : Viewing

Q.no 18. Which are not geometric transformations

A : Translation

B : Rotation

C : Scaling

D : Image
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 104/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 19. Pick out the odd one out

A : LED

B : LCD

C : Gas Discharge tube

D : Plasma Panel

Q.no 20. Resolution can be defined by

A : Number of component

B : Number of small square boxes

C : Number of pixels

D : Number of pixels per unit length

Q.no 21. GIF stands for

A : Global Image Format

B : Graphics Interchange Format

C : Graphics Image Format

D : Global Interchange Format

Q.no 22. Surface information in A-buffer includes

A : RGB intensity components

B : Vector

C : Raster

D : pixmap

Q.no 23. Non-impact use various techniques to combine three color pigment ______ to
produce a range of color patterns

A : Cyan , magenta and yellow

B : Cyan , white and black

C : Cyan , white and yellow

D : Black , magenta and yellow

Q.no 24. Find out the odd ones

A : Boundary fill

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 105/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : 4-connected

C : Back-Face Detection

D : 8-connected

Q.no 25. For a seed-fill method, If a given point is (x, y) and we want to access (x-1, y-1) in the
same iteration, we use which of the following

A : 4-connected method

B : 5-connected method

C : 7-connected method

D : 8-connected method

Q.no 26. In translation transformation Ty indicates

A : Scaling factor along Y direction

B : Translation factor along Y direction

C : Tilting factor along Y direction

D : Shearing factor along y direction

Q.no 27. In which transformation ,the mirror image of an object can be seen with respect to
x-axis, y-axis ,z-axis as well as with respect to an arbitrary line

A : Reflection

B : Shearing

C : Translation

D : Rotation

Q.no 28. The rectangle portion of the interface window that defines where the image will
actually appear are called

A : Transformation viewing

B : View port

C : Clipping window

D : Screen coordinate system

Q.no 29. The region code of a point is 1001. The point is in the________region of window

A : Top right

B : Top left

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 106/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

C : Bottom left

D : Bottom right

Q.no 30. In Cohen-Sutherland subdivision line clipping algorithm, bit 1 in region code is set if

A : end point of line is to the left of the window

B : end point of line is to the right of the window

C : end point of line is to the below of the window

D : end point of line is to the above of the window

Q.no 31. To increase the energy of these slow moving electron and create a bright picture in
DVST , the screen is maintained at a

A : Low positive potential

B : High negative potential

C : High positive potential

D : Low Negative Potential

Q.no 32. What is the use of homogeneous coordinates and matrix representation

A : To treat all 3 transformations in a consistent way

B : To scale

C : To rotate

D : To shear the object

Q.no 33. By changing the dimensions of the viewport, the _________ and ___________ of the
objects being displayed can be manipulated

A : Number of pixels and image quality

B : X co-ordinate and Y co-ordinate

C : Size and proportions

D : Pixel and co-ordinates

Q.no 34. The animation can be divided into

A : One part

B : Two parts

C : Three parts

D : Four parts
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 107/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

Q.no 35. A polygon, in which the line segment joining any two points within the polygon lies
completely inside the polygon, is called ________ polygon

A : Convex

B : Concave

C : Closed

D : Complete

Q.no 36. .............. is a type of window which is invoked by an application when multiple inputs
are required to specify the desired action

A : Panel

B : Icon

C : Dialog box

D : Menu

Q.no 37. Mapping the world co-ordinates into physical device co-ordinates is called___

A : translation

B : homogeneous transformation

C : co-ordinate conversion

D : Viewing transformation

Q.no 38. GPU stands for

A : Graphical Processing Unit

B : Graphical Percentage Unit

C : Good Processing Unit

D : Graphical Product Unit

Q.no 39. The rotation axis that is perpendicular to the xy plane and passes through the pivot
point is known as

A : Rotation

B : Translation

C : Scaling

D : Shearing

Q.no 40. A joystick is consisting of a

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 108/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

A : Pen

B : Stick

C : Microphone

D : Pick

Q.no 41. If the resultant object is given along with the set of transformations applied on it,
then to find the original object we have to use___________

A : Affine transformation

B : Reverse transformation

C : Normal transformation

D : Inverse transformation

Q.no 42. Non impact use various techniques to combine three color pigment ______ to
produce a range of color patterns

A : Cyan , magenta and yellow

B : Cyan , white and black

C : Cyan , white and yellow

D : Black , magenta and yellow

Q.no 43. Z-buffer algorithm is used for

A : Framebuffer removal

B : Hidden line removal

C : Rendering

D : Animation

Q.no 44. The number of matrices required to rotate an object about a point (1,1)
are___________

A:1

B:2

C:3

D:4

Q.no 45. _______is known as standard graphics objects

A : Octree

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 109/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

B : Polygon surfaces

C : Ellipsoid

D : Raster image

Q.no 46. The video memory that is used to hold the image displayed on screen is known as

A : Display processor

B : LUT

C : Frame buffer

D : Display file

Q.no 47. A fast and simple method for rendering an object with polygon surface is

A : Constant-intensity shading

B : Flat shading

C : Both a & b

D : Flattening

Q.no 48. When a circle is subjected to translational sweep, a .................is formed

A : Ellipse

B : Cone

C : Sphere

D : Cylinder

Q.no 49. Pen or inkjet plotters use the following devices

A : Drum

B : Flat bed

C : Both a & b

D : None of these

Q.no 50. Cohen-Sutherland subdivision line clipping algorithm uses ________ regions with
different codes.

A:8

B:6

C:4

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 110/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

D:9

Q.no 51. Which surface algorithm is based on perspective depth

A : Depth comparison

B : Z-buffer or depth-buffer algorithm

C : subdivision method

D : back-face removal

Q.no 52. The size of these dot in inkjet printer usually lies between

A : 50 to60 microns in diameter

B : 20 to30 microns in diameter

C : 30 to40 microns in diameter

D : 10 to20 microns in diameter

Q.no 53. The range that specifies the gray or grayscale levels is___________

A : The value range from -1 to 1

B : The value range from 0 to -1

C : The value range from 0 to 1

D : Any one of the above

Q.no 54. The method which uses array of dots for generating a character is called

A : Stoke method

B : Bitmap method

C : Star bust method

D : Pixmap method

Q.no 55. In non-zero winding number rule If the total sum of this direction value is non-zero,
then this point to be tested is an

A : Interior point

B : Exterior point

C : Partial point

D : Invisible

Q.no 56. In the Cohen Sutherland Out code Algorithm, the four bits in the outcode are set on
the basis of positions of the line end points to the ________ of clipping window regions in the
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 111/112
10/22/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10

order

A : Top, Bottom, Right, Left

B : Right, Top, Bottom, Left

C : Top, Right, Left, Bottom

D : Bottom, Right, Left, Top

Q.no 57. Which of the following is a hidden surface removal algorithm?

A : DDA

B : Breshenham’s

C : Z-buffer

D : Cohen Sutherland

Q.no 58. The point (x,y) becomes (y,x) in____________transformation

A : Reflection about origin y-axis

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 59. _______is very important in creating animated images on the screen

A : Image transformation

B : Morphing

C : Clipping

D : Image reflection

Q.no 60. Refreshing is not needed in DVST because of the presence of_____

A : Primary gun

B : Flood gun

C : Focusing anode

D : Control grid

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=3308&code=1052000&showTest=2371&actForm=edit&set=10 112/112
 • Join Our Community on Telegram- Techvines Coders Union
Channel Link- https://t.me/Techvines_Coders_Union
In computer graphics,pictures or graphics objects are presented
as a collection of discrete picture element called___
A) dots
B) pixels
C) co-ordinates
D) points
ANSWER: B
____is the smallest addressable screen element.
A) dots
B) point
C) pixels
D) spot
ANSWER: C
____is the smallest piece of the display screen which we can
control.
A) dots
B) point
C) spot
D) pixel
ANSWER: D
We can control ____of the pixels which compose the screen
A) intensity
B) size
C) shape
D) None
ANSWER: A
We can control ____of the pixels which compose the screen
A) colour
B) size
C) shape
D) None
ANSWER: A
Each pixel on the graphics display represents______
A) a single mathematical point
B) 2 mathematical point
C) 4 mathematical point
D) a region which theoretically can contain infinite points
ANSWER: D
A point (42,38) can be displayed on a screen by a pixel
A) (4,3)
B) (3,4)
C) (5,4)
D) (4,4)
ANSWER: A
The process of determining the appropriate pixel for
representing, picture or graphics objects is known as___
A) scan conversion
B) rasterization
C) scanning
D) graphical representation
ANSWER: B
The process representing continuous picture or graphics objects
as a collection of descrete pixels is called____
A) scan conversion
B) rasterization
C) scanning
D) graphical representation
ANSWER: A
The computer graphics allows____ on pictures before
displaying it.
A) rotation
B) translation
C) scaling and projections
D) All of above
ANSWER: D
Graphics devices include_____
A) input devices
B) output devices
C) a and b
D) None
ANSWER: C
Computer graphics allows_____
A) user interface
B) plotting of graphics and chart
C) office automation and desktop publishing
D) all of above
ANSWER: D
Computer graphics allows______
A) copmuter-aided drafting and design
B) simulaion and animation
C) art and commerce
D) all of above
ANSWER: D
Computer graphics allows_____
A) process control
B) cartography
C) art and commerce
D) all of above
ANSWER: D
The software components of conceptual framework for
interactive graphics is/are_____
A) application model
B) application program
C) graphics system
D) all of above
ANSWER: D
The Hardware components of conceptual framework for
interactive graphics is/are________
A) input devices
B) output devices
C) a and b
D) none of these
ANSWER: C
The display devices are_____
A) input
B) output
C) a and b
D) none of these
ANSWER: B
CRT stands for____
A) Cathode Ray Tube
B) Colour Ray Tube
C) Cathode Radio Tube
D) Colour Radio Tube
ANSWER: A
A CRT is an evacuated _________ tube
A) plastic
B) glass
C) steel
D) iron
ANSWER: B
An____________ gun at the rear of the CRT produces a beam
of electrons
A) electronic
B) electron
C) element
D) emergency
ANSWER: B
The deflection system of the CRT consists
of___________deflection plates
A) vertical
B) horizontal
C) a and b
D) none of these
ANSWER: C
The techique(s) used for producing image on the CRT
is/are__________
A) vector scan
B) raster scan
C) Both a and b
D) none of these
ANSWER: C
Vector scan technique is also called _________
A) scalar scan
B) random scan
C) raster scan
D) beam scan
ANSWER: B
In vector scan display, buffer memory used is also called
_________
A) refresh memory
B) refresh buffer
C) buffer display
D) refresh circuit
ANSWER: B
In vector scan display, the phosphor is to be refreshed at least
________ times per second to avoid flicker.
A) 10
B) 20
C) 30
D) 40
ANSWER: C
In raster scan display,the display image is stored in the form of
_________ in the refresh buffer.
A) 1s
B) 0s
C) 1s and 0s
D) none of these
ANSWER: C
In raster scan CRT, the beam is swept back and forth from
_______ across the screen.
A) left to right
B) right to left
C) up to down
D) down to up
ANSWER: A
In raster Scan CRT, when a beam is moved from the left to the
right,it s ____ and it is _____ when it is moved from the right to
the left.
A) ON,OFF
B) OFF,ON
C) ON,ON
D) OFF,OFF
ANSWER: A
In raster scan display, the screen image repeatedly scanned, this
process is called _______
A) buffering of screen
B) refreshig of screen
C) rendering of screen
D) heghlighting screen
ANSWER: B
On a black and white system with one bit per pixel , the frame
buffer is called a__________.
A) bitmap
B) pixmap
C) bitpixmap
D) pixbitmap
ANSWER: A
The cost of vector scan display is___________ cost of raster
scan dispay.
A) equal to
B) less than
C) more than
D) none of these
ANSWER: C
For ____________ display , scan conversion hardware is
required.
A) vector scan
B) random scan
C) raster scan
D) none of these
ANSWER: C
Aspect ratio is the ratio of ________ to prodce equal length
lines in both direction on the screen
A) vertical points to horizontal points
B) horizontal points to vertical points
C) left to riht and right to left diagonal points
D) right to left and left to right diagonal points
ANSWER: A
Display file can be implemented using __________ data
structure.
A) array
B) linked list
C) paging
D) all of the above
ANSWER: D
The process of digitizing a picture definition given in an
application program into a set of pixel-intensity Values is called
____________.
A) animation
B) sampling
C) rasterization
D) scan-conversion
ANSWER: D
The size of frame buffer(video memory )depends
on_____________.
A) resolution only
B) number of different colors only
C) both (B) and(C)
D) computer byte
ANSWER: E
A pixel of black_white image or graphics object takes
_________ space in memory
A) 1 bit
B) 2 bits
C) 1 nibble
D) 1 byte
ANSWER: C
The resolution of an image is __________
A) number of pixels per unit area
B) number of pixels per unit length inhorizontal
C) number of pixels per unit length in vertical
D) none of these
ANSWER: A
Persistance can be defined as…….
A) intensity of a pixel
B) pixels per unit area
C) the duration of phosphorescence exhibited by a phosphor
D) number of pixels in an image
ANSWER: C
The path the electron beam takes at the end of each refresh cycle
is called…..
A) horizontal retrace
B) vertical retrace
C) diagonal retrace
D) left to right retrace
ANSWER: B
The path the electron beam takes when returning to the left side
of the CRTscreen is called…..
A) horizontal retrace
B) vertical retrace
C) diagonal retrace
D) top to bottom retrace
ANSWER: A
Frame buffer is used to store …..
A) number if pixels in image
B) intencities of pixels
C) image definition
D) co-ordinate values of image
ANSWER: B
The clearity of a displayed image depends on the…..
A) resolution
B) floating point precision of system
C) associated software
D) aspect ratio
ANSWER: A
Random scan monitor can also reffered to as….
A) vector displays
B) stroke writing displays
C) calligraphic displays
D) none of the above
ANSWER: A
Which facility is provided by computer graphics to change the
shape colour or other properties of objects begin viewed A)
Motion dynamics
B) Update dynamics
C) A & B
D) None of these
ANSWER: B
which factors affect resolution
A)The type of phosphor
B) The intensity to be displayed
C) The focusing & deflection systems used in CRT
D) all of these
ANSWER: D
special area of the memory is dedicated to graphics only in
raster scan display called_________
A) Frame buffer
B) video controller
C) display controler
D) Monitor
ANSWER: A
which is not true statement for raster scan generator
A) It produces deflection signals
B) It consists of raster scan generator,x&y address
register&pixel
C) it receive the intencity information of each pixel from frame
buffer
D) it controls the x&y address registers
ANSWER: C
The disadvantage of raster graphics display system is ______
A) It require large number of frame buffer memory cycles
needed for video scan out
B) The burden of image generation is on the main CPU
C) Insufficient frame buffer memory band width
D) All of these
ANSWER: D
To store black and white images ,black pixels are represented
by________ in the frame buffer and white pixels by_______
A) Zero and one
B) One and Zero
C) Both a & b
D) None of these
ANSWER: B
The image can be transmitted to the display point by________
A) Line
B) Segment
C) Point
D) None of these
ANSWER: C
The center of display screen is computed as
A) X max ,y max
B) Xmax/2,ymax/2
C) Xmax/3,ymax/3
D) None of these
ANSWER: B
What is true about DDA algorithm for scan conversion of a line
A) General purpose method
B) Incremental
C) current calculation is independent of previous step
D) Is slower than the use of line equation
ANSWER: B
In DDA algorithm for scan conversion of line
A) if |m|<=1 then dx=1
B) if |m|>=1 then dx=1
C) if |m|<=1 then dy=1
D) none of the above
ANSWER: A
Which of these is true about Bresenham's Line Algorithm?
A) Highly efficient incremental method
B) Uses scan conversion
C) uses integer addition,subtraction and multiplication by 2
D) all of the above
ANSWER: A
Integer addition,subtraction and multiplication by 2 in
Bresenham's Line Algorithm can be done by
A) Simple arithmetic shift operation
B) circular shift operation
C) XOR Operation
D) none of the above
ANSWER: B
In Bresenham's algorithm for scan conversion of line
A) d=2dy-dx
B) d=2dx-dy
C) d=4dy-dx
D) d=4dx-dy
ANSWER: A
What is the basis of scan conversion of a circle?
A) Semi-circle symmetry
B) Quarter symmetry
C) Eight-way symmetry
D) none of the above
ANSWER: C
What is true about the Bresenhem's Circle algorithm?
A) if d<0 then d=d+4x+6
B) if d>0 then d=d+4x+6
C) if d<0 then d=d+4(x-y)+10 and y--
D) none of the above
ANSWER: A
which of these is a characteristic of midpoint circle algorithm?
A) Produces pixel points for an semicircle
B) Produces pixel points for an quadrant
C) Produces pixel points for an octant
D) none of the above
ANSWER: C
What is the initial value for the decision parameter in midpoint
circle algorithm
A) 5/4-r
B) 4/5-r
C) r-5/4
D) r-4/5
ANSWER: A
In Bresenham's line generation algorithm, the initial value of the
decision parameter as p0 = __________, where slope MOD (m)
<1
A) 2Δy – Δx
B) 2Δy – 2Δx
C) Δx – Δy
D) none of the above
ANSWER: A
If a line whose end point is (10, 12) and start point is (20, 20),
then slope m =?
A) 1.2
B) 0.8
C) -0.4
D) none of the above
ANSWER: B
The Cartesian slope-intercept equation for a straight line is
________________.
A) y = m(a+b+c)
B) y = m.x + b
C) y = 2∆x-m
D) none of the above
ANSWER: B
The DDA algorithm is a faster method for calculating pixel
positions than the direct use of Eq. y = m.x + b
A) TRUE
B) FALSE
ANSWER: A
In Bresenham's Mid-point Circle Algorithm, the initial value of
the decision parameter is p0 = 5/4 – r.
A) TRUE
B) FALSE
ANSWER: A
The method which used either delta x or delta y, whichever is
larger, is chosen as one raster unit to draw the line .the algorithm
is called?
A) Bresenham`s Line Algorithm
B) Generalized Bresenham`s Algorithm
C) DDA Line Algorithm
D) Midpoint Line Algorithm
ANSWER: C
There are two standard methods of mathematically representing
a circle centered at the origin. They are?
A) Polynomial Method, and Bresenham`s
B) Trigonometric Method and Bresenham`s
C) DDA, and Bresenham`s
D) Polynomial Method, and Trigonometric Method
ANSWER: D
In Bresenham's algorithm, while generating a circle , it is easy to
generate?
A) One octant first and other by successive reflection
B) One octant first and other by successive rotation
C) One octant first and other by successive translation
D) All octants
ANSWER: A
Why a circle drawn on the screen appears to be elliptical ?
A) It is due to the aspect ratio of monitor
B) Screen has rectangular shape
C) Our eyes are not at the same level on screen
D) CRT is completely spherical
ANSWER: A
Which of the following technique is used in Midpoint
Subdivision algorithm ?
A) Linear search
B) Binary Search
C) Heap sort
D) Bubble Sort
ANSWER: B
A circle, if scaled only in one direction becomes a ?
A) parabola
B) hyperbola
C) Ellipse
D) remains a circle
ANSWER: C
(2,4) is a point on a circle that has center at the origin. Which of
the following points are also on circle ?
A) (2,-4),(-2,4)
B) (4,-2)
C) (-4,2)
D) All of above
ANSWER: D
A line can be represented by
A) One point
B) Two points
C) Three points
D) Four points
ANSWER: B
Bresanham circle algorithm uses the approach of a.
A) Midpoint
B) Point
C) Line
D) None of these
ANSWER: A
The side effect of scan conversion are
A) Aliasing
B) Anti aliasing
C) Both a & b
D) None of these
ANSWER: A
The process of reducing aliasing is called
A) Resolution
B) Anti aliasing
C) Sampling
D) None of these
ANSWER: B
The problem of aliasing are
A) Staircase
B) Unequal brightness
C) Picket fence problem
D) All of these
ANSWER: D
The basic principle of Bresenham`s line algorithm is__?
A) A to select the optimum raster locations to represent a
straight line
B) to select either Δx or Δy, whichever is larger, is chosen as
one raster unit
C) we find on which side of the line the midpoint lies
D) both a and b
ANSWER: A
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
A) x-increments = 1; y-increments =1
B) x-increments = 0.5; y-increments =1
C) x-increments = 1; y-increments =0.5
D) None of above
ANSWER: C
Line produced by moving pen is __ at the end points than the
line produced by the pixel replication?
A) Thin
B) Straight
C) Thicker
D) both A and B
ANSWER: C
A line segment _____________.
A) extends forward
B) extends backward
C) ends at two points
D) extends forever both forward and backward
ANSWER: C
In DDA line drawing algorithm, dx or dy, whichever
is________, is chosen as one raster unit.
A) 1
B) 0
C) smaller
D) larger
ANSWER: D
Sign function makes the DDA line drawing algorithm work in
_____ quadrants.
A) I and II
B) B I and III
C) II and III
D) all
ANSWER:D
Floating point arithmetic in DDA algorithm is__________.
A) time efficient
B) time consuming
C) fast
D) slow
ANSWER: B
DDA line drawing algorithm for calculating pixel positions is
__________ the direct use of equation y = mx + b.
A) slower than
B) faster than
C) of equal speed to that of
D) none of these
ANSWER: B
Expansion of line DDA algorithm is______
A) Digital difference analyzer
B) Direct differential analyzer
C) Digital differential analyzer
D) Data differential analyzer
ANSWER: C
Which algorithm is a faster method for calculating pixel
positions?
A) Bresenham’s line algorithm
B) Parallel line algorithm
C) Mid-point algorithm
D) DDA line algorithm
ANSWER: D
In Bresenham’s line algorithm, if the distances d1 < d2 then
decision parameter Pk is______
A) Positive
B) Equal
C) Negative
D) Option a or c
ANSWER: C
A dashed line could be displayed by generating_________.
A) Inter dash spacing
B) Very short dashes
C) Both A or B
D) A or B
ANSWER: A
Which of the following technique is used in Midpoint
Subdivision algorithm ?
A) Linear search
B) Binary search
C) Heap sort
D) Bubble sort
ANSWER: B
Which one is not a type of basic fill styles?
A. Hollow
B. solid color
C. Pattern
D. Dark
ANSWER: D

The process of filling an area with rectangular pattern is called

A. Tiling
B. Linear fill
C. Tint-fill
D. Soft-fill
ANSWER: A

The algorithm which repaints an area that was originally

painted by merging a foreground color F and background color
B where F!=B
A. Tint fill
B. Flood fill
C. Linear soft-fill
D. Boundary fill
ANSWER: C
 The fill color that is combined with the background color is
known as
A. Soft fill
B. Tint fill
C. Both a and b
D. None
ANSWER: A

The process of mapping a world window in world coordinate

system to viewport are called
A. Transformation viewing
B. Viewport
C. Clipping window
D. Screen coordinate system
ANSWER: A

The process of extracting a portion of a database or a picture

inside or outside a specified region are called
A. Transformation
B. Projection
C. Clipping
D. Mapping
ANSWER: C
The rectangle portion of the interface window that defines
where the image will actually appear are called
A. Transformation viewing
B. View port
C. Clipping window
D. Screen coordinate system
ANSWER: B

Coordinates of window are knows as ..............

A. Screen coordinates
B. World coordinates
C. Device coordinates
D. Cartesian coordinates
ANSWER: B

The region against which an object is clipped is called

a ..............
A. Clip window
B. Boundary
C. Enclosing rectangle
D. Clip square
ANSWER: A

............. identifies the picture portions that are exterior to the

clip window
A. Interior clipping
B. Exterior clipping
C. Extraction
D. None of the above
ANSWER: B

Identify line clipping algorithms from the following

A. Cohen- Sutherland algorithm
B. Liang-Barskyclipping
C. Nicholl-Lee-Nicholl clipping
D. All of the above
ANSWER: D

The region code of a point within the window is ............

A. 1111
B. 0
C. 1000
D. 1
ANSWER: B

According to Cohen-Sutherland algorithm, a line is completely

outside the window if ............
A. The region codes of line endpoints have a '1' in same bit
position.
B. The endpoints region code are nonzero values
C. If L bit and R bit are nonzero.
D. The region codes of line endpoints have a '0' in same bit
position.
ANSWER: A

The region code of a point is 1001. The point is in the .................

region of window.
A. Top right
B. Top left
C. Bottom left
D. Botton righ
ANSWER: B

The result of logical AND operation with endpoint region codes

is a nonzero value. Which of the following statement is true?
A. The line is completely inside the window
B. The line is completely outside the window
C. The line is partially inside the window
D. The line is already clipped
ANSWER: B

The left (L bit ) bit of the region code of a point (X,Y) is '1'
if ......................
A. X > XWMIN
B. X< XWMIN
C. X< XWMAX
D. X>XWMAX
ANSWER: B

The right bit (R bit)of the region codeof a point (X,Y) is '1'
if ......................
A. X > XWMIN
B. X< XWMIN
C. X< XWMAX
D. X>XWMAX
ANSWER: D

The ...................... algorithm divides a 2D space into 9 regions,

of which only the middle part (viewport) is visible.
A. Cohen-Sutherland
B. Liang Barsky
C. Sutherland Hodegeman
D. N-L-N
ANSWER: A

A method used to test lines for total clipping is equivalent to

the .............
A. logical XOR
B. logical OR
C. logical AND
D. both a & b
ANSWER: C

Sutherland Hodgeman algorithm works well for...........

A. Concave polygon
B. Convex polygon
C. Smooth curves
D. Line segment
ANSWER: B
The text clipping strategy to reject an entire character string that
overlaps a clip window is called................
A. All-or-none character clipping
B. All-or-none string clipping
C. Curve clipping
D. both a & b
ANSWER: B

............. is known as standard graphics objects

A. Octree
B. Quadtree
C. Polygon surfaces
D. Ellipsoid
ANSWER: C

Identify the data structures used to store the data about polygon
surfaces
A. Vertex table
B. Polygon table
C. Edge table
D. All of the above
ANSWER: D
Coordinate values for each vertex is stored in ......................
A. Coordinate table
B. Vertex table
C. Edge table
D. Location table
ANSWER: B

...................... data structure is used to identify the vertices for

each polygon edge.
A. Vertex table
B. Polygon table
C. Edge table
D. Surface table
ANSWER: C

...................... data structure is used to identify the edges for

each polygon .
A. Vertex table
B. Polygon table
C. Edge table
D. None of the above
ANSWER: B
The complex graphics operations are
A. Selection
B. Separation
C. Clipping
D. None of these
ANSWER: C

In computer graphics, a graphical object is known a

A. Point
B. Segment
C. Parameter
D. None of these
ANSWER: B

An object can be viewed as a collection of

A. One segment
B. Two segment
C. Several segments
D. None of these
ANSWER: C
Every segment has its own attributes like
A. Size, visibility
B. Start position
C. Image transformation
D. All of these
ANSWER: D

By using the attributes of segment , we can________ any

segment
A. Change
B. Control
C. Print
D. None of these
ANSWER: B

A two-dimensional array contain the details of all the segment

are called
A. Segmentation table
B. Segment name
C. Operation
D. None of these
ANSWER: A
We assign all the attributes of segment under this
A. Segment name
B. Segment size
C. Array
D. None of these
ANSWER: A

The initial size of segment will be_______

A. 1
B. 0
C. 2
D. 3
ANSWER: B

The end point of polygon are called as

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B
The line segment of polygon are called as
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: A

What are the types of polygon

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: C

If a line joining any of its two interior points lies completely

within it are called
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: A
If a line joining any two of its interior points lies not completely
inside are called
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: B

If the visit to the vertices of the polygon in the given order

produces an anticlockwise loop are called
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: B

If the visit to the vertices of the polygon in the given order

produces an clockwise loop are called
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: A
Which approaches are used for determine whether a particular
point is inside or outside of a polygon
A. Even-odd method
B. Winding number method
C. Both a & b
D. None of these
ANSWER: C

The rectangle portion of the interface window that defines

where the image will actually appear are called
A. Transformation viewing
B. View port
C. Clipping window
D. Screen coordinate system
ANSWER: B

The process of extracting a portion of a database or a picture

inside or outside a specified region are called
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D

The rectangle space in which the world definition of region is

displayed are called
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: B

The object space in which the application model is defined

A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: C

The process of cutting off the line which are outside the window
are called
A. Shear
B. Reflection
C. Clipping
D. Clipping window
ANSWER: C

Some common form of clipping include

A. curve clipping
B. point clipping
C. polygon clipping
D. All of these
ANSWER: D

The center of display screen is computed as

A. X�max�,y�max

B. Xmax/2,ymax/2
C. Xmax/3,ymax/3
D. None of these
ANSWER: B

Which method are used to construct and position the straight

lines, arcs and circles, etcs
A. Rubber band method
B. Gravity field
C. Dragging
D. None of these
ANSWER: A

If the visit to the vertices of the polygon in the given order

produces an anticlockwise loop are called
A. Negatively oriented
B. Positively oriented
C. Both a & b

D. None of these�

ANSWER: B

If the visit to the vertices of the polygon in the given order

produces an clockwise loop are called
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: A

The rectangle space in which the world definition of region is

displayed are called
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: B

The process of coloring the area of a polygon is called

A. Polygon filling
B. Polygon flow
C. Aliasing
D. None of these
ANSWER: A

How many types of polygon filling

A. Two
B. One
C. Three
D. Four
ANSWER: C

The algorithm used for filling the interior of a polygon is called

A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A

The function of scan line polygon fill algorithm is

A. Find intersection point of the boundary of polygon and scan
line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
D. None of these
ANSWER: A

If the pixel is already filled with desired color then leaves it

otherwise fills it. this is called
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B

The region against which an object is clipped is called

a ..............
A. Clip window
B. Boundary
C. Enclosing rectangle
D. Clip square
ANSWER: A

Sutherland-Hodgman�s Polygon clipping algorithm uses a

����������

A. Divide and conquer strategy.

B. Recursive� approach

C. Increment approach
D. None of above
ANSWER: A

The technique for not showing that part of drawing which one is
not interested , it is called�������

A. Windowing
B. clipping
C. View-port
D. None of above
ANSWER: B
((Q))1_//An -------------test is used to check whether a point is inside or outside of the polygon.
((A)) Inside

((B)) Outside

((C )) Fill

((D)) Cover

((E)) A

((F))

((Q))1_//In an inside test if number of intersections are ---------------- then point is inside of the polygon.
Note : intersection point is not a vertex.

((A)) Even

((B)) Odd

((C )) Infinite

((D)) None of the above

((E)) B

((F))

((Q))1_//In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note
: intersection point is not a vertex

((A)) Inside

((B)) Outside

((C )) Color

((D)) Can't Say

((E)) A

((F))

((Q))1_//In an inside test if intersections point is a vertex and edges meeting at that vertex lies on same
side of constructed horizontal line then the number of intersections are considered as --
--------. Note : intersection point is a vertex

((A)) Even Number

 ((B)) Odd Number

((C )) Infinite Number

((D)) Can't Say

((E)) A

((F))

((Q))1_//In an inside test if intersections point is a vertex and edges meeting at that vertex lies on -------
------ side of constructed horizontal line then the number of intersections are
considered as even number . Note : intersection point is a vertex

((A)) Same

((B)) Opposite

((C )) On the

((D)) None of the above

((E)) A

((F))

((Q))1_//Two inside polygon test methods are __________ and ________

((A)) Even odd method , winding number method

((B)) Scan line and flood fill

((C )) Even odd method, flood fill

((D)) winding number method, Scan line

((E)) A

((F))

((Q))1_//The 8-Fill Polygon technique will correctly fill the triangle shown below when seeded at the
position shown with an X.

((A)) TRUE

((B)) FALSE

((C ))

((D))
 ((E)) B

((F))

((Q))1_//Following is the method for inside test of the polygon.

((A)) Even-odd method

((B)) Linear method

((C )) Inside method

((D)) Seed method

((E)) A

((F))

((Q))1_//Every side in winding number method has given a number called

((A)) Winding Number

((B)) Integer no.

((C )) Direct number

((D)) Side Number

((E)) A

((F))

((Q))1_//The total of the winding no. in winding number method of inside test is called as
((A)) winding.

((B)) collective winding.

((C )) net winding.

-((D)) summation winding.

((E)) C

((F))

((Q))1_//Winding number method always gives correct answer for overlapping polygons

((A)) TRUE

((B)) FALSE
 ((C ))

((D))

((E)) B

((F))

((Q))1_//Inside tests of polygon are useful in --------

((A)) Polygon filling

((B)) Line coloring

((C )) Shadowing

((D)) None of the above

((E)) A

((F))

((Q))1_//Even-odd method of inside test counts ----- to decide the position of a point.

((A)) Edges

((B)) Vertices

((C )) Intersections

((D)) Pixels

((E)) C

((F))

((Q))1_//In winding number method an ------------------ edges ------ considered

((A)) Horizontal , not

((B)) Vertical , not

((C )) Slanted , not

((D)) Horizontal , is

((E)) A

((F))
((Q))1_//Even-odd method of inside test is suitable for------

((A)) Polygons

((B)) Circles

((C )) Lines

((D)) All of above

((E)) A

((F))

((Q))1_//In winding number method an edge can have winding number as -----

((A)) Zero

((B)) +1 or -1

((C )) Only +1

((D)) Only -1

((E)) B

((F))

((Q))1_//If the pixel is already filled with desired color then does nothing, otherwise fills it. This is called
((A)) Flood fill algorithm

((B)) Boundary fill algorithm

((C )) Scan line polygon filling algorithm

((D)) None of these

((E)) B

((F))

((Q))1_//The algorithm used for filling the interior of a polygon is called

((A)) Flood fill algorithm

((B)) Boundary fill algorithm

((C )) Scan line polygon fill algorithm

((D)) None of these

 ((E)) A

((F))

((Q))1_//___________ procedure accepts the coordinates of an internal point.

((A)) Area fill

((B)) Boundary fill.

((C )) Line fill.

((D)) Scan fill.

((E)) B

((F))

((Q))1_//In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring
pixels.

((A)) 8

((B)) 4

((C )) 2

((D)) 16

((E)) A

((F))

((Q))1_//Following statement(s) is/are true about flood fill algorithm

((A)) It need a seed pixel

((B)) It works at pixel level

((C )) Requires more memory

((D)) All of above

((E)) D

((F))

((Q))1_//Following statement(s) is/are false about flood fill algorithm

((A)) It doesn’t need a seed pixel

 ((B)) It works at pixel level

((C )) Requires more memory

((D)) All of above

((E)) A

((F))

((Q))1_//Seed pixel in flood fill Algorithm is an

((A)) An interior pixel

((B)) Exterior pixel

((C )) Not a pixel

((D)) It is color of pixel

((E)) A

((F))

((Q))1_//In Boundary Fill method ____________ Data Structure is used.

((A)) Stack

((B)) Array

((C )) Heap

((D)) None of above

((E)) A

((F))

((Q))1_//The 4-connected Polygon filling technique has disadvantage(s) as

((A)) Requires more memory

((B)) May fill polygon partially

((C )) Stack overflow

((D)) All of above

((E)) D
 ((F))

((Q))1_//In --------------algorithm edges can be specified in different color.

((A)) Flood fill

((B)) Boundary fill

((C )) DDA fill

((D)) BSA fill

((E)) A

((F))

((Q))1_//The process of coloring the area of a polygon is called

((A)) Polygon filling

((B)) Polygon flow

((C )) Aliasing

((D)) None of these

((E)) A

((F))

((Q))1_//Boundary fill algorithm uses -------- call to the fill function.

((A)) Recursive

((B)) Static

((C )) One

((D)) None of these

((E)) A

((F))

((Q))1_//Boundary fill algorithm needs–

((A)) Boundary Color (BC) and (x,y) coordinates of seed point.

((B)) Fill Color (FC) and (x,y) coordinates of seed point.

 ((C )) Boundary Color (BC), Fill Color (FC) and (x,y) coordinates of seed point.

((D)) (x,y) coordinates of seed point.

((E)) C

((F))

((Q))1_//Which polygon fill algorithm needs following information - 1.Boundary Color (BC), 2. Fill Color
(FC) and 3. (x,y) coordinates of seed point.

((A)) Boundary fill

((B)) Region fill

((C )) Scan fill

((D)) DDA fill

((E)) A

((F))

((Q))1_//Which polygon fill algorithm needs following information - 1. Region Color (RC), 2. Fill Color (FC)
and 3. (x,y) coordinates of seed point.

((A)) Flood Fill

((B)) Region fill

((C )) Scan fill

((D)) DDA fill

((E)) A

((F))

((Q))1_//Horizontal lines are not considered in scan line fill algorithm.

((A)) TRUE

((B)) FALSE

((C ))

((D))

((E)) A
 ((F))

((Q))1_//Scan line fill algorithm is more efficient than flood fill algorithm.

((A)) TRUE

((B)) FALSE

((C ))

((D))

((E)) A

((F))

((Q))1_//Which statement is true about the 4 connected region.

((A)) It is faster than 8 connected region

((B)) Sometimes it leaves region unfilled.

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))

((Q))1_//Seed pixel in flood fill Algorithm is an

((A)) An interior pixel

((B)) Exterior pixel

((C )) Not a pixel

((D)) It is color of pixel

((E)) A

((F))

((Q))1_//The function of scan line polygon fill algorithm are :

((A)) Find intersection point of the boundary of polygon and scan line

((B)) Find intersection point of the boundary of polygon and point

 ((C )) Both A and B

((D)) Neither A or B

((E)) A

((F))

((Q))1_//The edge table contains pointers back to the ______________ to identify vertices for each
polygon edge.

((A)) vertex table.

((B)) polygon table.

((C )) edge table.

((D)) expanded vertex table.

((E)) A

((F))

((Q))1_//Scan line polygon filling method uses

((A)) Scan-line coherence

((B)) Edge coherence

((C )) Area coherence

((D)) Both A and B

((E)) D

((F))

((Q))1_//Scan-line coherence property is used in

((A)) Line drawing algorithm

((B)) Scan line polygon filling algorithm

((C )) Flood fill polygon filling algorithm

((D)) None of above

((E)) B

((F))
((Q))1_//Which of the following is true about scan line algorithm?

((A)) It need a seed pixel

((B)) It works at pixel level

((C )) It uses scan lines to fill the polygon

((D)) All of above

((E)) C

((F))

((Q))1_//In scan line algorithm the intersection points are

((A)) sorted in ascending order

((B)) sorted in descending order

((C )) not sorted

((D)) Deleted

((E)) A

((F))

((Q))1_//Which of the following algorithms to fill polygons was the one used by real rasterizers?
((A)) Flood-Fill Polygons

((B)) Scan-Line Polygon

((C )) Boundary Fill Polygons

((D)) None of above

((E)) B

((F))

((Q))1_//Active edge table is used in following algorithm

((A)) Boundary fill

((B)) Region fill

((C )) Scan Line

((D)) Edge Fill

 ((E)) C

((F))

((Q))1_//Scan line polygon filling algorithm uses series of ……………. To fill the polygon.

((A)) Scan lines

((B)) Points

((C )) Layers

((D)) None of above

((E)) A

((F))

((Q))1_//In scan line algorithm, Scan lines are processed in increasing (upward) / decreasing (downward)
--------------------------.

((A)) Y order

((B)) X order

((C )) Pixel order

((D)) Color order

((E)) A

((F))

((Q))1_//When the current scan line in Scan line polygon fill algorithm moves above the upper / below
the lower endpoint, the edge

((A)) becomes inactive

((B)) becomes active

((C )) is discarded

((D)) is added.

((E)) A

((F))

((Q))1_//The edges crossed by current scan line in Scan line polygon fill algorithm are called as
((A)) Active edges
 ((B)) Inactive edges

((C )) Marked edges

((D)) None of these

((E)) A

((F))

((Q))1_//Scan line Fill Approach works at the

((A)) color level

((B)) edge level

((C )) polygon level

((D)) Pixel Level

((E)) C

((F))

((Q))1_//Following are the data structures used in Scan line algorithm to increase the efficiency.
((A)) Active Edge list

((B)) Active Edge Table

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))

((Q))1_//Scan line polygon filling algorithm starts from

((A)) Either ymax or ymin

((B)) Either xmax or xmin

((C )) Only xmax

((D)) Only xmin

((E)) A

((F))
((Q))1_//Scan line polygon filling algorithm can be used for filling Convex polygon.

((A)) TRUE

((B)) FALSE

((C )) Cant Say

((D)) None of these

((E)) A

((F))

((Q))1_//Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111

((A)) TRUE

((B)) FALSE

((C )) Cant Say

((D)) None of these

((E)) A

((F))

((Q))1_//Which one is not valid out code to perform trivial accept / reject test in line clipping
((A)) 1101

((B)) 1001

((C )) 101

((D)) 1000

((E)) A

((F))

((Q))1_//Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the
other line clipping algorithms?

((A)) Need to perform trivial accept / Reject test on end points of the line.

((B)) Need to perform trivial accept / Reject test for every point on the line.

((C )) Cannot say

((D)) None of these

 ((E)) B

((F))

((Q))1_//If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y
coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be
inside the clipping rectangle

((A)) Xmin > X < Xmax and Ymin > Y < Ymax

((B)) Xmin > X > Xmax and Ymin > Y > Ymax

((C )) Xmin < X < Xmax and Ymin < Y < Ymax

((D)) Xmin < X > Xmax and Ymin < Y > Ymax

((E)) C

((F))

((Q))1_//determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying
the rules

((A)) P1:Clipped away, P2: Clipped away, P3:Clipped Away

((B)) P1: Visible, P2:Visible, P3:Clipped Away

((C )) P1: Visible, P2:Visible, P3: Visible

((D)) P1: Clipped away, P2:Visible, P3:Clipped Away

((E)) D

((F))

((Q))1_//Outcode / Region Code used in Line Clipping is of size ____ bits.

((A)) 4

((B)) 3

((C )) 2

((D)) 1

((E)) A

((F))
((Q))1_//In Line Clipping algorithm, the two dimensional space is divided into ___ regions.
((A)) 6

((B)) 7

((C )) 9

((D)) 10

((E)) C

((F))

((Q))1_//Is 0011 valid region code / outcode used in Line Clipping algorithm?

((A)) yes

((B)) no

((C )) Cannot say

((D)) None of these

((E)) B

((F))

((Q))1_//Cohen – Sutherland line clipping algorithm was developed in ____

((A)) 1967

((B)) 1968

((C )) 1969

((D)) 1965

((E)) A

((F))

((Q))1_//Primitive types of clipping algorithms are

((A)) Point Clipping

((B)) Line Clipping

((C )) Polygon Clipping

((D)) All of above

 ((E)) D

((F))

((Q))1_//In ________ operation eliminates objects or portions of objects that are not visible through the
window to ensure the proper construction of corresponding image

((A)) Clipping

((B)) Windowing

((C )) Viewing

((D)) Transformation

((E)) A

((F))

((Q))1_//The region against which an object is clipped is called as ____________

((A)) Clip window

((B)) Clip rectangle

((C )) Window

((D)) None of these

((E)) A

((F))

((Q))1_//Cohen – Sutherland Line Clipping Algorithm is also called as ____________________

((A)) Sutherland - Hodgman Algorithm

((B)) Cohen - Sutherland Outcode Algorithm

((C )) Cyrus - Beck Algorithm

((D)) None of Above

((E)) B

((F))
((Q))1_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). What is the outcode of point (150,50)?

((A)) 110

((B)) 100

((C )) 0

((D)) 1000

((E)) C

((F))

((Q))1_//The selection and separation of a part of text or image for further operation are called
((A)) Translation

((B)) Shearing

((C )) Reflection

((D)) Clipping

((E)) D

((F))

((Q))1_//The complex graphics operations are

((A)) Selection

((B)) clipping

((C )) shear

((D)) None of these

((E)) B

((F))

((Q))1_//The process of extracting a portion of a database or a picture inside or outside a specified

region are called

((A)) Translation

((B)) Shearing

((C )) Reflection
 ((D)) Clipping

((E)) D

((F))

((Q))1_//The rectangle space in which the world definition of region is displayed are called
((A)) Screen coordinate system

((B)) Clipping window or world window

((C )) World coordinate system

((D)) None of these

((E)) B

((F))

((Q))1_//............. identifies the picture portions that are exterior to the clip window

((A)) Interior clipping

((B)) Exterior clipping

((C )) Extraction

((D)) None of these

((E)) B

((F))

((Q))1_//The region code of a point within the window is ............

((A)) 1111

((B)) 0

((C )) 1000

((D)) 1001

((E)) B

((F))

((Q))1_//According to Cohen-Sutherland algorithm, a line is completely outside the window if ............

((A)) The region codes of line endpoints have a '1' in same bit position.
 ((B)) The endpoints region code are nonzero values

((C )) If L bit and R bit are nonzero.

((D)) The region codes of line endpoints have a '0' in same bit position.

((E)) A

((F))

((Q))1_//The region code of a point is 1001. The point is in the ................. region of window.
((A)) Top Left

((B)) Top right

((C )) bottom left

((D)) bottom right

((E)) A

((F))

((Q))1_//The result of logical AND operation with endpoint region codes is a nonzero value. Which of the
following statement is true?

((A)) The line is completely inside the window

((B)) The line is completely outside the window

((C )) The line is partially inside the window

((D)) The line is already clipped

((E)) B

((F))

((Q))1_//The left (L bit ) bit of the region code of a point (X,Y) is '1' if ......................

((A)) X > XWMIN

((B)) X< XWMIN

((C )) X< XWMAX

((D)) X>XWMAX

((E)) B
 ((F))

((Q))1_//The right bit (R bit)of the region code of a point (X,Y) is '1' if ......................

((A)) X > XWMIN

((B)) X< XWMIN

((C )) X< XWMAX

((D)) X>XWMAX

((E)) D

((F))

((Q))1_//The Most Significant Bit of the region code of a point (X,Y) is '1' if ......................

((A)) Y >YWMIN

((B)) Y< YWMIN

((C )) Y< YWMAX

((D)) Y>YWMAX

((E)) D

((F))

((Q))1_//The bottom bit of the region code of a point is '0' if .......................

((A)) Y >YWMIN

((B)) Y< YWMIN

((C )) Y< YWMAX

((D)) Y>YWMAX

((E)) D

((F))

((Q))1_//The ...................... algorithm divides a 2D space into 9 regions, of which only the middle part
(viewport) is visible.

((A)) Cohen-Sutherland

((B)) Liang Barsky

 ((C )) Sutherland Hodegeman

((D)) None of these

((E)) A

((F))

((Q))1_//Sutherland Hodgeman algorithm works well for...........

((A)) Concave polygons

((B)) Convex Polygons

((C )) Smooth Curves

((D)) Line Segments

((E)) B

((F))

((Q))1_//A line with endpoints codes as 0000 and 0100 is ?

((A)) Partially invisible

((B)) Completely visible

((C )) Completely invisible

((D)) Trivially invisible

((E)) A

((F))

((Q))1_//In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the
?

((A)) codes of the end point are same

((B)) logical OR of the end points code is 0000

((C )) logical AND of the end point code is 0000

((D)) Only A

((E)) D

((F))
((Q))1_//Sutherland – Hodgman algorithm is used for _______________.

((A)) Line Clipping

((B)) Polygon Clipping

((C )) Point Clipping

((D)) Hybrid Clipping

((E)) B

((F))

((Q))1_//Which polygon clipping algorithm executed by clipping all polygon edges against the viewing
screen edges one viewing screen edge at a time?

((A)) Cohen-Sutherland

((B)) Sutherland Hodgman

((C )) Both A and B

((D)) Neither A or B

((E)) B

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside
the window and S ( Previous point) lies outside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) B

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside
the window and S ( Previous point) lies outside the window. Then while processing through that window
boundary we should
 ((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store Nothing

((E)) D

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside
the window and S ( Previous point) lies inside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) A

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside
the window and S ( Previous point) lies inside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) C

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is
used as

((A)) Left -> Right -> Top -> Bottom

 ((B)) Left -> Bottom -> Right -> Top

((C )) Right -> Top -> Left -> Bottom

((D)) Left -> Bottom -> Top -> Right

((E)) A

((F))

((Q))1_//Polygon-Clipping algorithms include the:

((A)) Sutherland-Hodgeman method

((B)) Liang-Barsky method

((C )) Weiler-Atherton method

((D)) All of above

((E)) D

((F))

((Q))1_//_______ is a ordered list of vertices where each vertex connected with the next in the list.
((A)) Line

((B)) Polygon

((C )) Parabola

((D)) None of the above

((E)) B

((F))

((Q))1_//Types of polygon :

((A)) Concave

((B)) Convex

((C )) Complex

((D)) All of above

((E)) D

((F))
((Q))1_//Concave and Convex are types of _______

((A)) Circle

((B)) Rectangle

((C )) Polygon

((D)) Ellipse

((E)) C

((F))

((Q))1_//In convex Polygon all interior angles are

((A)) Less than 90

((B)) Less than 180

((C )) greater than 180

((D)) greater than 90

((E)) B

((F))

((Q))1_//In concave Polygon atleast one interior angle is

((A)) Less than 90

((B)) Less than 180

((C )) greater than 180

((D)) greater than 90

((E)) C

((F))

((Q))1_//A region S is ____ , iff for any x1 and x2 in S, the straight line segment connecting x1 and x2 is
also contained in S.

((A)) Concave

((B)) Convex

((C )) Self-intersecting
 ((D)) Polygon with hole

((E)) B

((F))

((Q))1_//_____ may not always be Convex .

((A)) Paralleogram

((B)) Trapizoid

((C )) Polygon

((D)) Triangle

((E)) C

((F))

((Q))1_//__________ is represented as a number of line segments connected end to end to form a

closed figure.

((A)) Circle

((B)) Line

((C )) Polygon

((D)) point

((E)) C

((F))

((Q))1_//___________ is not a Type of polygon

((A)) Concave

((B)) Convex

((C )) Linear

((D)) Complex

((E)) C

((F))

((Q))1_//Right angled Triangle is an example of ____ Polygon

 ((A)) Concave

((B)) Convex

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//Square is an example of ____ Polygon

((A)) Convex

((B)) Concave

((C )) Complex

((D)) Linear

((E)) A

((F))

((Q))1_//An M shaped closed figure is an example of ____ Polygon

((A)) Convex

((B)) Concave

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//Polygons are formed by two scan lines and two _____ in polygon representation using
trapizoid primitive.

((A)) Vertical Lines

((B)) Line segments

((C )) Scan Lines

((D)) Horizontal Lines

 ((E)) B

((F))

((Q))1_//Polygons are formed by two ____ lines and two Line segments in polygon representation
using trapizoid primitive.

((A)) Vertical

((B)) segmented

((C )) Scan

((D)) Horizontal Lines

((E)) B

((F))

((Q))1_//A region S is ____, if for atleast 2 points x1 and x2 in S, the straight line segment connecting x1
and x2 is not contained entirely in S.

((A)) Concave

((B)) Convex

((C )) Linear

((D)) Polygon with hole

((E)) A

((F))

((Q))1_//A concave polygon is one which is not ___

((A)) Non-Linear

((B)) Linear

((C )) Convex

((D)) None

((E)) C

((F))

((Q))1_//A convex polygon is a polygon such that for any two points inside the polygon, all points on the
line segment connecting them are __________the Polygon
 ((A)) also inside

((B)) outside

((C )) also partially inside

((D)) partially outside

((E)) A

((F))

((Q))1_//A ______ polygon is a polygon such that for any two points inside the polygon, all points on
the line segment connecting them are also inside the Polygon

((A)) Concave

((B)) Convex

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//A convex polygon is a polygon such that for any two points ____ the polygon, all points on the
line segment connecting them are also ____ the Polygon

((A)) inside, outside

((B)) outside, outside

((C )) outside, outside

((D)) inside, inside

((E)) D

((F))

((Q))1_//One of the representation of Polygon is using

((A)) Rectangle Primitive

((B)) Trapizoid Primitive

((C )) Circle Primitive

 ((D)) Square Primitive

((E)) B

((F))

((Q))1_//For Graphics devices who do not support polygon as a whole _____ approach is used to draw
polygon

((A)) Trapizoid

((B)) Lines and Points

((C )) Rectangle

((D)) Lines and circles

((E)) B

((F))

((Q))1_//Polygon can be drawn as series of ______

((A)) Triangles

((B)) Rectangles

((C )) Squares

((D)) Trapizoids

((E)) D

((F))

((Q))1_// Operation code _____ is used to draw a polygon

((A)) 3 or greater

((B)) 3 or lesser

((C )) 2 or greater

((D)) N or lesser

((E)) A

((F))
((Q))1_//The devices which support polygons drawing primitive directly as Polygon shape, save the
polygon as a ____

((A)) Unit

((B)) Drawing

((C )) Rectangle

((D)) Square

((E)) A

((F))

((Q))1_//In one of the polygon representation ,Polygons are formed by two _____and two _____
((A)) Scan lines & Vertical Lines

((B)) Scan lines & Line segments

((C )) Vertical Lines & Line segments

((D)) Horizontal Lines & scan lines

((E)) B

((F))

((Q))1_//Scaling factor Sx in Viewing transformation is given by ____

((A)) (XVmax-XVmin)/(XWmax-XWmin)

((B)) (XWmax-XWmin)/(XVmax-Xvmin)

((C )) (XVmin-Xvmax)/(XWmax-XWmin)

((D)) (XVmin-Xvmax)/(XWmin-XWmax)

((E)) A

((F))

((Q))1_//Scaling factor Sy in Viewing transformation is given by ____

((A)) (YVmax-YVmin)/(YWmax-YWmin)

((B)) (YWmax-YWmin)/(YVmax-Yvmin)

((C )) (YVmin-Xvmax)/(YWmax-XWmin)
 ((D)) (XVmin-Xvmax)/(YWmin-YWmax)

((E)) A

((F))

((Q))1_//Scaling factor Sx in Viewing transformation is given by ____

((A)) Viewport X extent / Window Y extent

((B)) Window X extent / Viewport X extent

((C )) Viewport X extent / Window X extent

((D)) Viewport Y extent / Window X extent

((E)) C

((F))

((Q))1_//Scaling factor Sy in Viewing transformation is given by ____

((A)) Viewport X extent / Window Y extent

((B)) Viewport Y extent / Window Y extent

((C )) Viewport Y extent / Window x extent

((D)) Window Y extent / Viewport Y extent

((E)) B

((F))

((Q))1_//The mapping of the window (modeling coordinates) to viewport (device coordinates) is a 2D

((A)) windowing

((B)) viewing transformation

((C )) Window Transformation

((D)) None

((E)) B

((F))

((Q))1_//The clipping window is mapped into a

((A)) window
 ((B)) clipping window

((C )) world coordinates

((D)) viewport

((E)) D

((F))

((Q))1_//Representation of an object measured in some physical units

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) A

((F))

((Q))1_//Representation of a set of objects, all measured in the same physical units.

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) B

((F))

((Q))1_//The space within the image is displayed

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) C
 ((F))

((Q))1_//The process of going from a window in world coordinates to a viewport in screen coordinates
((A)) windowing

((B)) viewing transformation

((C )) Window Transformation

((D)) None

((E)) B

((F))

((Q))1_//As the window increases in size, the image in the viewport_______ in size in viewing
transformation

((A)) increases

((B)) doubles

((C )) decreases

((D)) remains the same

((E)) C

((F))

((Q))1_//Maintain ______ size and position between clipping window and viewport in viewing
transformation.

((A)) equal

((B)) relative

((C )) non_relative

((D)) non-equal

((E)) B

((F))

((Q))1_//In viewing transformation maintain ______ size and______ between clipping window and
viewport

((A)) equal , position

 ((B)) non-equal, position

((C )) relative, position

((D)) un-equal , position

((E)) C

((F))

((Q))1_//In viewing transformation maintain relative size and ______ between clipping window and
viewport

((A)) window

((B)) viewport

((C )) position

((D)) none

((E)) C

((F))

((Q))1_//Maintain relative ____ and position between clipping window and viewport in viewing
transformation

((A)) viewport

((B)) size

((C )) window

((D)) none

((E)) B

((F))

((Q))1_//An area on a display device to which a window is mapped, defines where it is to be displayed
((A)) viewport

((B)) size

((C )) window

((D)) none

((E)) A
 ((F))

((Q))1_//In viewing transformation maintain relative size an position between clipping window and
viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Xv=

((A)) Xvmin +( Xw+Xwmin )Sx

((B)) Xvmin +( Xw-Xwmin )Sx

((C )) Xvmin -( Xw+Xwmin )Sx

((D)) Xvmin -( Xw-Xwmin )Sx

((E)) B

((F))

((Q))1_//In viewing transformation maintain relative size an position between clipping window and
viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Yv=

((A)) Yvmin +(Yw+Ywmin )Sx

((B)) Yvmin +( Yw-Ywmin )Sy

((C )) Xvmin -( Yw+Ywmin )Sx

((D)) Yvmin -( Yw-Xwmin )Sy

((E)) B

((F))

((Q))1_//In viewing transformation perform _____ transformation that scales the window area to the
size of the view port

((A)) translation

((B)) rotation

((C )) scaling

((D)) shear

((E)) C

((F))

((Q))1_//In viewing transformation perform scaling transformation that scales the _____ area to the size
of the ______
 ((A)) window, viewport

((B)) viewport, window

((C )) window, screen

((D)) screen, viewport

((E)) A

((F))

((Q))1_//In viewing transformation _____the scaled window area to the position of the viewport.
((A)) rotate

((B)) translate

((C )) shear

((D)) scale

((E)) B

((F))

((Q))1_//A window with 6 clipping boundaries can be considered under___ clipping.

((A)) Generalised

((B)) window

((C )) viewport

((D)) none

((E)) A

((F))

((Q))1_//In _____ clipping , cliiping routine can be performed along any line.

((A)) viewport

((B)) window

((C )) Generalised

((D)) none

((E)) C
 ((F))

((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.

((A)) horizontal

((B)) veritical

((C )) arbitrary

((D)) both horizontal & vertical

((E)) C

((F))

((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.

((A)) only horizontal

((B)) only veritical

((C )) arbitrary

((D)) both horizontal & vertical

((E)) C

((F))

((Q))2_//What will be the output set after clipping left and clipping right?

((A)) 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

((B)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((C )) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’

((E)) D

((F))

((Q))2_//What will be the input set for clipping left and clipping right respectively?

((A)) 1 2 3 4 6 7 8 9 10 11 and 1’ 2 3 4 6 7 8 9 10 11 11’

((B)) 1 2 3 4 6 7 8 9 10 11 and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

 ((C )) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (x,y) then remaining neighboring pixels

((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1)

((E)) A

((F))

((Q))2_//What will be input set to clipping top and clipping bottom respectively?

((A)) 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2

((B)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((C )) 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 1’ 2 3 4 6 7 8 9 10 11 11’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2

((E)) A

((F))

((Q))2_//What will be clipped polygon vertices?

((A)) 4’ 4 ‘5’ 6’ 7 7’ 8’ 9 9’ 10’ 11 11’ 1’ 2 3’

((B)) 1’2 3’ 4’4 5’6’ 7 7’8’ 9’ 10’ 11 11’

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))
((Q))2_//What will be the input set for clipping right and for clipping top respectively?

((A)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’

((B)) 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

((C )) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). Whether a point at (5,50) is visible or not?

((A)) Visible

((B)) Partially Visible

((C )) Completely Exterior

((D)) None of the above

((E)) C

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). Whether a point at (75,90) is visible or not?

((A)) Visible

((B)) Partially Visible

((C )) Completely Exterior

((D)) None of the above

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). What is the outcode of point (150,50)?

((A)) 10

((B)) 1000
 ((C )) 100

((D)) 110

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). What is the outcode of point (75,250)?

((A)) 110

((B)) 100

((C )) 0

((D)) 1000

((E)) D

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (75,90). What will be the outcodes associated
with line segment?

((A)) 0110, 0000

((B)) 0001, 0000

((C )) 0000, 0010

((D)) 0000,1000

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). A line has end coordinates as (50,5) and (150,50). What will be the outcodes
associated with line segment?

((A)) 0100 , 0010

((B)) 0001, 0000

((C )) 0000, 0010

 ((D)) 0010, 0110

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). A line has end coordinates as (50,5) and (150,50). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (75,90). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (25,50) and (175,190). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

 ((E)) A

((F))

((Q))2_//A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has
end coordinates (40,15) and (75,45). What will be the end points of clipped line? Use Cohen –
Sutherland Outcode Algorithm.

((A)) (23.67,50) and (69.06,40)

((B)) (50,23.67) and (69.06, 40)

((C )) (50,23.67) and (40,69.06)

((D)) None of Above

((E)) B

((F))

((Q))2_//A clipping window has coordinates as A (50, 10), B (80, 10), C (80, 40), D (50, 40). A line
segment has end coordinates (70, 20) and (100, 10). What will be the end points of clipped line? Use
Cohen – Sutherland Outcode Algorithm.

((A)) (80, 16.66)

((B)) (80, 16.66) and (20, 70)

((C )) (80, 16.66) and (70, 20)

((D)) (16.66, 80) and (70, 20)

((E)) C

((F))

((Q))2_//Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left
corner at (-8, -4) and upper right corner at ( 12,8). What will be the end points of clipped line? Use
Cohen – Sutherland Outcode Algorithm.

((A)) (-8,6) and (2,8)

((B)) (-8,6) and (8,2)

((C )) (6,-8) and (2,8)

((D)) (8,-6) and (8,2)

((E)) A
 ((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (15,150). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) C

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (0,10) and (250,15). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) C

((F))

((Q))2_//A rectangular clipping window whose lower left corner is at (-3,1) and upper right corner is at
(2,6). If line segment has end coordinates (-4,2) and (-1,7). What will the end coordinates of clipped line
(use Cohen – Sutherland Outcode Algorithm)

((A)) (-3, 11/3) and (-8/5, 6)

((B)) (3/11, -3) and ( -5/8, 6)

((C )) (-3, 3/11) and (-8/5,6)

((D)) (-11/3, 3) and (-6, 8/5)

((E)) A

((F))
((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factor Sx =

((A)) 0.25

((B)) 0.125

((C )) 4

((D)) 0.5

((E)) A

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factor Sy =

((A)) 0.25

((B)) 0.125

((C )) 4

((D)) 0.5

((E)) B

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factors Sx =___ & Sy =___

((A)) 0.25 & 0.125

((B)) 0.125 & 0.25

((C )) 4&8

((D)) 0.5 & 1

((E)) A

((F))
((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factor Sx =___

((A)) 0.25

((B)) 0.125

((C )) 0.5

((D)) 4

((E)) A

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factor Sy=___

((A)) 0.25

((B)) 0.125

((C )) 0.5

((D)) 4

((E)) B

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factors Sx =___ & Sy= ___

((A)) 0.25 & 0.5

((B)) 0.25 & 0.125

((C )) 0.5 & 0.25

((D)) 0.125 & 0.25

((E)) B

((F))
((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factors Sx=
((A)) (1/18)

((B)) (1/16)

((C )) 18

((D)) 16

((E)) A

((F))

((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factor Sy=
((A)) (1/18)

((B)) (1/16)

((C )) 18

((D)) 16

((E)) B

((F))

((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factor Sx= & Sy =
___

((A)) 1/18 & 16

((B)) 1/16 & 1/18

((C )) 18 & 1/16

((D)) 1/18 & 1/16

((E)) D

((F))

((Q))2_//In 8 connected region if one pixel is (x,y) then remaining neighboring pixels are
((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)
 ((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1)

((E)) A

((F))

((Q))2_//In 4 connected region if one pixel is (x,y) then remaining neighboring pixels are
((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1)

((E)) D

((F))

((Q))2_//‘Scan-line coherence ‘ means

((A)) If a pixel on a scan line lies within a polygon, pixels near it will most likely lie within the
polygon

((B)) If edge of the polygon intersects a given polygon , pixels near it will most likely lie within
the polygon

((C )) If a pixel on a edge lies within a polygon, pixels near it will most likely lie within the
polygon

((D)) None of above

((E)) A

((F))

((Q))2_//The function of scan line polygon fill algorithm are

((A)) Find intersection point of the boundary of polygon and scan line

((B)) Find intersection point of the boundary of polygon and point

((C )) Both a & b

((D)) None of these

((E)) A
 ((F))

((Q))2_//In scan line algorithm, using Edge coherence property the next incremental x-intersection(xs+1)
can be calculated as: ------------Note: Xs is the previous x-intersection.

((A)) xs+1= xs + m

((B)) xs+1= xs + 1

((C )) xs+1= xs + 1/m

((D)) xs+1= xs + m/2

((E)) C

((F))

((Q))2_//In scan line algorithm, Let an edge is represented by Formula y = mx + b and for scan_line s
value of y = s. What will be the Xs ? Note : Scan line is intersecting with edge at (s,Xs)

((A)) Xs = (s-b)+m

((B)) Xs = (s-b)

((C )) Xs = (s-b)/m

((D)) Xs = (s-b)*m

((E)) C

((F))

((Q))2_//In winding number method if net winding is --------then point is outside otherwise it is inside.
((A)) Odd

((B)) Two

((C )) One

((D)) zero

((E)) D

((F))

((Q))2_//In winding number method if net winding is zero then point is ---------- otherwise it is inside.
((A)) outside

((B)) Inside
 ((C )) colorful

((D)) None of above

((E)) A

((F))

((Q))2_//In winding number method if net winding is non-zero then point is --------.

((A)) outside

((B)) Inside

((C )) colorful

((D)) None of above

((E)) B

((F))

((Q))2_//what will be the intersection points for current scan line as shown in figure using scan line
polygon filling algorithm

((A)) (p0,p1,p2,p3)

((B)) (p0,p1, p1,p2,p3)

((C )) (p0,p1,p2,p3, p3)

((D)) (p0, p3)

((E)) A

((F))

((Q))2_//What will be the intersection points for current scan line as shown in figure using scan line
polygon filling algorithm.

((A)) (p0 ,p0,p1,p1,p2)

((B)) (p0,p1,p2)

((C )) (p0,p2)

((D)) (p0,p1,p1,p2)

((E)) D
 ((F))

((Q))2_//In 4 connected region if one pixel is (2,3) then remaining neighboring pixels are
((A)) (3, 3 ) (1,3) (2,4) (2,2) (1,2) (1, 4) (3,2) (3, 4)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (3, 3 ) (1,3) (2,4) (2,2)

((E)) D

((F))

((Q))2_//In 8 connected region if one pixel is (3,2) then remaining neighboring pixels are
((A)) (2, 2 ) (4,2) (3,3) (3,1) (4,3) (4,1) (2,3) (2, 1)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (2, 2 ) (4,2) (3,3) (3,1)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (2,3) then remaining neighboring pixels are
((A)) (1, 3 ) (3,3) (2,4) (2,2) (3,4) (3,2) (1,4) (1, 2)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (2, 2 ) (4,2) (3,3) (3,1)

((E)) A

((F))

((Q))2_//If one edge of the polygon has end coordinates (10,20) and (15,40) and current scan line is
scanning at y=25. What will be the intersection point?

((A)) (11.2,25)

((B)) (12,25)

((C )) (12.2,25)
 ((D)) (25,11.2)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (5,3) then remaining neighboring pixels are
((A)) (6, 3 ) (4,3) (5,4) (5,2) (6,4) (6,2) (4,4) (4, 2)

((B)) (6, 3 ) (1,1) (2,4) (2,2) (6,2) (1, 4) (3,3) (3, 4)

((C )) (3, 3 ) (6,2) (2,3) (2,2)

((D)) (2, 2 ) (6,2) (6,3) (3,1)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (5,5) then remaining neighboring pixels are
((A)) (2, 2 ) (6,2) (6,3) (3,1)

((B)) (6, 3 ) (1,1) (2,4) (2,2) (6,2) (1, 4) (3,3) (3, 4)

((C )) (3, 3 ) (6,2) (2,3) (2,2)

((D)) (6, 5 ) (4,3) (5,6) (5,4) (6,6) (6,4) (4,6) (4, 4)

((E)) D

((F))

((Q))2_//In 4 connected region if one pixel is (3,3) then remaining neighboring pixels are
((A)) (3, 3 ) (1,3) (2,4) (2,2)

((B)) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (4, 3 ) (2,3) (3,4) (3,2)

((E)) D

((F))

((Q))2_//In 4 connected region if one pixel is (5,5) then remaining neighboring pixels are
((A)) (3, 3 ) (6,3) (2,4) (2,2)

((B)) (2,2) (5, 4) (3,2) (6, 4)

 ((C )) (3, 3 ) (4,2) (2,3) (2,2)

((D)) (6, 5 ) (4,5) (5,4) (5,6)

((E)) D

((F))

((Q))2_//In scan line polygon filling algorithm for current scan line the x-intersections got are
20,10,50,30. How pairing will be formed?

((A)) (10,20)and (30,50)

((B)) (10,20)and (20,30)and (30,50)

((C )) (20,10)and (10,50)

((D)) (20,10)and (10,50)and (50,30)

((E)) A

((F))

((Q))2_//In scan line polygon filling algorithm for current scan line the x-intersections obtained are
20,10,50,30. How these x-intersections are stored in intersection array?

((A)) (10,20,30,50)

((B)) (20,10,50,30)

((C )) (50,30,20,10)

((D)) (10,50,20,30)

((E)) A

((F))

((Q))2_//One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the
ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 12. What will
be the x-value of the intersection point of the scan line in i+1 th step?

((A)) 12.2

((B)) 12.5

((C )) 13

((D)) 13.5
 ((E)) A

((F))

((Q))2_//One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the
ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 14. What will
be the x-value of the intersection point of the scan line in i+1 th step?

((A)) 16.2

((B)) 14.2

((C )) 16.2

((D)) 14.2

((E)) D

((F))

((Q))2_//In winding number method , constructed horizontal line between point Q and point P intersects
two edges of the polygon with winding no. +1 and -1. Tell whether point Q is inside or outside and what
is the net winding ? Note : Q is the point to be tested for inside test.P is point outside the polygon.
((A)) Outside , zero

((B)) Inside , zero

((C )) Outside , nonzero

((D)) Inside , nonzero

((E)) A

((F))

((Q))2_//In winding number method , constructed horizontal line between point Q and point P intersects
edge of the polygon with winding no. +1 . Tell whether point Q is inside or outside and what is the net
winding ? Note : Q is the point to be tested for inside test. P is point outside the polygon.
((A)) Outside , zero

((B)) Inside , zero

((C )) Outside , nonzero

((D)) Inside , nonzero

((E)) D

((F))
((Q))1_//An -------------test is used to check whether a point is inside or outside of the polygon.
((A)) Inside

((B)) Outside

((C )) Fill

((D)) Cover

((E)) A

((F))

((Q))1_//In an inside test if number of intersections are ---------------- then point is inside of the polygon.
Note : intersection point is not a vertex.

((A)) Even

((B)) Odd

((C )) Infinite

((D)) None of the above

((E)) B

((F))

((Q))1_//In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note
: intersection point is not a vertex

((A)) Inside

((B)) Outside

((C )) Color

((D)) Can't Say

((E)) A

((F))

((Q))1_//In an inside test if intersections point is a vertex and edges meeting at that vertex lies on same
side of constructed horizontal line then the number of intersections are considered as --
--------. Note : intersection point is a vertex

((A)) Even Number

 ((B)) Odd Number

((C )) Infinite Number

((D)) Can't Say

((E)) A

((F))

((Q))1_//In an inside test if intersections point is a vertex and edges meeting at that vertex lies on -------
------ side of constructed horizontal line then the number of intersections are
considered as even number . Note : intersection point is a vertex

((A)) Same

((B)) Opposite

((C )) On the

((D)) None of the above

((E)) A

((F))

((Q))1_//Two inside polygon test methods are __________ and ________

((A)) Even odd method , winding number method

((B)) Scan line and flood fill

((C )) Even odd method, flood fill

((D)) winding number method, Scan line

((E)) A

((F))

((Q))1_//The 8-Fill Polygon technique will correctly fill the triangle shown below when seeded at the
position shown with an X.

((A)) TRUE

((B)) FALSE

((C ))

((D))
 ((E)) B

((F))

((Q))1_//Following is the method for inside test of the polygon.

((A)) Even-odd method

((B)) Linear method

((C )) Inside method

((D)) Seed method

((E)) A

((F))

((Q))1_//Every side in winding number method has given a number called

((A)) Winding Number

((B)) Integer no.

((C )) Direct number

((D)) Side Number

((E)) A

((F))

((Q))1_//The total of the winding no. in winding number method of inside test is called as
((A)) winding.

((B)) collective winding.

((C )) net winding.

-((D)) summation winding.

((E)) C

((F))

((Q))1_//Winding number method always gives correct answer for overlapping polygons

((A)) TRUE

((B)) FALSE
 ((C ))

((D))

((E)) B

((F))

((Q))1_//Inside tests of polygon are useful in --------

((A)) Polygon filling

((B)) Line coloring

((C )) Shadowing

((D)) None of the above

((E)) A

((F))

((Q))1_//Even-odd method of inside test counts ----- to decide the position of a point.

((A)) Edges

((B)) Vertices

((C )) Intersections

((D)) Pixels

((E)) C

((F))

((Q))1_//In winding number method an ------------------ edges ------ considered

((A)) Horizontal , not

((B)) Vertical , not

((C )) Slanted , not

((D)) Horizontal , is

((E)) A

((F))
((Q))1_//Even-odd method of inside test is suitable for------

((A)) Polygons

((B)) Circles

((C )) Lines

((D)) All of above

((E)) A

((F))

((Q))1_//In winding number method an edge can have winding number as -----

((A)) Zero

((B)) +1 or -1

((C )) Only +1

((D)) Only -1

((E)) B

((F))

((Q))1_//If the pixel is already filled with desired color then does nothing, otherwise fills it. This is called
((A)) Flood fill algorithm

((B)) Boundary fill algorithm

((C )) Scan line polygon filling algorithm

((D)) None of these

((E)) B

((F))

((Q))1_//The algorithm used for filling the interior of a polygon is called

((A)) Flood fill algorithm

((B)) Boundary fill algorithm

((C )) Scan line polygon fill algorithm

((D)) None of these

 ((E)) A

((F))

((Q))1_//___________ procedure accepts the coordinates of an internal point.

((A)) Area fill

((B)) Boundary fill.

((C )) Line fill.

((D)) Scan fill.

((E)) B

((F))

((Q))1_//In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring
pixels.

((A)) 8

((B)) 4

((C )) 2

((D)) 16

((E)) A

((F))

((Q))1_//Following statement(s) is/are true about flood fill algorithm

((A)) It need a seed pixel

((B)) It works at pixel level

((C )) Requires more memory

((D)) All of above

((E)) D

((F))

((Q))1_//Following statement(s) is/are false about flood fill algorithm

((A)) It doesn’t need a seed pixel

 ((B)) It works at pixel level

((C )) Requires more memory

((D)) All of above

((E)) A

((F))

((Q))1_//Seed pixel in flood fill Algorithm is an

((A)) An interior pixel

((B)) Exterior pixel

((C )) Not a pixel

((D)) It is color of pixel

((E)) A

((F))

((Q))1_//In Boundary Fill method ____________ Data Structure is used.

((A)) Stack

((B)) Array

((C )) Heap

((D)) None of above

((E)) A

((F))

((Q))1_//The 4-connected Polygon filling technique has disadvantage(s) as

((A)) Requires more memory

((B)) May fill polygon partially

((C )) Stack overflow

((D)) All of above

((E)) D
 ((F))

((Q))1_//In --------------algorithm edges can be specified in different color.

((A)) Flood fill

((B)) Boundary fill

((C )) DDA fill

((D)) BSA fill

((E)) A

((F))

((Q))1_//The process of coloring the area of a polygon is called

((A)) Polygon filling

((B)) Polygon flow

((C )) Aliasing

((D)) None of these

((E)) A

((F))

((Q))1_//Boundary fill algorithm uses -------- call to the fill function.

((A)) Recursive

((B)) Static

((C )) One

((D)) None of these

((E)) A

((F))

((Q))1_//Boundary fill algorithm needs–

((A)) Boundary Color (BC) and (x,y) coordinates of seed point.

((B)) Fill Color (FC) and (x,y) coordinates of seed point.

 ((C )) Boundary Color (BC), Fill Color (FC) and (x,y) coordinates of seed point.

((D)) (x,y) coordinates of seed point.

((E)) C

((F))

((Q))1_//Which polygon fill algorithm needs following information - 1.Boundary Color (BC), 2. Fill Color
(FC) and 3. (x,y) coordinates of seed point.

((A)) Boundary fill

((B)) Region fill

((C )) Scan fill

((D)) DDA fill

((E)) A

((F))

((Q))1_//Which polygon fill algorithm needs following information - 1. Region Color (RC), 2. Fill Color (FC)
and 3. (x,y) coordinates of seed point.

((A)) Flood Fill

((B)) Region fill

((C )) Scan fill

((D)) DDA fill

((E)) A

((F))

((Q))1_//Horizontal lines are not considered in scan line fill algorithm.

((A)) TRUE

((B)) FALSE

((C ))

((D))

((E)) A
 ((F))

((Q))1_//Scan line fill algorithm is more efficient than flood fill algorithm.

((A)) TRUE

((B)) FALSE

((C ))

((D))

((E)) A

((F))

((Q))1_//Which statement is true about the 4 connected region.

((A)) It is faster than 8 connected region

((B)) Sometimes it leaves region unfilled.

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))

((Q))1_//Seed pixel in flood fill Algorithm is an

((A)) An interior pixel

((B)) Exterior pixel

((C )) Not a pixel

((D)) It is color of pixel

((E)) A

((F))

((Q))1_//The function of scan line polygon fill algorithm are :

((A)) Find intersection point of the boundary of polygon and scan line

((B)) Find intersection point of the boundary of polygon and point

 ((C )) Both A and B

((D)) Neither A or B

((E)) A

((F))

((Q))1_//The edge table contains pointers back to the ______________ to identify vertices for each
polygon edge.

((A)) vertex table.

((B)) polygon table.

((C )) edge table.

((D)) expanded vertex table.

((E)) A

((F))

((Q))1_//Scan line polygon filling method uses

((A)) Scan-line coherence

((B)) Edge coherence

((C )) Area coherence

((D)) Both A and B

((E)) D

((F))

((Q))1_//Scan-line coherence property is used in

((A)) Line drawing algorithm

((B)) Scan line polygon filling algorithm

((C )) Flood fill polygon filling algorithm

((D)) None of above

((E)) B

((F))
((Q))1_//Which of the following is true about scan line algorithm?

((A)) It need a seed pixel

((B)) It works at pixel level

((C )) It uses scan lines to fill the polygon

((D)) All of above

((E)) C

((F))

((Q))1_//In scan line algorithm the intersection points are

((A)) sorted in ascending order

((B)) sorted in descending order

((C )) not sorted

((D)) Deleted

((E)) A

((F))

((Q))1_//Which of the following algorithms to fill polygons was the one used by real rasterizers?
((A)) Flood-Fill Polygons

((B)) Scan-Line Polygon

((C )) Boundary Fill Polygons

((D)) None of above

((E)) B

((F))

((Q))1_//Active edge table is used in following algorithm

((A)) Boundary fill

((B)) Region fill

((C )) Scan Line

((D)) Edge Fill

 ((E)) C

((F))

((Q))1_//Scan line polygon filling algorithm uses series of ……………. To fill the polygon.

((A)) Scan lines

((B)) Points

((C )) Layers

((D)) None of above

((E)) A

((F))

((Q))1_//In scan line algorithm, Scan lines are processed in increasing (upward) / decreasing (downward)
--------------------------.

((A)) Y order

((B)) X order

((C )) Pixel order

((D)) Color order

((E)) A

((F))

((Q))1_//When the current scan line in Scan line polygon fill algorithm moves above the upper / below
the lower endpoint, the edge

((A)) becomes inactive

((B)) becomes active

((C )) is discarded

((D)) is added.

((E)) A

((F))

((Q))1_//The edges crossed by current scan line in Scan line polygon fill algorithm are called as
((A)) Active edges
 ((B)) Inactive edges

((C )) Marked edges

((D)) None of these

((E)) A

((F))

((Q))1_//Scan line Fill Approach works at the

((A)) color level

((B)) edge level

((C )) polygon level

((D)) Pixel Level

((E)) C

((F))

((Q))1_//Following are the data structures used in Scan line algorithm to increase the efficiency.
((A)) Active Edge list

((B)) Active Edge Table

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))

((Q))1_//Scan line polygon filling algorithm starts from

((A)) Either ymax or ymin

((B)) Either xmax or xmin

((C )) Only xmax

((D)) Only xmin

((E)) A

((F))
((Q))1_//Scan line polygon filling algorithm can be used for filling Convex polygon.

((A)) TRUE

((B)) FALSE

((C )) Cant Say

((D)) None of these

((E)) A

((F))

((Q))1_//Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111

((A)) TRUE

((B)) FALSE

((C )) Cant Say

((D)) None of these

((E)) A

((F))

((Q))1_//Which one is not valid out code to perform trivial accept / reject test in line clipping
((A)) 1101

((B)) 1001

((C )) 101

((D)) 1000

((E)) A

((F))

((Q))1_//Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the
other line clipping algorithms?

((A)) Need to perform trivial accept / Reject test on end points of the line.

((B)) Need to perform trivial accept / Reject test for every point on the line.

((C )) Cannot say

((D)) None of these

 ((E)) B

((F))

((Q))1_//If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y
coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be
inside the clipping rectangle

((A)) Xmin > X < Xmax and Ymin > Y < Ymax

((B)) Xmin > X > Xmax and Ymin > Y > Ymax

((C )) Xmin < X < Xmax and Ymin < Y < Ymax

((D)) Xmin < X > Xmax and Ymin < Y > Ymax

((E)) C

((F))

((Q))1_//determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying
the rules

((A)) P1:Clipped away, P2: Clipped away, P3:Clipped Away

((B)) P1: Visible, P2:Visible, P3:Clipped Away

((C )) P1: Visible, P2:Visible, P3: Visible

((D)) P1: Clipped away, P2:Visible, P3:Clipped Away

((E)) D

((F))

((Q))1_//Outcode / Region Code used in Line Clipping is of size ____ bits.

((A)) 4

((B)) 3

((C )) 2

((D)) 1

((E)) A

((F))
((Q))1_//In Line Clipping algorithm, the two dimensional space is divided into ___ regions.
((A)) 6

((B)) 7

((C )) 9

((D)) 10

((E)) C

((F))

((Q))1_//Is 0011 valid region code / outcode used in Line Clipping algorithm?

((A)) yes

((B)) no

((C )) Cannot say

((D)) None of these

((E)) B

((F))

((Q))1_//Cohen – Sutherland line clipping algorithm was developed in ____

((A)) 1967

((B)) 1968

((C )) 1969

((D)) 1965

((E)) A

((F))

((Q))1_//Primitive types of clipping algorithms are

((A)) Point Clipping

((B)) Line Clipping

((C )) Polygon Clipping

((D)) All of above

 ((E)) D

((F))

((Q))1_//In ________ operation eliminates objects or portions of objects that are not visible through the
window to ensure the proper construction of corresponding image

((A)) Clipping

((B)) Windowing

((C )) Viewing

((D)) Transformation

((E)) A

((F))

((Q))1_//The region against which an object is clipped is called as ____________

((A)) Clip window

((B)) Clip rectangle

((C )) Window

((D)) None of these

((E)) A

((F))

((Q))1_//Cohen – Sutherland Line Clipping Algorithm is also called as ____________________

((A)) Sutherland - Hodgman Algorithm

((B)) Cohen - Sutherland Outcode Algorithm

((C )) Cyrus - Beck Algorithm

((D)) None of Above

((E)) B

((F))
((Q))1_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). What is the outcode of point (150,50)?

((A)) 110

((B)) 100

((C )) 0

((D)) 1000

((E)) C

((F))

((Q))1_//The selection and separation of a part of text or image for further operation are called
((A)) Translation

((B)) Shearing

((C )) Reflection

((D)) Clipping

((E)) D

((F))

((Q))1_//The complex graphics operations are

((A)) Selection

((B)) clipping

((C )) shear

((D)) None of these

((E)) B

((F))

((Q))1_//The process of extracting a portion of a database or a picture inside or outside a specified

region are called

((A)) Translation

((B)) Shearing

((C )) Reflection
 ((D)) Clipping

((E)) D

((F))

((Q))1_//The rectangle space in which the world definition of region is displayed are called
((A)) Screen coordinate system

((B)) Clipping window or world window

((C )) World coordinate system

((D)) None of these

((E)) B

((F))

((Q))1_//............. identifies the picture portions that are exterior to the clip window

((A)) Interior clipping

((B)) Exterior clipping

((C )) Extraction

((D)) None of these

((E)) B

((F))

((Q))1_//The region code of a point within the window is ............

((A)) 1111

((B)) 0

((C )) 1000

((D)) 1001

((E)) B

((F))

((Q))1_//According to Cohen-Sutherland algorithm, a line is completely outside the window if ............

((A)) The region codes of line endpoints have a '1' in same bit position.
 ((B)) The endpoints region code are nonzero values

((C )) If L bit and R bit are nonzero.

((D)) The region codes of line endpoints have a '0' in same bit position.

((E)) A

((F))

((Q))1_//The region code of a point is 1001. The point is in the ................. region of window.
((A)) Top Left

((B)) Top right

((C )) bottom left

((D)) bottom right

((E)) A

((F))

((Q))1_//The result of logical AND operation with endpoint region codes is a nonzero value. Which of the
following statement is true?

((A)) The line is completely inside the window

((B)) The line is completely outside the window

((C )) The line is partially inside the window

((D)) The line is already clipped

((E)) B

((F))

((Q))1_//The left (L bit ) bit of the region code of a point (X,Y) is '1' if ......................

((A)) X > XWMIN

((B)) X< XWMIN

((C )) X< XWMAX

((D)) X>XWMAX

((E)) B
 ((F))

((Q))1_//The right bit (R bit)of the region code of a point (X,Y) is '1' if ......................

((A)) X > XWMIN

((B)) X< XWMIN

((C )) X< XWMAX

((D)) X>XWMAX

((E)) D

((F))

((Q))1_//The Most Significant Bit of the region code of a point (X,Y) is '1' if ......................

((A)) Y >YWMIN

((B)) Y< YWMIN

((C )) Y< YWMAX

((D)) Y>YWMAX

((E)) D

((F))

((Q))1_//The bottom bit of the region code of a point is '0' if .......................

((A)) Y >YWMIN

((B)) Y< YWMIN

((C )) Y< YWMAX

((D)) Y>YWMAX

((E)) D

((F))

((Q))1_//The ...................... algorithm divides a 2D space into 9 regions, of which only the middle part
(viewport) is visible.

((A)) Cohen-Sutherland

((B)) Liang Barsky

 ((C )) Sutherland Hodegeman

((D)) None of these

((E)) A

((F))

((Q))1_//Sutherland Hodgeman algorithm works well for...........

((A)) Concave polygons

((B)) Convex Polygons

((C )) Smooth Curves

((D)) Line Segments

((E)) B

((F))

((Q))1_//A line with endpoints codes as 0000 and 0100 is ?

((A)) Partially invisible

((B)) Completely visible

((C )) Completely invisible

((D)) Trivially invisible

((E)) A

((F))

((Q))1_//In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the
?

((A)) codes of the end point are same

((B)) logical OR of the end points code is 0000

((C )) logical AND of the end point code is 0000

((D)) Only A

((E)) D

((F))
((Q))1_//Sutherland – Hodgman algorithm is used for _______________.

((A)) Line Clipping

((B)) Polygon Clipping

((C )) Point Clipping

((D)) Hybrid Clipping

((E)) B

((F))

((Q))1_//Which polygon clipping algorithm executed by clipping all polygon edges against the viewing
screen edges one viewing screen edge at a time?

((A)) Cohen-Sutherland

((B)) Sutherland Hodgman

((C )) Both A and B

((D)) Neither A or B

((E)) B

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside
the window and S ( Previous point) lies outside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) B

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside
the window and S ( Previous point) lies outside the window. Then while processing through that window
boundary we should
 ((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store Nothing

((E)) D

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside
the window and S ( Previous point) lies inside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) A

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside
the window and S ( Previous point) lies inside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) C

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is
used as

((A)) Left -> Right -> Top -> Bottom

 ((B)) Left -> Bottom -> Right -> Top

((C )) Right -> Top -> Left -> Bottom

((D)) Left -> Bottom -> Top -> Right

((E)) A

((F))

((Q))1_//Polygon-Clipping algorithms include the:

((A)) Sutherland-Hodgeman method

((B)) Liang-Barsky method

((C )) Weiler-Atherton method

((D)) All of above

((E)) D

((F))

((Q))1_//_______ is a ordered list of vertices where each vertex connected with the next in the list.
((A)) Line

((B)) Polygon

((C )) Parabola

((D)) None of the above

((E)) B

((F))

((Q))1_//Types of polygon :

((A)) Concave

((B)) Convex

((C )) Complex

((D)) All of above

((E)) D

((F))
((Q))1_//Concave and Convex are types of _______

((A)) Circle

((B)) Rectangle

((C )) Polygon

((D)) Ellipse

((E)) C

((F))

((Q))1_//In convex Polygon all interior angles are

((A)) Less than 90

((B)) Less than 180

((C )) greater than 180

((D)) greater than 90

((E)) B

((F))

((Q))1_//In concave Polygon atleast one interior angle is

((A)) Less than 90

((B)) Less than 180

((C )) greater than 180

((D)) greater than 90

((E)) C

((F))

((Q))1_//A region S is ____ , iff for any x1 and x2 in S, the straight line segment connecting x1 and x2 is
also contained in S.

((A)) Concave

((B)) Convex

((C )) Self-intersecting
 ((D)) Polygon with hole

((E)) B

((F))

((Q))1_//_____ may not always be Convex .

((A)) Paralleogram

((B)) Trapizoid

((C )) Polygon

((D)) Triangle

((E)) C

((F))

((Q))1_//__________ is represented as a number of line segments connected end to end to form a

closed figure.

((A)) Circle

((B)) Line

((C )) Polygon

((D)) point

((E)) C

((F))

((Q))1_//___________ is not a Type of polygon

((A)) Concave

((B)) Convex

((C )) Linear

((D)) Complex

((E)) C

((F))

((Q))1_//Right angled Triangle is an example of ____ Polygon

 ((A)) Concave

((B)) Convex

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//Square is an example of ____ Polygon

((A)) Convex

((B)) Concave

((C )) Complex

((D)) Linear

((E)) A

((F))

((Q))1_//An M shaped closed figure is an example of ____ Polygon

((A)) Convex

((B)) Concave

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//Polygons are formed by two scan lines and two _____ in polygon representation using
trapizoid primitive.

((A)) Vertical Lines

((B)) Line segments

((C )) Scan Lines

((D)) Horizontal Lines

 ((E)) B

((F))

((Q))1_//Polygons are formed by two ____ lines and two Line segments in polygon representation
using trapizoid primitive.

((A)) Vertical

((B)) segmented

((C )) Scan

((D)) Horizontal Lines

((E)) B

((F))

((Q))1_//A region S is ____, if for atleast 2 points x1 and x2 in S, the straight line segment connecting x1
and x2 is not contained entirely in S.

((A)) Concave

((B)) Convex

((C )) Linear

((D)) Polygon with hole

((E)) A

((F))

((Q))1_//A concave polygon is one which is not ___

((A)) Non-Linear

((B)) Linear

((C )) Convex

((D)) None

((E)) C

((F))

((Q))1_//A convex polygon is a polygon such that for any two points inside the polygon, all points on the
line segment connecting them are __________the Polygon
 ((A)) also inside

((B)) outside

((C )) also partially inside

((D)) partially outside

((E)) A

((F))

((Q))1_//A ______ polygon is a polygon such that for any two points inside the polygon, all points on
the line segment connecting them are also inside the Polygon

((A)) Concave

((B)) Convex

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//A convex polygon is a polygon such that for any two points ____ the polygon, all points on the
line segment connecting them are also ____ the Polygon

((A)) inside, outside

((B)) outside, outside

((C )) outside, outside

((D)) inside, inside

((E)) D

((F))

((Q))1_//One of the representation of Polygon is using

((A)) Rectangle Primitive

((B)) Trapizoid Primitive

((C )) Circle Primitive

 ((D)) Square Primitive

((E)) B

((F))

((Q))1_//For Graphics devices who do not support polygon as a whole _____ approach is used to draw
polygon

((A)) Trapizoid

((B)) Lines and Points

((C )) Rectangle

((D)) Lines and circles

((E)) B

((F))

((Q))1_//Polygon can be drawn as series of ______

((A)) Triangles

((B)) Rectangles

((C )) Squares

((D)) Trapizoids

((E)) D

((F))

((Q))1_// Operation code _____ is used to draw a polygon

((A)) 3 or greater

((B)) 3 or lesser

((C )) 2 or greater

((D)) N or lesser

((E)) A

((F))
((Q))1_//The devices which support polygons drawing primitive directly as Polygon shape, save the
polygon as a ____

((A)) Unit

((B)) Drawing

((C )) Rectangle

((D)) Square

((E)) A

((F))

((Q))1_//In one of the polygon representation ,Polygons are formed by two _____and two _____
((A)) Scan lines & Vertical Lines

((B)) Scan lines & Line segments

((C )) Vertical Lines & Line segments

((D)) Horizontal Lines & scan lines

((E)) B

((F))

((Q))1_//Scaling factor Sx in Viewing transformation is given by ____

((A)) (XVmax-XVmin)/(XWmax-XWmin)

((B)) (XWmax-XWmin)/(XVmax-Xvmin)

((C )) (XVmin-Xvmax)/(XWmax-XWmin)

((D)) (XVmin-Xvmax)/(XWmin-XWmax)

((E)) A

((F))

((Q))1_//Scaling factor Sy in Viewing transformation is given by ____

((A)) (YVmax-YVmin)/(YWmax-YWmin)

((B)) (YWmax-YWmin)/(YVmax-Yvmin)

((C )) (YVmin-Xvmax)/(YWmax-XWmin)
 ((D)) (XVmin-Xvmax)/(YWmin-YWmax)

((E)) A

((F))

((Q))1_//Scaling factor Sx in Viewing transformation is given by ____

((A)) Viewport X extent / Window Y extent

((B)) Window X extent / Viewport X extent

((C )) Viewport X extent / Window X extent

((D)) Viewport Y extent / Window X extent

((E)) C

((F))

((Q))1_//Scaling factor Sy in Viewing transformation is given by ____

((A)) Viewport X extent / Window Y extent

((B)) Viewport Y extent / Window Y extent

((C )) Viewport Y extent / Window x extent

((D)) Window Y extent / Viewport Y extent

((E)) B

((F))

((Q))1_//The mapping of the window (modeling coordinates) to viewport (device coordinates) is a 2D

((A)) windowing

((B)) viewing transformation

((C )) Window Transformation

((D)) None

((E)) B

((F))

((Q))1_//The clipping window is mapped into a

((A)) window
 ((B)) clipping window

((C )) world coordinates

((D)) viewport

((E)) D

((F))

((Q))1_//Representation of an object measured in some physical units

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) A

((F))

((Q))1_//Representation of a set of objects, all measured in the same physical units.

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) B

((F))

((Q))1_//The space within the image is displayed

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) C
 ((F))

((Q))1_//The process of going from a window in world coordinates to a viewport in screen coordinates
((A)) windowing

((B)) viewing transformation

((C )) Window Transformation

((D)) None

((E)) B

((F))

((Q))1_//As the window increases in size, the image in the viewport_______ in size in viewing
transformation

((A)) increases

((B)) doubles

((C )) decreases

((D)) remains the same

((E)) C

((F))

((Q))1_//Maintain ______ size and position between clipping window and viewport in viewing
transformation.

((A)) equal

((B)) relative

((C )) non_relative

((D)) non-equal

((E)) B

((F))

((Q))1_//In viewing transformation maintain ______ size and______ between clipping window and
viewport

((A)) equal , position

 ((B)) non-equal, position

((C )) relative, position

((D)) un-equal , position

((E)) C

((F))

((Q))1_//In viewing transformation maintain relative size and ______ between clipping window and
viewport

((A)) window

((B)) viewport

((C )) position

((D)) none

((E)) C

((F))

((Q))1_//Maintain relative ____ and position between clipping window and viewport in viewing
transformation

((A)) viewport

((B)) size

((C )) window

((D)) none

((E)) B

((F))

((Q))1_//An area on a display device to which a window is mapped, defines where it is to be displayed
((A)) viewport

((B)) size

((C )) window

((D)) none

((E)) A
 ((F))

((Q))1_//In viewing transformation maintain relative size an position between clipping window and
viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Xv=

((A)) Xvmin +( Xw+Xwmin )Sx

((B)) Xvmin +( Xw-Xwmin )Sx

((C )) Xvmin -( Xw+Xwmin )Sx

((D)) Xvmin -( Xw-Xwmin )Sx

((E)) B

((F))

((Q))1_//In viewing transformation maintain relative size an position between clipping window and
viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Yv=

((A)) Yvmin +(Yw+Ywmin )Sx

((B)) Yvmin +( Yw-Ywmin )Sy

((C )) Xvmin -( Yw+Ywmin )Sx

((D)) Yvmin -( Yw-Xwmin )Sy

((E)) B

((F))

((Q))1_//In viewing transformation perform _____ transformation that scales the window area to the
size of the view port

((A)) translation

((B)) rotation

((C )) scaling

((D)) shear

((E)) C

((F))

((Q))1_//In viewing transformation perform scaling transformation that scales the _____ area to the size
of the ______
 ((A)) window, viewport

((B)) viewport, window

((C )) window, screen

((D)) screen, viewport

((E)) A

((F))

((Q))1_//In viewing transformation _____the scaled window area to the position of the viewport.
((A)) rotate

((B)) translate

((C )) shear

((D)) scale

((E)) B

((F))

((Q))1_//A window with 6 clipping boundaries can be considered under___ clipping.

((A)) Generalised

((B)) window

((C )) viewport

((D)) none

((E)) A

((F))

((Q))1_//In _____ clipping , cliiping routine can be performed along any line.

((A)) viewport

((B)) window

((C )) Generalised

((D)) none

((E)) C
 ((F))

((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.

((A)) horizontal

((B)) veritical

((C )) arbitrary

((D)) both horizontal & vertical

((E)) C

((F))

((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.

((A)) only horizontal

((B)) only veritical

((C )) arbitrary

((D)) both horizontal & vertical

((E)) C

((F))

((Q))2_//What will be the output set after clipping left and clipping right?

((A)) 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

((B)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((C )) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’

((E)) D

((F))

((Q))2_//What will be the input set for clipping left and clipping right respectively?

((A)) 1 2 3 4 6 7 8 9 10 11 and 1’ 2 3 4 6 7 8 9 10 11 11’

((B)) 1 2 3 4 6 7 8 9 10 11 and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

 ((C )) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (x,y) then remaining neighboring pixels

((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1)

((E)) A

((F))

((Q))2_//What will be input set to clipping top and clipping bottom respectively?

((A)) 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2

((B)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((C )) 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 1’ 2 3 4 6 7 8 9 10 11 11’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2

((E)) A

((F))

((Q))2_//What will be clipped polygon vertices?

((A)) 4’ 4 ‘5’ 6’ 7 7’ 8’ 9 9’ 10’ 11 11’ 1’ 2 3’

((B)) 1’2 3’ 4’4 5’6’ 7 7’8’ 9’ 10’ 11 11’

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))
((Q))2_//What will be the input set for clipping right and for clipping top respectively?

((A)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’

((B)) 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

((C )) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). Whether a point at (5,50) is visible or not?

((A)) Visible

((B)) Partially Visible

((C )) Completely Exterior

((D)) None of the above

((E)) C

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). Whether a point at (75,90) is visible or not?

((A)) Visible

((B)) Partially Visible

((C )) Completely Exterior

((D)) None of the above

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). What is the outcode of point (150,50)?

((A)) 10

((B)) 1000
 ((C )) 100

((D)) 110

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). What is the outcode of point (75,250)?

((A)) 110

((B)) 100

((C )) 0

((D)) 1000

((E)) D

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (75,90). What will be the outcodes associated
with line segment?

((A)) 0110, 0000

((B)) 0001, 0000

((C )) 0000, 0010

((D)) 0000,1000

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). A line has end coordinates as (50,5) and (150,50). What will be the outcodes
associated with line segment?

((A)) 0100 , 0010

((B)) 0001, 0000

((C )) 0000, 0010

 ((D)) 0010, 0110

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). A line has end coordinates as (50,5) and (150,50). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (75,90). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (25,50) and (175,190). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

 ((E)) A

((F))

((Q))2_//A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has
end coordinates (40,15) and (75,45). What will be the end points of clipped line? Use Cohen –
Sutherland Outcode Algorithm.

((A)) (23.67,50) and (69.06,40)

((B)) (50,23.67) and (69.06, 40)

((C )) (50,23.67) and (40,69.06)

((D)) None of Above

((E)) B

((F))

((Q))2_//A clipping window has coordinates as A (50, 10), B (80, 10), C (80, 40), D (50, 40). A line
segment has end coordinates (70, 20) and (100, 10). What will be the end points of clipped line? Use
Cohen – Sutherland Outcode Algorithm.

((A)) (80, 16.66)

((B)) (80, 16.66) and (20, 70)

((C )) (80, 16.66) and (70, 20)

((D)) (16.66, 80) and (70, 20)

((E)) C

((F))

((Q))2_//Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left
corner at (-8, -4) and upper right corner at ( 12,8). What will be the end points of clipped line? Use
Cohen – Sutherland Outcode Algorithm.

((A)) (-8,6) and (2,8)

((B)) (-8,6) and (8,2)

((C )) (6,-8) and (2,8)

((D)) (8,-6) and (8,2)

((E)) A
 ((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (15,150). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) C

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (0,10) and (250,15). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) C

((F))

((Q))2_//A rectangular clipping window whose lower left corner is at (-3,1) and upper right corner is at
(2,6). If line segment has end coordinates (-4,2) and (-1,7). What will the end coordinates of clipped line
(use Cohen – Sutherland Outcode Algorithm)

((A)) (-3, 11/3) and (-8/5, 6)

((B)) (3/11, -3) and ( -5/8, 6)

((C )) (-3, 3/11) and (-8/5,6)

((D)) (-11/3, 3) and (-6, 8/5)

((E)) A

((F))
((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factor Sx =

((A)) 0.25

((B)) 0.125

((C )) 4

((D)) 0.5

((E)) A

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factor Sy =

((A)) 0.25

((B)) 0.125

((C )) 4

((D)) 0.5

((E)) B

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factors Sx =___ & Sy =___

((A)) 0.25 & 0.125

((B)) 0.125 & 0.25

((C )) 4&8

((D)) 0.5 & 1

((E)) A

((F))
((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factor Sx =___

((A)) 0.25

((B)) 0.125

((C )) 0.5

((D)) 4

((E)) A

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factor Sy=___

((A)) 0.25

((B)) 0.125

((C )) 0.5

((D)) 4

((E)) B

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factors Sx =___ & Sy= ___

((A)) 0.25 & 0.5

((B)) 0.25 & 0.125

((C )) 0.5 & 0.25

((D)) 0.125 & 0.25

((E)) B

((F))
((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factors Sx=
((A)) (1/18)

((B)) (1/16)

((C )) 18

((D)) 16

((E)) A

((F))

((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factor Sy=
((A)) (1/18)

((B)) (1/16)

((C )) 18

((D)) 16

((E)) B

((F))

((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factor Sx= & Sy =
___

((A)) 1/18 & 16

((B)) 1/16 & 1/18

((C )) 18 & 1/16

((D)) 1/18 & 1/16

((E)) D

((F))

((Q))2_//In 8 connected region if one pixel is (x,y) then remaining neighboring pixels are
((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)
 ((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1)

((E)) A

((F))

((Q))2_//In 4 connected region if one pixel is (x,y) then remaining neighboring pixels are
((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1)

((E)) D

((F))

((Q))2_//‘Scan-line coherence ‘ means

((A)) If a pixel on a scan line lies within a polygon, pixels near it will most likely lie within the
polygon

((B)) If edge of the polygon intersects a given polygon , pixels near it will most likely lie within
the polygon

((C )) If a pixel on a edge lies within a polygon, pixels near it will most likely lie within the
polygon

((D)) None of above

((E)) A

((F))

((Q))2_//The function of scan line polygon fill algorithm are

((A)) Find intersection point of the boundary of polygon and scan line

((B)) Find intersection point of the boundary of polygon and point

((C )) Both a & b

((D)) None of these

((E)) A
 ((F))

((Q))2_//In scan line algorithm, using Edge coherence property the next incremental x-intersection(xs+1)
can be calculated as: ------------Note: Xs is the previous x-intersection.

((A)) xs+1= xs + m

((B)) xs+1= xs + 1

((C )) xs+1= xs + 1/m

((D)) xs+1= xs + m/2

((E)) C

((F))

((Q))2_//In scan line algorithm, Let an edge is represented by Formula y = mx + b and for scan_line s
value of y = s. What will be the Xs ? Note : Scan line is intersecting with edge at (s,Xs)

((A)) Xs = (s-b)+m

((B)) Xs = (s-b)

((C )) Xs = (s-b)/m

((D)) Xs = (s-b)*m

((E)) C

((F))

((Q))2_//In winding number method if net winding is --------then point is outside otherwise it is inside.
((A)) Odd

((B)) Two

((C )) One

((D)) zero

((E)) D

((F))

((Q))2_//In winding number method if net winding is zero then point is ---------- otherwise it is inside.
((A)) outside

((B)) Inside
 ((C )) colorful

((D)) None of above

((E)) A

((F))

((Q))2_//In winding number method if net winding is non-zero then point is --------.

((A)) outside

((B)) Inside

((C )) colorful

((D)) None of above

((E)) B

((F))

((Q))2_//what will be the intersection points for current scan line as shown in figure using scan line
polygon filling algorithm

((A)) (p0,p1,p2,p3)

((B)) (p0,p1, p1,p2,p3)

((C )) (p0,p1,p2,p3, p3)

((D)) (p0, p3)

((E)) A

((F))

((Q))2_//What will be the intersection points for current scan line as shown in figure using scan line
polygon filling algorithm.

((A)) (p0 ,p0,p1,p1,p2)

((B)) (p0,p1,p2)

((C )) (p0,p2)

((D)) (p0,p1,p1,p2)

((E)) D
 ((F))

((Q))2_//In 4 connected region if one pixel is (2,3) then remaining neighboring pixels are
((A)) (3, 3 ) (1,3) (2,4) (2,2) (1,2) (1, 4) (3,2) (3, 4)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (3, 3 ) (1,3) (2,4) (2,2)

((E)) D

((F))

((Q))2_//In 8 connected region if one pixel is (3,2) then remaining neighboring pixels are
((A)) (2, 2 ) (4,2) (3,3) (3,1) (4,3) (4,1) (2,3) (2, 1)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (2, 2 ) (4,2) (3,3) (3,1)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (2,3) then remaining neighboring pixels are
((A)) (1, 3 ) (3,3) (2,4) (2,2) (3,4) (3,2) (1,4) (1, 2)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (2, 2 ) (4,2) (3,3) (3,1)

((E)) A

((F))

((Q))2_//If one edge of the polygon has end coordinates (10,20) and (15,40) and current scan line is
scanning at y=25. What will be the intersection point?

((A)) (11.2,25)

((B)) (12,25)

((C )) (12.2,25)
 ((D)) (25,11.2)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (5,3) then remaining neighboring pixels are
((A)) (6, 3 ) (4,3) (5,4) (5,2) (6,4) (6,2) (4,4) (4, 2)

((B)) (6, 3 ) (1,1) (2,4) (2,2) (6,2) (1, 4) (3,3) (3, 4)

((C )) (3, 3 ) (6,2) (2,3) (2,2)

((D)) (2, 2 ) (6,2) (6,3) (3,1)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (5,5) then remaining neighboring pixels are
((A)) (2, 2 ) (6,2) (6,3) (3,1)

((B)) (6, 3 ) (1,1) (2,4) (2,2) (6,2) (1, 4) (3,3) (3, 4)

((C )) (3, 3 ) (6,2) (2,3) (2,2)

((D)) (6, 5 ) (4,3) (5,6) (5,4) (6,6) (6,4) (4,6) (4, 4)

((E)) D

((F))

((Q))2_//In 4 connected region if one pixel is (3,3) then remaining neighboring pixels are
((A)) (3, 3 ) (1,3) (2,4) (2,2)

((B)) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (4, 3 ) (2,3) (3,4) (3,2)

((E)) D

((F))

((Q))2_//In 4 connected region if one pixel is (5,5) then remaining neighboring pixels are
((A)) (3, 3 ) (6,3) (2,4) (2,2)

((B)) (2,2) (5, 4) (3,2) (6, 4)

 ((C )) (3, 3 ) (4,2) (2,3) (2,2)

((D)) (6, 5 ) (4,5) (5,4) (5,6)

((E)) D

((F))

((Q))2_//In scan line polygon filling algorithm for current scan line the x-intersections got are
20,10,50,30. How pairing will be formed?

((A)) (10,20)and (30,50)

((B)) (10,20)and (20,30)and (30,50)

((C )) (20,10)and (10,50)

((D)) (20,10)and (10,50)and (50,30)

((E)) A

((F))

((Q))2_//In scan line polygon filling algorithm for current scan line the x-intersections obtained are
20,10,50,30. How these x-intersections are stored in intersection array?

((A)) (10,20,30,50)

((B)) (20,10,50,30)

((C )) (50,30,20,10)

((D)) (10,50,20,30)

((E)) A

((F))

((Q))2_//One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the
ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 12. What will
be the x-value of the intersection point of the scan line in i+1 th step?

((A)) 12.2

((B)) 12.5

((C )) 13

((D)) 13.5
 ((E)) A

((F))

((Q))2_//One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the
ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 14. What will
be the x-value of the intersection point of the scan line in i+1 th step?

((A)) 16.2

((B)) 14.2

((C )) 16.2

((D)) 14.2

((E)) D

((F))

((Q))2_//In winding number method , constructed horizontal line between point Q and point P intersects
two edges of the polygon with winding no. +1 and -1. Tell whether point Q is inside or outside and what
is the net winding ? Note : Q is the point to be tested for inside test.P is point outside the polygon.
((A)) Outside , zero

((B)) Inside , zero

((C )) Outside , nonzero

((D)) Inside , nonzero

((E)) A

((F))

((Q))2_//In winding number method , constructed horizontal line between point Q and point P intersects
edge of the polygon with winding no. +1 . Tell whether point Q is inside or outside and what is the net
winding ? Note : Q is the point to be tested for inside test. P is point outside the polygon.
((A)) Outside , zero

((B)) Inside , zero

((C )) Outside , nonzero

((D)) Inside , nonzero

((E)) D

((F))
Subject:-Computer Graphics
Objective type questions Unit-I Graphics Primitives and Scan Conversion

1) In computer graphics, pictures or graphics objects are presented as a collection of discrete picture
element called______.
A. dots
B. pixels
C. co-ordinates
D. points
ANSWER: B

2). _______is the smallest addressable screen element.

A. dots
B. point
C. pixels
D. spot
ANSWER: C

3.) ______is the smallest piece of the display screen which we can control.
A. dots
B. point
C. spot
D. pixel
ANSWER: D

4) We can control ____of the pixels which compose the screen.

A. intensity
B. size
C. shape
D. None
ANSWER: A

5) We can control ____of the pixels which compose the screen.

A. colour
B. size
C. shape
D. None
ANSWER: A

6) Each pixel on the graphics display represents______.

A. a single mathematical point
B. 2 mathematical point
C. 4 mathematical point
D. a region which theoretically can contain infinite points
ANSWER: D

7). A point (42,38) can be displayed on a screen by a pixel.

A. (4,3)
B. (3,4)
C. (5,4)
D. (4,4)
ANSWER: A
8) The process of determining the appropriate pixel for representing, picture or graphics objects is known
as___
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: B

9) The process representing continuous picture or graphics objects as a collection of descrete pixels is
called____.
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: A

10) The computer graphics allows____ on pictures before displaying it.

A. rotation
B. translation
C. scaling and projections
D. All of above
ANSWER: D

11) Graphics devices include_____.

A. input devices
B. output devices
C. a and b
D. None
ANSWER: C

12) Computer graphics allows_____.

A. user interface
B. plotting of graphics and chart
C. office automation and desktop publishing
D. all of above
ANSWER: D

13) Computer graphics allows______.

A. copmuter-aided drafting and design
B. simulaion and animation
C. art and commerce
D. all of above
ANSWER: D

14) Computer graphics allows_____.

A. process control
B. cartography
C. art and commerce
D. all of above
ANSWER: D

15) The software components of conceptual framework for interactive graphics is/are_____.
A. application modelB. application program
C. graphics system
D. all of above
ANSWER: D
16) The Hardware components of conceptual framework for interactive graphics is/are________.
A. input devices
B. output devices
C. a and b
D. none of these
ANSWER: C

17) The display devices are_____.

A. input
B. output
C. a and b
D. none of these
ANSWER: B

18) CRT stands for____.

A. Cathode Ray Tube
B. Colour Ray Tube
C. Cathode Radio Tube
D. Colour Radio Tube
ANSWER: A

19) A CRT is an evacuated _________ tube.

A. plastic
B. glass
C. steel
D. iron
ANSWER: B

20) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B

21) The deflection system of the CRT consistsof___________deflection plates.

A. vertical
B. horizontal
C. a and b
D. none of these
ANSWER: C

22) The techique(s) used for producing image on the CRT is/are__________ .
A. vector scan
B. raster scan
C. Both a and b
D. none of these
ANSWER: C

23) Vector scan technique is also called _________.

A. scalar scan
B. random scan
C. raster scan
D. beam scan
ANSWER: B
24) In vector scan display, buffer memory used is also called _________.
A. refresh memory
B. refresh buffer
C. buffer display
D. refresh circuit
ANSWER: B

25) In vector scan display, the phosphor is to be refreshed at least ________ times per second to avoid
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C

26) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B

27) The deflection system of the CRT consistsof___________deflection plates.

A. vertical
B. horizontal
C. a and b
D. none of these
ANSWER: C

28) The techique(s) used for producing image on the CRT is/are__________.
A. vector scan
B. raster scan
C. Both a and b
D. none of these
ANSWER: C

29) Vector scan technique is also called _________.

A. scalar scan
B. random scan
C. raster scan
D. beam scan
ANSWER: B

30) In vector scan display, buffer memory used is also called _________.
A. refresh memory
B. refresh bufferC. buffer display
D. refresh circuit
ANSWER: B

31) In vector scan display, the phosphor is to be refreshed at least ________ times per second to avoid
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C

32) In raster scan display,the display image is stored in the form of _________ in the refresh buffer.
A. 1s
B. 0s
C. 1s and 0s
D. none of these
ANSWER: C

33) In raster scan CRT, the beam is swept back and forth from _______ across the screen.
A. left to right
B. right to left
C. up to down
D. down to up
ANSWER: A

34) In raster Scan CRT, when a beam is moved from the left to the right,it s ____ and it is _____ when it is
moved from the right to the left.
A. ON,OFF
B. OFF,ON
C. ON,ON
D. OFF,OFF
ANSWER: A

35) In raster scan display, the screen image repeatedly scanned, this process is called _______.
A. buffering of screen
B. refreshig of screen
C. rendering of screen
D. heghlighting screen
ANSWER: B

36) On a black and white system with one bit per pixel , the frame buffer is called a__________.
A. bitmap
B. pixmap
C. bitpixmap
D. pixbitmap
ANSWER: A

37) The cost of vector scan display is___________ cost of raster scan dispay.
A. equal to
B. less than
C. more than
D. none of these

ANSWER: C

38) For ____________ display , scan conversion hardware is required.

A. vector scan
B. random scan
C. raster scan
D. none of these
ANSWER: C
39)Aspect ratio is the ratio of ________ to prodce equal length lines in both direction on the screen
A. vertical points to horizontal points
B. horizontal points to vertical points
C. left to riht and right to left diagonal points
D. right to left and left to right diagonal points
ANSWER: A

40)Display file can be implemented using __________ data structure.

A. array
B. linked list
C. paging
D. all of the above
ANSWER: D

41)The process of digitizing a picture definition given in an application program into a set of pixel-intensity
Values is called ____________.
A. animation
B. sampling
C. rasterization
D. scan-conversion
ANSWER: D

42)The size of frame buffer(video memory )depends on_____________.

A. resolution only
B. number of different colors only
C. both (B) and(C)
D. computer byte
ANSWER: C

43)A pixel of black_white image or graphics object takes _________ space in memory.
A. 1 bit
B. 2 bits
C. 1 nibble
D. 1 byte
ANSWER: C

44)The resolution of an image is __________.

A. number of pixels per unit area
B. number of pixels per unit length inhorizontal
C. number of pixels per unit length in vertical
D. none of these
ANSWER: A

45)Persistance can be defined as______.

A. intensity of a pixelB. pixels per unit area
C. the duration of phosphorescence exhibited by a phosphor
D. number of pixels in an image
ANSWER: C

46) The path the electron beam takes at the end of each refresh cycle is called______.
A. horizontal retrace
B. vertical retrace
C. diagonal retrace
D. left to right retrace
ANSWER: B
47) The path the electron beam takes when returning to the left side of the CRTscreen is called_____.
A. horizontal retrace
B. vertical retrace
C. diagonal retrace
D. top to bottom retrace
ANSWER: A

48) Frame buffer is used to store_____.

A. number if pixels in image
B. intencities of pixels
C. image definition
D. co-ordinate values of image
ANSWER: B

49) The clearity of a displayed image depends on the______.

A. resolution
B. floating point precision of system
C. associated software
D. aspect ratio
ANSWER: A

50)Random scan monitor can also referred to as______.

A. vector displays
B. stroke writing displays
C. calligraphic displays
D. none of the above
ANSWER: A

51) Which facility is provided by computer graphics to change the shape colour or other properties of
objects begin viewed.
A. Motion dynamics
B. Update dynamics
C. A & B
D. None of these
ANSWER: B

which factors affect resolution.

A. The type of phosphor
B. The intensity to be displayed
C. The focusing & deflection systems used in CRT
D. all of these

ANSWER: D

special area of the memory is dedicated to graphics only in raster scan display called_________ .
A. Frame buffer
B. video controller
C. display controler
D. Monitor
ANSWER: A

which is not true statement for raster scan generator.

A. It produces deflection signals
B. It consists of raster scan generator,x&y address register&pixel
C. it receive the intencity information of each pixel from frame buffer
D. it controls the x&y address registers
ANSWER: C

The disadvantage of raster graphics display system is ______.

A. It require large number of frame buffer memory cycles needed for video scan out
B. The burden of image generation is on the main CPU
C. Insufficient frame buffer memory band width
D. All of these
ANSWER: D

To store black and white images ,black pixels are represented by________ in the frame buffer and white
pixels by_______.
A. Zero and one
B. One and Zero
C. Both a & b
D. None of these
ANSWER: B

The image can be transmitted to the display point by________.

A. Line
B. Segment
C. Point
D. None of these
ANSWER: C

The center of display screen is computed as

A. X max ,y max
B. Xmax/2,ymax/2
C. Xmax/3,ymax/3
D. None of these
ANSWER: B

What is true about DDA algorithm for scan conversion of a line

A. General purpose method
B. Incremental
C. current calculation is independent of previous step
D. Is slower than the use of line equation
ANSWER: B

In DDA algorithm for scan conversion of line

A. if |m|<=1 then dx=1B. if |m|>=1 then dx=1
C. if |m|<=1 then dy=1
D. none of the above
ANSWER: A

Which of these is true about Bresenham's Line Algorithm?

A. Highly efficient incremental method
B. Uses scan conversion
C. uses integer addition,subtraction and multiplication by 2
D. all of the above
ANSWER: A

Integer addition,subtraction and multiplication by 2 in Bresenham's Line Algorithm can be done by

A. Simple arithmetic shift operation
B. circular shift operation
C. XOR Operation
D. none of the above
ANSWER: B

In Bresenham's algorithm for scan conversion of line

A. d=2dy-dx
B. d=2dx-dy
C. d=4dy-dx
D. d=4dx-dy
ANSWER: A

What is the basis of scan conversion of a circle?

A. Semi-circle symmetry
B. Quarter symmetry
C. Eight-way symmetry
D. none of the above
ANSWER: C

What is true about the Bresenhem's Circle algorithm?

A. if d<0 then d=d+4x+6
B. if d>0 then d=d+4x+6
C. if d<0 then d=d+4(x-y)+10 and y--
D. none of the above
ANSWER: A

which of these is a characteristic of midpoint circle algorithm?

A. Produces pixel points for an semicircle
B. Produces pixel points for an quadrant
C. Produces pixel points for an octant
D. none of the above
ANSWER: C

What is the initial value for the decision parameter in midpoint circle algorithm.
A. 5/4-r
B. 4/5-r
C. r-5/4
D. r-4/5
ANSWER: A

In Bresenham's line generation algorithm, the initial value of the decision parameter as p0 = __________,
where slope MOD (m) < 1
A. 2Δy – Δx
B. 2Δy – 2Δx
C. Δx – Δy
D. none of the above
ANSWER: A

If a line whose end point is (10, 12) and start point is (20, 20), then slope m =?
A. 1.2
B. 0.8
C. -0.4
D. none of the above
ANSWER: B

The Cartesian slope-intercept equation for a straight line is ________________.

A. y = m(a+b+c)
B. y = m.x + b
C. y = 2∆x-m
D. none of the above
ANSWER: B

The DDA algorithm is a faster method for calculating pixel positions than the direct use of Eq. y = m.x + b.
A. TRUE
B. FALSE
ANSWER: A

In Bresenham's Mid-point Circle Algorithm, the initial value of the decision parameter is p0 = 5/4 – r.
A. TRUE
B. FALSE
ANSWER: A

The method which used either delta x or delta y, whichever is larger, is chosen as one raster unit to draw
the line .the algorithm is called?
A. Bresenham`s Line Algorithm
B. Generalized Bresenham`s Algorithm
C. DDA Line Algorithm
D. Midpoint Line Algorithm
ANSWER: C

There are two standard methods of mathematically representing a circle centered at the origin. They are?
A. Polynomial Method, and Bresenham`s
B. Trigonometric Method and Bresenham`s
C. DDA, and Bresenham`s
D. Polynomial Method, and Trigonometric Method
ANSWER: D

In Bresenham's algorithm, while generating a circle , it is easy to generate?

A. One octant first and other by successive reflection
B. One octant first and other by successive rotation
C. One octant first and other by successive translation
D. All octants
ANSWER: A

Why a circle drawn on the screen appears to be elliptical ?

A. It is due to the aspect ratio of monitor
B. Screen has rectangular shape
C. Our eyes are not at the same level on screen
D. CRT is completely spherical
ANSWER: A

Which of the following technique is used in Midpoint Subdivision algorithm ?

A. Linear search
B. Binary Search
C. Heap sort
D. Bubble Sort
ANSWER: B

A circle, if scaled only in one direction becomes a ?

A. parabola
B. hyperbola
C. Ellipse
D. remains a circle
ANSWER: C

(2,4) is a point on a circle that has center at the origin. Which of the following points are also on circle ?
A. (2,-4),(-2,4)
B. (4,-2)
C. (-4,2)
D. All of above
ANSWER: D

A line can be represented by_________.

A. One point
B. Two points
C. Three points
D. Four points
ANSWER: B

Bresanham circle algorithm uses the approach of a ______________.

A. Midpoint
B. Point
C. Line
D. None of these
ANSWER: A

The side effect of scan conversion are________.

A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A

The process of reducing aliasing is called __________.

A. Resolution
B. Anti aliasing
C. Sampling

D. None of these
ANSWER: B

The problem of aliasing are_____________.

A. Staircase
B. Unequal brightness
C. Picket fence problem
D. All of these
ANSWER: D

The basic principle of Bresenham`s line algorithm is__?

A. A to select the optimum raster locations to represent a straight line
B. to select either Δx or Δy, whichever is larger, is chosen as one raster unit
C. we find on which side of the line the midpoint lies
D. both a and b
ANSWER: A

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?
A. x-increments = 1; y-increments =1
B. x-increments = 0.5; y-increments =1
C. x-increments = 1; y-increments =0.5
D. None of above
ANSWER: C

Line produced by moving pen is __ at the end points than the line produced by the pixel replication?
A. Thin
B. Straight
C. Thicker
D. both A and B
ANSWER: C

A line segment _____________.

A. extends forward
B. extends backward
C. ends at two points
D. extends forever both forward and backward
ANSWER: C

In DDA line drawing algorithm, dx or dy, whichever is________, is chosen as one raster unit.
A. 1
B. 0
C. smaller
D. larger
ANSWER: D

Sign function makes the DDA line drawing algorithm work in _____ quadrants.
A. I and II
B. B I and III
C. II and III
D. all
ANSWER:D

Floating point arithmetic in DDA algorithm is__________.A. time efficient

B. time consuming
C. fast
D. slow
ANSWER: B

DDA line drawing algorithm for calculating pixel positions is __________ the direct use of equation y =
mx + b.
A. slower than
B. faster than
C. of equal speed to that of
D. none of these
ANSWER: B

Expansion of line DDA algorithm is______.

A. Digital difference analyzer
B. Direct differential analyzer
C. Digital differential analyzer
D. Data differential analyzer
ANSWER: C
Which algorithm is a faster method for calculating pixel positions?
A. Bresenham’s line algorithm
B. Parallel line algorithm
C. Mid-point algorithm
D. DDA line algorithm
ANSWER: D

In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk is______
A. Positive
B. Equal
C. Negative
D. Option a or c
ANSWER: C

A dashed line could be displayed by generating_________.

A. Inter dash spacing
B. Very short dashes
C. Both A or B
D. A or B
ANSWER: A

Which of the following technique is used in Midpoint Subdivision algorithm ?

A. Linear search
B. Binary search
C. Heap sort
D. Bubble sort
ANSWER: B

Smallest size object that can be displayed on a monitor is called________.

A. Picture element
B. Point
C. Dot PitchD. Aspect ratio
ANSWER: A

The maximum number of points that can be displayed without overlap on a CRT
A. Aspect Ratio
B. Resolution
C. Brightness
D. Pixel
ANSWER: B

Each screen point is referred to as_________________.

A. Resolution
B. Pixel
C. Persistence
D. Dot Pitch
ANSWER: B

_____________is the number of points per centimeter that can be plotted horizontally and vertically.
A. Aspect Ratio
B. Pixel Depth
C. Resolution
D. Dot Pitch
ANSWER: C
__________is the ratio of horizontal points to vertical points necessary to produce equal length
lines in both direction.
A. Dot Pitch
B. Resolution
C. Aspect Ratio
D. Height-Width Ratio
ANSWER: C

Vector display is well suited for___________.

A. Animation
B. Line drawing applications
C. Cartoons
D. All of the above
ANSWER: B

Beam penetration method is usually used in______________.

A. LCD
B. Raster Scan display
C. Random scan display
D. DVST
ANSWER: C

An RGB color system with 24 bits os storage per pixel is known as________________.
A. Color CRT
B. True-color system
C. RGB monitor
D. Color- Depth
ANSWER: B

Digitizing a picture definition into a set of intensity values is known as .............A. Digitization
B. Scan conversion
C. Refreshing
D. Scanning
ANSWER: B

Raster graphics are composed of ____________.

A. Pixels
B. Paths
C. Palette
D. None of these
ANSWER: A

Which of the following allow for 8 mirror images?

A. Parabola
B. Ellipse
C. Hyperbola
D. Circle
ANSWER: D

The simplest output primitive is__________.

A. Straight line
B. Straight line segment
C. Point
D. Circle
ANSWER: C
A bitmap is________ bit(s) per pixels.
A. 0
B. 1
C. 2
D. 4
ANSWER: B

The quality of an image depend on_____________.

A. No. of pixel used by image
B. No. of line used by image
C. No. of resolution used by image
D. None
ANSWER: A

The basic geometric structures that describes a scene on display is called__________-.

A. Attributes
B. Output primitive
C. Lines
D. Curves
ANSWER: B

An accurate and efficient raster line-generating algorithm is_________.

A. DDA algorithm
B. Mid-point algorithm
C. Parallel line algorithm
D. Bresenham’s line algorithmANSWER: D
In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk is______.
A. Positive
B. Equal
C. Negative
D. Option a or c
ANSWER: C
((Q)) 1_ // A graphics package contains
((A)) No of housekeeping task such as clearing a display screen.
((B)) No of housekeeping task such as initializing parameters
((C)) Both A and B
((D)) None of these
((E)) D
((F))

((Q)) 1_ // The interactive computer graphics involves _______way communication b/w computer
and the user
((A)) 1
((B)) 2
((C)) 3
((D)) 4
((E)) A
((F))

((Q)) 1_ // Interactive computer graphics enables a user to customize the graphics in _______
((A)) Computer Way
((B)) His own way
((C)) Both A and B
((D)) User’s Way
((E)) D
((F))

((Q)) 1_ // The application area of computer graphics are

((A)) Virtual Reality
((B)) Education and textbook
((C)) CAD and Films
((D)) All of these
((E)) D
((F))

((Q)) 1_ // CAD means

((A)) Car Aided Design
((B)) Computer Art Design
((C)) Computer Aided Design
((D)) Car Art Design
((E)) C
((F))

((Q)) 1_ // What are the components of Interactive computer graphics

((A)) A digital memory or frame buffer
((B)) A television monitor
((C)) An interface or display controller
((D)) All of these
((E)) D
((F))

((Q)) 1_ // Which graphics application provides a proper dialogue box to help the user
((A)) MS excel
((B)) MS Paint
((C)) MS word
((D)) MS Access
((E)) B
((F))

((Q)) 1_ // A basic interactive picture construction technique are

((A)) Positioning and pointing, constraints
((B)) Grid, gravity field, rubber band method
((C)) Sketching, dragging, inking and painting
((D)) All of these
((E)) D
((F))

((Q)) 1_ // Computer graphics was first used by

((A)) William fetter in 1960
((B)) James fetter in 1969
((C)) James gosling in 1991
((D)) John Taylor in 1980
((E)) A
((F))

((Q)) 1_ // Computer graphics uses ____________ to make images

((A)) hardware and software systems
((B)) hardware only
((C)) software only
((D)) hardware of software
((E)) A
((F))

((Q)) 1_ // The role of interactive computer graphics is

((A)) Generation of picture of computer graphics
((B)) Preparation of picture for presentation
((C)) Presentation of previously generated pictures
((D)) All of above
((E)) D
((F))

((Q)) 1_ // Computer graphics methods are now commonly used in making

((A)) Motion Pictures
((B)) Music Videos
((C)) Television shows
((D)) All of above
((E)) D
((F))

((Q)) 1_ // The term computer graphics is given by which of following equations

((A)) Computer Graphics = Data Structure + Algorithm
((B)) Computer Graphics = Data Structure + Languages
((C)) Computer Graphics = Data Structure + Algorithm + Languages
((D)) Computer Graphics = Data Structure
((E)) C
((F))

((Q)) 1_ // An application of computer vision is to create visual effect of is

((A)) camera focusing
((B)) camera tracking
((C)) camera clicking
((D)) camera moving
((E)) A
((F))

((Q)) 1_ // In computer graphics, a computer is used to create

((A)) Picture
((B)) Data Structure
((C)) Algorithm
((D)) To modify existing object
((E)) A
((F))

((Q)) 1_ // The technique used to summarize the financial, statistical , mathematical , scientific and
economic data is
((A) Computer Art
((B)) Image Processing
((C)) Presentation Graphics
((D)) Graphics
((E)) C
((F))

((Q)) 1_ // CGI stands for computer graphics interface.

((A)) TRUE
((B)) FALSE
((C)) can’t say
((D)) May be
((E)) A
((F))

((Q)) 1_ // Computer generated models of physical, financial, and economic systems are often
used for
((A)) Education Aid
((B)) Quality Control
((C)) Entertainment
((D)) stock exchange
((E)) B
((F))

((Q)) 1_ // Examples of Presentation Graphics is

((A)) Bar Charts
((B)) Line Graphs
((C)) CAD
((D)) Both A & B
((E)) D
((F))

((Q)) 1_ // The ISO standard for computer graphics

((A)) Graphics Kernel System
((B)) Graphics Standard System
((C)) Computer Graphics Standards
((D)) Computer Graphics System
((E)) A
((F))

((Q)) 1_ // GKS stands for ________

((A)) Graphics Koll System
((B)) Computer Graphics Kernel System
((C)) Graded Kernel System
((D)) Graphics Kernel System
((E)) D
((F))

((Q)) 1_ // Which method are used to get and set the position of a pixel, object or text in active
area of a desktop
((A)) Drugging method
((B)) Basic positioning method
((C)) Sketching method
((D)) Gravity field method
((E)) B
((F))
((Q)) 1_ // Heat supplied to the cathode by directing a current through a coil of wire is called
((A)) Electron gun
((B)) Electron beam
((C)) Filament
((D)) Anode and cathode
((E)) A
((F))

((Q)) 1_ // __________ technology creates fast response to figure touch in Touch panels.
((A)) Analog capacitive
((B)) Digital capacitive
((C)) Analog resistive
((D)) None of above
((E))
((F))

((Q)) 1_ // Phosphorescence is the process of

((A)) Continuously glowing even after removing the electron beam.
((B)) Glowing after applying electron beam
((C)) Switching off the glow of phosphor
((D)) Turning ON the pixels
((E)) B
((F))

((Q)) 1_ // Pixel is the

((A)) Largest screen element which user can control
((B)) Smallest screen element which user can control
((C)) particular colour of the screen
((D)) one object on screen
((E)) B
((F))

((Q)) 1_ // ______ refers to the number of dots on screen

((A)) pixel
((B)) Resolution
((C)) Aspect ratio
((D)) Frame buffer
((E)) B
((F))
((Q)) 1_ // Frame buffer is part of the_________ which stores the image to be displayed on screen
((A)) main memory
((B)) ROM
((C)) External Memory
((D)) Dynamic Memory
((E)) A
((F))

((Q)) 1_ // To store black and white images ,black pixels are represented by________ in the frame
buffer and white pixels by_______
((A)) Zero and one
((B)) One and Zero
((C)) Both a & b
((D)) None
((E)) A
((F))

((Q)) 1_ // In graphical system, the array of pixels in the picture are stored in
((A)) Memory
((B)) Memory
((C)) Processor
((D)) All the above
((E)) A
((F))
((Q)) 1_ // The ____ simply reads each successive byte of data from the frame buffer ?
((A)) Digital Controller
((B)) Data Controller
((C)) Display controller
((D)) All of above
((E)) C
((F))

((Q)) 2_ // A 16*16array of black and white pixels could be represented by________

((A)) 64bytes
((B)) 32bytes
((C)) 128bytes
((D)) 96bytes
((E)) B
((F))

((Q)) 1_ // The maximum number of points that can be displayed without overlap on a CRT is
referred as
((A)) Picture
((B)) Resolution
((C)) Persistence
((D)) None
((E)) B
((F))

((Q)) 1_ // Aspect ratio means

((A)) Number of pixels
((B)) Ratio of vertical points to horizontal points
((C)) Ratio of horizontal points to vertical points
((D)) Both b and c
((E)) B
((F))

((Q)) 1_ // Color depth can be defined by ________ which can be displayed on a display unit
((A)) Bits per pixel
((B)) Bytes per pixel
((C)) Megabyte per pixel
((D)) None of these
((E)) A
((F))

((Q)) 1_ // On a black and white system with one bit per pixel, the frame buffer is commonly
called as ((A)) Pix map
((B)) Multi map
((C)) Bitmap
((D)) All the above
((E)) A
((F))

((Q)) 1_ // The region of the memoy to hold all the pixel values of the display is called ___
((A)) Cache memory
((B)) ROM
((C)) Frame buffer
((D)) VRAM
((E)) C
((F))

((Q)) 1_ // In computer graphics, pictures or graphic objects are presented as a collection of

discrete picture elements called _____
((A)) dots
((B)) pixels
((C)) coordinates
((D)) points
((E)) B
((F))

((Q)) 1_ // A frame buffer is used in ___

((A)) vector graphic display
((B)) Raster graphic display
((C)) Display file
((D)) DVST
((E)) B
((F))

((Q)) 1_ // we can control ____ of the pixel which compose the screen
((A)) size
((B)) shape
((C)) intensity
((D)) none of the given
((E)) C
((F))

((Q)) 1_ // Pixel is also referred to as a ___

((A)) point
((B)) do
((C)) pel
((D)) coordinate
((E)) C
((F))

((Q)) 1_ // In raster scan display, the image is stored in the form of ____ in the refresh buffer.
((A)) 1s
((B)) 0s
((C)) 1s and 0s
((D)) None
((E)) C
((F))

((Q)) 1_ // _____ is the smalest addressable screen element.

((A)) dot
((B)) Spot
((C)) point
((D)) pixel
((E)) D
((F))

((Q)) 1_ // Which of the following is not true with respect to frame buffer
((A)) It stores what is currently displayed on screen
((B)) It stores the image as a set of pixel
((C)) It is part of the main memory
((D)) It stores commands to draw the image
((E)) D
((F))

((Q)) 1_ // The selection of the pixel will depend on the____of the line
((A)) resolution
((B)) slope
((C)) length
((D)) breadth
((E)) A
((F))

((Q)) 1_ // A pixel of black -white image or graphic object takes _____ space in memory
((A)) 2 bits
((B)) 1 bit
((C)) 1nibble
((D)) 1 byte
((E)) B
((F))

((Q)) 1_ // In high quality system ___bits per pixel is needed to control the intensity of screen
position
((A)) 8
((B)) 12
((C)) 16
((D)) 24
((E)) D
((F))

((Q)) 1_ // A particular font and associated styles can be set using the function
((A)) setTextfont (tf)
((B)) setfont (tf)
((C)) setFont (tf)
((D)) SetTextFont()
((E)) D
((F))

((Q)) 1_ // The Character size is specified by

((A)) Printers
((B)) Compositors
((C)) Frame buffer
((D)) Both a and b
((E)) C
((F))

((Q)) 1_ // Random-scan system mainly designed for

((A)) Realistic shaded screen
((B)) Fog effect
((C)) Line-drawing applications
((D)) Only b
((E)) C
((F))

((Q)) 1_ // Types of computer graphics are

((A)) Vector and raster
((B)) Scalar and raster
((C)) Vector and scalar
((D)) None of these
((E)) A
((F))

((Q)) 1_ // In graphics systems a separate processor is used to interpret the commands in the
display file.Such a processor is known as-
((A)) Display processor
((B)) command processor
((C)) graphics processor
((D)) none of the above
((E)) A

((Q)) 1_ // CRT stands for____

((A)) Cathode Ray Tube
((B)) Colour Ray Tube
((C)) Cathode Radio Tube
((D)) Colour Radio Tube
((E)) A
((F))

((Q)) 1_ // Important characteristics of Video Display Devices include-

((A)) Persistence
((B)) Resolution
((C)) Aspect Ratio
((D)) all of the above
((E)) D
((F))

((Q)) 1_ // Video controller provides the facility of-

((A)) Video mixing
((B)) Video buffering
((C)) Video editing
((D)) None of the above
((E)) D
((F))

((Q)) 1_ // Computer graphics is used in many DTP software as

((A)) Photoshop
((B)) Paint brush
((C)) Both a & b
((D)) None of these
((E)) C
((F))

((Q)) 1_ // Raster scan is _______ expensive than random scan

((A)) More
((B)) Less
((C)) Both a & b
((D)) None
((E)) A
((F))

((Q)) 1_ // Beam penetration method is used in

((A)) Random scan system
((B)) Raster scan system
((C)) Both a & b
((D)) None of these
((E)) D
((F))

((Q)) 1_ // A point (4.2,3.8) can be displayed on screen by pixel_

((A)) (4,3)
((B)) (3,4)
((C)) (5,4)
((D)) (4,4)
((E)) D
((F))

((Q)) 1_ // ________ rate is how often the image is “re-drawn” on the monitor.
((A)) Scan
((B)) Refresh
((C)) Show
((D)) Distance
((E)) B
((F))

((Q)) 1_ // A shadow mask CRT has _____ phosphor color dots at each pixel position
((A)) 1
((B)) 2
((C)) 3
((D)) None of these
((E)) C
((F))

((Q)) 1_ // Data generating devices are

((A)) Scanners
((B)) Digitizers
((C)) Tablets
((D)) a and b
((E)) B
((F))

((Q)) 1_ // The control is achieved by setting the ___ and colour of the pixel which compose the
screen.
((A)) intensity
((B)) brightness
((C)) both a,b
((D)) none of the above
((E)) D
((F))

((Q)) 1_ // Raster is a synonym for the term ?

((A)) Array
((B)) Matrix
((C)) Model
((D)) All of above
((E)) D
((F))

((Q)) 1_ // The basic elements of a picture in volume graphics is

((A)) pixel
((B)) volsel
((C)) voxel
((D)) none of the above
((E)) B
((F))

((Q)) 1_ // In Raster scan displays the refresh display file is called as

((A)) display list
((B)) display program
((C)) refresh buffer
((D)) all of above
((E)) C
((F))

((Q)) 1_ // Data gloves are commanly used in,

((A)) Graphics tablet
((B)) Virtual-reality environment
((C)) Digitizers
((D)) Graphics environment
((E)) D
((F))

((Q)) 1_ // The photoscanners have resolutions up to ___ units per inch.

((A)) 2000
((B)) 5000
((C)) 8000
((D)) none of the above
((E)) D
((F))

((Q)) 1_ // In raster scan displays a special area of memory is dedicated to graphics only.This
memory area is called –
((A)) Display buffer
((B)) Frame buffer
((C)) Memory buffer
((D)) None of the above
((E)) B
((F))

((Q)) 1_ // Vector display draws-

((A)) only lines
((B)) only characters
((C)) only objects
((D)) none of the above
((E)) C
((F))

((Q)) 1_ // CGA stands for-

((A)) Color Grphics Adapter
((B)) Clear Graphics Adapter
((C)) Close Graphics Adapter
((D)) None of the above
((E)) A
((F))

((Q)) 1_ // The process in which object is represented as collection of discrete pixels is called
as____
((A)) Line conversion
((B)) Circle conversion
((C)) Scan conversion
((D)) None of the above
((E)) C
((F))

((Q)) 1_ // DVST stands for ___________

((A)) Direct View Storage Tube
((B)) Domain View Storage Tube
((C)) Direct View Storage Tube
((D)) None of these
((E))A
((F))

((Q)) 1_ // The number of pixels stored in the frame buffer of a graphics system is known as
((A)) Resolution
((B)) Depth
((C)) Resalution
((D)) Only a
((E)) A
((F))

((Q)) 1_ // The most common type of graphics monitor employing a CRT in the _____scan
((A)) raster
((B)) random
((C)) CRT
((D)) electron
((E)) A
((F))

((Q)) 1_ // The no. of bits per pixel in the frame buffer is called________buffer area
((A)) width
((B)) depth
((C)) height
((D)) colour
((E)) B
((F))

((Q)) 1_ // In which system, the Shadow mask mehods are commonly used
((A)) Raster-scan system
((B)) Random-scan system
((C)) Only b
((D)) Both a and b
((E)) B
((F))

((Q)) 1_ // The origin of computer graphics was developed in

((A)) 1950
((B)) 1960
((C)) 1970
((D)) 1990
((E)) D
((F))

((Q)) 1_ // The image is passed repeatedly to the monitor _____in order to maintain a steady
picture on the screen
((A)) 25 times a second
((B)) 30 times a second
((C)) 30 or more times a second
((D)) None of these
((E)) B
((F))

((Q)) 1_ // Pixel mask means

((A)) A string containing only 1's
((B)) A string containing only 0’s
((C)) A string containing 1 and 0
((D)) A string containing 0 and 0
((E)) C
((F))
((Q)) 1_ // The algorithm which displays line-type attributes by plotting pixel spans is
((A)) Raster line algorithm
((B)) Raster scan algorithm
((C)) Random line algorithm
((D)) Random scan algorithm
((E)) B
((F))

((Q)) 1_ // Which of the following is false with respect to display file?

((A)) It provides an interface between in image specification process and image display
rocess.
((B)) It stores imformation in the form of commands.
((C)) It stores each and every pixels setting of the display device.
((D)) It speed up the display process.
((E)) A
((F))

((Q)) 1_ // Which of the following is not true with respect to frame buffer?
((A)) It stores what is currently displayed on screen.
((B)) It stores the image as a set of pixels.
((C)) It is a part of system memory.
((D)) It stores commands to draw the image.
((E)) D
((F))

((Q)) 1_ // Two basic technique for producing color display with a CRT are
((A)) Shadow mask and random scan
((B)) Beam penetration method and shadow mask method
((C)) Random scan and raster scan
((D)) None of these
((E)) C
((F))

((Q)) 1_ // A major disadvantage of DVST in interactive computer graphics is

((A)) Ability to selectively erase part of an image
((B)) Inability to selectively erase part of image from screen
((C)) Inability to produce bright picture
((D)) None of above
((E)) C
((F))

((Q)) 1_ // Touch panel technology uses two thin glasses one is coated
with_______________material and the other glass _________________material
((A)) Phosphor , resistive
((B)) Conducting , resistive
((C)) Phosphor , silver
((D)) Gas, phosphor
((E)) B
((F))

((Q)) 1_ // Which of the following is the basic attribute of a character?

((A)) Font
((B)) Size and color
((C)) Orientation
((D)) All the above
((E)) D
((F))

((Q)) 1_ // The movement of different attributes of image would make the image dynamic and
such a dynamic effect is termed as ________
((A)) Picture
((B)) Animation
((C)) Painting
((D)) None of these
((E)) B
((F))

((Q)) 1_ // Color depth can be defined by ________ which can be displayed on a display unit
((A)) Bits per pixel
((B)) Bytes per pixel
((C)) Megabyte per pixel
((D)) None of these
((E)) A
((F))

((Q)) 1_ // RGB true color model has _______ color depth

((A)) 24bit
((B)) 32bit
((C)) 64bit
((D)) None
((E)) A
((F))

((Q)) 1_ // Shadow mask method is used in

((A)) Random scan system
((B)) Raster scan system
((C)) Both a & b
((D)) None of these
((E)) A
((F))

((Q)) 1_ // SVGA display system has____ resolution specifications.

((A)) 640 * 480
((B)) 800 * 600
((C)) 1027 * 768
((D)) 1280 * 1024
((E)) B
((F))

((Q)) 1_ // _____stores the picture information as a charge distribution behind the phosphor-
coated screen.
((A)) Cathode ray tube
((B)) Direct-view storage tube
((C)) Flat panel displays
((D)) 3D viewing device.
((E)) A
((F))

((Q)) 1_ // Structure of display file has following fields

((A)) Opcode
((B)) X coordinate array
((C)) Y coordinate array
((D)) All of above
((E)) D
((F))

((Q)) 1_ // Archietecture of random scan display consist of

((A)) Display controller
((B)) Display buffer memory
((C)) CRT
((D)) All of above
((E)) D
((F))

((Q)) 1_ // In CRT outer layer consist of_____ and inner layer consist of ___________
((A)) Red,Green
((B)) Green,Red
((C)) Yellow,Blue
((D)) Black,White
((E)) A
((F))

((Q)) 1_ // Display file interpreter converts____into___

((A)) Picture,Commands
((B)) Commands,Picture
((C)) Commands,Bitmap
((D)) Commands,Array
((E)) B
((F))

((Q)) 1_ // In beam penetration method slow electrons excites_____and beam of fast electrons
excites___
((A)) Outer red,Inner green
((B)) Outer green,Inner red
((C)) Outer yellow,Inner blue
((D)) Outer blue,Inner yellow
((E)) A
((F))

((Q)) 1_ // The application area of computer graphics are

((A)) Virtual Reality
((B)) Education and textbook
((C)) CAD and Films
((D)) All of these
((E)) D
((F))

((Q)) 1_ // A graphics package contains

((A)) No of housekeeping task such as clearing a display screen.
((B)) No of housekeeping task such as initializing parameters
((C)) Rotines to Draw various shapes
((D)) All of the above
((E)) D
((F))
((Q)) 1_ // The interactive computer graphics involves________ way communication b/w computer
and the user
((A)) 1
((B)) 2
((C)) Both A & B
((D)) None
((E)) 1
((F))

((Q)) 1_ // The movement of different attributes of image would make the image dynamic and
such a dynamic effect is termed as ________
((A)) Drawing
((B)) Animation
((C)) Painting
((D)) None of these
((E)) B
((F))

((Q)) 1_ // Display + Manipulation + Storage of pictures + Experimental data for proper

visualization using a computer
((A)) Computer Graphics
((B)) Television
((C)) Painting
((D)) None of these
((E)) A
((F))

((Q)) 1_ // The application area of computer graphics are

((A)) Virtual Reality
((B)) Entertainment
((C)) CAD and Films
((D)) All of these
((E))D
((F))

((Q)) 1_ // In computer graphics , a computer is used to create

((A)) Picture
((B)) To modify existing object
((C)) Animation
((D)) All of the above
((E))D
((F))

((Q)) 1_ // The application area of computer graphics are

((A)) Medical Field
((B)) Entertainment
((C)) CAD and Films
((D)) All of these
((E))D
((F))
 Subject:-Computer Graphics

MCQ on UNIT 2

A chain of connected line segments is called a ________.

A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: A

A closed polyline is called a _________.

A. Polychain
B. Polygon
C. Polyclosed
D. Closed chain
ANSWER: B

A ploygon in which the line segment joining any two points within the polygon lies completely inside the polygon,
is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: A

A Polygoan in which the line segment joining any two points within the polygon may not lie completely inside the
polygon, is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B

__________ is a method for testing a pixel inside of a polygon.

A. even-odd method
B. winding number method
C. A and B
D. None of these

ANSWER: C

_________ is a basic approach used to fill the polygon.

A. seed fill
B. scan fill
C. A and B
D. None of these ANSWER: C
The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill algorithm.
A. flood, boundry
B. even, odd
C. edge, flood
D. boundry, scan
ANSWER: A

Polygoan filling algorithms those fill interior-defined regions are called _______ algorithms.
A. flood fill
B. boundry fill
C. scan line
D. edge fill
ANSWER: A

Polygoan filling algorithms those fill boundary defined regions are called _________ algorithms.
A. flood fill
B. boundry fill
C. edge line
D. A and B
ANSWER:D

In a boundary fill algorithm for filling polygon, boundary defined regions may be either _________ connected or
__________ connected.
A. 2,4
B. 4,8
C. 8,16
D. 8,6
ANSWER:B

The getpixel function gives the ______ of specified pixel.A. intensity

B. colour
C. Size
D. Shape
ANSWER: B

The putpixel function draws the pixel specified_______.

A. intensity
B. colour
C. Size
D. Shape
ANSWER: B

Seed fill algo for filling polygon is ________ algorithm.

A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:A

Scan line algorithm for filling polygon is ______ algorithm.

A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:B

The basic approach to represent polygon is __________.

A. Polygon drawing primitive approach
B. trapezoid primitive approach
C. line and point approach
D. all of above
ANSWER:D

The process of selecting and viewing the picture with diffrerent views is called_______.
A. Clipping
B. WindowingC. Segmenting
D. all of above
ANSWER:B

A Process which divides each segment of the picture into its visible and invisible portion, allowing the invisible
portion to be discarded is called__________.
A. Clipping
B. Windowing
C. Segmenting
D. all of above
ANSWER:A

A convenient cartesian co-ordinate system used for storing a picture in the computer memory is called__________.
A. X-Y co-ordinate system
B. World co-ordinate system
C. normalized co-ordinate system
D. viewing co-ordinate system
ANSWER:B

When a picture is displayed on the display device it is measeured in ________co-ordinate system.

A. World
B. Physical device
C. Viewing
D. Normalized
ANSWER:B

Mapping the world co-ordinates into physical device co-ordinates is called__________.

A. translation
B. homogeneous transformation
C. co-ordinate conversion
D. Viewing transformation
ANSWER: D
A finite world co-ordinate area selected to perform Viewing transformation for display is called a ____________.
A. Window
B. Segment
C. Clip
D. Viewport

ANSWER: A

An area on a physical device to which a window is mapped is called a __________.

A. Window
B. Segment
C. Clip
D. Viewport
ANSWER: D

The region of a picture against which an object is to be clipped is called a

A. Clip Window
B. Segment
C. Clip
D. Viewport
ANSWER: A

The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the window.
A. any line
B. one end
C. both end
D. any two
ANSWER: C

Cohen-sutherland subdivision line clipping algorithm uses ________ regions with diffrerent codes.
A. 8
B. 6
C. 4
D. 9
ANSWER: D

The transformation which maps the viewing co-ordinates to normalized device co-ordinte is called _______.
A. Viewing transformation
B. translation
C. normalization transformation
D. homogeneous transformation
ANSWER: C

The transformation of object description from normalized co-ordinates to device co-ordinates is called ________.A.
Workstation transformation
B. viewing transformation
C. normalization transformation
D. homogeneous transformation
ANSWER: A
If both end points of a line are exterior to the clipping window,__________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: B

If both end points of a line are completely to the right of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C

If both end points of a line are completely to the left of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C

If both end points of a line are completely to the above of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C

If both end points of a line are completely to the below of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping windowC. the line is completely exterior to the clipping
window
D. none of these
ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 1 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: A

In Cohen-sutherland subdivision line clipping algorithm, bit 2 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: B

In Cohen-sutherland subdivision line clipping algorithm, bit 3 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 4 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: D

In cohen- sutherland subdivision line clipping algorithm, all bits in region code are zero if__________.
A. end point of a line lies within a clipping window
B. end point of a line lies to the left of the clipping window
C. end point of a line lies to the right of the clipping window
D. None of theseANSWER: A

In cohen- sutherland subdivision line clipping algorithm,any line that has one in the same bit position in the region
codes for each end point are _________.
A. Completely inside the clipping rectangle
B. Completely outside the clipping rectangle
C. Completely left to the clipping rectangle
D. Completely right to the clipping rectangle
ANSWER: B

In cohen- sutherland subdivision line clipping algorithm, if the result of the logical AND operation with two end
point region codes is not 0000 __________.
A. the line is Completely inside the clipping region
B. the line is Completely outside the clipping region
C. the line is Completely left to the clipping region
D. the line is Completely right to the clipping region
ANSWER: B

In sutherland -Hodgeman polygon clipping algorithm, if the first vertex of the edge is outside the window boundry
and the second vertex of the edge is inside then _____ and ____ are added to the output vertex list.
A. first vertex, second vertex
B. first vertex, the intersection point of the polygon edge with the window boundry
C. Second vertex,the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: C

In sutherland -Hodgeman polygon clipping algorithm, if both vertices of the edge are inside the window boundry,
then _______ is addes to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: B

In sutherland-Hodgeman polygon clipping algorithm, if the first vertex of the edge is inside the window boundry
and the second vertex of the edge is outside then _____ and ____ are added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these

ANSWER: C

In sutherland-Hodgeman polygon clipping algorithm, if both vertices of the edge are outside the window boundry,
______is added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: D

Which of the following clipping algorithm follows the Divide and Conquer strategy?
A. 4-bit algorithm
B. Midpoint algorithm
C. Cyrus break algorithm
D. Cohen- Sutherland algorithm
ANSWER:B

The selection and separation of a part of text or image for further operation are called__________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER:D

The complex graphics operations are_______.

A. Selection
B. Separation
C. Clipping
D. None of these
ANSWER: C

In computer graphics, a graphical object is known as________.

A. Point
B. Segment
C. Parameter
D. None of these
ANSWER: B
A many sided figure is termed as_________.A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B

The end point of polygon are called as__________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B

The line segment of polygon are called as _________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: A

What are the types of polygon___________.

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: C

If a line joining any of its two interior points lies completely within it are called____________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: A

If a line joining any two of its interior points lies not completely inside are called______________.
A. Convex polygon
B. Concave polygonC. Both a & b
D. None of these
ANSWER: B

In which polygon object appears only partially________________.

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None
ANSWER: B

The process of extracting a portion of a database or a picture inside or outside a specified region are
called_____________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D

The rectangle portion of the interface window that defines where the image will actually appear are
called_____________.
A. Transformation viewing
B. View port
C. Clipping window
D. Screen coordinate system
ANSWER: B

The rectangle space in which the world definition of region is displayed are called_______________.
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: B

The object space in which the application model is defined____________.

A. Screen coordinate system
B. Clipping window or world window
C. World coordinate systemD. None of these
ANSWER: C

The process of cutting off the line which are outside the window are called__________.
A. Shear
B. Reflection
C. Clipping
D. Clipping window
ANSWER: C

Some common form of clipping include_________.

A. curve clipping
B. point clipping
C. polygon clipping
D. All of these
ANSWER: D

A technique by which the vertical and /or horizontal scan frequency of video signal can be changed for different
purpose and applications is called__________.
A. Scan conversion
B. Polygon filling
C. Two dimensional graphics
D. Anti aliasing
ANSWER: A

The process of coloring the area of a polygon is called___________.

A. Polygon filling
B. Polygon flow
C. Aliasing
D. None of these
ANSWER: A

How many types of polygon filling ____________.

A. Two
B. One
C. Three
D. Four
ANSWER: C
The algorithm used for filling the interior of a polygon is called____________.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A

The function of scan line polygon fill algorithm are_______________.

A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
D. None of these
ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it, this is called___________.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B

The side effect of scan conversion are__________.

A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are
called____________.
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a
polygon____________.A. Even-odd method
B. Winding number method
C. Both a & b
D. None of these
ANSWER: C

The process of mapping a world window in world coordinate system to viewport are called___________.
A. Transformation viewing
B. View Port
C. Clipping window
D. Screen coordinate system
ANSWER: A

The space in which the image is displayed are called___________.

A. Screen coordinate system
B. Clipping window
C. World coordinate system
D. None of these
ANSWER: A
Some common form of clipping include__________.
A. Curve clipping
B. Point clipping
C. Polygon clipping
D. All of these
ANSWER: D

In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the?
A. Codes of the end point are same
B. Logical AND of the end point code is not 0000
C. Logical OR of the end points code is 0000
D. Logical AND of the end point code is 0000
E. A and B
ANSWER: E

The transformation in which an object is moved in a minimum distance path from one position to another is
called________.
A. TranslationB. Scaling
C. Rotation
D. Reflection
ANSWER: A

The transformation in which the dimension of an object are changed relative to a specified fixed point is
called____________.
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER: B

An object can be viewed as a collection of___________.

A. One segment
B. Two segment
C. Several segments
D. None of these
ANSWER: C

The graphics method in which one object is transformed into another object are called___________.
A. Clipping
B. Morphing
C. Reflection
D. Shear
ANSWER: B

Scaling of a polygon is done by computing____________.

A. The product of (x, y) of each vertex
B. (x, y) of end points
C. Center coordinates
D. Only a
ANSWER: D

A chain of connected line segment is called a__________

A. Polyline
B. Polysegment
C. Polygon
.D. Polychain
ANSWER: A

A ploygon in which the line segment joining any two points within the polygon may not lies completely inside the
polygon, is called___________polygon .
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B

In the given point (x,y) and we want to access(x-1,y-1) in a single step we need to use_________.
A. 4-connected
B. 5-connected
C. 6-connected
D. 8-connected
ANSWER: D

In scan fill algorithm the scan lines which needs to be considered are from___________.
A. Ymax to ymin of the whole polygon
B. Ymax to ymin of the longest edge of the polygon
C. Ymax to ymin of the shortest edge of the polygon
D. None of these
ANSWER: A

Sutherland Hodgeman algorithm is used for_____________.

A. Polygon filling
B. Line clipping
C. Polygon clipping
D. Text clipping
ANSWER: C

Which of the following is not true w.r.t polygon clipping.

A. Line clipping algorithms are not used for polygon clipping
B. The shape of polygon may change after clipping
C. The sequence of clipping w.r.t. window edges is fixed
D. All of these
ANSWER: C

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (80,80).
Whether a point at (10,50) is visible or not?
A. Visible
B. Partially Visible
C. Completely Exterior
D. None of the above
ANSWER:C

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner
(100,100).What is the outcode of point (150,50)?
A. 0010
B. 1000
C. 0100
D. 0110
ANSWER: A

Which of the following is true with respect to Suther Hodge algorithm?

A. It clips only concave polygons
B. It is more time consuming and complex
C. It may insert extra edges in resultant polygon
D. None of these
ANSWER: C

In sutherland-hodgeman polygon clipping algorithm,if both vertices of the edge are outside the window boundary
then_______is added to the output vertex.
A. First vertex
B. The intersection point of the polygon edge with the window boundary
C. Second vertex
D. None of these
ANSWER: B

A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates
(40,15) and (75,45). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.
A. (23.67,50) and (69.06,40)
B. (50,23.67) and (69.06, 40)
C. (50,23.67) and (40,69.06)
D. None of Above
ANSWER:B

Adjacent pixels are likely to have same characteristics. This property is referred as_______.
A. Property of coherence
B. Spacial coherence
C. Spatial coherence
D. None of these
ANSWER: A

Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left corner at (-8, -4) and
upper right corner at ( 12,8). What will be the end points of clipped line? Use Cohen – Sutherland Outcode
Algorithm.
A. (-8,6) and (2,8)
B. (-8,6) and (8,2)
C. (6,-8) and (2,8)
D. (8,-6) and (8,2)
ANSWER:A

Scale a square ABCD with co-ordinates A(0,0), B(5,0), C(5,5), D(0,5) by 2 units for x-direction and 3-units for y –
direction.
A. A(0,0) , B(10,0) , C(10,15) , D(0,15)
B. A(0,0) , B(0,0) , C(10,15) , D(0,15)
C. A(0,0) , B(10,0) , C(10,10) , D(15,0)
D. None of these
ANSWER:A

The first viewing parameter in perspective projection we must consider is the?

A. Viewing window
B. Shift vector
C. View reference point
D. View reference plane
ANSWER:C

In normalization transformation for window to viewport, window is lower left corner (1,1) and upper right corner at
(3,5) to a view point with lower left corner at (0,0) and upper right corner at(1/2,1/2) .Scaling factors Sx =___ &
Sy =___.
A. 0.25 & 0.125
B. 0.125 & 0.25
C. 4 & 8
D. 0.5 & 1
ANSWER:A

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line AB with end-points A(30, 55) and B(70, 40) will be___________.
A. Completely visible
B. Completely invisible
C. Partially visible
D. Partially invisible
ANSWER:C

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50) will be___________.
A. Completely visible
B. Completely invisible
C. Partially visible
D. Partially invisible
ANSWER:A

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50), the outcodes of P and Q will
be___________ and _________repectively.
A. 1000 and 0001
B. 0000 and 0000
C. 0100 and 0010
D. 1100 and 0011
ANSWER:B

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(30, 55) and Q(70, 40) will have __________ number of
intersection points with the clipping window.
A. 0
B. 1
C. 2
D. 3
ANSWER:B

In the Cohen Sutherland Outcode Algorithm, the four bits in the outcode are set on the basis of positions of the line
end points to the ________ of clipping window regions in the order.
A. Top, Bottom, Right, Left
B. Right, Top, Bottom, Left
C. Top, Right, Left, BottomD. Bottom, Right, Left, Top
ANSWER:A

In the Cohen Sutherland Outcode Algorithm, if both the end-points of the line has outcode 1000, then the line lies
in the _________________region of the clipping window.
A. Left
B. Right
C. Top
D. Bottom
ANSWER:C

In the Cohen Sutherland Outcode Algorithm, if the point outcode is 1001, then the point lies in the
_________________regions of the clipping window.
A. Top and Right
B. Bottom and Right
C. Top and Left
D. Bottom and Left
ANSWER:C
The algorithm used for filling the interior of a polygon is called
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it. this is called
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B

The graphics can be

A. Drawing
B. Photograph, movies
C. Simulation
D. All of these

ANSWER: D

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
A. Scan-line fill algorithm
B. Boundary-fill algorithm
C. Flood-fill algorithm
D. Parallel curve algorithm
ANSWER: B

If we want to recolor an area that is not defined within a single color boundary is known as_________.
A. Boundary-fill algorithm
B. Parallel curve algorithm
C. Flood-fill algorithm
D. Only b
ANSWER: C

There are 2 types of polygons. They are?

A. Convex and concave
B. Square and rectangle
C. Hexagon and square
D. Octagon and convex
ANSWER: A

A many sided figure is termed as_____.

A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B

The end point of polygon are called as___________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B

The algorithm used for filling the interior of a polygon is called____________.A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A

The function of scan line polygon fill algorithm are________.

A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
D. None of these
ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it. this is called_______.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B

If a line joining any two of its interior points lies not completely inside are called____________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: B

In which polygon object appears only partially_______.

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: B

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called______.
A. Negatively oriented
B. Positively orientedC. Both a & b
D. None of these
ANSWER: B

If the visit to the vertices of the polygon in the given order produces an clockwise loop are cComputer Graphics MCQ
1alled______.
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: A

Which things are mainly needed to make a polygon and to enter the polygon into display file_____.
A. No of sides of polygon
B. Vertices points
C. Both a & b
D. None of these
ANSWER: C

Two types of coordinates are_________.

A. Positive and negative coordinates
B. Absolute and relative coordinates
C. Both a & b
D. None
ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a polygon_____.
A. Even-odd method
B. Winding number method
C. Both a & b
D. None of these
ANSWER: C

For a seed-fill method, If a given point is (x, y) and we want to access (x-1, y-1) in the same iteration, we use which
of the following?
A. 4-connected method
B. 5-connected method
C. 7-connected method
D. 8-connected method

ANSWER: D

In a given triangle, a(10, 10), B(20, 20), C(30, 10), the point P(28, 20) is______.
A. Inside the triangle
B. Outside the triangle
C. On the vertex
D. On the edge
ANSWER: B
((Q))1_//An -------------test is used to check whether a point is inside or outside of the polygon.
((A)) Inside

((B)) Outside

((C )) Fill

((D)) Cover

((E)) A

((F))

((Q))1_//In an inside test if number of intersections are ---------------- then point is inside of the polygon.
Note : intersection point is not a vertex.

((A)) Even

((B)) Odd

((C )) Infinite

((D)) None of the above

((E)) B

((F))

((Q))1_//In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note
: intersection point is not a vertex

((A)) Inside

((B)) Outside

((C )) Color

((D)) Can't Say

((E)) A

((F))

((Q))1_//In an inside test if intersections point is a vertex and edges meeting at that vertex lies on same
side of constructed horizontal line then the number of intersections are considered as --
--------. Note : intersection point is a vertex

((A)) Even Number

 ((B)) Odd Number

((C )) Infinite Number

((D)) Can't Say

((E)) A

((F))

((Q))1_//In an inside test if intersections point is a vertex and edges meeting at that vertex lies on -------
------ side of constructed horizontal line then the number of intersections are
considered as even number . Note : intersection point is a vertex

((A)) Same

((B)) Opposite

((C )) On the

((D)) None of the above

((E)) A

((F))

((Q))1_//Two inside polygon test methods are __________ and ________

((A)) Even odd method , winding number method

((B)) Scan line and flood fill

((C )) Even odd method, flood fill

((D)) winding number method, Scan line

((E)) A

((F))

((Q))1_//The 8-Fill Polygon technique will correctly fill the triangle shown below when seeded at the
position shown with an X.

((A)) TRUE

((B)) FALSE

((C ))

((D))
 ((E)) B

((F))

((Q))1_//Following is the method for inside test of the polygon.

((A)) Even-odd method

((B)) Linear method

((C )) Inside method

((D)) Seed method

((E)) A

((F))

((Q))1_//Every side in winding number method has given a number called

((A)) Winding Number

((B)) Integer no.

((C )) Direct number

((D)) Side Number

((E)) A

((F))

((Q))1_//The total of the winding no. in winding number method of inside test is called as
((A)) winding.

((B)) collective winding.

((C )) net winding.

-((D)) summation winding.

((E)) C

((F))

((Q))1_//Winding number method always gives correct answer for overlapping polygons

((A)) TRUE

((B)) FALSE
 ((C ))

((D))

((E)) B

((F))

((Q))1_//Inside tests of polygon are useful in --------

((A)) Polygon filling

((B)) Line coloring

((C )) Shadowing

((D)) None of the above

((E)) A

((F))

((Q))1_//Even-odd method of inside test counts ----- to decide the position of a point.

((A)) Edges

((B)) Vertices

((C )) Intersections

((D)) Pixels

((E)) C

((F))

((Q))1_//In winding number method an ------------------ edges ------ considered

((A)) Horizontal , not

((B)) Vertical , not

((C )) Slanted , not

((D)) Horizontal , is

((E)) A

((F))
((Q))1_//Even-odd method of inside test is suitable for------

((A)) Polygons

((B)) Circles

((C )) Lines

((D)) All of above

((E)) A

((F))

((Q))1_//In winding number method an edge can have winding number as -----

((A)) Zero

((B)) +1 or -1

((C )) Only +1

((D)) Only -1

((E)) B

((F))

((Q))1_//If the pixel is already filled with desired color then does nothing, otherwise fills it. This is called
((A)) Flood fill algorithm

((B)) Boundary fill algorithm

((C )) Scan line polygon filling algorithm

((D)) None of these

((E)) B

((F))

((Q))1_//The algorithm used for filling the interior of a polygon is called

((A)) Flood fill algorithm

((B)) Boundary fill algorithm

((C )) Scan line polygon fill algorithm

((D)) None of these

 ((E)) A

((F))

((Q))1_//___________ procedure accepts the coordinates of an internal point.

((A)) Area fill

((B)) Boundary fill.

((C )) Line fill.

((D)) Scan fill.

((E)) B

((F))

((Q))1_//In 8 connected region by knowing one pixel we can get remaining ---------------- neighboring
pixels.

((A)) 8

((B)) 4

((C )) 2

((D)) 16

((E)) A

((F))

((Q))1_//Following statement(s) is/are true about flood fill algorithm

((A)) It need a seed pixel

((B)) It works at pixel level

((C )) Requires more memory

((D)) All of above

((E)) D

((F))

((Q))1_//Following statement(s) is/are false about flood fill algorithm

((A)) It doesn’t need a seed pixel

 ((B)) It works at pixel level

((C )) Requires more memory

((D)) All of above

((E)) A

((F))

((Q))1_//Seed pixel in flood fill Algorithm is an

((A)) An interior pixel

((B)) Exterior pixel

((C )) Not a pixel

((D)) It is color of pixel

((E)) A

((F))

((Q))1_//In Boundary Fill method ____________ Data Structure is used.

((A)) Stack

((B)) Array

((C )) Heap

((D)) None of above

((E)) A

((F))

((Q))1_//The 4-connected Polygon filling technique has disadvantage(s) as

((A)) Requires more memory

((B)) May fill polygon partially

((C )) Stack overflow

((D)) All of above

((E)) D
 ((F))

((Q))1_//In --------------algorithm edges can be specified in different color.

((A)) Flood fill

((B)) Boundary fill

((C )) DDA fill

((D)) BSA fill

((E)) A

((F))

((Q))1_//The process of coloring the area of a polygon is called

((A)) Polygon filling

((B)) Polygon flow

((C )) Aliasing

((D)) None of these

((E)) A

((F))

((Q))1_//Boundary fill algorithm uses -------- call to the fill function.

((A)) Recursive

((B)) Static

((C )) One

((D)) None of these

((E)) A

((F))

((Q))1_//Boundary fill algorithm needs–

((A)) Boundary Color (BC) and (x,y) coordinates of seed point.

((B)) Fill Color (FC) and (x,y) coordinates of seed point.

 ((C )) Boundary Color (BC), Fill Color (FC) and (x,y) coordinates of seed point.

((D)) (x,y) coordinates of seed point.

((E)) C

((F))

((Q))1_//Which polygon fill algorithm needs following information - 1.Boundary Color (BC), 2. Fill Color
(FC) and 3. (x,y) coordinates of seed point.

((A)) Boundary fill

((B)) Region fill

((C )) Scan fill

((D)) DDA fill

((E)) A

((F))

((Q))1_//Which polygon fill algorithm needs following information - 1. Region Color (RC), 2. Fill Color (FC)
and 3. (x,y) coordinates of seed point.

((A)) Flood Fill

((B)) Region fill

((C )) Scan fill

((D)) DDA fill

((E)) A

((F))

((Q))1_//Horizontal lines are not considered in scan line fill algorithm.

((A)) TRUE

((B)) FALSE

((C ))

((D))

((E)) A
 ((F))

((Q))1_//Scan line fill algorithm is more efficient than flood fill algorithm.

((A)) TRUE

((B)) FALSE

((C ))

((D))

((E)) A

((F))

((Q))1_//Which statement is true about the 4 connected region.

((A)) It is faster than 8 connected region

((B)) Sometimes it leaves region unfilled.

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))

((Q))1_//Seed pixel in flood fill Algorithm is an

((A)) An interior pixel

((B)) Exterior pixel

((C )) Not a pixel

((D)) It is color of pixel

((E)) A

((F))

((Q))1_//The function of scan line polygon fill algorithm are :

((A)) Find intersection point of the boundary of polygon and scan line

((B)) Find intersection point of the boundary of polygon and point

 ((C )) Both A and B

((D)) Neither A or B

((E)) A

((F))

((Q))1_//The edge table contains pointers back to the ______________ to identify vertices for each
polygon edge.

((A)) vertex table.

((B)) polygon table.

((C )) edge table.

((D)) expanded vertex table.

((E)) A

((F))

((Q))1_//Scan line polygon filling method uses

((A)) Scan-line coherence

((B)) Edge coherence

((C )) Area coherence

((D)) Both A and B

((E)) D

((F))

((Q))1_//Scan-line coherence property is used in

((A)) Line drawing algorithm

((B)) Scan line polygon filling algorithm

((C )) Flood fill polygon filling algorithm

((D)) None of above

((E)) B

((F))
((Q))1_//Which of the following is true about scan line algorithm?

((A)) It need a seed pixel

((B)) It works at pixel level

((C )) It uses scan lines to fill the polygon

((D)) All of above

((E)) C

((F))

((Q))1_//In scan line algorithm the intersection points are

((A)) sorted in ascending order

((B)) sorted in descending order

((C )) not sorted

((D)) Deleted

((E)) A

((F))

((Q))1_//Which of the following algorithms to fill polygons was the one used by real rasterizers?
((A)) Flood-Fill Polygons

((B)) Scan-Line Polygon

((C )) Boundary Fill Polygons

((D)) None of above

((E)) B

((F))

((Q))1_//Active edge table is used in following algorithm

((A)) Boundary fill

((B)) Region fill

((C )) Scan Line

((D)) Edge Fill

 ((E)) C

((F))

((Q))1_//Scan line polygon filling algorithm uses series of ……………. To fill the polygon.

((A)) Scan lines

((B)) Points

((C )) Layers

((D)) None of above

((E)) A

((F))

((Q))1_//In scan line algorithm, Scan lines are processed in increasing (upward) / decreasing (downward)
--------------------------.

((A)) Y order

((B)) X order

((C )) Pixel order

((D)) Color order

((E)) A

((F))

((Q))1_//When the current scan line in Scan line polygon fill algorithm moves above the upper / below
the lower endpoint, the edge

((A)) becomes inactive

((B)) becomes active

((C )) is discarded

((D)) is added.

((E)) A

((F))

((Q))1_//The edges crossed by current scan line in Scan line polygon fill algorithm are called as
((A)) Active edges
 ((B)) Inactive edges

((C )) Marked edges

((D)) None of these

((E)) A

((F))

((Q))1_//Scan line Fill Approach works at the

((A)) color level

((B)) edge level

((C )) polygon level

((D)) Pixel Level

((E)) C

((F))

((Q))1_//Following are the data structures used in Scan line algorithm to increase the efficiency.
((A)) Active Edge list

((B)) Active Edge Table

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))

((Q))1_//Scan line polygon filling algorithm starts from

((A)) Either ymax or ymin

((B)) Either xmax or xmin

((C )) Only xmax

((D)) Only xmin

((E)) A

((F))
((Q))1_//Scan line polygon filling algorithm can be used for filling Convex polygon.

((A)) TRUE

((B)) FALSE

((C )) Cant Say

((D)) None of these

((E)) A

((F))

((Q))1_//Using Cohen-Sutherland line clipping, it is impossible for a vertex to be labeled 1111

((A)) TRUE

((B)) FALSE

((C )) Cant Say

((D)) None of these

((E)) A

((F))

((Q))1_//Which one is not valid out code to perform trivial accept / reject test in line clipping
((A)) 1101

((B)) 1001

((C )) 101

((D)) 1000

((E)) A

((F))

((Q))1_//Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the
other line clipping algorithms?

((A)) Need to perform trivial accept / Reject test on end points of the line.

((B)) Need to perform trivial accept / Reject test for every point on the line.

((C )) Cannot say

((D)) None of these

 ((E)) B

((F))

((Q))1_//If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y
coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be
inside the clipping rectangle

((A)) Xmin > X < Xmax and Ymin > Y < Ymax

((B)) Xmin > X > Xmax and Ymin > Y > Ymax

((C )) Xmin < X < Xmax and Ymin < Y < Ymax

((D)) Xmin < X > Xmax and Ymin < Y > Ymax

((E)) C

((F))

((Q))1_//determine whether points (P1, P2 and P3) are clipped away or visible after clipping by applying
the rules

((A)) P1:Clipped away, P2: Clipped away, P3:Clipped Away

((B)) P1: Visible, P2:Visible, P3:Clipped Away

((C )) P1: Visible, P2:Visible, P3: Visible

((D)) P1: Clipped away, P2:Visible, P3:Clipped Away

((E)) D

((F))

((Q))1_//Outcode / Region Code used in Line Clipping is of size ____ bits.

((A)) 4

((B)) 3

((C )) 2

((D)) 1

((E)) A

((F))
((Q))1_//In Line Clipping algorithm, the two dimensional space is divided into ___ regions.
((A)) 6

((B)) 7

((C )) 9

((D)) 10

((E)) C

((F))

((Q))1_//Is 0011 valid region code / outcode used in Line Clipping algorithm?

((A)) yes

((B)) no

((C )) Cannot say

((D)) None of these

((E)) B

((F))

((Q))1_//Cohen – Sutherland line clipping algorithm was developed in ____

((A)) 1967

((B)) 1968

((C )) 1969

((D)) 1965

((E)) A

((F))

((Q))1_//Primitive types of clipping algorithms are

((A)) Point Clipping

((B)) Line Clipping

((C )) Polygon Clipping

((D)) All of above

 ((E)) D

((F))

((Q))1_//In ________ operation eliminates objects or portions of objects that are not visible through the
window to ensure the proper construction of corresponding image

((A)) Clipping

((B)) Windowing

((C )) Viewing

((D)) Transformation

((E)) A

((F))

((Q))1_//The region against which an object is clipped is called as ____________

((A)) Clip window

((B)) Clip rectangle

((C )) Window

((D)) None of these

((E)) A

((F))

((Q))1_//Cohen – Sutherland Line Clipping Algorithm is also called as ____________________

((A)) Sutherland - Hodgman Algorithm

((B)) Cohen - Sutherland Outcode Algorithm

((C )) Cyrus - Beck Algorithm

((D)) None of Above

((E)) B

((F))
((Q))1_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). What is the outcode of point (150,50)?

((A)) 110

((B)) 100

((C )) 0

((D)) 1000

((E)) C

((F))

((Q))1_//The selection and separation of a part of text or image for further operation are called
((A)) Translation

((B)) Shearing

((C )) Reflection

((D)) Clipping

((E)) D

((F))

((Q))1_//The complex graphics operations are

((A)) Selection

((B)) clipping

((C )) shear

((D)) None of these

((E)) B

((F))

((Q))1_//The process of extracting a portion of a database or a picture inside or outside a specified

region are called

((A)) Translation

((B)) Shearing

((C )) Reflection
 ((D)) Clipping

((E)) D

((F))

((Q))1_//The rectangle space in which the world definition of region is displayed are called
((A)) Screen coordinate system

((B)) Clipping window or world window

((C )) World coordinate system

((D)) None of these

((E)) B

((F))

((Q))1_//............. identifies the picture portions that are exterior to the clip window

((A)) Interior clipping

((B)) Exterior clipping

((C )) Extraction

((D)) None of these

((E)) B

((F))

((Q))1_//The region code of a point within the window is ............

((A)) 1111

((B)) 0

((C )) 1000

((D)) 1001

((E)) B

((F))

((Q))1_//According to Cohen-Sutherland algorithm, a line is completely outside the window if ............

((A)) The region codes of line endpoints have a '1' in same bit position.
 ((B)) The endpoints region code are nonzero values

((C )) If L bit and R bit are nonzero.

((D)) The region codes of line endpoints have a '0' in same bit position.

((E)) A

((F))

((Q))1_//The region code of a point is 1001. The point is in the ................. region of window.
((A)) Top Left

((B)) Top right

((C )) bottom left

((D)) bottom right

((E)) A

((F))

((Q))1_//The result of logical AND operation with endpoint region codes is a nonzero value. Which of the
following statement is true?

((A)) The line is completely inside the window

((B)) The line is completely outside the window

((C )) The line is partially inside the window

((D)) The line is already clipped

((E)) B

((F))

((Q))1_//The left (L bit ) bit of the region code of a point (X,Y) is '1' if ......................

((A)) X > XWMIN

((B)) X< XWMIN

((C )) X< XWMAX

((D)) X>XWMAX

((E)) B
 ((F))

((Q))1_//The right bit (R bit)of the region code of a point (X,Y) is '1' if ......................

((A)) X > XWMIN

((B)) X< XWMIN

((C )) X< XWMAX

((D)) X>XWMAX

((E)) D

((F))

((Q))1_//The Most Significant Bit of the region code of a point (X,Y) is '1' if ......................

((A)) Y >YWMIN

((B)) Y< YWMIN

((C )) Y< YWMAX

((D)) Y>YWMAX

((E)) D

((F))

((Q))1_//The bottom bit of the region code of a point is '0' if .......................

((A)) Y >YWMIN

((B)) Y< YWMIN

((C )) Y< YWMAX

((D)) Y>YWMAX

((E)) D

((F))

((Q))1_//The ...................... algorithm divides a 2D space into 9 regions, of which only the middle part
(viewport) is visible.

((A)) Cohen-Sutherland

((B)) Liang Barsky

 ((C )) Sutherland Hodegeman

((D)) None of these

((E)) A

((F))

((Q))1_//Sutherland Hodgeman algorithm works well for...........

((A)) Concave polygons

((B)) Convex Polygons

((C )) Smooth Curves

((D)) Line Segments

((E)) B

((F))

((Q))1_//A line with endpoints codes as 0000 and 0100 is ?

((A)) Partially invisible

((B)) Completely visible

((C )) Completely invisible

((D)) Trivially invisible

((E)) A

((F))

((Q))1_//In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the
?

((A)) codes of the end point are same

((B)) logical OR of the end points code is 0000

((C )) logical AND of the end point code is 0000

((D)) Only A

((E)) D

((F))
((Q))1_//Sutherland – Hodgman algorithm is used for _______________.

((A)) Line Clipping

((B)) Polygon Clipping

((C )) Point Clipping

((D)) Hybrid Clipping

((E)) B

((F))

((Q))1_//Which polygon clipping algorithm executed by clipping all polygon edges against the viewing
screen edges one viewing screen edge at a time?

((A)) Cohen-Sutherland

((B)) Sutherland Hodgman

((C )) Both A and B

((D)) Neither A or B

((E)) B

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside
the window and S ( Previous point) lies outside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) B

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside
the window and S ( Previous point) lies outside the window. Then while processing through that window
boundary we should
 ((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store Nothing

((E)) D

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside
the window and S ( Previous point) lies inside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) A

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside
the window and S ( Previous point) lies inside the window. Then while processing through that window
boundary we should

((A)) Store interaction point of line PS (S’) only

((B)) Store point P and S’

((C )) Store point P only

((D)) Store points S and S’

((E)) C

((F))

((Q))1_//In Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is
used as

((A)) Left -> Right -> Top -> Bottom

 ((B)) Left -> Bottom -> Right -> Top

((C )) Right -> Top -> Left -> Bottom

((D)) Left -> Bottom -> Top -> Right

((E)) A

((F))

((Q))1_//Polygon-Clipping algorithms include the:

((A)) Sutherland-Hodgeman method

((B)) Liang-Barsky method

((C )) Weiler-Atherton method

((D)) All of above

((E)) D

((F))

((Q))1_//_______ is a ordered list of vertices where each vertex connected with the next in the list.
((A)) Line

((B)) Polygon

((C )) Parabola

((D)) None of the above

((E)) B

((F))

((Q))1_//Types of polygon :

((A)) Concave

((B)) Convex

((C )) Complex

((D)) All of above

((E)) D

((F))
((Q))1_//Concave and Convex are types of _______

((A)) Circle

((B)) Rectangle

((C )) Polygon

((D)) Ellipse

((E)) C

((F))

((Q))1_//In convex Polygon all interior angles are

((A)) Less than 90

((B)) Less than 180

((C )) greater than 180

((D)) greater than 90

((E)) B

((F))

((Q))1_//In concave Polygon atleast one interior angle is

((A)) Less than 90

((B)) Less than 180

((C )) greater than 180

((D)) greater than 90

((E)) C

((F))

((Q))1_//A region S is ____ , iff for any x1 and x2 in S, the straight line segment connecting x1 and x2 is
also contained in S.

((A)) Concave

((B)) Convex

((C )) Self-intersecting
 ((D)) Polygon with hole

((E)) B

((F))

((Q))1_//_____ may not always be Convex .

((A)) Paralleogram

((B)) Trapizoid

((C )) Polygon

((D)) Triangle

((E)) C

((F))

((Q))1_//__________ is represented as a number of line segments connected end to end to form a

closed figure.

((A)) Circle

((B)) Line

((C )) Polygon

((D)) point

((E)) C

((F))

((Q))1_//___________ is not a Type of polygon

((A)) Concave

((B)) Convex

((C )) Linear

((D)) Complex

((E)) C

((F))

((Q))1_//Right angled Triangle is an example of ____ Polygon

 ((A)) Concave

((B)) Convex

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//Square is an example of ____ Polygon

((A)) Convex

((B)) Concave

((C )) Complex

((D)) Linear

((E)) A

((F))

((Q))1_//An M shaped closed figure is an example of ____ Polygon

((A)) Convex

((B)) Concave

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//Polygons are formed by two scan lines and two _____ in polygon representation using
trapizoid primitive.

((A)) Vertical Lines

((B)) Line segments

((C )) Scan Lines

((D)) Horizontal Lines

 ((E)) B

((F))

((Q))1_//Polygons are formed by two ____ lines and two Line segments in polygon representation
using trapizoid primitive.

((A)) Vertical

((B)) segmented

((C )) Scan

((D)) Horizontal Lines

((E)) B

((F))

((Q))1_//A region S is ____, if for atleast 2 points x1 and x2 in S, the straight line segment connecting x1
and x2 is not contained entirely in S.

((A)) Concave

((B)) Convex

((C )) Linear

((D)) Polygon with hole

((E)) A

((F))

((Q))1_//A concave polygon is one which is not ___

((A)) Non-Linear

((B)) Linear

((C )) Convex

((D)) None

((E)) C

((F))

((Q))1_//A convex polygon is a polygon such that for any two points inside the polygon, all points on the
line segment connecting them are __________the Polygon
 ((A)) also inside

((B)) outside

((C )) also partially inside

((D)) partially outside

((E)) A

((F))

((Q))1_//A ______ polygon is a polygon such that for any two points inside the polygon, all points on
the line segment connecting them are also inside the Polygon

((A)) Concave

((B)) Convex

((C )) Complex

((D)) Linear

((E)) B

((F))

((Q))1_//A convex polygon is a polygon such that for any two points ____ the polygon, all points on the
line segment connecting them are also ____ the Polygon

((A)) inside, outside

((B)) outside, outside

((C )) outside, outside

((D)) inside, inside

((E)) D

((F))

((Q))1_//One of the representation of Polygon is using

((A)) Rectangle Primitive

((B)) Trapizoid Primitive

((C )) Circle Primitive

 ((D)) Square Primitive

((E)) B

((F))

((Q))1_//For Graphics devices who do not support polygon as a whole _____ approach is used to draw
polygon

((A)) Trapizoid

((B)) Lines and Points

((C )) Rectangle

((D)) Lines and circles

((E)) B

((F))

((Q))1_//Polygon can be drawn as series of ______

((A)) Triangles

((B)) Rectangles

((C )) Squares

((D)) Trapizoids

((E)) D

((F))

((Q))1_// Operation code _____ is used to draw a polygon

((A)) 3 or greater

((B)) 3 or lesser

((C )) 2 or greater

((D)) N or lesser

((E)) A

((F))
((Q))1_//The devices which support polygons drawing primitive directly as Polygon shape, save the
polygon as a ____

((A)) Unit

((B)) Drawing

((C )) Rectangle

((D)) Square

((E)) A

((F))

((Q))1_//In one of the polygon representation ,Polygons are formed by two _____and two _____
((A)) Scan lines & Vertical Lines

((B)) Scan lines & Line segments

((C )) Vertical Lines & Line segments

((D)) Horizontal Lines & scan lines

((E)) B

((F))

((Q))1_//Scaling factor Sx in Viewing transformation is given by ____

((A)) (XVmax-XVmin)/(XWmax-XWmin)

((B)) (XWmax-XWmin)/(XVmax-Xvmin)

((C )) (XVmin-Xvmax)/(XWmax-XWmin)

((D)) (XVmin-Xvmax)/(XWmin-XWmax)

((E)) A

((F))

((Q))1_//Scaling factor Sy in Viewing transformation is given by ____

((A)) (YVmax-YVmin)/(YWmax-YWmin)

((B)) (YWmax-YWmin)/(YVmax-Yvmin)

((C )) (YVmin-Xvmax)/(YWmax-XWmin)
 ((D)) (XVmin-Xvmax)/(YWmin-YWmax)

((E)) A

((F))

((Q))1_//Scaling factor Sx in Viewing transformation is given by ____

((A)) Viewport X extent / Window Y extent

((B)) Window X extent / Viewport X extent

((C )) Viewport X extent / Window X extent

((D)) Viewport Y extent / Window X extent

((E)) C

((F))

((Q))1_//Scaling factor Sy in Viewing transformation is given by ____

((A)) Viewport X extent / Window Y extent

((B)) Viewport Y extent / Window Y extent

((C )) Viewport Y extent / Window x extent

((D)) Window Y extent / Viewport Y extent

((E)) B

((F))

((Q))1_//The mapping of the window (modeling coordinates) to viewport (device coordinates) is a 2D

((A)) windowing

((B)) viewing transformation

((C )) Window Transformation

((D)) None

((E)) B

((F))

((Q))1_//The clipping window is mapped into a

((A)) window
 ((B)) clipping window

((C )) world coordinates

((D)) viewport

((E)) D

((F))

((Q))1_//Representation of an object measured in some physical units

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) A

((F))

((Q))1_//Representation of a set of objects, all measured in the same physical units.

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) B

((F))

((Q))1_//The space within the image is displayed

((A)) Modelling Coordinate System

((B)) World Coordinate System

((C )) Screen Coordinate System

((D)) None

((E)) C
 ((F))

((Q))1_//The process of going from a window in world coordinates to a viewport in screen coordinates
((A)) windowing

((B)) viewing transformation

((C )) Window Transformation

((D)) None

((E)) B

((F))

((Q))1_//As the window increases in size, the image in the viewport_______ in size in viewing
transformation

((A)) increases

((B)) doubles

((C )) decreases

((D)) remains the same

((E)) C

((F))

((Q))1_//Maintain ______ size and position between clipping window and viewport in viewing
transformation.

((A)) equal

((B)) relative

((C )) non_relative

((D)) non-equal

((E)) B

((F))

((Q))1_//In viewing transformation maintain ______ size and______ between clipping window and
viewport

((A)) equal , position

 ((B)) non-equal, position

((C )) relative, position

((D)) un-equal , position

((E)) C

((F))

((Q))1_//In viewing transformation maintain relative size and ______ between clipping window and
viewport

((A)) window

((B)) viewport

((C )) position

((D)) none

((E)) C

((F))

((Q))1_//Maintain relative ____ and position between clipping window and viewport in viewing
transformation

((A)) viewport

((B)) size

((C )) window

((D)) none

((E)) B

((F))

((Q))1_//An area on a display device to which a window is mapped, defines where it is to be displayed
((A)) viewport

((B)) size

((C )) window

((D)) none

((E)) A
 ((F))

((Q))1_//In viewing transformation maintain relative size an position between clipping window and
viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Xv=

((A)) Xvmin +( Xw+Xwmin )Sx

((B)) Xvmin +( Xw-Xwmin )Sx

((C )) Xvmin -( Xw+Xwmin )Sx

((D)) Xvmin -( Xw-Xwmin )Sx

((E)) B

((F))

((Q))1_//In viewing transformation maintain relative size an position between clipping window and
viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Yv=

((A)) Yvmin +(Yw+Ywmin )Sx

((B)) Yvmin +( Yw-Ywmin )Sy

((C )) Xvmin -( Yw+Ywmin )Sx

((D)) Yvmin -( Yw-Xwmin )Sy

((E)) B

((F))

((Q))1_//In viewing transformation perform _____ transformation that scales the window area to the
size of the view port

((A)) translation

((B)) rotation

((C )) scaling

((D)) shear

((E)) C

((F))

((Q))1_//In viewing transformation perform scaling transformation that scales the _____ area to the size
of the ______
 ((A)) window, viewport

((B)) viewport, window

((C )) window, screen

((D)) screen, viewport

((E)) A

((F))

((Q))1_//In viewing transformation _____the scaled window area to the position of the viewport.
((A)) rotate

((B)) translate

((C )) shear

((D)) scale

((E)) B

((F))

((Q))1_//A window with 6 clipping boundaries can be considered under___ clipping.

((A)) Generalised

((B)) window

((C )) viewport

((D)) none

((E)) A

((F))

((Q))1_//In _____ clipping , cliiping routine can be performed along any line.

((A)) viewport

((B)) window

((C )) Generalised

((D)) none

((E)) C
 ((F))

((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.

((A)) horizontal

((B)) veritical

((C )) arbitrary

((D)) both horizontal & vertical

((E)) C

((F))

((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.

((A)) only horizontal

((B)) only veritical

((C )) arbitrary

((D)) both horizontal & vertical

((E)) C

((F))

((Q))2_//What will be the output set after clipping left and clipping right?

((A)) 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

((B)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((C )) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’

((E)) D

((F))

((Q))2_//What will be the input set for clipping left and clipping right respectively?

((A)) 1 2 3 4 6 7 8 9 10 11 and 1’ 2 3 4 6 7 8 9 10 11 11’

((B)) 1 2 3 4 6 7 8 9 10 11 and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

 ((C )) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (x,y) then remaining neighboring pixels

((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1)

((E)) A

((F))

((Q))2_//What will be input set to clipping top and clipping bottom respectively?

((A)) 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2

((B)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((C )) 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 1’ 2 3 4 6 7 8 9 10 11 11’ and 3’ 4’ 4 5’ 6’ 7 8 9 10 11 11’ 1’ 2

((E)) A

((F))

((Q))2_//What will be clipped polygon vertices?

((A)) 4’ 4 ‘5’ 6’ 7 7’ 8’ 9 9’ 10’ 11 11’ 1’ 2 3’

((B)) 1’2 3’ 4’4 5’6’ 7 7’8’ 9’ 10’ 11 11’

((C )) Both A and B

((D)) Neither A or B

((E)) C

((F))
((Q))2_//What will be the input set for clipping right and for clipping top respectively?

((A)) 1’ 2 3 4 6 7 8 9 10 11 11’ and 2 3 4 5’ 6’ 7 8 9 10 11 11’ 1’

((B)) 1 2 3 4 6 7 8 9 10 11 11’ and 1’2 3 4 5’ 6’ 7 8 9 10 11 11’

((C )) 1’ 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((D)) 1 2 3 4 6 7 8 9 10 11 11’ and 1 1’ 2 3 4 6 7 8 9 10 11 11’

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). Whether a point at (5,50) is visible or not?

((A)) Visible

((B)) Partially Visible

((C )) Completely Exterior

((D)) None of the above

((E)) C

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). Whether a point at (75,90) is visible or not?

((A)) Visible

((B)) Partially Visible

((C )) Completely Exterior

((D)) None of the above

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). What is the outcode of point (150,50)?

((A)) 10

((B)) 1000
 ((C )) 100

((D)) 110

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). What is the outcode of point (75,250)?

((A)) 110

((B)) 100

((C )) 0

((D)) 1000

((E)) D

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (75,90). What will be the outcodes associated
with line segment?

((A)) 0110, 0000

((B)) 0001, 0000

((C )) 0000, 0010

((D)) 0000,1000

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). A line has end coordinates as (50,5) and (150,50). What will be the outcodes
associated with line segment?

((A)) 0100 , 0010

((B)) 0001, 0000

((C )) 0000, 0010

 ((D)) 0010, 0110

((E)) A

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (10,10) and Upper Right
Corner (100,100). A line has end coordinates as (50,5) and (150,50). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (75,90). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) B

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (25,50) and (175,190). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

 ((E)) A

((F))

((Q))2_//A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has
end coordinates (40,15) and (75,45). What will be the end points of clipped line? Use Cohen –
Sutherland Outcode Algorithm.

((A)) (23.67,50) and (69.06,40)

((B)) (50,23.67) and (69.06, 40)

((C )) (50,23.67) and (40,69.06)

((D)) None of Above

((E)) B

((F))

((Q))2_//A clipping window has coordinates as A (50, 10), B (80, 10), C (80, 40), D (50, 40). A line
segment has end coordinates (70, 20) and (100, 10). What will be the end points of clipped line? Use
Cohen – Sutherland Outcode Algorithm.

((A)) (80, 16.66)

((B)) (80, 16.66) and (20, 70)

((C )) (80, 16.66) and (70, 20)

((D)) (16.66, 80) and (70, 20)

((E)) C

((F))

((Q))2_//Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left
corner at (-8, -4) and upper right corner at ( 12,8). What will be the end points of clipped line? Use
Cohen – Sutherland Outcode Algorithm.

((A)) (-8,6) and (2,8)

((B)) (-8,6) and (8,2)

((C )) (6,-8) and (2,8)

((D)) (8,-6) and (8,2)

((E)) A
 ((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (5,50) and (15,150). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) C

((F))

((Q))2_//Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right
Corner (200,200). A line has end coordinates as (0,10) and (250,15). The given line segment is
___________. Use Cohen – Sutherland Outcode Algorithm.

((A)) Completely Visible

((B)) Partially Visible

((C )) Completely Invisible

((D)) None of Above

((E)) C

((F))

((Q))2_//A rectangular clipping window whose lower left corner is at (-3,1) and upper right corner is at
(2,6). If line segment has end coordinates (-4,2) and (-1,7). What will the end coordinates of clipped line
(use Cohen – Sutherland Outcode Algorithm)

((A)) (-3, 11/3) and (-8/5, 6)

((B)) (3/11, -3) and ( -5/8, 6)

((C )) (-3, 3/11) and (-8/5,6)

((D)) (-11/3, 3) and (-6, 8/5)

((E)) A

((F))
((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factor Sx =

((A)) 0.25

((B)) 0.125

((C )) 4

((D)) 0.5

((E)) A

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factor Sy =

((A)) 0.25

((B)) 0.125

((C )) 4

((D)) 0.5

((E)) B

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (1,1) and
upper right corner at (3,5) to a view point with lower left corner at (0,0) and upper right corner
at(1/2,1/2) .Scaling factors Sx =___ & Sy =___

((A)) 0.25 & 0.125

((B)) 0.125 & 0.25

((C )) 4&8

((D)) 0.5 & 1

((E)) A

((F))
((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factor Sx =___

((A)) 0.25

((B)) 0.125

((C )) 0.5

((D)) 4

((E)) A

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factor Sy=___

((A)) 0.25

((B)) 0.125

((C )) 0.5

((D)) 4

((E)) B

((F))

((Q))2_//In normalization transformation for window to viewport, window is lower left corner (2,2) and
upper right corner at (6,10) to a view point with lower left corner at (0,0) and upper right corner at(1, 1)
.Scaling factors Sx =___ & Sy= ___

((A)) 0.25 & 0.5

((B)) 0.25 & 0.125

((C )) 0.5 & 0.25

((D)) 0.125 & 0.25

((E)) B

((F))
((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factors Sx=
((A)) (1/18)

((B)) (1/16)

((C )) 18

((D)) 16

((E)) A

((F))

((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factor Sy=
((A)) (1/18)

((B)) (1/16)

((C )) 18

((D)) 16

((E)) B

((F))

((Q))2_//In viewing from a window in world coordinates with x extent 3 to 12 & y extent 2 to 10 onto a
viewport with x extent ¼ to 3/4and y extent 0 to ½ in normalized device space .Scaling factor Sx= & Sy =
___

((A)) 1/18 & 16

((B)) 1/16 & 1/18

((C )) 18 & 1/16

((D)) 1/18 & 1/16

((E)) D

((F))

((Q))2_//In 8 connected region if one pixel is (x,y) then remaining neighboring pixels are
((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)
 ((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1)

((E)) A

((F))

((Q))2_//In 4 connected region if one pixel is (x,y) then remaining neighboring pixels are
((A)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((B)) (x+1, y ) (x-1,y) (x,y+1) (x,y) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((C )) (x-1,y-1) (x-1, y+1) (x+1, y-1) (x+1, y+1)

((D)) (x+1, y ) (x-1,y) (x,y+1) (x,y-1)

((E)) D

((F))

((Q))2_//‘Scan-line coherence ‘ means

((A)) If a pixel on a scan line lies within a polygon, pixels near it will most likely lie within the
polygon

((B)) If edge of the polygon intersects a given polygon , pixels near it will most likely lie within
the polygon

((C )) If a pixel on a edge lies within a polygon, pixels near it will most likely lie within the
polygon

((D)) None of above

((E)) A

((F))

((Q))2_//The function of scan line polygon fill algorithm are

((A)) Find intersection point of the boundary of polygon and scan line

((B)) Find intersection point of the boundary of polygon and point

((C )) Both a & b

((D)) None of these

((E)) A
 ((F))

((Q))2_//In scan line algorithm, using Edge coherence property the next incremental x-intersection(xs+1)
can be calculated as: ------------Note: Xs is the previous x-intersection.

((A)) xs+1= xs + m

((B)) xs+1= xs + 1

((C )) xs+1= xs + 1/m

((D)) xs+1= xs + m/2

((E)) C

((F))

((Q))2_//In scan line algorithm, Let an edge is represented by Formula y = mx + b and for scan_line s
value of y = s. What will be the Xs ? Note : Scan line is intersecting with edge at (s,Xs)

((A)) Xs = (s-b)+m

((B)) Xs = (s-b)

((C )) Xs = (s-b)/m

((D)) Xs = (s-b)*m

((E)) C

((F))

((Q))2_//In winding number method if net winding is --------then point is outside otherwise it is inside.
((A)) Odd

((B)) Two

((C )) One

((D)) zero

((E)) D

((F))

((Q))2_//In winding number method if net winding is zero then point is ---------- otherwise it is inside.
((A)) outside

((B)) Inside
 ((C )) colorful

((D)) None of above

((E)) A

((F))

((Q))2_//In winding number method if net winding is non-zero then point is --------.

((A)) outside

((B)) Inside

((C )) colorful

((D)) None of above

((E)) B

((F))

((Q))2_//what will be the intersection points for current scan line as shown in figure using scan line
polygon filling algorithm

((A)) (p0,p1,p2,p3)

((B)) (p0,p1, p1,p2,p3)

((C )) (p0,p1,p2,p3, p3)

((D)) (p0, p3)

((E)) A

((F))

((Q))2_//What will be the intersection points for current scan line as shown in figure using scan line
polygon filling algorithm.

((A)) (p0 ,p0,p1,p1,p2)

((B)) (p0,p1,p2)

((C )) (p0,p2)

((D)) (p0,p1,p1,p2)

((E)) D
 ((F))

((Q))2_//In 4 connected region if one pixel is (2,3) then remaining neighboring pixels are
((A)) (3, 3 ) (1,3) (2,4) (2,2) (1,2) (1, 4) (3,2) (3, 4)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (3, 3 ) (1,3) (2,4) (2,2)

((E)) D

((F))

((Q))2_//In 8 connected region if one pixel is (3,2) then remaining neighboring pixels are
((A)) (2, 2 ) (4,2) (3,3) (3,1) (4,3) (4,1) (2,3) (2, 1)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (2, 2 ) (4,2) (3,3) (3,1)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (2,3) then remaining neighboring pixels are
((A)) (1, 3 ) (3,3) (2,4) (2,2) (3,4) (3,2) (1,4) (1, 2)

((B)) (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (2, 2 ) (4,2) (3,3) (3,1)

((E)) A

((F))

((Q))2_//If one edge of the polygon has end coordinates (10,20) and (15,40) and current scan line is
scanning at y=25. What will be the intersection point?

((A)) (11.2,25)

((B)) (12,25)

((C )) (12.2,25)
 ((D)) (25,11.2)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (5,3) then remaining neighboring pixels are
((A)) (6, 3 ) (4,3) (5,4) (5,2) (6,4) (6,2) (4,4) (4, 2)

((B)) (6, 3 ) (1,1) (2,4) (2,2) (6,2) (1, 4) (3,3) (3, 4)

((C )) (3, 3 ) (6,2) (2,3) (2,2)

((D)) (2, 2 ) (6,2) (6,3) (3,1)

((E)) A

((F))

((Q))2_//In 8 connected region if one pixel is (5,5) then remaining neighboring pixels are
((A)) (2, 2 ) (6,2) (6,3) (3,1)

((B)) (6, 3 ) (1,1) (2,4) (2,2) (6,2) (1, 4) (3,3) (3, 4)

((C )) (3, 3 ) (6,2) (2,3) (2,2)

((D)) (6, 5 ) (4,3) (5,6) (5,4) (6,6) (6,4) (4,6) (4, 4)

((E)) D

((F))

((Q))2_//In 4 connected region if one pixel is (3,3) then remaining neighboring pixels are
((A)) (3, 3 ) (1,3) (2,4) (2,2)

((B)) (2,2) (1, 4) (3,2) (3, 4)

((C )) (3, 3 ) (1,2) (2,3) (2,2)

((D)) (4, 3 ) (2,3) (3,4) (3,2)

((E)) D

((F))

((Q))2_//In 4 connected region if one pixel is (5,5) then remaining neighboring pixels are
((A)) (3, 3 ) (6,3) (2,4) (2,2)

((B)) (2,2) (5, 4) (3,2) (6, 4)

 ((C )) (3, 3 ) (4,2) (2,3) (2,2)

((D)) (6, 5 ) (4,5) (5,4) (5,6)

((E)) D

((F))

((Q))2_//In scan line polygon filling algorithm for current scan line the x-intersections got are
20,10,50,30. How pairing will be formed?

((A)) (10,20)and (30,50)

((B)) (10,20)and (20,30)and (30,50)

((C )) (20,10)and (10,50)

((D)) (20,10)and (10,50)and (50,30)

((E)) A

((F))

((Q))2_//In scan line polygon filling algorithm for current scan line the x-intersections obtained are
20,10,50,30. How these x-intersections are stored in intersection array?

((A)) (10,20,30,50)

((B)) (20,10,50,30)

((C )) (50,30,20,10)

((D)) (10,50,20,30)

((E)) A

((F))

((Q))2_//One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the
ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 12. What will
be the x-value of the intersection point of the scan line in i+1 th step?

((A)) 12.2

((B)) 12.5

((C )) 13

((D)) 13.5
 ((E)) A

((F))

((Q))2_//One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the
ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 14. What will
be the x-value of the intersection point of the scan line in i+1 th step?

((A)) 16.2

((B)) 14.2

((C )) 16.2

((D)) 14.2

((E)) D

((F))

((Q))2_//In winding number method , constructed horizontal line between point Q and point P intersects
two edges of the polygon with winding no. +1 and -1. Tell whether point Q is inside or outside and what
is the net winding ? Note : Q is the point to be tested for inside test.P is point outside the polygon.
((A)) Outside , zero

((B)) Inside , zero

((C )) Outside , nonzero

((D)) Inside , nonzero

((E)) A

((F))

((Q))2_//In winding number method , constructed horizontal line between point Q and point P intersects
edge of the polygon with winding no. +1 . Tell whether point Q is inside or outside and what is the net
winding ? Note : Q is the point to be tested for inside test. P is point outside the polygon.
((A)) Outside , zero

((B)) Inside , zero

((C )) Outside , nonzero

((D)) Inside , nonzero

((E)) D

((F))
UNIT (I-II)
MCQ
 Image is stored as set of command in
 A)Raster Display
 B) vector Display
 C) LCD
 D) Plasma panel
B
 VGA stands for
 A) video graphics Array
 B) visual graphics Array
 C) video graphics Adapter
 D) volatile graphics Array
A
 A shadow mask has ------dots at each pixel
 A) 1
 B) 2
 C) 3
 D)4
A
 Which of the following command is used to switch mode
from text to graphics in graphcis
 A) closegraph
 B) initgraph
 C) restorecrtmode
 D) cleardevice
C
 Flickering effect related to
 A) Aspect ratio
 B) Resolution
 C) Refresh Rate
 D) moving
C
 Which of following is not true with plotter
 A) needs less computer memory
 B) modification to image is not easy
 C) It allows selective erasing
 D) It is slower that DVST
C
 Plasma panel is good example of
 A) emissive display
 B)non-emmisive display
 C) Both A & B
 D) All of Aobe
A
 Aspect ratio is defined with
 A) ratio in between Width to height
 B) ratio in between height to Width
 C) height
 D) width
A
 The fluorescence is
 A) the light given off by phosphor during exposure to beam
 B) the light given off by shadow during exposure to beam
 C) moving picture
 D) none of above
A
 In ---- each character is displayed as group of dots
 A) graphics
 B) Text
 C) Character
 D) None
A
 In sharp slope of a line
 A) move along y axis and find corrosponding x axis
 B) move along x axis and find corrosponding y axis
 C) move along y axis and find corrosponding z axis
 D) All of above
A
 Character styles are generated by
 A) stroke method
 B) starbust method
 C) bit map
 D) All of Above
A
 In polar coordinate system x can find if radius is r
 A) X=r (CosΘ)
 B) X=r (tanΘ)
 C) X=r (sinΘ)
 D) All of Above
A
 How many pixel will be there for line (10,10),(20,20)
 A)10
 B)11
 C).9
 D)20
B
 In bresenham line the decision parameter is
 A) G=2*dy-dx
 B)G=2*dx-dy
 C) G=2*(dx-dy)
 D) G=2*dx-2dy
A
 The various form of distortion is called as
 A)alising
 B)Antialising
 C)Filtering
 D) scanning
A
 In bresenham mid-point circle decision parameter
 A)3-2r
 B)1-r
 C)5/4-r
 D) r
A
 Which is false for DDA
 A) deals with floating
 B)error can be introduced in calculating point
 C) easy to understand
 D) it is faster consuming less cpu power
D
 For midpoint algorithm for circle if pk<0
 A) midpoint is inside circle boundary
 B) midpoint is outside circle boundary
 C) midpoint is on circle boundary
 D) midpoint is inside circle boundary
A
 In picket fens if distance between picket is adjsuted
keeping length constant called as
 A) local alising
 B) Global Alising
 C).Pixel Alising
 D) All of Above
B
 In picket fens problem to maintain equal length distance between
picket distort termed as
 A) Local Alising
 B) Global Alising
 C) Pixel Alising
 D) Non of Above
A
 In starbust method
 A) a fix pattern of line is used to display the characters
 B) a fix pattern of circle is used to display the characters
 C) used line segment to highlight character
 D) Both A & C
D
 The basic attributes of a straight line segment are
A) Type
B) Width
C) Color
D) All of these
D
 A dashed line could be displayed by generating_____
A) Inter dash spacing
B) Very short dashes
C) Botha a and b
D) A or BB
A
 Which of the following is not a line-type?
a) Dashed line
b) Dark line
c) Dotted line
d) Only b
D
 In Bresenham's algorithm, while generating a circle , it is
easy to generate?
 A). One octant first and other by successive reflection
 B). One octant first and other by successive rotation
 C). One octant first and other by successive translation
 D).All octants
A
 Which of the following technique is used in Midpoint
Subdivision algorithm ?
 Linear search
 Binary search
 Heap sort
 Bubble sort
B
 The phenomenon of having a continuous glow of a beam on
the screen even after it is removed is called as ?
 A). Fluorescence
 B) Persistence
 C) Phosphorescence
 D) Incandescence
B
. Interactive computer graphics uses various kind of
input devices such as
a) Mouse
b) Graphic tablet
c) Joystick
d) All of these
Answer: d
. Input function are used for
a) Control the data flow from these interactive devices
b) Process the data flow from these interactive devices
c) Both a & b d) None of these
Answer: c
.A graphics package contains
a) No of housekeeping task such as clearing a display
screen
b) No of housekeeping task such as initializing
parameters
c) Both a & b d) None of these
Answer: c
.The interactive computer graphics involves________
way communication b/w computer and the user
a) One b) Two
c) Three d) four
Answer: b
.Which one is the basic input device in GUI
a) Mouse
b) Graphics tablet
c) Voice system
d) Touch panel
Answer: a
. Which of the following is the basic attribute of a
character?
a) Font b) Size and color
c) Orientation d) All the above
Answer: d
. Attribute can be set for
a) Entire character strings
b) Individual characters defined as marker symbol
c) Neither a nor b
d) Both a and b
Answer: d
. The Character size is specified by
a) Printers b) Compositors
c) Frame buffer d) Both a and b
Answer: a
. Which devices provides positional information to the
graphics system ?
a) Input devices b) Output devices
c) Pointing devices d) Both a and c
Answer: d
. The number of pixels stored in the frame buffer of a
graphics system is known as
a) Resolution b) Depth
c) Resalution d) Only a
Answer: d
. In graphical system, the array of pixels in the picture
are stored in
a) Memory
b) Frame buffer
c) Processor
d) All the above
Answer: a
. Heat supplied to the cathode by directing a current
through a coil of wire is called
a) Electron gun b) Electron beam
c) Filament d) Anode and cathode
Answer: c
.The maximum number of points that can be displayed
without overlap on a CRT is referred as
a) Picture b) Resolution
c) Persistence d) Neither b nor c
Answer: b
. In which system, the Shadow mask methods are
commonly used
a) Raster-scan system b) Random-scan system
c) Only b d) Both a and b

Answer: a
.The primary output device in a graphics system
is_________
a) Scanner b) Video monitor
c) Neither a nor b d) Printer
Answer: b
.On a black and white system with one bit per pixel, the
frame buffer is commonly called as
a) Pix map b) Multi map
c) Bitmap d) All the above
Answer: c
.Types of computer graphics are
a) Vector and raster b) Scalar and raster
c) Vector and scalar d) None of these
Answer: a
. User can make any change on image with the use of
a) Non-interactive graphics
b) Interactive graphics
c) Both a & b
d) None of these
Answer: b
.The application area of computer graphics are
a) Entertaintment
b) Education and textbook
c) CAD and entertainment
d) All of these
Answer: d
.CAD means
a) Car aided design
b) Computer art design
c) Computer aided design
d) None of these
Answer: c
.What are the components of Interactive computer
graphics
a) A digital memory or frame buffer
b) A television monitor
c) An interface or display controller
d) All of these
Answer: d
. A display controller serves to pass the contents of
a) Frame buffer to monitor
b) Monitor to frame buffer
c) Both a & b
d) None of these
Answer: a
.To store black and white images ,black pixels are
represented by________ in the frame buffer and
white pixels by_______
a) Zero and one b) One and Zero
c) Both a & b d) None of these
Answer: b
.The display controller converts 0s and 1s into_______
a) TV monitor
b) Video signal
c) Electronics signal
d) None of these
Answer: b
. The image can be transmitted to the display point
by________
a) Line b) Segment
c) Point d) None of these
Answer: c
.Which graphics application provides a proper
dialogue box to help the user
a) MS excel
b) MS Paint
c) MS word
d) None of these
Answer: b
.The area of computer that is captured by an
application is called
a) Window b) View port
c) Display d) None of these
Answer: a
.A basic interactive picture construction technique are
a) Positioning and pointing, constraints
b) Grid, gravity field, rubber band method
c) Sketching, dragging, inking and painting
d) All of these
Answer: d
.The movement of different attributes of image would
make the image dynamic and such a dynamic effect is
termed as ________
a) Picture b) Animation
c) Painting d) None of these
Answer: b
.Which method are used to get and set the position of a
pixel, object or text in active area of a desktop
a) Drugging method
b) Basic positioning method
c) Sketching method
d) Gravity field method
Answer: b
.The division displayed on screen into row and
columns is known as
a) Rubber band method
b) Gravity field
c) Dragging
d) Grid
Answer: d
.The function of a plotter is like a
a) Monitor b) Projector
c) Printer d) None of these
Answer: c
.Joystick are often used to control
a) Typing b) Video games
c) Voice d) None of these
Answer: b
.The functioning of a light pen is similar to mouse
except that
a) User can move the pointer
b) User can select objects on the display screen by
pointing to object with the pen
c) Both a & b
d) None of these
Answer: c
.Color depth can be defined by ________ which can be
displayed on a display unit
a) Bits per pixel
b) Bytes per pixel
c) Megabyte per pixel
d) None of these
Answer: a
.The resolution of raster scan display is
a) Low b) High
c) Medium d) None
Answer: a

.Raster scan is _______ expensive than random scan

a) More b) Less
c) Both a & b d) None
Answer: b
. What is name of temporary memory where the graphics
data is stored to be displayed on screen
a) RAM
b) ROM
c) Frame buffer
d) None
Answer: c
. Horizontal retrace used in
a) raster scan system
b) random scan system
c) both
d) None
Answer: a
. Swapping is
a) using horizontal and vertical retrace
b) using vertical retrace only
c) using vertical retrace
d) None of these
Answer: a
. Pitch length is
a) distance of beam from focusing system to screen.
b) distance of beam from deflection system to screen.
c) distance of beam from control grids to screen.
d) None
Answer: a
Brightness in raster system is controlled by
a) applying +ve voltage to control grid
b) applying -ve voltage to control grid
c) applying +ve voltage to focusing system
d) applying -ve voltage to focusing system
Answer: b
 DDA Algorithm is
 A) Incremental Algorithm
 B) Is based assumption that x-value changes in y
value
 C) It never uses slope
 D ) It uses midpoint to find next find.
A
 Midpoint line Algorithm is
 A) Incremental Algorithm
 B) Is based assumption that x-value changes in y
value
 C) It never uses slope
 D ) It uses midpoint to find next find.
D
 Genetle slope
 A) a slope where rows are more than column.
 B) a slope where rows are less than column
 C) a slope where rows and column are same.
 D) none of above
A
 Steep slope
 A) a slope where rows are more than column.
 B) a slope where rows are less than column
 C) a slope where rows and column are same.
 D) none of above
B
 A slope of line is
 A)change in x with respect to change in y.
 B)a ratio between change in x with change in y
 C) a ratio between change in y with chage in x.
 D) change in y with respect to change in x
C
 Equation of line is
 A) y=mx+c
 B)x= my+c
 C)m=x+y.
 D)all of above
A
 the term ∆x is equal to
 A) x+1
 B) x-1
 C) x+2.
 D) both A & B
D
 For simpl DDA line drawing algorithm
 A)|dx| > |dy| can be used.
 B) | dy | > |dx | can be used
 C) |dx| == |dy| can be used
 D) all of above
A,B
 the term ∆y is equal to
 A) y+1
 B) y-1
 C) y+2.
 D) both A & B
D
 A vector is
 A) direction
 B) length
 C) two direction
 D) both A & B
D
 The process of turning on pixel for a line segment is
 A) vector generation
 B) line generation
 C) pixel generation
 D) either A or B
D
 The line draw with line drawing algorithm has
 A) constant brightness
 B) change in brightness
 C) change in line color
 D) all of above
A
 The hoiozontal and vertical line drawn by algo is
 A) straight
 B) zigzag
 C)curved
 D) all of above
A
 The end point accuracy of DDA is
 A) good
 B) poor
 C) best
 D) better
B
 The value of initial decision parameter of Bresenham’s
line drawing algorithm is
 A) 2∆Y+∆X
 B) 2∆Y-∆X
 C) -2∆Y+∆X
 D) -2∆Y-∆X
A
 The value of initial decision parameter of mid-point
circle drawing algorithm is
 A) 3-2r
 B) 1-2r
 C) 5/4-r
 D) 1-r
Both C and D
 The antilalizing technique where pixel is shifted by
½ ,1/4 , by closer path is called
 A) pixel phasing
 B) filtering
 C) intensity compression
 D) sampling
A
 Pixel phasing is
 A) based on software
 B) Based on Hardware
 C) used both hardeware and software
 D) All of Above
B
 Algorithm that used value of previous output is
 A) Incremental
 B) Mid point
 C) either Incremetal or Mid point
 D) All of Above
A
 Sign function makes DDA line algorithm works in
 A) I and II quadrant
 B) I and III quadrant
 C) II and III quadrant
 D) All quadrants
D
 The DDA Algorithm is
 A) based on brightness
 B) Based on length
 C) Based on orientation
 D) based on display
C
 The brightness is depends on
 A) based on brightness
 B) Based on length
 C) Based on orientation
 D) based on display
C
 Alising effect is
 A) stair case effect
 B) shading
 C) rendering
 D) All of Above
A
 If two points used to generate a line then equation of
line is given by
 A) x-x1/y-y1 = y2-y1/x2-x2
 B) y2-y1/x2-x2= x-x1/y-y1
 C) y-y1/x-x1= y2-y1/x2-x1
 D) y2-x1/x2-x2= y-x1/y-y1
C
 If two points are parallel, they have
 A) constant slope
 B) same slope
 C) different slope
 D) zero slope
B
 If two points are horizontal , they have
 A) constant slope
 B) same slope
 C) different slope
 D) zero slope
D
 The algorithm which displays line-type attributes by
plotting pixel spans is
-a) Raster line algorithm
-b) Raster scan algorithm
-c) Random line algorithm
-d) Random scan algorithm
A
 A line drawn in the background color is
a) Visible
b) Invisible
c) Visible or Invisible
d) Only b
D
. Interactive computer graphics uses various kind of input
devices such as
a) Mouse
b) Graphic tablet
c) Joystick
d) All of these
Answer: d
. Input function are used for
a) Control the data flow from these interactive devices
b) Process the data flow from these interactive devices
c) Both a & b d) None of these
Answer: c
.A graphics package contains
a) No of housekeeping task such as clearing a display
screen
b) No of housekeeping task such as initializing
parameters
c) Both a & b d) None of these
Answer: c
.The interactive computer graphics involves________
way communication b/w computer and the user
a) One b) Two
c) Three d) four
Answer: b
.Which one is the basic input device in GUI
a) Mouse
b) Graphics tablet
c) Voice system
d) Touch panel
Answer: a
6. Which of the following is the basic attribute of a
character?
a) Font b) Size and color
c) Orientation d) All the above
Answer: d
. Attribute can be set for
a) Entire character strings
b) Individual characters defined as marker symbol
c) Neither a nor b
d) Both a and b
Answer: d
. The Character size is specified by
a) Printers b) Compositors
c) Frame buffer d) Both a and b
Answer: a
. Which devices provides positional information to the
graphics system ?
a) Input devices b) Output devices
c) Pointing devices d) Both a and c
Answer: d
. The number of pixels stored in the frame buffer of a
graphics system is known as
a) Resolution b) Depth
c) Resalution d) Only a
Answer: d
. In graphical system, the array of pixels in the picture are
stored in
a) Memory
b) Frame buffer
c) Processor
d) All the above
Answer: a
. Heat supplied to the cathode by directing a current through
a coil of wire is called
a) Electron gun b) Electron beam
c) Filament d) Anode and cathode
Answer: c
.The maximum number of points that can be displayed
without overlap on a CRT is referred as
a) Picture b) Resolution
c) Persistence d) Neither b nor c
Answer: b
. In which system, the Shadow mask methods are
commonly used
a) Raster-scan system b) Random-scan system
c) Only b d) Both a and b

Answer: a
.The primary output device in a graphics system
is_________
a) Scanner b) Video monitor
c) Neither a nor b d) Printer
Answer: b
.On a black and white system with one bit per pixel, the
frame buffer is commonly called as
a) Pix map b) Multi map
c) Bitmap d) All the above
Answer: c
.Types of computer graphics are
a) Vector and raster b) Scalar and raster
c) Vector and scalar d) None of these
Answer: a
. User can make any change on image with the use of
a) Non-interactive graphics
b) Interactive graphics
c) Both a & b
d) None of these
Answer: b
.The application area of computer graphics are
a) Entertaintment
b) Education and textbook
c) CAD and entertainment
d) All of these
Answer: d
.CAD means
a) Car aided design
b) Computer art design
c) Computer aided design
d) None of these
Answer: c
.What are the components of Interactive computer
graphics
a) A digital memory or frame buffer
b) A television monitor
c) An interface or display controller
d) All of these
Answer: d
. A display controller serves to pass the contents of
a) Frame buffer to monitor
b) Monitor to frame buffer
c) Both a & b
d) None of these
Answer: a
.To store black and white images ,black pixels are
represented by________ in the frame buffer and
white pixels by_______
a) Zero and one b) One and Zero
c) Both a & b d) None of these
Answer: b
.The display controller converts 0s and 1s into_______
a) TV monitor
b) Video signal
c) Electronics signal
d) None of these
Answer: b
. The image can be transmitted to the display point
by________
a) Line b) Segment
c) Point d) None of these
Answer: c
.Which graphics application provides a proper
dialogue box to help the user
a) MS excel
b) MS Paint
c) MS word
d) None of these
Answer: b
.The area of computer that is captured by an
application is called
a) Window b) View port
c) Display d) None of these
Answer: a
.A basic interactive picture construction technique are
a) Positioning and pointing, constraints
b) Grid, gravity field, rubber band method
c) Sketching, dragging, inking and painting
d) All of these
Answer: d
 The origin of computer graphics was developed in
 a) 1950
 b) 1960
 c) 1970
 d) 1990
 Answer: a
 In DDA algo. Case |m|≤1:
 yi+1 = yi + y/ x & xi+1 = xi + 1
 yi+1 = yi + y/ x & xi+1 = xi – 1
 yi+1 = yi -y/ x & xi+1 = xi + 1
 yi+1 = yi - y/ x & xi+1 = xi - 1
 In DDA algo. Case |m|>1 1:
 xi+1 = xi - x/ y and yi+1 = yi + 1
 xi+1 = xi + x/ y and yi+1 = yi + 1
 xi+1 = xi - x/ y and yi+1 = yi – 1
 xi+1 = xi -x/ y and yi+1 = yi - 1
 Answer:B
 A simple closed figure in a plan fromed with three or more
line segments.
 A. Polygon
 B. Quadralatiral
 C. Regular Polygon
 D. Nonagon
 The process of filling an area with rectangular pattern is
called
a) Tiling
b) Linear fill
c) Tint-fill
d) Soft-fill
 The algorithm which repaints an area that was originally
painted by merging a foreground color F and background
color B where F!=B©
 a) Tint fill
 b) Flood fill
 c) Linear soft-fill
 d) Boundary fill
 4 way connected fills
 Boundary pixel
 It fills 4 neighbor pixel using stack
 It fills diagonal pixels
 None of above
 The chain of connected line segment is called
 Polygon
 Polyline
 Ploy segment
 All of Above
 A polygon in which line segment joining any two point
withing the ploygon lies completely inside the polygon
called as
 Convex
 Concave
 Hybrid
 Closed
 A polygon in which line segment joining any two point
within the polygon not lies completely inside the polygon
called as
 Convex
 Concave
 Hybrid
 Closed
 ----- is a method to test point is inside or outside of a
polygon
 Inside out side
 Winding no
 Both above
 None of these
 ----- is a basic approach to fill a polygon
 Seed fill
 Scan fill
 Both of above
 None of thses
 The seed fill categorized as
 A) Flood fill
 B) Boundry fill
 C) Even odd fill
 D) 4 way or 8 way
 E) Both A & B
 The polygon that fills interior of polygon called as
 Flood fill
 Boundary fill
 Winding no
 All of above
 Seed fill is a ----- alogirth
 Recursive
 Non-recursive
 Both of above
 None
 Polygon filling uses ……data structure
 Stack
 Queue
 Heap
 Tree
 The basic primitive of polygon are
 Line
 Pixel
 Color/intensity
 All of above
 Basic approaches of polygon are
 Primitive
 Trapezoidal
 Line and point
 All of above
 Scan line considers
 Moving from Ymax to Ymin by decrementing 1unit
 Moving from Xmax to Xmin by incrementing 1unit
 Finding shortest of Xmax or Ymax and decrement by 1 unit
 All of Above
 The object seen in which it is defined as
 Screen co-ordinate
 World co-ordinate
 Device co-ordinate
 Normal co-ordinate
 -- method used to fill interior of polygon is
 4 way 8 way
 8 way 12 way
 12 way 4 way
 All of above
 In scan line filling intersection is find by
 Xnew=Xold+1/slope, Ynew=Yold-1
 Xnew=Xold-1/slope, Ynew=Yold+1
 Xold=Xnew-1/slope, Ynew=Yold-1
 Xnew=Yold-1/slope,Xnew=Yold-1
 In winding no method if sum is zero point is
 In
 Out
 Both in and out
 All of above
 In winding no method if sum is non-zero point is
 In
 Out
 Both in and out
 All of above
 --- algorithm uses half scan line
 Scan line fill
 Flood fiil
 Fense fill
 Boundry fill
 ---- algorithm uses complement pixel logic
 Scan line fill
 Flood fiil
 Fense fill
 Boundry fill
 Which polygon uses geometry level filling
 Scan line fill
 Flood fiil
 Fense fill
 Boundry fill
 Which polygon filled by pixel level
 Scan line fill
 Flood fiil
 Boundry fill
 Both B & C
 Adjacent pixel has same characteristics is called as
 Coherance
 Special case
 Property of coherance
 Spatial coherance
 Scan line fill uses --- property to edge
 Coherance
 Line
 Point
 All of above
 Active edge list is with
 Scan line fill
 Polygon traversal
 Fense fill
 All of above
 The co-ordinate of size 1 X 1 is
 Screen co-ordinate
 World co-ordinate
 View reference plane
 All of above
 The workstation transformation is
 Transforming image from normlized co-ordinate to view
port
 Transforming image from view port to normlized co-
ordinate
 Transforming image from world co-ordinate to view port
 Transforming image from normlized co-ordinate to world
co-ordinate
 Viewing transformation is
 Mapping from world to device co-ordinate system
 Mapping image from normlized co-ordinate to view port
 Mapping image from view port to normlized co-ordinate
 Mapping image from world co-ordinate to view port
 Viewing transformation involves
 Translation
 Scaling
 Roatation
 All of above
 The mathematical representaion of world co-ordinate to
view port transformation is
 Mwc,vc=R.T
 Mwc,vc=S.T
 Mwc,vc=R.S
 Mwc,vc=S.R
 The mathematical representation of workstation
transformation is
 Mnc,vc=T.S.R
 Mnc,vc=T.S.T-1
 Mnc,vc=T.R.S
 Mnc,vc=S.R
 The net winding is
 Sum of winding no
 Sum of vertices
 Sum of edges
 None of above
 In winding no method
 If the line starts below the crossing line and ends above
crossing line then assign it -1
 If the line starts above the crossing line and ends below
crossing line then assign it +1
 If the line starts above the crossing line and ends below
crossing line then assign it -1
 If the line starts below the crossing line and ends above
crossing line then assign it +1
 The process where the pattern gets mapped with
respective to the polygon termed as-----
 Anchoring
 Tilling
 Rolling
 scaling
  The process which divides each element of the picture into
its visible and invisible portions, allowing the invisible
portion to be discarded is called__?
 clipping
 Windowing
 both a and b
 Projecting
 Answer: A

25/01/2017 Sinhgad Academy of Engineering, Kondhwa(Bk)

  The region against which an object is to be clipped is
called__?

 clip window or clipping window

 Drawing window
 image window
 both b and c
 Answer: A

25/01/2017 Sinhgad Academy of Engineering, Kondhwa(Bk)

  The region code 0000 represents the__?
 viewing window
 left clipping window
 right clipping window
 bottom clipping window
 Answer: A

25/01/2017 Sinhgad Academy of Engineering, Kondhwa(Bk)

  A method used to test lines for total clipping is equivalent
to the__?
 logical XOR operator
 logical OR operator
 logical AND operator
 both a and b
 Answer: C

25/01/2017 Sinhgad Academy of Engineering, Kondhwa(Bk)

  A method used to test lines for total clipping is equivalent
to the__?
 logical XOR operator
 logical OR operator
 logical AND operator
 both a and b
 Answer: C

25/01/2017 Sinhgad Academy of Engineering, Kondhwa(Bk)

  A polygon in which the line segment joining any 2 points
within the polygon may not lie completely inside the
polygon is called __?
 convex polygon
 concave polygon
 both a and b
 Hexagon
 Answer: B

25/01/2017 Sinhgad Academy of Engineering, Kondhwa(Bk)

 CG – Computer graphics
Unit 1
MCQs
1. In vector displays beam is deflected from the endpoint to endpoint and the technique is
called________.
A) Raster Scan
B) Random Scan
C) Vector Scan
D) Conversion Scan

2. _________ method proves to be efficient in the scan-conversion of straight lines.

A) Raster Algorithm
B) DDA Algorithm
C) Brenham’s line algorithm
D) Frame Algorithm

3. _______ is implemented using rotating random-access semiconductor memory.

A) Peripheral Buffer
B) Memory Buffer
C) Frame Buffer
D) IO Buffer

4. _________ algorithm is orientation dependent.

A) DDA
B) Rasterization
C) Scan conversion
D) Bresenham’s Line Algorithm

5. The intensity values for all the screen points are held in the _____________.
A) Frame buffer
B) IO buffer
C) Video controller
D) Display processor
6. ________ algorithm can be used to draw the circle by defining a circle as a differential
equation.
A) Bresenham’s line
B) Digital differential analyzer
C) Recursive algorithms
D) Backtracking algorithms
7. Based on the line segment joining any two point’s lies, the polygons can be classified
as__________.
A) Convex and Concave
B) Regular and Irregular
C) Equilateral and Equiangular
D) None of the above
8. Algorithms that fill interior, that defines regions are called ___________.
A) Boundary Fill algorithm
B) Flood Fill algorithm
C) Scan line algorithm
D) Fill area algorithm

9. Which of the following algorithm aims to overcome difficulties of seed fill algorithm?
A) Scan line algorithm
B) Boundary fill algorithm
C) Flood fill algorithm
D) Line algorithm

10. The region against which an object is to be clipped is called ________________.

A) Clip Window
B) Crop Window
C) Cross Section
D) Connecting Window

11. ______ is the procedure used to identify if any portions of a picture are within or outside
of a specific region of space.
A) Clipping
B) Copying
C) Conversion
D) Communication

12. It is the process of digitizing a picture definition given in an application program and
store it in the frame buffer as a set of pixel-intensity values. This above statement refers to:
A) Scan conversion
B) Video controller
C) Raster-scan system
D) Look up table (LUT)
13. 1. Checking the pixel, if it is inside the polygon or outside it.
2. After checking, the pixels inside the polygon are highlighted. This method of highlighting
is ____.
A) Flood Fill algorithm
B) Boundary Fill algorithm
C) Scan line algorithm
D) Fill area algorithm
14."Each pixel has some intensity value which is represented in memory of the computer.
This memory part is known as the ____________."

a. Frame Buffer
b. Random Access Memory (RAM)
c. Picture Memory
d. None of the above

Answer: a. Frame Buffer

15: Which of the following best defines Scan Conversion in computer graphics?

a. It is a process of representing graphics objects as a collection of pixels

b. It is a process of converting colored images to grayscale images.
c. It is a process of converting handmade drawing to computer pictures through a
scanner
d. None of the above

Answer: a. It is a process of representing graphics objects as a collection of pixels

16. Smallest size object that can be displayed on a monitor is called .....................
a) Picture element b) Point c) Dot Pitch d) aspect ratio Ans: Picture element

17. Each screen point is referred to as .........................

a) Resolution b) Pixel c) Persistence d) Dot Pitch Ans: Pixel

18 .................. refers to pixel spacing.

a) Pixmap b) Resolution c) Pixel depth d) Persistence Ans: Resolution

19. The distance from one pixel to the next pixel is called ...........
a) Resolution b)Dot Pitch c)Pixmap d)ppi Ans: Resolution

20. The maximum number of points that can be displayed without overlap on a CRT
a) Aspect Ratio b) Resolution c)Brightness d)Pixel Ans: Resolution

21. ..................... is the number of points per centimeter that can be plotted horizontally
and vertically.
a) Aspect Ratio b)Pixel Depth c)Resolution d)Dot Pitch Ans: Resolution
22. ...................... is the ratio of horizontal points to vertical points necessary to produce
equal length lines in both directions?
a) Dot Pitch b) Resolution c)Aspect Ratio d) Height-Width Ratio Ans: Aspect Ratio

23. The standard aspect ratio for PC is .................

a) 6:5 b) 4:3 c)3: 2 d)5:3 Ans: 4:3

24. Beam penetration method is usually used in ...............................

a) LCD b)Raster Scan display c) Random scan display d)DVST Ans: Random scan display

25. Identify different type of computer graphics

a) Monochrome and Color b) CRT and Flat panel c)Vector an Raster d)Monitors and
Hardcopy devices Ans: Vector an Raster

26.If the pixel is already filled with desired color then leaves it otherwise fills it. this is called
a.Flood fill algorithm
b.Boundary fill algorithm
c.Scan line polygon filling algorithm
d.None of these
27.A pixel may be defined as
a. Smallest size object
b. Larger size object
c. Medium size object
d. None of these
e.
28.A position in plane known as

f. Line
g. Point
h. Graphics
i. None of these

29.A line can be represented by

j. One point
 k. Two points
l. Three points
m. Four points

30.The process of coloring the area of a polygon is called

n. Polygon filling
o. Polygon flow
p. Aliasing
q. None of these
31.How many types of polygon filling
r. Two
s. One
t. Three
u. Four
32. The algorithm used for filling the interior of a polygon is called
v. Flood fill algorithm
w. Boundary fill algorithm
x. Scan line polygon fill algorithm
y. None of these

33.: The inside of the Cathode Ray Tube is coated with what material?

a. Fluorescent powder
b. No coating
c. Phosphorus
d. None of the above

Answer: c. Phosphorus

34.: Which among the following is not merit (advantage) of the Cathode Ray Tube?

a. It runs at highest pixel ratio

b. It is less expensive than any other display technology
c. It is very large, heavy and bulgy
d. None of the above

Answer: c. It is very large, heavy and bulgy

35.: Which of the following options is correct in accordance with the cathode ray tube?

a. CRTs are brighter than LCDs.

b. CRTs can operate at any resolution and at any aspect ratio.
c. CRTs are the most expensive display device till current date.
 d. None of the above

Answer: c. CRTs can operate at any resolution and at any aspect ratio

36.: Which among the following is a part of the Cathode Ray Tube?

a. Control Electrode
b. Electron Gun
c. Focusing System
d. All of the Above

Answer: d. All of the above

37.A technique by which the vertical and /or horizontal scan frequency of video signal
can be changed for different purpose and applications is called
a. Scan conversion
b. Polygon filling
c. Two dimensional graphics
d. Anti-aliasing

Q 38: The term computer graphics is given by which of following equations

A: Computer Graphics = Data Structure + Algorithm

B; Computer Graphics = Data Structure + Languages

C; Computer Graphics = Data Structure + Algorithm + Languages

D; Computer Graphics = Data Structure

Ans. C

39.39: In computer graphics , a computer is used to create

a.Picture

b.Data Structure
c.Algorithm

d.To modify existing object

Ans. A

Q 40 : Examples of Presentation Graphics is

a. Bar Charts

b. Line Graphs

c. CAD

d. Both A & B

Ans. D

q.41: Resolution of 2x2 inch image that has 512x512 pixels

a. 512x512 pixels per inch

b. 512/2 pixels per inch

c. 512 pixels per inch

d. None of above

Ans: B

Q42: Width of an image having height of 5 inches and an aspect ratio 1.5

a. 7.5 inches
 b. 6 inches

c. 5 inches

d. 1.5 inches

Ans: A

Q43: 24-bit plane frame buffer i.e. 8 bit planes per color will generate

a. 224 possible colours

b. 212 possible colors

c. 23 possible colors

d. 28 possible colors

Ans. A

Q44: Pixel is the

a. Largest screen element which user can control

b. Smallest screen element which user can control

c. particular colour of the screen

d. one object on screen

Ans. B

Q45: ______ refers to the number of dots on screen

 a. pixel

b. Resolution

c. Aspect ratio

d. Frame buffer

Ans. B

Q46: Aspect ratio means

a. Number of pixels

b. Ratio of vertical points to horizontal points

c. Ratio of horizontal points to vertical points

d. Both b and c

Ans. C
47.
Q: 47:In computer graphics, pictures or graphic objects are presented as a collection of
discrete picture elements called _____

a. dots

b. pixels

c. coordinates

d. points

Ans: B
Q48: In raster scan display, the image is stored in the form of ____ in the refresh buffer.

a. 1s

b. 0s

c. 1s and 0s

d. None

Ans. C

Q49: _____ is the smallest addressable screen element.

a. dot

b. spot

c. point
d. pixel
Ans.: D

Q50: Which method supports scaling of character?

a. Bitmap method

b. Stroke method

c. Starburst method

d. none of the above

Ans. B

Q51: How many line segments used in Starburst Method

 a. 24

b. 12

c. 8

d. 14
Ans.: A
52.
Q.52: Which method generates worst curve shape character

a. Bitmap method

b. Stroke method

c. Starburst method

d. All
Ans: C
53.
Which method generates smooth curve shape character

Bitmap method

Stroke method

Starburst method

All

A
54.
In stroke method small series of ______________are drawn like strokes of pen to form a
character
 Line segments

vectors

arcs

Pixels

A
55.
In starbust method to display character

Out of 12 line segments , segments required to display particular character are

highlighted

Out of 24 line segments , segments required to display particular character are

highlighted

Out of 12 X 12 line segments , segments required to display particular character are

highlighted

Out of 24 X 24 line segments , segments required to display particular character are

highlighted

56.

The method which uses array of dots for generating a character is called

Stoke method

Bitmap method
 Star bust method

None of these

57.
The Cartesian slope-intercept equation for a straight line is

y = mx + b

y=bx+m

y =x x + m

$y = b + $m \times $m

A
58.
Which algorithm is a faster method for calculating pixel positions?

Bresenham’s line algorithm

Parallel line algorithm

Mid-point algorithm

DDA line algorithm

A
59.
An accurate and efficient raster line-generating algorithm is

DDA algorithm

Mid-point algorithm
 Parallel line algorithm

Bresenham’s line algorithm

D
60.
Scan lines are numbered consecutively from 0, starting at the top of the screen; and pixel
columns are numbered from 0,___________ across each scan line.

left to right

right to left

top to bottom

bottom to top

A
61.
Given that the two endpoints of the segment are specified at positions (x1, y1) and (x2,
y2), value for the slope m is calculated as:

[(y2-y1) / (x2-x1)]

[(x2-x1) / (y2-y1)]

[(x2-y2) / (x1-y1)]

None of above

A
62.
______________ algorithm supports floating point operations
 Bresenham’s

DDA

scan line

All of above

B
63.
In bresnham’s circle generation first point on circumference of circle will be ________

(1,r)

(r,0)

(0,r)

(r,r)

C
64.
Bit map method is also called dot matrix method because

Characters are represented by 24 bits

Characters are represented an array of dots in matrix form.

Characters are represented by line segments

None of the above

B
65.
 Find initial point for bresenham's circle generation algorithms whose radius is 10 and
center co-ordinates are (0,0)

(0,10)

(10,0)

(10,10)

(-10,-10)

66.

which algorithm uses incremental approach to rasterize

Bresenham's line

DDA line

Midpoint line

All of above

D
67.
________ approach used by DDA line drawing algorithm

Trignometric

Polynomial

Incremental

Exponential
 C
68.
________ approach used by Bresenham's line drawing algorithm

Trigonometric

Polynomial

Incremental

Exponential

C
69.
________ approach used by Bresenham's Circle drawing algorithm

Trigonometric

Polynomial

Incremental

Exponential

C
70.
Which of the following is Line drawing algorithm?

Midpoint

Start Point

Endpoint
 None of these

A
71.
Which of the following is Line drawing algorithm?

Digital Differential Analyser

Start Point

Endpoint

None of these

A
72.
Which of the following is Line drawing algorithm?

Bresenham's line

Start Point

Endpoint

None of these

A
73.
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 =0.5

 None of above

C
74.
A line segment _____________.

extends forward

extends backward

has two end points

extends forever both forward and backward

C
75.
which method uses small series of line segments.

Bitmap method

Stroke method

Starburst method

none of the above

B
76.
In Bresenham’s line drawing algorithm error term is initialized to?

m-1/2

1/2-m

-1/2
None
 C
77.
Stroke method supports scaling of the character by

Positioning the line segment

changing the length of the line segment.

rotating the line segment

does not support scaling

B
78.
In Bitmap method character is placed on the screen

By copying pixel values from character array into some portion of the screen’s frame
buffer.

By copying 24-bit pattern values from character array into some portion of the
screen’s frame buffer.

By copying lines from character array into some portion of the screen’s frame buffer.

All

A
79.
In starbust method to display character

Out of 12 line segments , segments required to display particular character are

highlighted

Out of 24 line segments , segments required to display particular character are

highlighted
Out of 12 X 12 line segments , segments required to display particular character are
highlighted

Out of 24 X 24 line segments , segments required to display particular character are

highlighted

B
 CG- COMPUTER GRAPHICS
UNIT-3
(2D & 3D TRANSFORMATIONS)
Q1. How many types of 2D-Transformations are there?
A. 6
B. 3
C. 8
D. 2
Ans- B
Q2. Any 2D object which can move from one place to another without changing its shape &size
is known as
A. Rotation
B. Translation
C. Scaling
D. All of the above
Ans- B
Q3. The two-dimensional translation equation in the matrix form is
A. P’=P+T
B. P’=P-T
C. P’=P*T
D. P’=p
Ans- A
Q4. The two- dimensional rotation equation in the matrix form is
A. P’=P+T
B. P’=R*P
C. P’=P*P
D. P’=R+P
Ans- B
Q5. In 2D-translation, a point (x,y) can move to the new position (x’,y’) by using the equation
A. x’=x+tx and y’=y+tx
B. x'=x+tx and y’=y+ty
C. X'=x+ty and Y’=y+tx
D. X'=x-tx and Y’=y-ty
Ans- B
Q6. The translation distances tx&ty is called as
A. Translation vector
B. Shift vector
C. Both a&b
D. Neither a nor B
Ans- C
Q7. We translate a two-dimensional point by adding
 A. Translation distances
B. Translation difference
C. Only A
D. None of these
Ans- C
Q8. Basic geometric transformation includes
A. Translation
B. Rotation
C. Scaling
D. All of these
Ans- D
Q9. Some additional transformations are
A. Shear
B. Reflection
C. Both a&b
D. None of these
Ans- C
Q10. What value of the rotation angle rotates the object in clockwise direction?
A. Positive value
B. Negative value
C. Value less than 180°
D. All of the above
Ans- B
Q11.Which of the following transformation techniques is responsible for
altering(increasing/decreasing) size of the object?
A. Translation
B. Rotation
C. Scaling
D. None of these
Ans- C
Q12.The two-dimensional scaling equation in the matrix form is
A. P’=P*P
B. P’=S*P
C. P’=S+P
D. P’=P*S
Ans- B
Q13. If A= (1,1), B= (3,1) & C= (2,3) and scale pt(5,6)
Find A’
A. A’= (4,6)
B. A’= (5,6)
C. A’= (6,5)
 D. A’= (8,6)
Ans- B
Q14.If A= (1,1), B= (2,1), C= (3,2)
Find B’ if theta=180°
A. (2,1)
B. (-2,-1)
C. (-2,1)
D. (2,-1)
Ans- B
Q15. If A= (1,1) , B= (2,1) ,C= (2,3) then translate distance B’ when tx=6 , ty=7
A. (6,8)
B. (8,8)
C. (8,6)
D. (5,8)
Ans-B
Q16. The matrix representation for translation in homogeneous coordinate is
A. P’=T+P
B. P’=S*P
C. P’=R*P
D. P’=T*P
Ans- D
Q17. The matrix representation for scaling in homogeneous coordinate is
A. P’=S*P
B. P’=R*P
C. P’=dx+dy
D. P’=S*S
Ans- A
Q18.The matrix representation for rotation in homogeneous coordinate is
A. P’=T+P
B. P’=S*P
C. P’=R*P
D. P’=dx+dy
Ans- C
Q19. What is the use of homogeneous coordinates and matrix representation?
A. To treat all 3 transformations in a consistent way
B. To scale
C. To rotate
D. To shear the object
Ans- A
Q20. If points are expressed in homogeneous coordinates then the pair of (x,y) is represented
as
 A. (x’,y’,z’)
B. (x,y,z)
C. (x’,y’,w’)
D. (x’,y’,w)
Ans- D
Q21. For 2D transformations the value of third coordinate i.e w=?
A. 1
B. 0
C. -1
D. Any value
Ans- A
Q22. We can combine the multiplicative and translational terms for 2D into a single matrix
represented by expanding
A. 2 by 2 matrix into 4*4 matrix
B. 2 by 2 matrix into 3*3 matrix
C. 3 by 3 matrix into 2 by 2
D. Only C
Ans- B
Q23. Two successive translations are
A. Multiplicative
B. Inverse
C. Subtractive
D. Additive
Ans- D
Q24. Which of the following is NOT correct?
(A,B&C are matrices)
A. A.B= B.A
B. A.B.C=(A.B).C=A.(B.C)
C. C(A+B)=C.A+C.B
D. 1A=A1
Ans= A
Q25. Which transformation distorts the shape of an object such that the transformed shape
appears as if the object were composed of internal layers that had been caused to slide over
each other
A. Rotation
B. Scaling up
C. Scaling down
D. Shearing
Ans- D
Q26. Transpose of a column matrix is
A. Zero matrix
 B. Identity matrix
C. Row matrix
D. Diagonal matrix
Ans- C
Q27. Reversing the order in which a sequence of transformations is performed may affect the
transformed position of an object
A. True
B. False
Ans- A
Q28. Which of the following is the correct notation of a matrix with ‘m’ rows & ‘n’ columns?
A. m+n
B. m-n
C. mxn
D. m/n
Ans- C
Q29.How many minimum number of zeros are there in ‘3x3’ triangular matrix?
A. 4
B. 3
C. 5
D. 6
Ans- B
Q30. General pivot point rotation can be expressed as-
A. T(zr,yr).R(theta).T(-zr,-yr)=R(xr,yr,theta)
B. T(xr,yr).R(theta).T(-xr,-yr)=R(xr,yr,theta)
C. T(xr,yr).R(theta).T(-xr,-yr)=R(zr,yr,theta)
D. T(xr,yr).R(theta).T(-xr,-yr)=R(xr,zr,theta)
Ans- B
Q31. In a rotation, by how much angle is the object rotated?
A. 45°
B. 90°
C. 180°
D. 360°
Ans- C
Q32. Reflection is a special case of rotation
A. True
B. False
Ans- B
Q33.If two pure reflections about a line passing through the origin are applied successfully the
result is-
A. Pure rotation
B. Quarter rotation
 C. Half rotation
D. True reflection
Ans- A
Q34. What is the determinant of the pure reflection matrix?
A. 1
B. 0
C. -1
D. 2
Ans- C
Q35. Which of the following is NOT true?
Image formed by reflection through a plane mirror is-
A. Of same size
B. Same orientation
C. Virtual
D. Is at same distance from the mirror
Ans- B
Q36. Which of the following represents shearing?
A. (x,y)->(x+a, y+b)
B. (x,y)->(ax, by)
C. (x,y)->(xcos(theta)+ysin(theta), -xsin(theta) + ycos(theta))
D. (x,y)->(x+ay, y+bx)
Ans- D
Q37. If a ‘3x3’ matrix shears in X direction how many elements of it are ’1’?
A. 2
B. 3
C. 6
D. 5
Ans- B
Q38. If a ’3x3' matrix shears in Y direction how elements of it are ‘0’ ?
A. 2
B. 3
C. 6
D. 5
Ans- D
Q39. Shearing is also termed as?
A. Selecting
B. Sorting
C. Scaling
D. Skewing
Ans- D
Q40.Shearing and reflection are types of translation
 A. True
B. False
Ans- B
 CG- Computer graphics
Unit- 2
Polygon, windowing and clipping

Multiple choice questions:

1. A closed chain of connected line segments is called_____

A. Polyline

B. Poly-chain

C. Poly-segment D. Polygon

ANSWER: D

2. A chain of connected line segments is called_____

A. Polyline

B. Poly-chain

C. Poly-segment

D. Polygon

ANSWER: A

3. The number of type of Polygon is_____

A. 2

B. 3

C. 4

D. 5

ANSWER: B

4. A polygon in which the line segment joining any two points within the polygon lies completely inside
the polygon, is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: A
5. A Polygon in which the line segment joining any two points within the polygon may not lie completely
inside the polygon, is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete

ANSWER: B

6. If the interior angle of polygon is less than 180°, then the polygon is_____

A. Convex polygon

B. Concave polygon

C. Closed polygon

D. Complete polygon

ANSWER: A

7. If the interior angle of polygon is greater than 180°, then the polygon is_____

A. Convex polygon

B. Concave polygon

C. Closed polygon

D. Complete polygon

ANSWER: B

8. The edges of polygon cross each other than the polygon is ….

A Convex polygon.

B. Complex polygon

C. Concave polygon

D. Closed polygon

ANSWER: B

9. In which polygon object appears only partially_______.

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these

ANSWER: B

10. The process of colouring the area of the polygon is called_____.

Polygon filling

Polygon flow

Aliasing
None

11. How many types of polygon filling algorithm_____?

A. 2

B. 4

C. 3

D. 5

12. __________ is a method for testing a pixel inside of a polygon.

A. even-odd method
B. winding number method
C. A and B
D. None of these
ANSWER:C

13. The process of selecting and viewing the picture with different views is called_______. A.
Clipping
B. Windowing

C. Segmenting
D. all of above

ANSWER: B

14. The first viewing parameter in perspective projection we must consider is the?
A. Viewing window
B. Shift vector
C. View reference point
D. View reference plane

ANSWER:C

15. ________ is a basic approach used to fill the polygon.

A. seed fill
B. scan fill
C. A and B
D. None of these
ANSWER: C
16. The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill
algorithm.
A. flood, boundary
B. even, odd
C. edge, flood
D. boundary, scan
ANSWER: A
17. Polygon filling algorithms those fill interior-defined regions are called _______ algorithms. A.
flood fill
B. boundary fill
C. scan line
D. edge fill ANSWER: A

18. Seed fill algorithm for filling polygon is __________

A. recursive
B. non-recursive
C. A and B
D. none of these

ANSWER: A

19. In a boundary fill algorithm for filling polygon, boundary defined regions may be either _________
connected or _________ connected.
A. 2,4
B. 4,8
C. 8,16
D. 8,6

ANSWER: B

20. Scan line algorithm for filling polygon is ______ algorithm.

A. recursive
B. non-recursive
C. A and B
D. None of these A

NSWER: B

21. The algorithm used for filling the interior of a polygon is called____________.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these

ANSWER: A

22. If the pixel is already filled with desired color then leaves it otherwise fills it, this is
called___________.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B
23. The side effect of scan conversion are__________.
A. Aliasing
B. Anti-aliasing
C. Both a & b
D. None of these
ANSWER: A

24.A Process which divides each segment of the picture into its visible and invisible portion, allowing the
invisible portion to be discarded is called__________.
A. Clipping
B. Windowing
C. Segmenting
D. all of above

ANSWER:A

25. ____is the smallest addressable screen element.

A. dots

B. point

C. pixels

D. spot

ANSWER: C

26. If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are
called______. A. Negatively oriented
B. Positively oriented

C. Both a & b
D. None of these
ANSWER: B

27. If the boundary is specified in a single color, and if the algorithm proceeds pixel by pixel until the
boundary colour is encountered is called A. Scan-line fill algorithm
B. Boundary-fill algorithm
C. Flood-fill algorithm
D. Parallel curve algorithm

ANSWER: B

28. If we want to recolour an area that is not defined within a single color boundary is known
as_________.
A. Boundary-fill algorithm
B. Parallel curve algorithm
C. Flood-fill algorithm
D. Only b
ANSWER: C
29. The space in which the image is displayed are called_____.

A. screen coordinate system

B. clipping window

C. world coordinate system

D. none of these

ANSWER: A

30. Some common form of clipping include_____.

A. curve clipping

B. point clipping

C. polygon clipping

D. All of these

ANSWER: D

31. The process of mapping a world window in which coordinate system to viewport are called____.

A. Transformation viewing

B. Screen coordinate system

C. View port

D. Clipping window

ANSWER: A

32. The process of cutting off the line which are outside the window are called___.

A. Shear

B. Reflection

C. Clipping

D. Clipping window

ANSWER: C

33. The rectangle portion of the interface window that defines where the image will actually appear are
called_____________. A. Transformation viewing
B. View port
C. Clipping window
D. Screen coordinate system ANSWER: B
34. The process of extracting a portion of a database or a picture inside or outside a specified region are
called_____________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D

35. The rectangle space in which the world definition of region is displayed are called_______________.
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these

ANSWER: B

36. The selection and separation of a part of text or image for further operation are called__________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D
37. The complex graphics operations are_______.
A. Selection
B. Separation
C. Clipping
D. None of these

ANSWER: C

38. A many sided figure is termed as____.

A. Square

B. Polygon

C. Rectangle

D. None of these

ANSWER: B

39. If both end points of a line are exterior to the clipping window,__________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: B
40. If both end points of a line are completely to the right of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C
41. If both end points of a line are completely to the left of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these

ANSWER: C

42. The region of a picture against which an object is to be clipped is called a____.
A. Clip Window
B. Segment
C. Clip
D. Viewport
ANSWER: B

43. The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the
window. A. any line
B. one end
C. both end
D. any two
ANSWER: C

44. Which following coordinates are not used in2D viewing transformation?

A. modelling coordinates

B. viewing coordinates

C. vector coordinates

D. device coordinates

ANSWER: C

45. How the pixels are addressed in the seed fill algorithm. A.

Number of pixels addressed only once.

B. Number of pixels addressed half interval time.

C. Number of pixels addressed more than once.

D. Number of pixels addressed not even once.

ANSWER: C

46. In Cohen-Sutherland subdivision line clipping algorithm, bit 1 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: A
47. In Cohen-Sutherland subdivision line clipping algorithm, bit 2 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: B
48. In Cohen-Sutherland subdivision line clipping algorithm, bit 3 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: C
49. In Cohen-Sutherland subdivision line clipping algorithm, bit 4 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window

ANSWER: D

50. A finite world co-ordinate area selected to perform Viewing transformation for display is called a
____________.
A. Window
B. Segment
C. Clip
D. Viewport

ANSWER: A
51. An area on a physical device to which a window is mapped is called a __________.
A. Window
B. Segment
C. Clip
D. Viewport

ANSWER: D

52. Cohen-Sutherland subdivision line clipping algorithm uses ________ regions with diffrerent codes.
A. 8
B. 6
C. 4
D. 9
 ANSWER: D

53. In Cohen- Sutherland subdivision line clipping algorithm, all bits in region code are zero
if__________.
A. end point of a line lies within a clipping window
B. end point of a line lies to the left of the clipping window
C. end point of a line lies to the right of the clipping window
D. None of these

ANSWER: A
54. In Cohen- Sutherland subdivision line clipping algorithm, any line that has one in the same bit
position in the region codes for each end point are _________. A. Completely inside the clipping
rectangle
B. Completely outside the clipping rectangle
C. Completely left to the clipping rectangle
D. Completely right to the clipping rectangle
ANSWER: B
55. In Cohen- Sutherland subdivision line clipping algorithm, if the result of the logical AND operation
with two end point region codes is not 0000 __________. A. the line is Completely inside the clipping
region
B. the line is Completely outside the clipping region
C. the line is Completely left to the clipping region
D. the line is Completely right to the clipping region

ANSWER: B

56. In Sutherland -Hodgeman polygon clipping algorithm, if both vertices of the edge are inside the
window boundary, then _______ is added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these

ANSWER: B

57. Which of the following clipping algorithm follows the Divide and Conquer strategy?
A. 4-bit algorithm
B. Midpoint algorithm
C. Cyrus break algorithm
D. Cohen- Sutherland algorithm

ANSWER: B

58. In Sutherland-Hodgeman polygon clipping algorithm, if both vertices of the edge are outside the
window boundary,______is added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: D

59. In the Cohen Sutherland Out-code Algorithm, if the point out-code is 1001, then the point lies in the
_________________regions of the clipping window.
A. Top and Right
B. Bottom and Right
C. Top and Left D. Bottom and Left
ANSWER: C

60. The graphics can be….

A. Drawing

B. Photograph, movies

C. Simulation

D. All of these

Answer: D

Thank…………………………………………..
Computer Graphics Example Question Answers

NOTE : These Question Answers are given for practice purpose only. This is not a question bank for university exam.

Question Answer1 Answer2 Answer3 Answer4 Correct Option

The number of pixels stored in
the frame buffer of a graphics Resolution Depth Pixel Rate RGB value Answer1
system is known as
In graphical system, the array of
Memory Frame buffer Video Controller Processor Answer2
pixels in the picture are stored in
________ stores the picture
information as a charge Direct-view Flat panel
Cathode ray tube 3D viewing device Answer2
distribution behind the storage tube displays
phosphor-coated screen
In which system, the Shadow
Random-scan
mask methods are commonly Raster-scan system Plasma Displays LCD Answer1
system
used
The process of digitizing a given
picture definition into a set of
Rasterization Encoding Scan conversion True color system Answer3
pixel-intensity for storage in the
frame buffer is called
isometric,
The subcategories of cavalier, cabinet, isometric, cavalier,
cavalier, cabinet diametric, Answer3
orthographic projection are isometric trimetric
trimetric
In DVST, the electron beam from
Storage mesh Flood gun Collector mesh Phosphor screen Answer1
primary electron gun strikes on
The transformation in which the
Rotation Reflection Translation Scaling Answer4
dimension of an object are
Computer Graphics Example Question Answers

changed relative to a specified

fixed point is called
In perspective projection, the
lines of projection are not
projection
parallel. Instead, they all interaction point Centre of gravity Intersection Point Answer3
reference point
coverage at a single point
called__________________
A polygon in which the line
segment joining any 2 points
Isometric
within the polygon lies convex polygon concave polygon Clivier Polygons Answer1
Polygons
completely inside the polygon is
called__?
The type of geometric
transformation applied to an
object for re-positioning it along Scaling Rotation Translation Reflection Answer3
a straight line path from one
location to another:
The perspective projection is
more practical because the Smaller Larger Same as they are Longer Answer1
distant objects appear

The best hidden surface removal Depends on

Depth buffer Area subdivision painters Answer4
algorithm is ? the application

Bresenham line drawing Integer Floating point

Real arithmetic only Lesser Arithmetic Answer2
algorithm is easy because it uses arithmetic only arithmetic
Computer Graphics Example Question Answers

Hue of color is related to ? Incandescence Luminance Saturation Wavelength Answer4

................... is responsible for
accessing the frame buffer to Video controller CPU Monitor Graphics package Answer1
refresh the screen.
Which method is used to draw
GlBeging()/GlEnd() GlDraw()/End() glBegin()/glEnd() GlDraw() Answer3
shapes in OpenGL?
Which method is used to set
projection parameters in gluOrtho2D() glutInit() glutMainLoop() glMatrixMode() Answer4
OpenGL?
Which method intimates to
process all routines glEnd() glFlush() glutMainLoop() glutDisplayFunction() Answer2
immediately?
Which method of OpenGL
glGetError() glGetErrorCode() glGetCode() glError() Answer1
returns error code?
The algorithm which repaints an
Tint fill Flood fill Linear fill Boundary fill Answer4
area that was originally painted.
Full form of LCD is
Light Computer Light Cathod Liquid Crystal
___________________________ Light Crystal Displays Answer3
Displays Displays Displays
________.
_________________ table is
Look Up Color Table Color Coder None of Above Answer1
used to save RGB information
Which algorithm is used to fill in
areas bounded by multiple Area Fill Line Fill Boundry Fill Flood Fill Answer4
colour boarders.
__________ will be send as
GL_SQUARE GL_QUDS GL_POINTS GL_FAN Answer2
parameter to glBegin() for
Computer Graphics Example Question Answers

drawing square.

Full form of DVST is, Discrete View Direct View Digital View Digital Version Storage
Answer2
_____________________ . Standard Storage Tube Standard Tube Tube

High & Low

What are types of graphics in Vector & Raster Gray Scale &
definition None of Above Answer1
CRT moniters? Graphics Color Graphics
Graphics

Full form of CRT is, Computer Raster Computer Ray

Cathod Ray Tube Common Ray Tube Answe3
_____________________. Tube Tube

Which of following is not type of

Oblic Orthogenic Cavalier Parallel Answer2
projection?
which of following is not a logical
Click Pick Choose None of Above Answer1
interaction of input devices?
Which of the following OpenGL
function will be used to set glutInitWindowSize glutWindowSize glutMainLoop() gluInitWindowSize Answer1
window size?
____________ will be send as
parameter to glBegin() for GL_SQUARE GL_QUDS GL_POINTS GL_TRIANGLE_FAN Answer4
drawing fan shape.
What is the dimensions of a 3D
3X3 4X4 3X4 4X3 Answer2
transformation matrix?
Computer Graphics Example Question Answers

Translate to origin, Rotations can Perform a

What should be done to rotate
rotate about origin, only be glRotate and
around a point that is not the All can be done Answer1
then translate back performed specify the point
origin?
to original position. around the origin. to rotate around

glColor3d allows glColor3d takes

glColor3d only sets 3d color double glColor3d is in real
What is the difference between
RGB, while glColor3f operations, while arguments, while space, glColor3f is in Answer3
glColor3d and glColor3f?
sets R,G,B and A glColor3f only glColor3f takes integer space
allows 8-bit float arguments
Computer Graphics Example Question Answers

A function Mathematical
supplied by operation used to
Switching between OpenGL that can create a desired
What is a transformation? All of Above Answer3
different buffers. morph one behavior for
polygon to points and
another. objects.

If lighting is disabled, which

function specifies the color of glClearColor() glDisplayfunc() glColor() None of These Answer3
the vertex?

glColor3d allows glColor3d takes

glColor3d only sets 3d color double glColor3d is in real
What is the difference between
RGB, while glColor3f operations, while arguments, while space, glColor3f is in Answer3
glColor3d and glColor3f?
sets R,G,B and A glColor3f only glColor3f takes integer space
allows 8-bit float arguments

Which function call sets up the

glViewport() gluPerspective() None of These glDisplayfunc() Answer1
size of the output area?
Computer Graphics Example Question Answers

Open General Open Graphics

OpenGL stands for: Open Guide Line Open Graphics Layer Answer2
Liability Library

A type of buffer that A 3D scene A specialized

What is a “depth buffer” and accumulates “depth” organization buffer for doing
None of Above Answer1
what does it accumulate? information in a 3D chart produced underwater
scene by a UX designer scenes

In the official
Yes, but only with Not in the official
specification, but
Does OpenGL provide modeling glEnable(GL_PRIMITI specification, but
also enhanced
primitives such as a cube, cone, VES) called before such functionality Yes. Answe3
versions provided
pyramid? the glBegin is provided by the
by the GLUT
statement. GLUT library.
library.

Does OpenGL use a client-server

Irrelevant Yes No Not Specifed Answer2
model and a state machine?
Computer Graphics Example Question Answers

To under-run a
To approve a buffer buffer in a special
Why we call clear a buffer To make it clearly
for “publishing” to hack known as To reset its state Answer3
function in OpenGL? visible
the monitor “swapping
buffers”
 TYBSC (Computer Science)
Computer Graphics MCQ
2D transformation and viewing
1.A transformation that slants the shape of objects is called :
(A) Shear
(B) Translation
(C) Reflection
(D) All of these

2.The transformation that is used to alter the size of an object is called :

(A) Scaling
(B) Reflection
(C) Rotation
(D) Translation

3.For uniform scaling :

(A) Sx=Sy
(B) Sx>Sy
(C) Sx<Sy
(D) Sx!=Sy

4.In which transformation, the shape of an object can be modified in any

direction depending upon the value assigned to them?
(A) Reflection
(B) Shearing
(C) Translation
(D) Rotation

5.________refers to the result obtained by multiplying the matrix of the

individual transformation representation sequences.
(A) Wireframe model
(B) Constructive solid geometry methods
(C) Composite transformation
(D) None of these

6.In Cohen-Sutherland line clipping algorithm a line with endpoints codes as

0000 and 0100 is :
(A) Partially invisible
(B) Completely visible
(C) Completely invisible
(D) Trivially invisible

7.Sometimes it may require undoing the applied transformation, In such a case

which of the following will be used?
(A) Shear
(B) Translation
(C) Reflection
(D) Inverse transformation

8.Which co-ordinates allow common vector operations such as translation, rotation,

scaling and perspective projection to be represented as a matrix by which the vector is
multiplied.
a) vector co-ordinates
b) 3d co-ordinates
c) affine co-ordinates
d) homogenous co-ordinates

9.Window defines :
(A) Where to display
(B) What to display
(C) Why to display
(D) None of these

10.Any convenient co-ordinate system or Cartesian co-ordinates which can be used to

define the picture is called ___________
a) spherical co-ordinates
b) vector co-ordinates
c) viewport co-ordinates
d) world co-ordinates

11.Co-ordinates are ranging according to the screen resolution.

a) True
b) False

12.Which of the following co-ordinates are NOT used in 2d viewing transformation?

a) modelling co-ordinates
b) viewing co-ordinates
c) vector co-ordinates
d) device co-ordinates

13.The process of elimination of parts of a scene outside a window or a viewport is

called _____________
a) cutting
b) plucking
c) clipping
d) editing
14.For a 2d transformation viewing, in how many ways a clipping algorithm can be
applied?
a) 3
b) 2
c) 1
d) 5
Exp:Clipping algorithm can be applied in two ways for 2d transformation viewing. Two
ways in which clipping algorithms can be applied are- 1) world co-ordinate clipping. 2)
viewport clipping.

15.Which of the following is NOT a type of clipping algorithm used on the raster system?
a) line clipping
b) point clipping
c) area clipping
d) solid clipping
16.For a point to be clipped, which of the following conditions must be satisfied by the
point?
a) xwmin < x < xwmax
b) xwmin = x = xwmax
c) xw min > x > xw max
d) ywmin = y = ywmax

Explanation: A point P(x,y) is NOT clipped if x is more than the minimum value of x and
less than the maximum value of x. Mathematically, it can be written as “xwmin ≤ x ≤
xwmax“.

17.For a point to be clipped, which of the following conditions must be satisfied by the
point?
a) ywmin < y < ywmax
b) yw min > y > yw max
c) ywmin = y = ywmax
d) xwmin < x < xwmax

18.Which type of clipping is used to clip character strings?

a) text clipping
b) line clipping
c) sentence clipping
d) word clipping

19.In polygon clipping, line clipping algorithms can be used.

 a)True
b) False

Explanation: Polygon is a two dimensional shape formed by straight lines. So we can

conclude, polygon’s basic components are lines, hence line clipping algorithm can be
used for polygon clipping.

20.In 2D viewing we have :

(A) 3D window and 2D viewport
(B) 3D window and 3D viewport
(C) 2D window and 2D viewport
(D) 2D window and 3D viewport

21.The object space or the space in which the application model is defined is called
____________
a) World co-ordinate system
b) Screen co-ordinate system
c) World window
d) Interface window

22.The process of mapping a world window in World Coordinates to the Viewport is

called Viewing transformation.
a) True
b) False

23.Viewport defines :
(A) Where to display
(B) What to display
(C) Why to display
(D) None of these

24.How many homogenous representations are possible for one point (x, y)?
(A) 1
(B) 0
(C) 2
(D) Infinite

25.Which is not a line clipping algorithm?

(A) NLN algorithm
(B) Cohen-Sutherland algorithm
(C) Weiler-Atherton algorithm
(D) All of these

26.Clipping is used for :

(A) The display small size image
(B) The display large size image
(C) The display part of an image
(D) All of these

27.After applying 2D shearing transformation in x-direction unit square

becomes :
(A) Parallelogram
(B) Parabola
(C) Rectangle
(D) Hyperbola

28.Which are correct coordinates after applying shear in y-direction relative to

line x=-1 with shear parameter 0.5 on the unit square?
(A) [(0, 1), (1, 1), (1, 0), (0, 0)]
(B) [(1.5, 1), (0.5, 1), (1, 1), (2, 2)]
(C) [(1.5, 1.5), (0.5, 1.5), (0, 1), (1, 2)]
(D) [(0, 0.5), (1, 1), (1, 2), (0, 1.5)]

29.Correct scaling factor for Window to Viewport transformation are :

30.Which is the correct 2D Shearing matrix for shearing in the y-direction(for

column-major matrix)?

31.A translation is applied to an object by :

(A) Repositioning it along with a straight-line path
(B) Repositioning it along with a circular path
(C) Repositioning it along with an elliptical path
(D) All of these

32.We translate a two-dimensional point by adding :

(A) Translation distances
(B) Translation difference
(C) Both A & B
(D) None of these

33.

34.

35.To change the position of a circle or ellipse we translate :

(A) Center coordinates
(B) Center coordinates and redraws the figure in a new location
(C) Outline coordinates
(D) All of these
 MIT Arts,Commerce and Science College,Alandi

Question Bank

Computer graphics

Note:This is for your reference. Please study concepts in details.

Q.1pixel is…

A)smallest adressable point on screen b)memory block

Q.2Resolution is defined as

a)the number of pixels in the horizontal direction*the number of

pixel into horizontal direction

b)the number of pixels in the horizontal direction+the number of

pixel into horizontal direction

Q.3Aspect ratio is

a)the ratio of image width to its heighte

b)a)the ratio of image intensity level

Q.4Refresh rate is…..

a)the frequency at which the contents of the frame buffer is sent

to display monitor

b) the frequency at which the aliasing takes place

Q.5Which of the following are applications of computer graphics

1
a)Education b)art c)simulation d)entertainment

e)visualization d)all of these

Q.6The duration of phosphorescence exhibited by phoshor is

called…

a)persistence b)retrace

Q.7what do you call Path the electron beam takes a when

returning to the left side of the CRT screen?

a)Horizontal trace b)vertical trace

Q.8Which of the following are color model

a)RGB b)CMYK c)both

Q.9Frame buffer is

a)memory area where image is stored b)memory area

where graphics package is stored

Q.10RGB stands for ….

Q.11DAC means….

Q.12RLE stands for …...

Q.12.________ stores the picture information as a charge

distribution behind the phosphor-coated screen.

a)DVST b)CRT

Q.13The devices which converts the electrical energy into light is

called

a) Liquid-crystal displays

2
b) Non-emitters

c) Plasma panels

d) Emitters

Q.14In which system, the Shadow mask methods are commonly

used

a) Raster-scan system

b) Random-scan system

c) Only b

d) Both a and b

Q.16 On a black and white system with one bit per pixel, the

frame buffer is commonly called as

a) Pix map

b) Multi map

c) Bitmap

d) All of the mentioned

Q.17The most commonly used input device is

a) Mouse

b) Keyboard

c) Scanner

d) Printer

3
Q.18 ________ are used to measure dial rotations.

a) Potentiometers

b) Volta meter

Q.19The device which is used to position the screen cursor is

a) Mouse

b) Joystick

Q.20 _________ is used for detecting mouse motion.

a) Optical sensor

b) Rollers on the bottom of mouse

c) Both a and b

Q.21Trackball is

a) Two-dimensional positioning device

b) Three- dimensional positioning device

Q.22Which is the device that is constructed with the series of

sensors that detects hand and finger motion?

a) Digitizers

b) Data glove

Q.23hat is the disadvantage of the light pen?

a) It’s shape

b) They cannot detect positions

c) Accurate reading

d) Cannot detect positions within black areas

4
Q.24On raster system, lines are plotted with

a) Lines

b) Pixels

Q.25DDA …..

Q.26Which of the following are line drawing algorithm

a)DDA b)Bresenham algorithm c)both

Q.27Which of the following are circle drawing algorithm

a)midpoint circle generation 2)bresenham c)both

Q.28Polygon filling algorithm

a)Boundary fillb)flood fill c)scan line d)all

Q.29In bresenham’s circle generation algorithm if(x,y)is the

current pixel position the x value of the next pixel position is..

1)x+1 2)x 3)x-1 4)x+2

Q.30In bresenham’s circle generation algorithm if(x,y)is the

current pixelposition the y value of the next pixel position is..

1)y or y-1 2)y 3)y-1 or y+1

Q.31Which of the following are image coompression technique

run length encoding

Q.32methods for selecting neighboring node

a)4-connected b)8-connected

Q.33the cohen sutherland algorithm divides entire region

into_______no of subregions

5
a)9 b)10

Q.34If (x,y)is a point inside clipping window then its code

according to the cohe sutherland line clipping is------

a)0000 b)0001

Q.35 In cohen sutherland line clipping algorithm ,if the code of

two points P and Q are 0000 and 0000 then the line segment

joining the poits P and Q will be –--the clipping window

a)totally inside b)total outside

Q.35 In cohen sutherland line clipping algorithm ,if the code of

two points P and Q are 0101 and 0001 then the line segment

joining the points P and Q will be –--the clipping window

a)totally outside b)total inside

Q.36In cohen sutherland line clipping algorithm ,if the logical AND

of the codes of the two points P and Q are 0000 then the line

segment joining the poits P and Q will be –--the clipping window

a)needs clipping b)total outside

Q.37Line clipping Algorithm

a)Midpoint Subdivision b)Lthiang-Barskyc)Cohen Sutherland

d)all

Q.38Polygon clipping algorithms

a)Sutherland-Hodgeman b)Weiler-Atherton c)both

Q.39painters algorithms…

6
a)sorts algorithm by depth and then paints each polygon onto

screen starting with most distant polygon

Q.40 Z-buffer algorithm finds…

a)finds the smallest depth value z b)finds largest depth value z

Q.41Which of the following are input devices

a)joystic b)Trackball c)Touch Panels d)Mouse e)Light pen

f)All

Q.42Which of the following are output devices

a)printers plotters c)both

Q.43pick devices

a)Light pen

Q.44Locator devices

a)tablet

Q.45Method by which electron beam can be bented

a)Electrostatic deflection b)magnetic Deflection

Q.46Beam penetration method produces…..colors

a)only 4 b)millions of colors

Q.47Shadow mask method produces…..colors

a)millions of color b)only 4

Q.48Flat panel display can be …

1)emmisive 2)nonn emmisive 3)both

Q.49Which of the following are flat panel displays

7
1)LED 2)LCD 3)Plasma panel 4)All

Q.50 Which of the following is correct regarding DDA method

1)line drawing algorithms 2)drifting of points 3)total steps is value

greater among ∆x and ∆y 4)all

Q.51According to bresenhams line drawing algorithm decision

parameter

1.þ0=2∆y-∆x 2) þ0=∆y-∆x 3) þ0=2∆y-2∆x

Q.52According to bresenhams line drawing algorithm loop will

continue upto

1.∆x times 2.∆y times

Q.53 For mid point circle algorithms

1)þ0=1-r 2 þ0=12-r

Q.54According to boundary fill algorithms

1.Accept seed pixel,fill color and boundary color

2.Tests neighboring pixel for boundary

a.if not boundary paint with fill color

b.select another pixel

3.Neighbor can be selected by either 4-connected or 8-connected

approach

Q.55Flood fill algorithm can be used for

1)multi colored boundary

Q.56Which of the following are type of transformation

8
1.scaling 2.shearing 3.rotation 4)transformation 5)reflection 6)all

Q.57Which of the following is correct representation of 3D pipeline

1.Modelling coordiate----→world Coordinnate----→Viewing

Coordinate---→Projection Coordinate --→Device Coordinate

2-world Coordinnate----→Viewing Coordinate---→Projection

Coordinate --→Device Coordinate-->Modelling coordiate

Q.58 Types of Projection1.Parallel 2)Perspective 3)both

Q.59Types of parallel projection

1)Orthogonal 2)Oblique Projection 3)both

Q.60Cavilier and cabinet are ….type of projection

1.oblique 2.orthogonal

Q.61.Types of Axnometric projection

1.Isometric 2)Dimetric 3)Trimetric 4)all

Q.62Any rectangular screen area that can be moved

about,resized and made active or inactive is called---

1.window 2)viewport

Q.63Area on a display device to which window is mapped is

called---

1.viewport 2.window

Q.64The transformation in which an object is moved in a

minimum distance path from one position to another is called

9
Translation Scaling Rotation Reflection
Q.65he transformation in which an object is moved from one
position to another in circular path around a specified pivot point
is called
Rotation Reflection Translation Scaling
Q.66The transformation in which the dimension of an object are
changed relative to a specified fixed point is called
Scaling Rotation Reflection Translation
Q.67The selection and separation of a part of text or image for
further operation are called
clipping Scaling Rotation Reflection
Q.68f a line joining any two of its interior points lies not
completely inside are called
Concave polygon Convex polygon
Q.69The transformation that disturbs the shape of an object are
called
shearing Rotation Reflection Translation
Q.70If the boundary is specified in a single color, and if the
algorithm proceeds pixel by pixel until the boundary color is
encountered is called
Boundary-fill algorithm C. Flood-fill algorithm D. Parallel curve
algorithm A. Scan-line fill algorithm
Q.71The function of scan line polygon fill algorithm is
A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
D. None of these
Q.72Some common form of clipping include
A. curve clipping B. point clipping C. polygon clipping D. All of
these

10
Q.73The process of mapping a world window in world coordinate
system to viewport are called A. Transformation viewing B. View
Port C. Clipping window D. Screen coordinate system
Q.74After performing Y-shear transformation we got
A(2,5),B(4,11),C(2,7).If the constant value is 2 then original
coordinates will be___________.
A. A(2,5),B(4,11),C(2,7)
B. A(2,1),B(4,3),C(2,3)
C. A(4,1),B(10,3),C(4,3)
D. A(5,11),B(3,4),C(3,2)
ANSWER: B
Q.75 After rotating a triangle having A(0,0),B(6,0),C(3,3) by 90
̊about origin in anticlockwise direction,then resultin
triangle will be_____.
A. A(0,0),B(3,-3),C(0,6)
B. A(0,0),B(-3,3),C(0,6)
C. A(0,0),B(0,-6),C(3,-3)
D. A(0,0),B(0,6),C(-3,3)
ANSWER: D

Try to learn all formula on 2D and 3D

Best of Luck for your exam

11
 Subject:-Computer Graphics
Objective type questions Unit-II Polygons and Clipping Algorithms

A chain of connected line segments is called a ________.

A. Polyline

B. Polysegments

C. Polygon

D. Polychain

ANSWER: A

A closed polyline is called a _________.

A. Polychain

B. Polygon

C. Polyclosed

D. Closed chain

ANSWER: B

A ploygon in which the line segment joining any two points within the polygon lies completely inside the polygon, is
called ________ polygon.

A. Convex

B. Concave

C. Closed

D. Complete

ANSWER: A

A Polygoan in which the line segment joining any two points within the polygon may not lie completely inside the
polygon, is called ________ polygon.

A. Convex

B. Concave

C. Closed

D. Complete

ANSWER: B

__________ is a method for testing a pixel inside of a polygon.

A. even-odd method

B. winding number method

C. A and B

D. None of these

ANSWER: C
_________ is a basic approach used to fill the polygon.

A. seed fill

B. scan fill

C. A and B

D. None of these

ANSWER: C

The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill algorithm.

A. flood, boundry

B. even, odd

C. edge, flood

D. boundry, scan

ANSWER: A

Polygoan filling algorithms those fill interior-defined regions are called _______ algorithms.

A. flood fill

B. boundry fill

C. scan line

D. edge fill

ANSWER: A

Polygoan filling algorithms those fill boundary defined regions are called _________ algorithms.

A. flood fill

B. boundry fill

C. edge line

D. A and B

ANSWER: D

In a boundary fill algorithm for filling polygon, boundary defined regions may be either _________ connected or
__________ connected.

A. 2,4

B. 4,8

C. 8,16

D. 8,6

ANSWER: B

The getpixel function gives the ______ of specified pixel.

A. intensity

B. colour
C. Size

D. Shape

ANSWER: B

The putpixel function draws the pixel specified_______.

A. intensity

B. colour

C. Size

D. Shape

ANSWER: B

Seed fill algo for filling polygon is ________ algorithm.

A. recursive

B. non-recursive

C. A and B

D. None of these

ANSWER: A

Scan line algorithm for filling polygon is ______ algorithm.

A. recursive

B. non-recursive

C. A and B

D. None of these

ANSWER: B

The basic approach to represent polygon is __________.

A. Polygon drawing primitive approach

B. trapezoid primitive approach

C. line and point approach

D. all of above

ANSWER: D

The process of selecting and viewing the picture with diffrerent views is called_______.

A. Clipping

B. Windowing

C. Segmenting

D. all of above

ANSWER: B
A Process which divides each segment of the picture into its visible and invisible portion, allowing the invisible portion to
be discarded is called__________.

A. Clipping

B. Windowing

C. Segmenting

D. all of above

ANSWER: A

A convenient cartesian co-ordinate system used for storing a picture in the computer memory is called__________.

A. X-Y co-ordinate system

B. World co-ordinate system

C. normalized co-ordinate system

D. viewing co-ordinate system

ANSWER: B

When a picture is displayed on the display device it is measeured in ________co-ordinate system.

A. World

B. Physical device

C. Viewing

D. Normalized

ANSWER: B

Mapping the world co-ordinates into physical device co-ordinates is called__________.

A. translation

B. homogeneous transformation

C. co-ordinate conversion

D. Viewing transformation

ANSWER: D

A finite world co-ordinate area selected to perform Viewing transformation for display is called a ____________.

A. Window

B. Segment

C. Clip

D. Viewport

ANSWER: A

An area on a physical device to which a window is mapped is called a __________.

A. Window

B. Segment
C. Clip

D. Viewport

ANSWER: D

The region of a picture against which an object is to be clipped is called a

A. Clip Window

B. Segment

C. Clip

D. Viewport

ANSWER: A

The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the window.

A. any line

B. one end

C. both end

D. any two

ANSWER: C

Cohen-sutherland subdivision line clipping algorithm uses ________ regions with diffrerent codes.

A. 8

B. 6

C. 4

D. 9

ANSWER: D

The transformation which maps the viewing co-ordinates to normalized device co-ordinte is called _______.

A. Viewing transformation

B. translation

C. normalization transformation

D. homogeneous transformation

ANSWER: C

The transformation of object description from normalized co-ordinates to device co-ordinates is called ________.

A. Workstation transformation

B. viewing transformation

C. normalization transformation

D. homogeneous transformation

ANSWER: A
If both end points of a line are exterior to the clipping window,__________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: B

If both end points of a line are completely to the right of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: C

If both end points of a line are completely to the left of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: C

If both end points of a line are completely to the above of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: C

If both end points of a line are completely to the below of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. none of these

ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 1 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: A

In Cohen-sutherland subdivision line clipping algorithm, bit 2 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: B

In Cohen-sutherland subdivision line clipping algorithm, bit 3 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 4 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: D

In cohen- sutherland subdivision line clipping algorithm, all bits in region code are zero if__________.

A. end point of a line lies within a clipping window

B. end point of a line lies to the left of the clipping window

C. end point of a line lies to the right of the clipping window

D. None of these

ANSWER: A

In cohen- sutherland subdivision line clipping algorithm,any line that has one in the same bit position in the region codes
for each end point are _________.

A. Completely inside the clipping rectangle

B. Completely outside the clipping rectangle

C. Completely left to the clipping rectangle

D. Completely right to the clipping rectangle

ANSWER: B
In cohen- sutherland subdivision line clipping algorithm, if the result of the logical AND operation with two end point
region codes is not 0000 __________.

A. the line is Completely inside the clipping region

B. the line is Completely outside the clipping region

C. the line is Completely left to the clipping region

D. the line is Completely right to the clipping region

ANSWER: B

In sutherland -Hodgeman polygon clipping algorithm, if the first vertex of the edge is outside the window boundry and the
second vertex of the edge is inside then _____ and ____ are added to the output vertex list.

A. first vertex, second vertex

B. first vertex, the intersection point of the polygon edge with the window boundry

C. Second vertex,the intersection point of the polygon edge with the window boundry

D. None of these

ANSWER: C

In sutherland -Hodgeman polygon clipping algorithm, if both vertices of the edge are inside the window boundry, then
_______ is addes to the output vertex list.

A. first vertex

B. Second vertex

C. the intersection point of the polygon edge with the window boundry

D. None of these

ANSWER: B

In sutherland-Hodgeman polygon clipping algorithm, if the first vertex of the edge is inside the window boundry and the
second vertex of the edge is outside then _____ and ____ are added to the output vertex list.

A. first vertex

B. Second vertex

C. the intersection point of the polygon edge with the window boundry

D. None of these

ANSWER: C

In sutherland-Hodgeman polygon clipping algorithm, if both vertices of the edge are outside the window boundry,
______is added to the output vertex list.

A. first vertex

B. Second vertex

C. the intersection point of the polygon edge with the window boundry

D. None of these

ANSWER: D

Which of the following clipping algorithm follows the Divide and Conquer strategy?
A. 4-bit algorithm

B. Midpoint algorithm

C. Cyrus break algorithm

D. Cohen- Sutherland algorithm

ANSWER: B

The selection and separation of a part of text or image for further operation are called__________.

A. Translation

B. Shear

C. Reflection

D. Clipping

ANSWER: D

The complex graphics operations are_______.

A. Selection

B. Separation

C. Clipping

D. None of these

ANSWER: C

In computer graphics, a graphical object is known as________.

A. Point

B. Segment

C. Parameter

D. None of these

ANSWER: B

A many sided figure is termed as_________.

A. Square

B. Polygon

C. Rectangle

D. None

ANSWER: B

The end point of polygon are called as__________.

A. Edges

B. Vertices

C. Line
D. None of these

ANSWER: B

The line segment of polygon are called as _________.

A. Edges

B. Vertices

C. Line

D. None of these

ANSWER: A

What are the types of polygon___________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: C

If a line joining any of its two interior points lies completely within it are called____________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: A

If a line joining any two of its interior points lies not completely inside are called______________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: B

In which polygon object appears only partially________________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None

ANSWER: B

The process of extracting a portion of a database or a picture inside or outside a specified region are
called_____________.
A. Translation

B. Shear

C. Reflection

D. Clipping

ANSWER: D

The rectangle portion of the interface window that defines where the image will actually appear are
called_____________.

A. Transformation viewing

B. View port

C. Clipping window

D. Screen coordinate system

ANSWER: B

The rectangle space in which the world definition of region is displayed are called_______________.

A. Screen coordinate system

B. Clipping window or world window

C. World coordinate system

D. None of these

ANSWER: B

The object space in which the application model is defined____________.

A. Screen coordinate system

B. Clipping window or world window

C. World coordinate system

D. None of these

ANSWER: C

The process of cutting off the line which are outside the window are called__________.

A. Shear

B. Reflection

C. Clipping

D. Clipping window

ANSWER: C

Some common form of clipping include_________.

A. curve clipping

B. point clipping

C. polygon clipping
D. All of these

ANSWER: D

A technique by which the vertical and /or horizontal scan frequency of video signal can be changed for different purpose
and applications is called__________.

A. Scan conversion

B. Polygon filling

C. Two dimensional graphics

D. Anti aliasing

ANSWER: A

The process of coloring the area of a polygon is called___________.

A. Polygon filling

B. Polygon flow

C. Aliasing

D. None of these

ANSWER: A

How many types of polygon filling ____________.

A. Two

B. One

C. Three

D. Four

ANSWER: C

The algorithm used for filling the interior of a polygon is called____________.

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon fill algorithm

D. None of these

ANSWER: A

The function of scan line polygon fill algorithm are_______________.

A. Find intersection point of the boundary of polygon and scan line

B. Find intersection point of the boundary of polygon and point

C. Both a & b

D. None of these

ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it, this is called___________.
A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon filling algorithm

D. None of these

ANSWER: B

The side effect of scan conversion are__________.

A. Aliasing

B. Anti aliasing

C. Both a & b

D. None of these

ANSWER: A

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called____________.

A. Negatively oriented

B. Positively oriented

C. Both a & b

D. None of these

ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a polygon____________.

A. Even-odd method

B. Winding number method

C. Both a & b

D. None of these

ANSWER: C

The process of mapping a world window in world coordinate system to viewport are called___________.

A. Transformation viewing

B. View Port

C. Clipping window

D. Screen coordinate system

ANSWER: A

The space in which the image is displayed are called___________.

A. Screen coordinate system

B. Clipping window

C. World coordinate system

D. None of these

ANSWER: A

Some common form of clipping include__________.

A. Curve clipping

B. Point clipping

C. Polygon clipping

D. All of these

ANSWER: D

In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the?

A. Codes of the end point are same

B. Logical AND of the end point code is not 0000

C. Logical OR of the end points code is 0000

D. Logical AND of the end point code is 0000

E. A and B

ANSWER: E

The transformation in which an object is moved in a minimum distance path from one position to another is
called________.

A. Translation

B. Scaling

C. Rotation

D. Reflection

ANSWER: A

The transformation in which the dimension of an object are changed relative to a specified fixed point is
called____________.

A. Translation

B. Scaling

C. Rotation

D. Reflection

ANSWER: B

An object can be viewed as a collection of___________.

A. One segment

B. Two segment

C. Several segments

D. None of these
ANSWER: C

The graphics method in which one object is transformed into another object are called___________.

A. Clipping

B. Morphing

C. Reflection

D. Shear

ANSWER: B

Scaling of a polygon is done by computing____________.

A. The product of (x, y) of each vertex

B. (x, y) of end points

C. Center coordinates

D. Only a

ANSWER: D

A chain of connected line segment is called a__________ .

A. Polyline

B. Polysegment

C. Polygon

D. Polychain

ANSWER: A

A ploygon in which the line segment joining any two points within the polygon may not lies completely inside the
polygon, is called___________polygon .

A. Convex

B. Concave

C. Closed

D. Complete

ANSWER: B

In the given point (x,y) and we want to access(x-1,y-1) in a single step we need to use_________.

A. 4-connected

B. 5-connected

C. 6-connected

D. 8-connected

ANSWER: D

In scan fill algorithm the scan lines which needs to be considered are from___________.

A. Ymax to ymin of the whole polygon

B. Ymax to ymin of the longest edge of the polygon

C. Ymax to ymin of the shortest edge of the polygon

D. None of these

ANSWER: A

Sutherland Hodgeman algorithm is used for_____________.

A. Polygon filling

B. Line clipping

C. Polygon clipping

D. Text clipping

ANSWER: C

Which of the following is not true w.r.t polygon clipping.

A. Line clipping algorithms are not used for polygon clipping

B. The shape of polygon may change after clipping

C. The sequence of clipping w.r.t. window edges is fixed

D. All of these

ANSWER: C

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (80,80). Whether a
point at (10,50) is visible or not?

A. Visible

B. Partially Visible

C. Completely Exterior

D. None of the above

ANSWER: C

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (100,100).What is
the outcode of point (150,50)?

A. 0010

B. 1000

C. 0100

D. 0110

ANSWER: A

Which of the following is true with respect to Suther Hodge algorithm?

A. It clips only concave polygons

B. It is more time consuming and complex

C. It may insert extra edges in resultant polygon

D. None of these

ANSWER: C

In sutherland-hodgeman polygon clipping algorithm,if both vertices of the edge are outside the window boundary
then_______is added to the output vertex.

A. First vertex

B. The intersection point of the polygon edge with the window boundary

C. Second vertex

D. None of these

ANSWER: B

A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates
(40,15) and (75,45). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.

A. (23.67,50) and (69.06,40)

B. (50,23.67) and (69.06, 40)

C. (50,23.67) and (40,69.06)

D. None of Above

ANSWER: B

Adjacent pixels are likely to have same characteristics. This property is referred as_______.

A. Property of coherence

B. Spacial coherence

C. Spatial coherence

D. None of these

ANSWER: A

Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left corner at (-8, -4) and upper
right corner at ( 12,8). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.

A. (-8,6) and (2,8)

B. (-8,6) and (8,2)

C. (6,-8) and (2,8)

D. (8,-6) and (8,2)

ANSWER: A

Scale a square ABCD with co-ordinates A(0,0), B(5,0), C(5,5), D(0,5) by 2 units for x-direction and 3-units for y –
direction.

A. A(0,0) , B(10,0) , C(10,15) , D(0,15)

B. A(0,0) , B(0,0) , C(10,15) , D(0,15)

C. A(0,0) , B(10,0) , C(10,10) , D(15,0)

D. None of these
ANSWER: A

The first viewing parameter in perspective projection we must consider is the?

A. Viewing window

B. Shift vector

C. View reference point

D. View reference plane

ANSWER: C

In normalization transformation for window to viewport, window is lower left corner (1,1) and upper right corner at (3,5)
to a view point with lower left corner at (0,0) and upper right corner at(1/2,1/2) .Scaling factors Sx =___ & Sy =___.

A. 0.25 & 0.125

B. 0.125 & 0.25

C. 4 & 8

D. 0.5 & 1

ANSWER: A

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30, Xmax=
50 , Ymax = 70, the line AB with end-points A(30, 55) and B(70, 40) will be___________.

A. Completely visible

B. Completely invisible

C. Partially visible

D. Partially invisible

ANSWER: C

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50) will be___________.

A. Completely visible

B. Completely invisible

C. Partially visible

D. Partially invisible

ANSWER: A

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50), the outcodes of P and Q will
be___________ and _________repectively.

A. 1000 and 0001

B. 0000 and 0000

C. 0100 and 0010

D. 1100 and 0011

ANSWER: B

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30, Xmax=
50 , Ymax = 70, the line PQ with end-points P(30, 55) and Q(70, 40) will have __________ number of intersection points
with the clipping window.

A. 0

B. 1

C. 2

D. 3

ANSWER: B

In the Cohen Sutherland Outcode Algorithm, the four bits in the outcode are set on the basis of positions of the line end
points to the ________ of clipping window regions in the order.

A. Top, Bottom, Right, Left

B. Right, Top, Bottom, Left

C. Top, Right, Left, Bottom

D. Bottom, Right, Left, Top

ANSWER: A

In the Cohen Sutherland Outcode Algorithm, if both the end-points of the line has outcode 1000, then the line lies in the
_________________region of the clipping window.

A. Left

B. Right

C. Top

D. Bottom

ANSWER: C

In the Cohen Sutherland Outcode Algorithm, if the point outcode is 1001, then the point lies in the
_________________regions of the clipping window.

A. Top and Right

B. Bottom and Right

C. Top and Left

D. Bottom and Left

ANSWER: C

The algorithm used for filling the interior of a polygon is called

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon fill algorithm

D. None of these

ANSWER: A
If the pixel is already filled with desired color then leaves it otherwise fills it. this is called

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon filling algorithm

D. None of these

ANSWER: B

The graphics can be

A. Drawing

B. Photograph, movies

C. Simulation

D. All of these

ANSWER: D

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

A. Scan-line fill algorithm

B. Boundary-fill algorithm

C. Flood-fill algorithm

D. Parallel curve algorithm

ANSWER: B

If we want to recolor an area that is not defined within a single color boundary is known as_________.

A. Boundary-fill algorithm

B. Parallel curve algorithm

C. Flood-fill algorithm

D. Only b

ANSWER: C

There are 2 types of polygons. They are?

A. Convex and concave

B. Square and rectangle

C. Hexagon and square

D. Octagon and convex

ANSWER: A

A many sided figure is termed as_____.

A. Square

B. Polygon
C. Rectangle

D. None

ANSWER: B

The end point of polygon are called as___________.

A. Edges

B. Vertices

C. Line

D. None of these

ANSWER: B

The algorithm used for filling the interior of a polygon is called____________.

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon fill algorithm

D. None of these

ANSWER: A

The function of scan line polygon fill algorithm are________.

A. Find intersection point of the boundary of polygon and scan line

B. Find intersection point of the boundary of polygon and point

C. Both a & b

D. None of these

ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it. this is called_______.

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon filling algorithm

D. None of these

ANSWER: B

If a line joining any two of its interior points lies not completely inside are called____________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: B
In which polygon object appears only partially_______.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: B

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called______.

A. Negatively oriented

B. Positively oriented

C. Both a & b

D. None of these

ANSWER: B

If the visit to the vertices of the polygon in the given order produces an clockwise loop are called______.

A. Negatively oriented

B. Positively oriented

C. Both a & b

D. None of these

ANSWER: A

Which things are mainly needed to make a polygon and to enter the polygon into display file_____.

A. No of sides of polygon

B. Vertices points

C. Both a & b

D. None of these

ANSWER: C

Two types of coordinates are_________.

A. Positive and negative coordinates

B. Absolute and relative coordinates

C. Both a & b

D. None

ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a polygon_____.

A. Even-odd method

B. Winding number method

C. Both a & b

D. None of these

ANSWER: C

For a seed-fill method, If a given point is (x, y) and we want to access (x-1, y-1) in the same iteration, we use which of
the following?

A. 4-connected method

B. 5-connected method

C. 7-connected method

D. 8-connected method

ANSWER: D

In a given triangle, a(10, 10), B(20, 20), C(30, 10), the point P(28, 20) is______.

A. Inside the triangle

B. Outside the triangle

C. On the vertex

D. On the edge

ANSWER: B
 Subject:-Computer Graphics
Objective type questions combine
A chain of connected line segments is called a ________.

A. Polyline

B. Polysegments

C. Polygon

D. Polychain

ANSWER: A

A closed polyline is called a _________.

A. Polychain

B. Polygon

C. Polyclosed

D. Closed chain

ANSWER: B

A ploygon in which the line segment joining any two points within the polygon lies completely inside the polygon,
is called ________ polygon.

A. Convex

B. Concave

C. Closed

D. Complete

ANSWER: A

A Polygoan in which the line segment joining any two points within the polygon may not lie completely inside the
polygon, is called ________ polygon.

A. Convex

B. Concave

C. Closed

D. Complete

ANSWER: B

__________ is a method for testing a pixel inside of a polygon.

A. even-odd method

B. winding number method

C. A and B

D. None of these
ANSWER: C

_________ is a basic approach used to fill the polygon.

A. seed fill

B. scan fill

C. A and B

D. None of these

ANSWER: C

The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill algorithm.

A. flood, boundry

B. even, odd

C. edge, flood

D. boundry, scan

ANSWER: A

Polygoan filling algorithms those fill interior-defined regions are called _______ algorithms.

A. flood fill

B. boundry fill

C. scan line

D. edge fill

ANSWER: A

Polygoan filling algorithms those fill boundary defined regions are called _________ algorithms.

A. flood fill

B. boundry fill

C. edge line

D. A and B

ANSWER: D

In a boundary fill algorithm for filling polygon, boundary defined regions may be either _________ connected or
__________ connected.

A. 2,4

B. 4,8

C. 8,16

D. 8,6

ANSWER: B

The getpixel function gives the ______ of specified pixel.

A. intensity

B. colour

C. Size

D. Shape

ANSWER: B

The putpixel function draws the pixel specified_______.

A. intensity

B. colour

C. Size

D. Shape

ANSWER: B

Seed fill algo for filling polygon is ________ algorithm.

A. recursive

B. non-recursive

C. A and B

D. None of these

ANSWER: A

Scan line algorithm for filling polygon is ______ algorithm.

A. recursive

B. non-recursive

C. A and B

D. None of these

ANSWER: B

The basic approach to represent polygon is __________.

A. Polygon drawing primitive approach

B. trapezoid primitive approach

C. line and point approach

D. all of above

ANSWER: D

The process of selecting and viewing the picture with diffrerent views is called_______.

A. Clipping

B. Windowing
C. Segmenting

D. all of above

ANSWER: B

A Process which divides each segment of the picture into its visible and invisible portion, allowing the invisible
portion to be discarded is called__________.

A. Clipping

B. Windowing

C. Segmenting

D. all of above

ANSWER: A

A convenient cartesian co-ordinate system used for storing a picture in the computer memory is called__________.

A. X-Y co-ordinate system

B. World co-ordinate system

C. normalized co-ordinate system

D. viewing co-ordinate system

ANSWER: B

When a picture is displayed on the display device it is measeured in ________co-ordinate system.

A. World

B. Physical device

C. Viewing

D. Normalized

ANSWER: B

Mapping the world co-ordinates into physical device co-ordinates is called__________.

A. translation

B. homogeneous transformation

C. co-ordinate conversion

D. Viewing transformation

ANSWER: D

A finite world co-ordinate area selected to perform Viewing transformation for display is called a ____________.

A. Window

B. Segment

C. Clip

D. Viewport
ANSWER: A

An area on a physical device to which a window is mapped is called a __________.

A. Window

B. Segment

C. Clip

D. Viewport

ANSWER: D

The region of a picture against which an object is to be clipped is called a

A. Clip Window

B. Segment

C. Clip

D. Viewport

ANSWER: A

The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the window.

A. any line

B. one end

C. both end

D. any two

ANSWER: C

Cohen-sutherland subdivision line clipping algorithm uses ________ regions with diffrerent codes.

A. 8

B. 6

C. 4

D. 9

ANSWER: D

The transformation which maps the viewing co-ordinates to normalized device co-ordinte is called _______.

A. Viewing transformation

B. translation

C. normalization transformation

D. homogeneous transformation

ANSWER: C

The transformation of object description from normalized co-ordinates to device co-ordinates is called ________.
A. Workstation transformation

B. viewing transformation

C. normalization transformation

D. homogeneous transformation

ANSWER: A

If both end points of a line are exterior to the clipping window,__________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: B

If both end points of a line are completely to the right of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: C

If both end points of a line are completely to the left of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: C

If both end points of a line are completely to the above of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. None of these

ANSWER: C

If both end points of a line are completely to the below of clipping window,________.

A. the line is interior to the clipping window

B. the line is not necessarily completely exterior to the clipping window

C. the line is completely exterior to the clipping window

D. none of these

ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 1 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: A

In Cohen-sutherland subdivision line clipping algorithm, bit 2 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: B

In Cohen-sutherland subdivision line clipping algorithm, bit 3 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 4 in region code is set if _____.

A. end point of line is to the left of the window

B. end point of line is to the right of the window

C. end point of line is to the below of the window

D. end point of line is to the above of the window

ANSWER: D

In cohen- sutherland subdivision line clipping algorithm, all bits in region code are zero if__________.

A. end point of a line lies within a clipping window

B. end point of a line lies to the left of the clipping window

C. end point of a line lies to the right of the clipping window

D. None of these
ANSWER: A

In cohen- sutherland subdivision line clipping algorithm,any line that has one in the same bit position in the region
codes for each end point are _________.

A. Completely inside the clipping rectangle

B. Completely outside the clipping rectangle

C. Completely left to the clipping rectangle

D. Completely right to the clipping rectangle

ANSWER: B

In cohen- sutherland subdivision line clipping algorithm, if the result of the logical AND operation with two end
point region codes is not 0000 __________.

A. the line is Completely inside the clipping region

B. the line is Completely outside the clipping region

C. the line is Completely left to the clipping region

D. the line is Completely right to the clipping region

ANSWER: B

In sutherland -Hodgeman polygon clipping algorithm, if the first vertex of the edge is outside the window boundry
and the second vertex of the edge is inside then _____ and ____ are added to the output vertex list.

A. first vertex, second vertex

B. first vertex, the intersection point of the polygon edge with the window boundry

C. Second vertex,the intersection point of the polygon edge with the window boundry

D. None of these

ANSWER: C

In sutherland -Hodgeman polygon clipping algorithm, if both vertices of the edge are inside the window boundry,
then _______ is addes to the output vertex list.

A. first vertex

B. Second vertex

C. the intersection point of the polygon edge with the window boundry

D. None of these

ANSWER: B

In sutherland-Hodgeman polygon clipping algorithm, if the first vertex of the edge is inside the window boundry
and the second vertex of the edge is outside then _____ and ____ are added to the output vertex list.

A. first vertex

B. Second vertex

C. the intersection point of the polygon edge with the window boundry

D. None of these
ANSWER: C

In sutherland-Hodgeman polygon clipping algorithm, if both vertices of the edge are outside the window boundry,
______is added to the output vertex list.

A. first vertex

B. Second vertex

C. the intersection point of the polygon edge with the window boundry

D. None of these

ANSWER: D

Which of the following clipping algorithm follows the Divide and Conquer strategy?

A. 4-bit algorithm

B. Midpoint algorithm

C. Cyrus break algorithm

D. Cohen- Sutherland algorithm

ANSWER: B

The selection and separation of a part of text or image for further operation are called__________.

A. Translation

B. Shear

C. Reflection

D. Clipping

ANSWER: D

The complex graphics operations are_______.

A. Selection

B. Separation

C. Clipping

D. None of these

ANSWER: C

In computer graphics, a graphical object is known as________.

A. Point

B. Segment

C. Parameter

D. None of these

ANSWER: B

A many sided figure is termed as_________.

A. Square

B. Polygon

C. Rectangle

D. None

ANSWER: B

The end point of polygon are called as__________.

A. Edges

B. Vertices

C. Line

D. None of these

ANSWER: B

The line segment of polygon are called as _________.

A. Edges

B. Vertices

C. Line

D. None of these

ANSWER: A

What are the types of polygon___________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: C

If a line joining any of its two interior points lies completely within it are called____________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: A

If a line joining any two of its interior points lies not completely inside are called______________.

A. Convex polygon

B. Concave polygon
C. Both a & b

D. None of these

ANSWER: B

In which polygon object appears only partially________________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None

ANSWER: B

The process of extracting a portion of a database or a picture inside or outside a specified region are
called_____________.

A. Translation

B. Shear

C. Reflection

D. Clipping

ANSWER: D

The rectangle portion of the interface window that defines where the image will actually appear are
called_____________.

A. Transformation viewing

B. View port

C. Clipping window

D. Screen coordinate system

ANSWER: B

The rectangle space in which the world definition of region is displayed are called_______________.

A. Screen coordinate system

B. Clipping window or world window

C. World coordinate system

D. None of these

ANSWER: B

The object space in which the application model is defined____________.

A. Screen coordinate system

B. Clipping window or world window

C. World coordinate system

D. None of these

ANSWER: C

The process of cutting off the line which are outside the window are called__________.

A. Shear

B. Reflection

C. Clipping

D. Clipping window

ANSWER: C

Some common form of clipping include_________.

A. curve clipping

B. point clipping

C. polygon clipping

D. All of these

ANSWER: D

A technique by which the vertical and /or horizontal scan frequency of video signal can be changed for different
purpose and applications is called__________.

A. Scan conversion

B. Polygon filling

C. Two dimensional graphics

D. Anti aliasing

ANSWER: A

The process of coloring the area of a polygon is called___________.

A. Polygon filling

B. Polygon flow

C. Aliasing

D. None of these

ANSWER: A

How many types of polygon filling ____________.

A. Two

B. One

C. Three

D. Four

ANSWER: C
The algorithm used for filling the interior of a polygon is called____________.

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon fill algorithm

D. None of these

ANSWER: A

The function of scan line polygon fill algorithm are_______________.

A. Find intersection point of the boundary of polygon and scan line

B. Find intersection point of the boundary of polygon and point

C. Both a & b

D. None of these

ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it, this is called___________.

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon filling algorithm

D. None of these

ANSWER: B

The side effect of scan conversion are__________.

A. Aliasing

B. Anti aliasing

C. Both a & b

D. None of these

ANSWER: A

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are
called____________.

A. Negatively oriented

B. Positively oriented

C. Both a & b

D. None of these

ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a
polygon____________.
A. Even-odd method

B. Winding number method

C. Both a & b

D. None of these

ANSWER: C

The process of mapping a world window in world coordinate system to viewport are called___________.

A. Transformation viewing

B. View Port

C. Clipping window

D. Screen coordinate system

ANSWER: A

The space in which the image is displayed are called___________.

A. Screen coordinate system

B. Clipping window

C. World coordinate system

D. None of these

ANSWER: A

Some common form of clipping include__________.

A. Curve clipping

B. Point clipping

C. Polygon clipping

D. All of these

ANSWER: D

In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the?

A. Codes of the end point are same

B. Logical AND of the end point code is not 0000

C. Logical OR of the end points code is 0000

D. Logical AND of the end point code is 0000

E. A and B

ANSWER: E

The transformation in which an object is moved in a minimum distance path from one position to another is
called________.

A. Translation
B. Scaling

C. Rotation

D. Reflection

ANSWER: A

The transformation in which the dimension of an object are changed relative to a specified fixed point is
called____________.

A. Translation

B. Scaling

C. Rotation

D. Reflection

ANSWER: B

An object can be viewed as a collection of___________.

A. One segment

B. Two segment

C. Several segments

D. None of these

ANSWER: C

The graphics method in which one object is transformed into another object are called___________.

A. Clipping

B. Morphing

C. Reflection

D. Shear

ANSWER: B

Scaling of a polygon is done by computing____________.

A. The product of (x, y) of each vertex

B. (x, y) of end points

C. Center coordinates

D. Only a

ANSWER: D

A chain of connected line segment is called a__________ .

A. Polyline

B. Polysegment

C. Polygon
D. Polychain

ANSWER: A

A ploygon in which the line segment joining any two points within the polygon may not lies completely inside the
polygon, is called___________polygon .

A. Convex

B. Concave

C. Closed

D. Complete

ANSWER: B

In the given point (x,y) and we want to access(x-1,y-1) in a single step we need to use_________.

A. 4-connected

B. 5-connected

C. 6-connected

D. 8-connected

ANSWER: D

In scan fill algorithm the scan lines which needs to be considered are from___________.

A. Ymax to ymin of the whole polygon

B. Ymax to ymin of the longest edge of the polygon

C. Ymax to ymin of the shortest edge of the polygon

D. None of these

ANSWER: A

Sutherland Hodgeman algorithm is used for_____________.

A. Polygon filling

B. Line clipping

C. Polygon clipping

D. Text clipping

ANSWER: C

Which of the following is not true w.r.t polygon clipping.

A. Line clipping algorithms are not used for polygon clipping

B. The shape of polygon may change after clipping

C. The sequence of clipping w.r.t. window edges is fixed

D. All of these

ANSWER: C
Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (80,80).
Whether a point at (10,50) is visible or not?

A. Visible

B. Partially Visible

C. Completely Exterior

D. None of the above

ANSWER: C

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner
(100,100).What is the outcode of point (150,50)?

A. 0010

B. 1000

C. 0100

D. 0110

ANSWER: A

Which of the following is true with respect to Suther Hodge algorithm?

A. It clips only concave polygons

B. It is more time consuming and complex

C. It may insert extra edges in resultant polygon

D. None of these

ANSWER: C

In sutherland-hodgeman polygon clipping algorithm,if both vertices of the edge are outside the window boundary
then_______is added to the output vertex.

A. First vertex

B. The intersection point of the polygon edge with the window boundary

C. Second vertex

D. None of these

ANSWER: B

A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates
(40,15) and (75,45). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.

A. (23.67,50) and (69.06,40)

B. (50,23.67) and (69.06, 40)

C. (50,23.67) and (40,69.06)

D. None of Above

ANSWER: B
Adjacent pixels are likely to have same characteristics. This property is referred as_______.

A. Property of coherence

B. Spacial coherence

C. Spatial coherence

D. None of these

ANSWER: A

Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left corner at (-8, -4) and
upper right corner at ( 12,8). What will be the end points of clipped line? Use Cohen – Sutherland Outcode
Algorithm.

A. (-8,6) and (2,8)

B. (-8,6) and (8,2)

C. (6,-8) and (2,8)

D. (8,-6) and (8,2)

ANSWER: A

Scale a square ABCD with co-ordinates A(0,0), B(5,0), C(5,5), D(0,5) by 2 units for x-direction and 3-units for y –
direction.

A. A(0,0) , B(10,0) , C(10,15) , D(0,15)

B. A(0,0) , B(0,0) , C(10,15) , D(0,15)

C. A(0,0) , B(10,0) , C(10,10) , D(15,0)

D. None of these

ANSWER: A

The first viewing parameter in perspective projection we must consider is the?

A. Viewing window

B. Shift vector

C. View reference point

D. View reference plane

ANSWER: C

In normalization transformation for window to viewport, window is lower left corner (1,1) and upper right corner at
(3,5) to a view point with lower left corner at (0,0) and upper right corner at(1/2,1/2) .Scaling factors Sx =___ &
Sy =___.

A. 0.25 & 0.125

B. 0.125 & 0.25

C. 4 & 8

D. 0.5 & 1

ANSWER: A
In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line AB with end-points A(30, 55) and B(70, 40) will be___________.

A. Completely visible

B. Completely invisible

C. Partially visible

D. Partially invisible

ANSWER: C

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50) will be___________.

A. Completely visible

B. Completely invisible

C. Partially visible

D. Partially invisible

ANSWER: A

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50), the outcodes of P and Q will
be___________ and _________repectively.

A. 1000 and 0001

B. 0000 and 0000

C. 0100 and 0010

D. 1100 and 0011

ANSWER: B

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(30, 55) and Q(70, 40) will have __________ number of
intersection points with the clipping window.

A. 0

B. 1

C. 2

D. 3

ANSWER: B

In the Cohen Sutherland Outcode Algorithm, the four bits in the outcode are set on the basis of positions of the line
end points to the ________ of clipping window regions in the order.

A. Top, Bottom, Right, Left

B. Right, Top, Bottom, Left

C. Top, Right, Left, Bottom

D. Bottom, Right, Left, Top

ANSWER: A

In the Cohen Sutherland Outcode Algorithm, if both the end-points of the line has outcode 1000, then the line lies
in the _________________region of the clipping window.

A. Left

B. Right

C. Top

D. Bottom

ANSWER: C

In the Cohen Sutherland Outcode Algorithm, if the point outcode is 1001, then the point lies in the
_________________regions of the clipping window.

A. Top and Right

B. Bottom and Right

C. Top and Left

D. Bottom and Left

ANSWER: C

The algorithm used for filling the interior of a polygon is called

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon fill algorithm

D. None of these

ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it. this is called

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon filling algorithm

D. None of these

ANSWER: B

The graphics can be

A. Drawing

B. Photograph, movies

C. Simulation

D. All of these
ANSWER: D

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

A. Scan-line fill algorithm

B. Boundary-fill algorithm

C. Flood-fill algorithm

D. Parallel curve algorithm

ANSWER: B

If we want to recolor an area that is not defined within a single color boundary is known as_________.

A. Boundary-fill algorithm

B. Parallel curve algorithm

C. Flood-fill algorithm

D. Only b

ANSWER: C

There are 2 types of polygons. They are?

A. Convex and concave

B. Square and rectangle

C. Hexagon and square

D. Octagon and convex

ANSWER: A

A many sided figure is termed as_____.

A. Square

B. Polygon

C. Rectangle

D. None

ANSWER: B

The end point of polygon are called as___________.

A. Edges

B. Vertices

C. Line

D. None of these

ANSWER: B

The algorithm used for filling the interior of a polygon is called____________.

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon fill algorithm

D. None of these

ANSWER: A

The function of scan line polygon fill algorithm are________.

A. Find intersection point of the boundary of polygon and scan line

B. Find intersection point of the boundary of polygon and point

C. Both a & b

D. None of these

ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it. this is called_______.

A. Flood fill algorithm

B. Boundary fill algorithm

C. Scan line polygon filling algorithm

D. None of these

ANSWER: B

If a line joining any two of its interior points lies not completely inside are called____________.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: B

In which polygon object appears only partially_______.

A. Convex polygon

B. Concave polygon

C. Both a & b

D. None of these

ANSWER: B

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called______.

A. Negatively oriented

B. Positively oriented
C. Both a & b

D. None of these

ANSWER: B

If the visit to the vertices of the polygon in the given order produces an clockwise loop are called______.

A. Negatively oriented

B. Positively oriented

C. Both a & b

D. None of these

ANSWER: A

Which things are mainly needed to make a polygon and to enter the polygon into display file_____.

A. No of sides of polygon

B. Vertices points

C. Both a & b

D. None of these

ANSWER: C

Two types of coordinates are_________.

A. Positive and negative coordinates

B. Absolute and relative coordinates

C. Both a & b

D. None

ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a polygon_____.

A. Even-odd method

B. Winding number method

C. Both a & b

D. None of these

ANSWER: C

For a seed-fill method, If a given point is (x, y) and we want to access (x-1, y-1) in the same iteration, we use which
of the following?

A. 4-connected method

B. 5-connected method

C. 7-connected method

D. 8-connected method
ANSWER: D

In a given triangle, a(10, 10), B(20, 20), C(30, 10), the point P(28, 20) is______.

A. Inside the triangle

B. Outside the triangle

C. On the vertex

D. On the edge

ANSWER: B
 Subject:-Computer Graphics
Objective type questions Unit-III 2-D, 3-D Transformations and Projections

If we multiply any matrix with___matrix then we get the original matrix A___.

A. Scaling matrix

B. Translation matrix

C. Identity matrix

D. Opposite matrix

ANSWER: C

A Pixel is represented dy a tuple Xw,Yw,w in______.

A. Normalised Device Coordinates

B. Homogeneous coordinates system

C. 3D coordinate system

D. None of these

ANSWER: B

A _______ transformation alters the size of an object.

A. Scaling

B. Rotation

C. Translation

D. Shear

ANSWER: A

If the angle Q is positive then the rotation direction will be _________.

A. Clockwise

B. Anticlockwise

C. Parallel

D. Perpendicular

ANSWER: B

Reflection of a point about x-axis ,followed by a conter-clockwise rotation of 90˚ is equivalent to reflection about the
line ______.

A. X=-Y

B. Y=-X

C. X=Y

D. X+Y=1

ANSWER: C
The shape of the object gets by _________transformation.

A. Scaling

B. Rotation

C. Translation

D. Shear

ANSWER: D

A_______is a transformation that produces a mirror image of an object.

A. Scaling

B. Translation

C. Reflection

D. Both B & C

ANSWER: C

If we multiply any matrix A with identity matrix then we get the________matrix.

A. Identity matrix

B. Translation matrix

C. Scaling matrix

D. Original matrix

ANSWER: D

In homogeneous co-ordinate system a pixel is represented as ____________.

A. X,Y

B. X,Y,Z

C. X,Y,W

D. Xw,Yw,w

ANSWER: D

Two consecutive transformation t1 and t2 are _________.

A. Additive

B. Substractive

C. Multiplicative

D. None of these

ANSWER: A

Reflection about the line Y=X is equivalent to ________,followed by a anticlockwise rotation 90˚.

A. Reflection about y-axis

B. Reflection about x-axis

C. Reflection about origin

D. None of these

ANSWER: B

Two consecutive scaling transformation t1 and t2 are __________.

A. Additive

B. Substractive

C. Multiplicative

D. None of these

ANSWER: C

After scaling a triangle having coordinates A(0,0),B(5,0),C(5,5)by 2 units in X and 3 units in Y direction the new
coordinates will be___________.

A. A(0,0),B(10,0),C(10,15)

B. A(0,0),B(10,15),C(10,0)

C. A(0,0),B(0,10),C(15,10)

D. A(2,3),B(10,0),C(10,15)

ANSWER: A

After performing Y-shear transformation we got A(2,5),B(4,11),C(2,7).If the constant value is 2 then original
coordinates will be___________.

A. A(2,5),B(4,11),C(2,7)

B. A(2,1),B(4,3),C(2,3)

C. A(4,1),B(10,3),C(4,3)

D. A(5,11),B(3,4),C(3,2)

ANSWER: B

After rotating a triangle having A(0,0),B(6,0),C(3,3) by 90˚about origin in anticlockwise direction,thenresultin

triangle will be_____.

A. A(0,0),B(3,-3),C(0,6)

B. A(0,0),B(-3,3),C(0,6)

C. A(0,0),B(0,-6),C(3,-3)

D. A(0,0),B(0,6),C(-3,3)

ANSWER: D

The point (x,y) becomes (y,x) in____________transformation.

A. Reflection about origin y-axis

B. Reflection about x-axis

C. Reflection at line Y=X

D. Reflection about y-axis

ANSWER: C

Which of the following transformation is not used in rotation about arbitrary point in 2D?

A. Scaling

B. Rotation

C. Translation

D. None of these

ANSWER: A

After performing X-shear on triangle having A(2,1),B(4,3)C(2,3) with the constant value as 2,the resultant triangle
will be______.

A. A(2,5),B(4,1),C(2,7)

B. A(10,3),B(4,5),C(4,1)

C. A(4,1),B(10,3),C(4,3)

D. A(5,2),B(4,11),C(7,2)

ANSWER: C

If the resultant object is given along with the set of transformations applied on it, then to find the original object we
have to use___________.

A. Affine transformation

B. Reverse transformation

C. Normal transformation

D. Inverse transformation

ANSWER: D

Two consecutive rotation transformation are always__________.

A. Additive

B. Subtractive

C. Multiplicative

D. None of these

ANSWER: A

Two consecutive rotation transformation are always commutative____________.

A. TRUE

B. FALSE

C. Not always

D. None of these

ANSWER: A
A point (x,y) becomes (-x,y) in__________transformation.

A. Reflection at X axis

B. Reflection at Y axis

C. Reflection at origin

D. Reflection about line Y=X

ANSWER: B

In Y-shear transformation point (x,y) becomes_______.

A. x+yb,xa+y

B. x+yb,y

C. x,xa+y

D. None of these

ANSWER: C

Reflection about X-axis followed by reflection about Y-axis is equivalent to_______.

A. Reflection about line Y= X

B. Reflection about origin

C. Reflection about line Y=-X

D. Reflection about Y-axis

ANSWER: B

Two consecutive scaling transformation are always commutative___________.

A. TRUE

B. FALSE

C. Not always

D. None of these

ANSWER: A

If a circle is scaled in only one direction then it will become___________.

A. Parabola

B. Hyperbola

C. Ellipse

D. Circle

ANSWER: C

The transformation that changes the co-ordinate positions of an object along a circular path is called_______.

A. Translation

B. Scaling
C. Rotation

D. Reflection

ANSWER: C

The result of two successive 2D rotations R(Q1) and R(Q2) is___________.

A. R(Q1+Q2)

B. R(Q1.Q2)

C. R(Q1-Q2)

D. R(Q1/Q2)

ANSWER: A

If we take mirror reflection of a points(x,y) along x-axis then the point becomes_________.

A. (x,-y)

B. (-x,-y)

C. (-x,y)

D. (y,x)

ANSWER: A

If we take mirror reflection of a points(x,y) along the line Y=X then the point becomes________.

A. (x,-y)

B. (-y,-x)

C. (-x,y)

D. (y,x)

ANSWER: D

The number of matrices required to rotate an object about a point(1,1) are___________.

A. 1

B. 2

C. 3

D. 4

ANSWER: C

In X-shear transformation point(x,y)becomes_________.

A. (x+yb,xa+y)

B. (x+yb,y)

C. (x,xa+y)

D. None of these

ANSWER: B
If we take mirror reflection of a point (-x,y) along the origin then the point Becomes_________.

A. (x,-y)

B. (-y,-x)

C. (-x,y)

D. (y,x)

ANSWER: A

Shear transformation can be formed by scaling and rotation,justify True or False .

A. TRUE

B. FALSE

C. Not always

D. None of these

ANSWER: A

If a point (x,-y)is rotated along y axis by 180 degree in clockwise direction Followed by90 degree in anticlockwise
direction then it becomes__________.

A. (x,-y)

B. (-y,-x)

C. (-x,y)

D. (-y,x)

ANSWER: D

Which transformation needs homogeneous coordinates to represent it in Matrix from?

A. Scaling

B. Rotation

C. Translation

D. Reflection

ANSWER: C

Which of the following statement is not correct with respect to homogeneous coordinates?

A. It is used to combine transformations

B. Each point is represented as (xw,yw,w)

C. It is used for representing translation in matrix form

D. Homogeneous coordinates are represented in 2*2 matrix form

ANSWER: D

Any 2D point is represented in a matrix form with dimension as_________.

A. 1*2
B. 2*1

C. 1*1

D. 2*2

ANSWER: A

Any 2D point in homogeneous coordinates is represented in a matix form with dimension as________.

A. 1*2

B. 2*1

C. 1*3

D. 3*1

ANSWER: C

Which of the following 2D transformation is not represented in matrix form in non homogeneous coordinate
system?

A. Scaling

B. Rotation

C. Translation

D. Reflection

ANSWER: C

If we need to tilt the 2D object in one direction then we have to use_____transformation.

A. Scaling

B. Translation

C. Shear

D. Rotation

ANSWER: C

If we need to tilt the height of the object keeping width same as original object then we have to
use________transformations.

A. Scaling in Y direction

B. Scaling

C. Y-shearing

D. X-shearing

ANSWER: B

If we need to shift the width of the object keeping height as unchanged,then we have to
use__________transformations.

A. Translation
B. Scaling

C. Y-shearing

D. X-shearing

ANSWER: D

In Scaling transformation Sx Indicate______.

A. Scaling factor along X axis

B. Translation factor along X axis

C. Tilting factor along X axis

D. None of these

ANSWER: A

In translation transformation Ty indicates____________.

A. Scaling factor along Y direction

B. Translation factor along Y direction

C. Tilting factor along Y direction

D. None of these

ANSWER: B

If the size of triangle needs to be doubled by keeping the center triangle at the same position as that of original
triangle. then we need to apply ______transformation.

A. Only scaling

B. Only translation

C. Scaling and translation

D. Scaling and Rotation

ANSWER: C

If we have applied scaling by 2 units in both directions and received final coordinates of the polygon, then to recover
the original coordinates of the polygon we have to apply scaling transformation with…

A. Sx=2, Sy=2

B. Sx=1/2, Sy=1/2

C. Sx=1/2, Sy=2

D. Sx=2, Sy=1/2

ANSWER: B

If have the final coordinates of the polygen, then to recover the original coordinates of polygen we have to
apply___________.

A. Scaling

B. Translation
C. Inverse transformation

D. None of these

ANSWER: C

Which of the following transformation are needed if we want to scale the object with respect to a point other than
origin?

A. Scaling

B. Transformation

C. Both a and b

D. Rotation

ANSWER: C

A point x(2,3) is reprensented in homogeneous coordinates as_________.

A. (2,3)

B. (2,3,1)

C. (2,3,1)

D. (2,3,0)

ANSWER: C

The transformation matrix is used for__________.

A. Reflection at X axis

B. Reflection at Y axis

C. Reflection at origin

D. None of these

ANSWER: B

The transformation matrix is used for__________.

A. Reflection at X axis

B. Reflection at Y axis

C. Reflection at origin

D. Reflection at line Y=X

ANSWER: C

The transformation matrix is used for__________.

A. Reflection at origin

B. Reflection at X axis

C. Reflection at Y axis

D. Reflection at the line Y=X

ANSWER: D

The transformation matrix is used for_____________.

A. Scaling

B. Y-shear

C. X-shear

D. None of these

ANSWER: B

If we rotate a triangle ABC having A(1,1), B(10,1), C(5,5) by 90 degree in anticlockwise direction then the ABC will
become________.

A. A(1,1), B(10,1), C(5,-5)

B. A(-1,1), B(-10,1), C(-5,5)

C. A(-1,1), B(-1,10), C(-5,5)

D. A(-1,1), B(-1,10), C(-5,-5)

ANSWER: B

Find out final co-ordinate of a figure bounded by co-ordinate A(2,1), B(2,3), C(4,2), D(4,2) with scale factor
Sx=Sy=3.

A. A(6,3), B(6,9), C(6,12), and D(12,6)

B. A(6,3), B(6,9), C(6,12), and DANSWER: B6,12)

C. A(6,3), B(6,9), C(12,6), and D(12,6)

D. A(6,3), B(9,6), C(12,6), and D(6,12)

ANSWER: C

If we perform X shear on a triangle having A(2,1), B(4,3), C(2,3). With constant value as 2 then the new coordinate
will be________.

A. A(4,1), B(10,3), C(2,3)

B. A(4,1), B(10,3), C(4,3)

C. A(2,5), B(4,11), C(2,7)

D. A(2,5), B(4,11), C(7,2)

ANSWER: B

If we perform Y shear on a triangle having A(2,1), B(4,3), C(2,3). With constant value as 2 then the new coordinate
will be_________.

A. A(4,1), B(10,3), C(2,3)

B. A(4,1), B(10,3), C(4,3)

C. A(2,5), B(4,11), C(2,7)

D. A(2,5), B(4,11), C(7,2)

ANSWER: C

If we rotate a triangle ABC having A(0,0), B(6,0) and C(3,3) by 90 degree about origin in anticlockwise direction
then triangle ABC will become as_________.

A. A(0,0), B(0,6), C(-3,3)

B. A(0,0), B(6,0), C(-3,3)

C. A(0,0), B(0,6), C(3,-3)

D. A(0,0), B(6,0), C(3,-3)

ANSWER: A

If we translate the square ABCD whose co-ordinate are A(0,0), B(3,0), C(3,3) and D(0,3) by 2 units in both
directions then the new coordinates of ABCD will be______.

A. A(2,2) , B(3,2), C(5,5), D(0,5)

B. A(2,2) , B(5,2), C(5,5), D(2,5)

C. A(2,2) , B(5,2), C(3,3), D(2,5)

D. A(2,2) , B(3,2), C(5,5), D(2,5)

ANSWER: B

If we scale the square ABCD whose co-ordinate are A(2,2), B(5,2), C(5,5), D(2,5) by 1.5 and 0.5 units in X and Y
directions respectively then the new coordinates of ABCD will be______.

A. A(3,1) , B(7.5,1), C(7.5,5), D(3,5)

B. A(3,3) , B(7.5,3), C(7.5,7.5), D(3,7.5)

C. A(3,1) , B(7.5,1), C(7.5,2.5), D(3,2.5)

D. A(3,3) , B(5,3), C(5,7.5), D(3,7.5)

ANSWER: C

If we scale a square ABCD with co-ordinate A(0,0), B(5,0), C(5,5) and D(0,5) by 2 units for x-direction and 3 units
for y-directions, then the final coordinates will be______.

A. A(0,0) , B(0,10), C(15,10) and D(15,0)

B. A(0,0) , B(10,0), C(10,15) and D(0,15)

C. A(0,0) , B(10,0), C(15,10) and D(0,15)

D. A(0,0) , B(10,0), C(15,10) and D(15,0)

ANSWER: B

If a final polygon co-ordinates are A(7,3), B(9,3), C(9,5) and D(7,5). We have applied translation by 1 in both x of y-
direction. Then the original polygon coordinates will be______.

A. A(6,3) , B(8,3), C(8,5), D(6,5)

B. A(7,2) , B(9,2), C(9,4), D(7,4)

C. A(6,2) , B(8,2), C(8,4), D(6,4)

D. None of these
ANSWER: C

In 3D viewing, the world co-ordinate position of the objects are converted into viewing co-ordinates by _________
transformation.

A. Viewing

B. Projection

C. Workstation

D. 3D

ANSWER: A

In 3D viewing, mismatch between 3D objects and 2D displays is compensated by introducing_________.

A. Transformation

B. Projection

C. Rotation

D. Translation

ANSWER: B

In 3D viewing, the _________transformation is used to convert 3D description of objects in viewing co-ordinates to

the 2D projection co-ordinates.

A. Viewing

B. Projection

C. Workstation

D. 3D

ANSWER: B

In 3D viewing, ____________-transformation transforms the projection co-ordinates into the device coordinates.

A. Viewing

B. Projection

C. Workstation

D. 3D

ANSWER: C

A view Plane normal vector is perpendicular to _____________.

A. View Plane

B. Projection Plane

C. Reference Plane

D. None of these

ANSWER: A
The length of a directed line segment (the view plane normal vector) from the view plane to the view reference point
is referred to as _________ distance.

A. Normal

B. Plane

C. View

D. Reference

ANSWER: C

Two Basic ways of projecting objects onto the view plane are _________ and _______- .

A. Serial, Parallel

B. Serial,Perspective

C. Parallel, Perspective

D. None of these

ANSWER: C

_____________ projection preserves relative proportions of the objects but does not produce the realistic views.

A. Serial

B. Perspective

C. Parallel

D. Any

ANSWER: C

_____________ projection produce the realistic views but does not preserves relative proportions.

A. Serial

B. Perspective

C. Parallel

D. Any

ANSWER: C

In perspective projection, the lines of projection converge at a single point called _________.

A. Center of projection

B. projection reference point

C. A & B

D. None of these

ANSWER: C

When the direction of the projection is normal to the view plane, we have an __________ parallel projection.

A. Serial
B. Orthographic

C. Oblique

D. None of these

ANSWER: C

When the direction of the projection is not perpendicular to the view plane , we have an _______ parallel projection.

A. Serial

B. Orthographic

C. Oblique

D. None of these

ANSWER: C

The orthographic projection can display more that one face of an object, such an orthographic projection is called
__________ orthographic projection.

A. Axonometric

B. Isometric

C. Parallel

D. Perspective

ANSWER: A

The foreshortening factor is the ratio of the ____________.

A. Actual length of line to its projected length

B. Projected length of line to its true length

C. A Or B

D. None of these

ANSWER: B

Three types of axonometric projections are ________, _____, _________

A. Serial , Parallel, isometric

B. Paralle, Perspective , Isometric

C. Isometric, dimetric, trimetric

D. None of these

ANSWER: C

The vanishing point for any set of lines that are parallel to one of the three principle axes of an object is referred to as
a __________.

A. Principle vanishing point

B. Axis vanishing point

C. A or B
D. None of these

ANSWER: C

The oblique projections are classified as ______ and ___________ projections.

A. Cavalier and Cabinet

B. Serial & Parallel

C. Parallel & Perspective

D. Isometric & dimetric

ANSWER: A

For the cavalier projection, the direction of projection makes a __________ angle with the view plane.

A. 40 degree

B. 45 degree

C. 63 degree

D. 63.4 Degree

ANSWER: B

When the direction of projection makes an angle of arc tan (2) = 63.4 degree with the view plane, the resulting view
is called a ____________ projection .

A. Parallel

B. Perspective

C. Cavalier

D. Cabinet

ANSWER: D

Cabinet projection appear ___________ realistic compared to cavalier projections.

A. More

B. Less

C. Equally

D. None of these

ANSWER: A

A Special form of the one-point perspective projection takes place when the vanishing point is placed centrally
within the figure.this type of projection is called a _________ projection.

A. Parallel

B. Perspective

C. Tunnel

D. Cavalier

ANSWER: C
The first viewing parameter in perspective projection we must consider is the?

A. Viewing window

B. Shift vector

C. View reference point

D. View reference plane

ANSWER: C

For a point (2,1,2) if we apply reflection about Y-axis, then the new point will become ___________.

A. (2,- 1,2)

B. (- 2,1,- 2)

C. (2,- 1,- 2)

D. (- 2,- 1,2)

ANSWER: B

Which of the following is not a type of perspective projection____________.

A. Isometric

B. One point

C. Two point

D. Three point

ANSWER: A

If we have applied scaling by 2 units in both directions and received final coordinates of the polygon, then to recover
the original coordinates of the polygon we have to apply scaling transformation with _____.

A. Sx = 2, Sy = 2

B. Sx = 1/2, Sy = 1/2

C. Sx = 1/2, Sy = 2

D. Sx = 2, Sy = 1/2

ANSWER: B

A cube is defined by 8 vertices A(0,0,0),B(2,0,0),C(2,2,0),D(0,2,0),E(0,0,2),F(0,0,2), G(2,0,2),H(2,2,2) After

translation by tx=1,ty=2,tz=1 resultant position is,

A. A(1,2,1), B(3,2,1), C(3,4,1), D(1,4,1), E(1,2,3), F(1,4,3),G(3,2,3), H(3,4,3)

B. A(1,2,1), B(1,2,3), C(3,4,1), D(1,1,1), E(1,2,3), F(1,4,3),G(3,2,3), H(3,3,3)

C. A(1,2,1), B(3,2,1), C(1,4,3), D(1,4,1), E(3,2,1), F(1,4,3),G(2,2,3), H(3,3,4)

D. None of the above.

ANSWER: A

After scaling a triangle having coordinates A(O,O),B(5,0), C(5,5) by 2 units in X and 3 units in Y direction, the new
coordinates will be_________.
A. A(0,0),B(10,0), C(10,15)

B. A(0,0),B(10,15), C(10,0)

C. A(0,0),B(0,10), C(15,10)

D. A(2,3), B(10,0), C(10,15)

ANSWER: A

After performing Y-shear transformation we got A(2,5), B(4,11), C(2,7). If the constant value is 2 then the original
coordinates will be _________.

A. A(2,5), B(4,11), C(2,7)

B. A(2,l), B(4,3), C(2,3)

C. A(4,1), B(10,3), C(4,3)

D. A(5,11), B(3,4), C(3,2)

ANSWER: B
 Subject:-Computer Graphics
Objective type questions Unit-IV Segment and Animation

The color options are numerically coded with the following values.

A. Ranging from 0 through the positive integer

B. Ranging from 0 to 1

C. Ranging from 0 to -0

D. Only c

ANSWER: A

In color raster system, the number of color choices available depends on_____________.

A. colors in frame buffer

B. Amount of storage provided per pixel in frame buffer

C. RGB color

D. Neither a nor b

ANSWER: B

The color code “000” is for________.

A. White

B. Black

C. Blue

D. Green

ANSWER: B

Color information can be stored in____________.

A. Main memory

B. Secondary memory

C. Graphics card

D. Frame buffer

ANSWER: D

Whenever a particular color code is specified in an application program, the corresponding binary value is placed in?

A. Color look-up table

B. Directly in frame buffer

C. a or b

D. Video lookup table

ANSWER: B
The range that specifies the gray or grayscale levels is___________.

A. The value range from -1 to 1

B. The value range from 0 to -1

C. The value range from 0 to 1

D. Any one of the above

ANSWER: C

With 3 bits per pixel, we can accommodate 8 gray levels. If we use 8 bits per pixel then what is the value of gray
levels?

A. 18 gray levels

B. 128 gray levels

C. 256 gray levels

D. No color

ANSWER: C

If any intensity input value near 0.33 would be stored as the binary value 1 in the frame buffer, then it
displays__________.

A. Dark green color

B. Light gray color

C. Dark gray color

D. White or black

ANSWER: C

RGB colors on internet applications are called___________.

A. Safe colors

B. Colors space

C. Web colors

D. Safe web colors

ANSWER: D

Equation that describes hue is ___________.

A. H = H-90

B. H = H-100

C. H = H-120

D. H = H-180

ANSWER: C

0 degree of red color in hue image will correspond to______________.

A. Boundary
B. Edges

C. White region

D. Black region

ANSWER: D

White color in a Cartesian coordinate system can be represented as____________.

A. (0,1,1)

B. (0,1,0)

C. (0,0,1)

D. (1,1,1)

ANSWER: D

Color model is also called___________.

A. color system

B. color space

C. color area

D. Both A and B

ANSWER: D

The additive color models use the concept of___________.

A. Printing ink

B. Light to display color

C. Printing line

D. None of these

ANSWER: B

The subtractive color model use the concept of ____________.

A. Printing ink

B. Light to display color

C. Printing line

D. None of these

ANSWER: A

Color apparent in additive model are the result of

A. Reflected light

B. Transmission of light

C. Flow of light

D. None of these
ANSWER: B

Color apparent in subtractive model are the result of

A. Amount of Reflected light

B. Transmission of light

C. Flow of light

D. None of these

ANSWER: A

Two dimensional color model are_____________.

A. RGB and CMKY

B. RBG and CYMK

C. RGB and CMYK

D. None

ANSWER: C

RGB model are used for____________.

A. Computer display

B. Printing

C. Painting

D. None of these

ANSWER: A

CMYK model are used for______________-.

A. Computer display

B. Printing

C. Painting

D. None of these

ANSWER: B

The intersection of three primary RGB color produces________.

A. White color

B. Black color

C. Magenta color

D. Blue color

ANSWER: A

The intersection of primary CMYK color produces__________.

A. White color
B. Black color

C. Cyan color

D. Magenta color

ANSWER: B

The RGB model display a much _______ percentage of the visible band as compared to CMYK.

A. Lesser

B. Larger

C. Medium

D. None of these

ANSWER: B

Color depth can be defined by ________ which can be displayed on a display unit.

A. Bits per pixel

B. Bytes per pixel

C. Megabyte per pixel

D. None of these

ANSWER: A

Each bit represent

A. One color

B. Two color

C. Three color

D. None

ANSWER: A

RGB true color model has _______ color depth.

A. 24bit

B. 32bit

C. 64bit

D. None

ANSWER: A

CMYK true color model has _______ color depth.

A. 24bit

B. 32bit

C. 64bit

D. None
ANSWER: B

Hue and saturation, both together produce_________.

A. Brightness

B. Transitivity

C. Chromaticity

D. Reflectivity

ANSWER: C

0 degree of red color in hue image will correspond to________.

A. Boundary

B. Edges

C. White region

D. black region

ANSWER: D

Green plus blue color produces________.

A. Yellow

B. Red

C. Magenta

D. Cyan

ANSWER: D

Three primary colors are_________.

A. Red, green, blue

B. Red, cyan, blue

C. Red, white, black

D. Red, green, yellow

ANSWER: A

Total amount of energy from light source is called________.

A. Brightness

B. Reflectance

C. Luminance

D. Radiance

ANSWER: D

Hues opposites to each others are known as____________.

A. Edges
B. Boundaries

C. Complements

D. Saturation

ANSWER: C

Color spectrum consists of__________.

A. 4 colors

B. 6 colors

C. 7 colors

D. 8 colors

ANSWER: C

One that is not a color model is__________.

A. RCB

B. CMYK

C. RGB

D. HSI

ANSWER: A

Intensity can be converted to color transformation by assigning colors to___________.

A. pixels

B. coordinates

C. pixel depth

D. intensity levels

ANSWER: D

Color model used for monitors is__________.

A. CMYK

B. BGR

C. RGB

D. CMR

ANSWER: C

The dynamic effect of an image is called_________.

A. Video

B. Animation

C. Super sampling

D. None of these
ANSWER: B

The animation can be defined as a collection of images played in______.

A. Not sequence

B. Defined sequence

C. Both a & b

D. None of these

ANSWER: B

When sound is included in the animation, it become____________.

A. Audio

B. Video

C. Both a & b

D. None of these

ANSWER: B

Many online animation tools are used to create animation in the form of___________.

A. JPEG image

B. PDF image

C. GIF image

D. None of these

ANSWER: C

The types of animation are__________.

A. Traditional animation

B. Computer animation

C. Both a & b

D. None of these

ANSWER: C

The types of computer animation are____________.

A. 2D computer animation

B. 3D computer animation

C. Both a & b

D. None of these

ANSWER: C

In computer graphics, a graphical object is known as____________.

A. Point
B. Segment

C. Parameter

D. None of these

ANSWER: B

An object can be viewed as a collection of__________.

A. One segment

B. Two segment

C. Several segments

D. None of these

ANSWER: C

Every segment has its own attributes like________.

A. Size, visibility

B. Start position

C. Image transformation

D. All of these

ANSWER: D

By using the attributes of segment , we can________ any segment.

A. Control

B. Print

C. None of these

D. Change

ANSWER: A

A two-dimensional array contain the details of all the segment are called________.

A. Segmentation table

B. Segment name

C. Operation

D. None of these

ANSWER: A

We assign all the attributes of segment under the________.

A. Segment Name

B. Segment size

C. Array

D. None of these
ANSWER: A

The initial size of segment will be_______.

A. 1

B. 0

C. 2

D. 3

ANSWER: C

The removal of a segment with its details are called________.

A. Alter the segments

B. Deletion of segments

C. Closing the segment

D. None of these

ANSWER: B

Deletion of any segment is much________ than creation of any new segment.

A. Easier

B. Difficult

C. Higher

D. None of these

ANSWER: B

When a display file is divided into number of subparts then each part is called as____.

A. Segment

B. Page

C. Image

D. Structure

ANSWER: A

A segment is a __________.

A. Small part of the whole scene

B. The complete scene

C. The collection of all pictures of the scene

D. None of these

ANSWER: A

Segments are called as structures in ____________ System.

A. GKS
B. PHIGS

C. Core

D. CGM

ANSWER: C

Which of the following attribute of the segment is used to make changes in image?

A. Visibility

B. Segment name

C. Image Transformation

D. Segment Size

ANSWER: D

Which of the following is not applied on segment?

A. Delete

B. Create

C. Close

D. Search

ANSWER: D

Which of the following operation is valid on Segment?

A. Copy

B. Search

C. Rename

D. Update

ANSWER: C

_______ attribute of segment is used to uniquely identify a particular segment.

A. Segment Start

B. Segment Name

C. Segment Size

D. Visibility

ANSWER: B

We can not have more than one segment open at a time. Statement true or false

A. TRUE

B. FALSE

C. Sometimes

D. None of these
ANSWER: A

The segment name is must be unique. State true or false.

A. TRUE

B. FALSE

C. Sometimes

D. None of these

ANSWER: A

For creation of new segment, we have to write ___________.

A. Seg_Start [Seg_Name]=Next free location in display file

B. Seg_Start [Seg_Name]= Current location in display file

C. Seg_Start [Seg_Start]=Next free location in display file

D. Seg_Start [Seg_Start]=Current location in display file

ANSWER: A

The default value of Visibility attribute is ______.

A. OFF

B. ON

C. 0

D. 1

ANSWER: C

Segment Name always start from_________.

A. 0

B. 1

C. -1

D) None of these

ANSWER: C

To delete a particular segment________.

A. Set Visibility attribute of that segment as OFF.

B. Shift all next segments up and overlap the segment to be deleted.

C. Make the size of the segment to be deleted as zero in segment table and update the segment start attribute of next
segment.

D. Both B & C

ANSWER: D

To delete all the segments simultaneusly_______.

A. Set size of all segments to zero

B. Set visibility attribute of all segment as OFF

C. Set segment start of all the segment to one

D. Both A & C

ANSWER: A

After deleting a particular segment, ……………… attribute of all next segments needs modification.

A. Segment Size

B. Segment start

C. Segment name

D. Visibility

ANSWER: C

After deleting a particular segment, the segment start attribute of all next segment become_________.

A. Segment start of a particular segment - size of segment to be deleted

B. Segment Start of particular segment - Size of segment start of segment to be deleted.

C. Segment start of particular segment - size of next segment

D. None of these

ANSWER: A

The segment is opened if_______.

A. The segment name is not in sorted order

B. More than two segments are not having same segment name

C. Segment name is starting from one

D. None of these

ANSWER: D

Which of the following statement says segment is invalid?

A. if the size of segment is zero.

B. If the segment name is zero

C. if two segment starts from same location.

D. None of these

ANSWER: C

Double Buffering concept in segments is nothing but_______.

A. maintaing two temporary buffers

B. Maintating two images

C. Modifying the existing image

D. None of these

ANSWER: C

Segment Renaming means_____.

A. copying old segment name to new segment

B. Assigning new segment name to existing segment.

C. Assigning same name for two segments

D. None of thes

ANSWER: B

It is necessary to organize the dispiay file in such away that it will be divided into several ______, which posses the
portion of overall picture.

A. Line

B. Pixel

C. Segment

D. Curves

ANSWER: C

Which is not attribute associated with segment?

A. Segment no

B. Segment start

C. Segment size

D. Length

ANSWER: D

This attribute/field additionaliy used in segment linked list___.

A. Colour

B. Visibility

C. Scalex

D. Link

ANSWER: A

Which process is used to keep replication of original segment?

A. Create segment

B. Close segment

C. Rename segment

D. Delete segment

ANSWER: D
 MCQ on UNIT 3
1. A three dimensional graphics has
a. Two axes
b. Three axes
c. Both a & b
d. None of these

2. _________as the most commonly used boundary presentation for a 3-D graphics object
a. Data polygon
b. Surface polygon
c. System polygon
d. None of these

3. A three dimensional object can also be represented using_______

a. Method
b. Equation
c. Point
d. None of these

4. An_______ can be considered as an extension of spherical surface

a. Bezier
b. Ellipsoid
c. Shearing
d. None of these

5. _______curve is one of the sp line approximation methods

a. Bezier
b. Ellipsoid
c. Shearing
d. None of these

6. A Bezier curve is a polynomial of degree ___________the no of control points used

a. One more than
b. One less than
c. Two less than
d. None of these

7. The most basic transformation that are applied in three-dimensional planes are
a. Translation
b. Scaling
c. Rotation
d. All of these

8. The transformation in which an object can be shifted to any coordinate position in three dimensional
plane are called
a. Translation
b. Scaling
c. Rotation
d. All of these

9. The transformation in which an object can be rotated about origin as well as any arbitrary pivot point are
called
a. Translation
b. Scaling
c. Rotation
d. All of these

10. The transformation in which the size of an object can be modified in x-direction ,y-direction and z-
direction
a. Translation
b. Scaling
c. Rotation
d. All of these
11. Apart from the basic transformation ,________are also used
a. Shearing
b. Reflection
c. Both a & b
d. None of these

12. In which transformation ,the shape of an object can be modified in any of direction depending upon the
value assigned to them
a. Reflection
b. Shearing
c. Scaling
d. None of these

13. In which transformation ,the mirror image of an object can be seen with respect to x-axis, y-axis ,z-axis as
well as with respect to an arbitrary line
a. Reflection
b. Shearing
c. Translation
d. None of these

14. How many types of projection are

a. 1
b. 2
c. 3
d. 4

15. The types of projection are

a. Parallel projection and perspective projection
b. Perpendicular and perspective projection
c. Parallel projection and Perpendicular projection
d. None of these

16. How many types of parallel projection are

a. 1
b. 2
c. 3
d. 4

17. The types of parallel projection are

a. Orthographic projection and quadric projection
b. Orthographic projection and oblique projection
c. oblique projection and quadric projection
d. None of these

18. _________are the three dimensional analogs of quad trees

a. Quadric
b. Octrees
c. Geometry
d. None of these

19. By which more complex objects can be constructed

a. Quadric surfaces
b. Wire frame model
c. Composite transformation
d. None of these

20. _______refers to the common elements of graphics scenes ,often used in graphics package as primitive
components
a. Quadric surfaces
b. Wire frame model
c. Composite transformation
d. None of these
21. _________refer to the shapes created by union, intersection and difference of given shapes
a. Wire frame model
b. Composite transformation
c. Constructive solid geometry methods
d. None of these

22. ________refer to a model that represent all the dimension of an object external as well as internal
a. Wire frame model
b. Constructive solid geometry methods
c. Composite transformation
d. None of these

23. ________refers to the result obtained by multiplying the matrix of the individual transformation
representation sequences
a. Wire frame model
b. Constructive solid geometry methods
c. Composite transformation
d. None of these

24. The projection in which the projection plane is allowed to intersect the x, y and z-axes at equal distances
a. Wire frame model
b. Constructive solid geometry methods
c. Isometric projection
d. Back face removal

25. In which projection ,the plane normal to the projection has equal angles with these three axes
a. Wire frame model
b. Constructive solid geometry methods
c. Isometric projection
d. Back face removal

26. ___________is a simple object space algorithm that removes about half of the total polygon in an image
as about half of the faces of objects are back faces
a. Wire frame model
b. Constructive solid geometry methods
c. Isometric projection
d. Back face removal

27. By which ,we can take a view of an object from different directions and different distances
a. Projection
b. Rotation
c. Translation
d. Scaling

28. Parallel projection shows the

a. True image of an object
b. True size of an object
c. True shape of an object
d. all of these

29. Projection rays(projectors) emanate from a

a. COP(centre of projection )
b. Intersect projection plane
c. Both a & b
d. None of these

30. The centre of projection for parallel projectors is at

a. Zero
b. Infinity
c. One
d. None of these
31. In orthographic projection, engineering use
a. Top view of an object
b. Front view of an object
c. Side view of an object
d. All of these

32. The orthographic projection that show more than one side of an object are called
a. Axonometric projection
b. Isometric projection
c. Both a & b
d. None of these

33. The projection that can be viewed as the projection that has a centre of projection at a finite distance from
the plane of projection are called
a. Parallel projection
b. Perspective projection
c. Isometric projection
d. None of these

34. The perspective projection is more practical because the distant objects appear
a. Smaller
b. Larger
c. Neither smaller nor larger
d. None of these

35. The equation of scaling transformation will be

a. X1=x+Tx,y1=y+Ty,z1=z+Tz
b. X1=x.sx,y1=y.sy,z1=z.sz
c. Both of these
d. None of these

36. The equation of translation transformation will be

a. X1=x+Tx,y1=y+Ty,z1=z+Tz
b. X1=x.sx,y1=y.sy,z1=z.sz
c. Both of these
d. None of these

37. Sp line curve can be either

a. Bezier sp line
b. B sp line
c. Both a & b
d. None of these

38. Bezier sp line always passes through

a. First and second control point
b. Does not pass from First and second control point
c. Both a & b
d. None of these

39. The equation for describing surface of 3D plane are

a. Ax+ By+ Cz+ D= 0
b. Ax+ By+ Cz = 0
c. Ax+ By+ D= 0
d. Ax+ By+ Cz+ D= 1

40. The object refers to the 3D representation through linear, circular or some other representation are
called
a. Quadric surface
b. Sweep representation
c. Torus
d. None of these
41. The distance of a line from the projection plane determines
a. Its size on projection plane
b. Its length on projection plane
c. Its width on projection plane
d. Its height on projection plane

42. The further the line from the projection plane, _______its image on the projection plane
a. Smaller
b. Larger
c. Neither smaller nor larger
d. None of these

43. The Bezier curve obtained from the four control points is called a
a. Square Bezier curve
b. Cubic Bezier curve
c. Hectare Bezier curve
d. Rectangle Bezier curve

44. The shape of a Bezier curve primarily depends upon the

a. Position of control points
b. Distance of control points
c. Position of control panel
d. None of these

45. The no of control points in a Bezier curve ensures the

a. Jaggies of curve
b. Smoothness of curve
c. Straightness of curve
d. None of these

46. More the control points of a Bezier curve,________ quality of the curve
a. Higher
b. Lower
c. Bad
d. None of these

47. ______is one of the function that is used to specify a single plane surface
a. Meta-ball model
b. Fill area
c. Reflection
d. None of these

48. Meta-ball is used to describe

a. Simplest object
b. Complex object
c. Composite object
d. None of these

49. Super quadrics is a class of object that contain

a. Data
b. Codes
c. Both a & b
d. None of these

50. When two molecules move apart, which effect on molecular shapes
a. Stretching
b. Snapping
c. Contracting
d. All of these

51. The sweep representation of an object refers to the

a. 2D representation
b. 3D representation
c. Both a & b
d. None of these
f we multiply any matrix with___matrix then we get the original matrix A___.
A. Scaling matrix
B. Translation matrix
C. Identity matrix
D. Opposite matrix
ANSWER: C
A Pixel is represented dy a tuple Xw,Yw,w in______.
A. Normalised Device Coordinates
B. Homogeneous coordinates system
C. 3D coordinate system
D. None of these
ANSWER: B
A _______ transformation alters the size of an object.
A. Scaling
B. Rotation
C. Translation
D. Shear
ANSWER: A
If the angle Q is positive then the rotation direction will be _________.
A. Clockwise
B. Anticlockwise
C. Parallel
D. Perpendicular
ANSWER: B
- - is equivalent to reflection about the
line ______.
A. X=-Y
B. Y=-X
C. X=Y
D. X+Y=1
ANSWER: CThe shape of the object gets by _________transformation.
A. Scaling
B. Rotation
C. Translation
D. Shear
ANSWER: D
A_______is a transformation that produces a mirror image of an object.
A. Scaling
B. Translation
C. Reflection
D. Both B & C
ANSWER: C
If we multiply any matrix A with identity matrix then we get the________matrix.
A. Identity matrix
B. Translation matrix
C. Scaling matrix
D. Original matrix
ANSWER: D
In homogeneous co-ordinate system a pixel is represented as ____________.
A. X,Y
B. X,Y,Z
C. X,Y,W
D. Xw,Yw,w
ANSWER: D
Two consecutive transformation t1 and t2 are _________.
A. Additive
B. Substractive
C. Multiplicative
D. None of these
ANSWER: A
.
A. Reflection about y-axis
B. Reflection about x-axisC. Reflection about origin
D. None of these
ANSWER: B
Two consecutive scaling transformation t1 and t2 are __________.
A. Additive
B. Substractive
C. Multiplicative
D. None of these
ANSWER: C
After scaling a triangle having coordinates A(0,0),B(5,0),C(5,5)by 2 units in X and 3 units in Y direction the new
coordinates will be___________.
A. A(0,0),B(10,0),C(10,15)
B. A(0,0),B(10,15),C(10,0)
C. A(0,0),B(0,10),C(15,10)
D. A(2,3),B(10,0),C(10,15)
ANSWER: A
After performing Y-shear transformation we got A(2,5),B(4,11),C(2,7).If the constant value is 2 then original
coordinates will be___________.
A. A(2,5),B(4,11),C(2,7)
B. A(2,1),B(4,3),C(2,3)
C. A(4,1),B(10,3),C(4,3)
D. A(5,11),B(3,4),C(3,2)
ANSWER: B
After rotating a triangle having about origin in anticlockwise direction,thenresultin
triangle will be_____.
A. A(0,0),B(3,-3),C(0,6)
B. A(0,0),B(-3,3),C(0,6)
C. A(0,0),B(0,-6),C(3,-3)
D. A(0,0),B(0,6),C(-3,3)
ANSWER: D
The point (x,y) becomes (y,x) in____________transformation.
A. Reflection about origin y-axis
B. Reflection about x-axis
C. Reflection at line Y=XD. Reflection about y-axis
ANSWER: C
Which of the following transformation is not used in rotation about arbitrary point in 2D?
A. Scaling
B. Rotation
C. Translation
D. None of these
ANSWER: A
After performing X-shear on triangle having A(2,1),B(4,3)C(2,3) with the constant value as 2,the resultant triangle
will be______.
A. A(2,5),B(4,1),C(2,7)
B. A(10,3),B(4,5),C(4,1)
C. A(4,1),B(10,3),C(4,3)
D. A(5,2),B(4,11),C(7,2)
ANSWER: C
If the resultant object is given along with the set of transformations applied on it, then to find the original object we
have to use___________.
A. Affine transformation
B. Reverse transformation
C. Normal transformation
D. Inverse transformation
ANSWER: D
Two consecutive rotation transformation are always__________.
A. Additive
B. Subtractive
C. Multiplicative
D. None of these
ANSWER: A
Two consecutive rotation transformation are always commutative____________.
A. TRUE
B. FALSE
C. Not always
D. None of these
ANSWER: AA point (x,y) becomes (-x,y) in__________transformation.
A. Reflection at X axis
B. Reflection at Y axis
C. Reflection at origin
D. Reflection about line Y=X
ANSWER: B
In Y-shear transformation point (x,y) becomes_______.
A. x+yb,xa+y
B. x+yb,y
C. x,xa+y
D. None of these
ANSWER: C
Reflection about X-axis followed by reflection about Y-axis is equivalent to_______.
A. Reflection about line Y= X
B. Reflection about origin
C. Reflection about line Y=-X
D. Reflection about Y-axis
ANSWER: B
Two consecutive scaling transformation are always commutative___________.
A. TRUE
B. FALSE
C. Not always
D. None of these
ANSWER: A
If a circle is scaled in only one direction then it will become___________.
A. Parabola
B. Hyperbola
C. Ellipse
D. Circle
ANSWER: C
The transformation that changes the co-ordinate positions of an object along a circular path is called_______.
A. Translation
B. ScalingC. Rotation
D. Reflection
ANSWER: C
The result of two successive 2D rotations R(Q1) and R(Q2) is___________.
A. R(Q1+Q2)
B. R(Q1.Q2)
C. R(Q1-Q2)
D. R(Q1/Q2)
ANSWER: A
If we take mirror reflection of a points(x,y) along x-axis then the point becomes_________.
A. (x,-y)
B. (-x,-y)
C. (-x,y)
D. (y,x)
ANSWER: A
If we take mirror reflection of a points(x,y) along the line Y=X then the point becomes________.
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (y,x)
ANSWER: D
The number of matrices required to rotate an object about a point(1,1) are___________.
A. 1
B. 2
C. 3
D. 4
ANSWER: C
In X-shear transformation point(x,y)becomes_________.
A. (x+yb,xa+y)
B. (x+yb,y)
C. (x,xa+y)
D. None of these
ANSWER: BIf we take mirror reflection of a point (-x,y) along the origin then the point Becomes_________.
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (y,x)
ANSWER: A
Shear transformation can be formed by scaling and rotation,justify True or False .
A. TRUE
B. FALSE
C. Not always
D. None of these
ANSWER: A
If a point (x,-y)is rotated along y axis by 180 degree in clockwise direction Followed by90 degree in anticlockwise
direction then it becomes__________.
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (-y,x)
ANSWER: D
Which transformation needs homogeneous coordinates to represent it in Matrix from?
A. Scaling
B. Rotation
C. Translation
D. Reflection
ANSWER: C
Which of the following statement is not correct with respect to homogeneous coordinates?
A. It is used to combine transformations
B. Each point is represented as (xw,yw,w)
C. It is used for representing translation in matrix form
D. Homogeneous coordinates are represented in 2*2 matrix form
ANSWER: D
Any 2D point is represented in a matrix form with dimension as_________.
A. 1*2B. 2*1
C. 1*1
D. 2*2
ANSWER: A
Any 2D point in homogeneous coordinates is represented in a matix form with dimension as________.
A. 1*2
B. 2*1
C. 1*3
D. 3*1
ANSWER: C
Which of the following 2D transformation is not represented in matrix form in non homogeneous coordinate
system?
A. Scaling
B. Rotation
C. Translation
D. Reflection
ANSWER: C
If we need to tilt the 2D object in one direction then we have to use_____transformation.
A. Scaling
B. Translation
C. Shear
D. Rotation
ANSWER: C
If we need to tilt the height of the object keeping width same as original object then we have to
use________transformations.
A. Scaling in Y direction
B. Scaling
C. Y-shearing
D. X-shearing
ANSWER: B
If we need to shift the width of the object keeping height as unchanged,then we have to
use__________transformations.
A. TranslationB. Scaling
C. Y-shearing
D. X-shearing
ANSWER: D
In Scaling transformation Sx Indicate______.
A. Scaling factor along X axis
B. Translation factor along X axis
C. Tilting factor along X axis
D. None of these
ANSWER: A
In translation transformation Ty indicates____________.
A. Scaling factor along Y direction
B. Translation factor along Y direction
C. Tilting factor along Y direction
D. None of these
ANSWER: B
If the size of triangle needs to be doubled by keeping the center triangle at the same position as that of original
triangle. then we need to apply ______transformation.
A. Only scaling
B. Only translation
C. Scaling and translation
D. Scaling and Rotation
ANSWER: C
If we have applied scaling by 2 units in both directions and received final coordinates of the polygon, then to recover
the original coordinates of the polygon we have to apply scaling transformation with...
A. Sx=2, Sy=2
B. Sx=1/2, Sy=1/2
C. Sx=1/2, Sy=2
D. Sx=2, Sy=1/2
ANSWER: B
If have the final coordinates of the polygen, then to recover the original coordinates of polygen we have to
apply___________.
A. Scaling
B. TranslationC. Inverse transformation
D. None of these
ANSWER: C
Which of the following transformation are needed if we want to scale the object with respect to a point other than
origin?
A. Scaling
B. Transformation
C. Both a and b
D. Rotation
ANSWER: C
A point x(2,3) is reprensented in homogeneous coordinates as_________.
A. (2,3)
B. (2,3,1)
C. (2,3,1)
D. (2,3,0)
ANSWER: C
The transformation matrix is used for__________.
A. Reflection at X axis
B. Reflection at Y axis
C. Reflection at origin
D. None of these
ANSWER: B
The transformation matrix is used for__________.
A. Reflection at X axis
B. Reflection at Y axis
C. Reflection at origin
D. Reflection at line Y=X
ANSWER: C
The transformation matrix is used for__________.
A. Reflection at origin
B. Reflection at X axis
C. Reflection at Y axis
D. Reflection at the line Y=XANSWER: D
The transformation matrix is used for_____________.
A. Scaling
B. Y-shear
C. X-shear
D. None of these
ANSWER: B
If we rotate a triangle ABC having A(1,1), B(10,1), C(5,5) by 90 degree in anticlockwise direction then the ABC will
become________.
A. A(1,1), B(10,1), C(5,-5)
B. A(-1,1), B(-10,1), C(-5,5)
C. A(-1,1), B(-1,10), C(-5,5)
D. A(-1,1), B(-1,10), C(-5,-5)
ANSWER: B
Find out final co-ordinate of a figure bounded by co-ordinate A(2,1), B(2,3), C(4,2), D(4,2) with scale factor
Sx=Sy=3.
A. A(6,3), B(6,9), C(6,12), and D(12,6)
B. A(6,3), B(6,9), C(6,12), and DANSWER: B6,12)
C. A(6,3), B(6,9), C(12,6), and D(12,6)
D. A(6,3), B(9,6), C(12,6), and D(6,12)
ANSWER: C
If we perform X shear on a triangle having A(2,1), B(4,3), C(2,3). With constant value as 2 then the new coordinate
will be________.
A. A(4,1), B(10,3), C(2,3)
B. A(4,1), B(10,3), C(4,3)
C. A(2,5), B(4,11), C(2,7)
D. A(2,5), B(4,11), C(7,2)
ANSWER: B
If we perform Y shear on a triangle having A(2,1), B(4,3), C(2,3). With constant value as 2 then the new coordinate
will be_________.
A. A(4,1), B(10,3), C(2,3)
B. A(4,1), B(10,3), C(4,3)
C. A(2,5), B(4,11), C(2,7)
D. A(2,5), B(4,11), C(7,2)ANSWER: C
If we rotate a triangle ABC having A(0,0), B(6,0) and C(3,3) by 90 degree about origin in anticlockwise direction
then triangle ABC will become as_________.
A. A(0,0), B(0,6), C(-3,3)
B. A(0,0), B(6,0), C(-3,3)
C. A(0,0), B(0,6), C(3,-3)
D. A(0,0), B(6,0), C(3,-3)
ANSWER: A
If we translate the square ABCD whose co-ordinate are A(0,0), B(3,0), C(3,3) and D(0,3) by 2 units in both
directions then the new coordinates of ABCD will be______.
A. A(2,2) , B(3,2), C(5,5), D(0,5)
B. A(2,2) , B(5,2), C(5,5), D(2,5)
C. A(2,2) , B(5,2), C(3,3), D(2,5)
D. A(2,2) , B(3,2), C(5,5), D(2,5)
ANSWER: B
If we scale the square ABCD whose co-ordinate are A(2,2), B(5,2), C(5,5), D(2,5) by 1.5 and 0.5 units in X and Y
directions respectively then the new coordinates of ABCD will be______.
A. A(3,1) , B(7.5,1), C(7.5,5), D(3,5)
B. A(3,3) , B(7.5,3), C(7.5,7.5), D(3,7.5)
C. A(3,1) , B(7.5,1), C(7.5,2.5), D(3,2.5)
D. A(3,3) , B(5,3), C(5,7.5), D(3,7.5)
ANSWER: C
If we scale a square ABCD with co-ordinate A(0,0), B(5,0), C(5,5) and D(0,5) by 2 units for x-direction and 3 units
for y-directions, then the final coordinates will be______.
A. A(0,0) , B(0,10), C(15,10) and D(15,0)
B. A(0,0) , B(10,0), C(10,15) and D(0,15)
C. A(0,0) , B(10,0), C(15,10) and D(0,15)
D. A(0,0) , B(10,0), C(15,10) and D(15,0)
ANSWER: B
If a final polygon co-ordinates are A(7,3), B(9,3), C(9,5) and D(7,5). We have applied translation by 1 in both x of y-
direction. Then the original polygon coordinates will be______.
A. A(6,3) , B(8,3), C(8,5), D(6,5)
B. A(7,2) , B(9,2), C(9,4), D(7,4)
C. A(6,2) , B(8,2), C(8,4), D(6,4)
D. None of theseANSWER: C
In 3D viewing, the world co-ordinate position of the objects are converted into viewing co-ordinates by _________
transformation.
A. Viewing
B. Projection
C. Workstation
D. 3D
ANSWER: A
In 3D viewing, mismatch between 3D objects and 2D displays is compensated by introducing_________.
A. Transformation
B. Projection
C. Rotation
D. Translation
ANSWER: B
In 3D viewing, the _________transformation is used to convert 3D description of objects in viewing co-ordinates to
the 2D projection co-ordinates.
A. Viewing
B. Projection
C. Workstation
D. 3D
ANSWER: B
In 3D viewing, ____________-transformation transforms the projection co-ordinates into the device coordinates.
A. Viewing
B. Projection
C. Workstation
D. 3D
ANSWER: C
A view Plane normal vector is perpendicular to _____________.
A. View Plane
B. Projection Plane
C. Reference Plane
D. None of these
ANSWER: AThe length of a directed line segment (the view plane normal vector) from the view plane to the view
reference point
is referred to as _________ distance.
A. Normal
B. Plane
C. View
D. Reference
ANSWER: C
Two Basic ways of projecting objects onto the view plane are _________ and _______- .
A. Serial, Parallel
B. Serial,Perspective
C. Parallel, Perspective
D. None of these
ANSWER: C
_____________ projection preserves relative proportions of the objects but does not produce the realistic views.
A. Serial
B. Perspective
C. Parallel
D. Any
ANSWER: C
_____________ projection produce the realistic views but does not preserves relative proportions.
A. Serial
B. Perspective
C. Parallel
D. Any
ANSWER: C
In perspective projection, the lines of projection converge at a single point called _________.
A. Center of projection
B. projection reference point
C. A & B
D. None of these
ANSWER: C
When the direction of the projection is normal to the view plane, we have an __________ parallel projection.
A. SerialB. Orthographic
C. Oblique
D. None of these
ANSWER: C
When the direction of the projection is not perpendicular to the view plane , we have an _______ parallel projection.
A. Serial
B. Orthographic
C. Oblique
D. None of these
ANSWER: C
The orthographic projection can display more that one face of an object, such an orthographic projection is called
__________ orthographic projection.
A. Axonometric
B. Isometric
C. Parallel
D. Perspective
ANSWER: A
The foreshortening factor is the ratio of the ____________.
A. Actual length of line to its projected length
B. Projected length of line to its true length
C. A Or B
D. None of these
ANSWER: B
Three types of axonometric projections are ________, _____, _________
A. Serial , Parallel, isometric
B. Paralle, Perspective , Isometric
C. Isometric, dimetric, trimetric
D. None of these
ANSWER: C
The vanishing point for any set of lines that are parallel to one of the three principle axes of an object is referred to as
a __________.
A. Principle vanishing point
B. Axis vanishing point
C. A or BD. None of these
ANSWER: C
The oblique projections are classified as ______ and ___________ projections.
A. Cavalier and Cabinet
B. Serial & Parallel
C. Parallel & Perspective
D. Isometric & dimetric
ANSWER: A
For the cavalier projection, the direction of projection makes a __________ angle with the view plane.
A. 40 degree
B. 45 degree
C. 63 degree
D. 63.4 Degree
ANSWER: B
When the direction of projection makes an angle of arc tan (2) = 63.4 degree with the view plane, the resulting view
is called a ____________ projection .
A. Parallel
B. Perspective
C. Cavalier
D. Cabinet
ANSWER: D
Cabinet projection appear ___________ realistic compared to cavalier projections.
A. More
B. Less
C. Equally
D. None of these
ANSWER: A
A Special form of the one-point perspective projection takes place when the vanishing point is placed centrally
within the figure.this type of projection is called a _________ projection.
A. Parallel
B. Perspective
C. Tunnel
D. Cavalier
ANSWER: CThe first viewing parameter in perspective projection we must consider is the?
A. Viewing window
B. Shift vector
C. View reference point
D. View reference plane
ANSWER: C
For a point (2,1,2) if we apply reflection about Y-axis, then the new point will become ___________.
A. (2,- 1,2)
B. (- 2,1,- 2)
C. (2,- 1,- 2)
D. (- 2,- 1,2)
ANSWER: B
Which of the following is not a type of perspective projection____________.
A. Isometric
B. One point
C. Two point
D. Three point
ANSWER: A
If we have applied scaling by 2 units in both directions and received final coordinates of the polygon, then to recover
the original coordinates of the polygon we have to apply scaling transformation with _____.
A. Sx = 2, Sy = 2
B. Sx = 1/2, Sy = 1/2
C. Sx = 1/2, Sy = 2
D. Sx = 2, Sy = 1/2
ANSWER: B
A cube is defined by 8 vertices A(0,0,0),B(2,0,0),C(2,2,0),D(0,2,0),E(0,0,2),F(0,0,2), G(2,0,2),H(2,2,2) After
translation by tx=1,ty=2,tz=1 resultant position is,
A. A(1,2,1), B(3,2,1), C(3,4,1), D(1,4,1), E(1,2,3), F(1,4,3),G(3,2,3), H(3,4,3)
B. A(1,2,1), B(1,2,3), C(3,4,1), D(1,1,1), E(1,2,3), F(1,4,3),G(3,2,3), H(3,3,3)
C. A(1,2,1), B(3,2,1), C(1,4,3), D(1,4,1), E(3,2,1), F(1,4,3),G(2,2,3), H(3,3,4)
D. None of the above.
ANSWER: A
After scaling a triangle having coordinates A(O,O),B(5,0), C(5,5) by 2 units in X and 3 units in Y direction, the new
coordinates will be_________.A. A(0,0),B(10,0), C(10,15)
B. A(0,0),B(10,15), C(10,0)
C. A(0,0),B(0,10), C(15,10)
D. A(2,3), B(10,0), C(10,15)
ANSWER: A
After performing Y-shear transformation we got A(2,5), B(4,11), C(2,7). If the constant value is 2 then the original
coordinates will be _________.
A. A(2,5), B(4,11), C(2,7)
B. A(2,l), B(4,3), C(2,3)
C. A(4,1), B(10,3), C(4,3)
D. A(5,11), B(3,4), C(3,2)
ANSWER: B
 Subject:-Computer Graphics
Objective type questions Unit-IV Segment and Animation

1. The color options are numerically coded with the following values.
A. Ranging from 0 through the positive integer
B. Ranging from 0 to 1
C. Ranging from 0 to -0
D. Only c
ANSWER: A

2. In color raster system, the number of color choices available depends on_____________.
A. colors in frame buffer
B. Amount of storage provided per pixel in frame buffer
C. RGB color
D. Neither a nor b
ANSWER: B

3. The color code “000” is for________.

A. White
B. Black
C. Blue
D. Green
ANSWER: B

4. Color information can be stored in____________.

A. Main memory
B. Secondary memory
C. Graphics card
D. Frame buffer
ANSWER: D

5. Whenever a particular color code is specified in an application program, the corresponding

binary value is placed in?
A. Color look-up table
B. Directly in frame buffer
C. a or b
D. Video lookup table
ANSWER: B

6. The range that specifies the gray or grayscale levels is___________.

A. The value range from -1 to 1
B. The value range from 0 to -1
C. The value range from 0 to 1
D. Any one of the above
ANSWER: C
7. With 3 bits per pixel, we can accommodate 8 gray levels. If we use 8 bits per pixel then what
is the value of gray
levels?
A. 18 gray levels
B. 128 gray levels
C. 256 gray levels
D. No color
ANSWER: C

8. If any intensity input value near 0.33 would be stored as the binary value 1 in the frame buffer,
then it displays__________.
A. Dark green color
B. Light gray color
C. Dark gray color
D. White or black
ANSWER: C

9. RGB colors on internet applications are called___________.

A. Safe colors
B. Colors space
C. Web colors
D. Safe web colors
ANSWER: D

10. Equation that describes hue is ___________.

A. H = H-90
B. H = H-100
C. H = H-120
D. H = H-180
ANSWER: C

11. 0 degree of red color in hue image will correspond to______________.

A. Boundary

B. Edges
C. White region
D. Black region
ANSWER: D
12. White color in a Cartesian coordinate system can be represented as____________.
A. (0,1,1)
B. (0,1,0)
C. (0,0,1)
D. (1,1,1)
ANSWER: D

13. Color model is also called___________.

A. color system
B. color space
C. color area
D. Both A and B
ANSWER: D

14. The additive color models use the concept of___________.

A. Printing ink
B. Light to display color
C. Printing line
D. None of these
ANSWER: B

15. The subtractive color model use the concept of ____________.

A. Printing ink
B. Light to display color
C. Printing line
D. None of these
ANSWER: A

16. Color apparent in additive model are the result of

A. Reflected light
B. Transmission of light
C. Flow of light
D. None of these

ANSWER: B

17. Color apparent in subtractive model are the result of

A. Amount of Reflected light
B. Transmission of light
C. Flow of light
D. None of these
ANSWER: A
18.Two dimensional color model are_____________.
A. RGB and CMKY
B. RBG and CYMK
C. RGB and CMYK
D. None
ANSWER: C

19. RGB model are used for____________.

A. Computer display
B. Printing
C. Painting
D. None of these
ANSWER: A

20. CMYK model are used for______________-.

A. Computer display
B. Printing
C. Painting
D. None of these
ANSWER: B

21. The intersection of three primary RGB color produces________.

A. White color
B. Black color
C. Magenta color
D. Blue color
ANSWER: A

22. The intersection of primary CMYK color produces__________.

A. White color

B. Black color
C. Cyan color
D. Magenta color
ANSWER: B

23. The RGB model display a much _______ percentage of the visible band as compared to
CMYK.
A. Lesser
B. Larger
C. Medium
D. None of these
ANSWER: B
24. Color depth can be defined by ________ which can be displayed on a display unit.
A. Bits per pixel
B. Bytes per pixel
C. Megabyte per pixel
D. None of these
ANSWER: A

25. Each bit represent

A. One color
B. Two color
C. Three color
D. None
ANSWER: A

26.RGB true color model has _______ color depth.

A. 24bit
B. 32bit
C. 64bit
D. None
ANSWER: A

27. CMYK true color model has _______ color depth.

A. 24bit
B. 32bit
C. 64bit
D. None

ANSWER: B

28. Hue and saturation, both together produce_________.

A. Brightness
B. Transitivity
C. Chromaticity
D. Reflectivity
ANSWER: C

29. Green plus blue color produces________.

A. Yellow
B. Red
C. Magenta
D. Cyan
ANSWER: D
30. Three primary colors are_________.
A. Red, green, blue
B. Red, cyan, blue
C. Red, white, black
D. Red, green, yellow
ANSWER: A

31. Total amount of energy from light source is called________.

A. Brightness
B. Reflectance
C. Luminance
D. Radiance
ANSWER: D

32. Hues opposites to each others are known as____________.

A. Edges

B. Boundaries
C. Complements
D. Saturation
ANSWER: C

33. Color spectrum consists of__________.

A. 4 colors
B. 6 colors
C. 7 colors
D. 8 colors
ANSWER: C

34. One that is not a color model is__________.

A. RCB
B. CMYK
C. RGB
D. HSV
ANSWER: A

35. Intensity can be converted to color transformation by assigning colors to___________.

A. pixels
B. coordinates
C. pixel depth
D. intensity levels
ANSWER: D
36. Color model used for monitors is__________.
A. CMYK
B. BGR
C. RGB
D. CMR
ANSWER: C

37. The dynamic effect of an image is called_________.

A. Video
B. Animation
C. Super sampling
D. None of these

ANSWER: B

38. The animation can be defined as a collection of images played in______.

A. Not sequence
B. Defined sequence
C. Both a & b
D. None of these
ANSWER: B

39. When sound is included in the animation, it become____________.

A. Audio
B. Video
C. Both a & b
D. None of these
ANSWER: B

40. Many online animation tools are used to create animation in the form of___________.
A. JPEG image
B. PDF image
C. GIF image
D. None of these
ANSWER: C

41. The types of animation are__________.

A. Traditional animation
B. Computer animation
C. Both a & b
D. None of these
ANSWER: C
42. The types of computer animation are____________.
A. 2D computer animation
B. 3D computer animation
C. Both a & b
D. None of these
ANSWER: C

43. In computer graphics, a graphical object is known as____________.

A. Point

B. Segment
C. Parameter
D. None of these
ANSWER:B

44. An object can be viewed as a collection of__________.

A. One segment
B. Two segment
C. Several segments
D. None of these
ANSWER:C

45. Every segment has its own attributes like________.

A. Size, visibility
B. Start position
C. Image transformation
D. All of these
ANSWER:D

46. By using the attributes of segment , we can________ any segment.

A. Control
B. Print
C. None of these
D. Change
ANSWER:A

47. A two-dimensional array contain the details of all the segment are called________.
A. Segmentation table
B. Segment name
C. Operation
D. None of these
ANSWER: A
48. We assign all the attributes of segment under the________.
A. Segment Name
B. Segment size
C. Array
D. None of these

ANSWER: A

49. The initial size of segment will be_______.

A. 1
B. 0
C. 2
D. 3
ANSWER: B

50. The removal of a segment with its details are called________.

A. Alter the segments
B. Deletion of segments
C. Closing the segment
D. None of these
ANSWER: B

51. Deletion of any segment is much________ than creation of any new segment.
A. Easier
B. Difficult
C. Higher
D. None of these
ANSWER:B

52. When a display file is divided into number of subparts then each part is called as____.
A. Segment
B. Page
C. Image
D. Structure
ANSWER: A

53. A segment is a __________.

A. Small part of the whole scene
B. The complete scene
C. The collection of all pictures of the scene
D. None of these
ANSWER: A
54. Segments are called as structures in ____________ System.
A. GKSB. PHIGS
C. Core
D. CGM
ANSWER: C

55. Which of the following attribute of the segment is used to make changes in image?
A. Visibility
B. Segment name
C. Image Transformation
D. Segment Size
ANSWER:D

56. Which of the following is not applied on segment?

A. Delete
B. Create
C. Close
D. Search
ANSWER: D

57. Which of the following operation is valid on Segment?

A. Copy
B. Search
C. Rename
D. Update
ANSWER: C

58. _______ attribute of segment is used to uniquely identify a particular segment.

A. Segment Start
B. Segment Name
C. Segment Size
D. Visibility
ANSWER: B

59. We can not have more than one segment open at a time. Statement true or false
A. TRUE
B. FALSE
C. Sometimes
D. None of these

ANSWER: A
60. The segment name is must be unique. State true or false.
A. TRUE
B. FALSE
C. Sometimes
D. None of these
ANSWER: A

61. For creation of new segment, we have to write ___________.

A. Seg_Start [Seg_Name]=Next free location in display file
B. Seg_Start [Seg_Name]= Current location in display file
C. Seg_Start [Seg_Start]=Next free location in display file
D. Seg_Start [Seg_Start]=Current location in display file
ANSWER: A

62. The default value of Visibility attribute is ______.

A. OFF
B. ON
C. 0
D. 1
ANSWER: B

63. Segment Name always start from_________.

A. 0
B. 1
C. -1
D) None of these
ANSWER: B

64. To delete a particular segment________.

A. Set Visibility attribute of that segment as OFF.
B. Shift all next segments up and overlap the segment to be deleted.
C. Make the size of the segment to be deleted as zero in segment table and update the segment
start attribute of next segment.
D. Both B & C
ANSWER: D

65. To delete all the segments simultaneusly_______

A. Set size of all segments to zero

B. Set visibility attribute of all segment as OFF
C. Set segment start of all the segment to one
D. Both A & C
ANSWER: A
66. After deleting a particular segment, .................. attribute of all next segments needs
modification.
A. Segment Size
B. Segment start
C. Segment name
D. Visibility
ANSWER: B

67. After deleting a particular segment, the segment start attribute of all next segment
become_________.
A. Segment start of a particular segment - size of segment to be deleted
B. Segment Start of particular segment - Size of segment start of segment to be deleted.
C. Segment start of particular segment - size of next segment
D. None of these
ANSWER: A

68. The segment is opened if_______.

A. The segment name is not in sorted order
B. More than two segments are not having same segment name
C. Segment name is starting from one
D. None of these
ANSWER: D

69. Which of the following statement says segment is invalid?

A. if the size of segment is zero.
B. If the segment name is zero
C. if two segment starts from same location.
D. None of these
ANSWER: C

70. Double Buffering concept in segments is nothing but_______.

A. maintaing two temporary buffers
B. Maintating two images
C. Modifying the existing image

D. None of these
ANSWER: B

71. It is necessary to organize the dispiay file in such away that it will be divided into several
______, which posses the portion of overall picture.
A. Line
B. Pixel
C. Segment
D. Curves
ANSWER:C

72. Which is not attribute associated with segment?

A. Segment no
B. Segment start
C. Segment size
D. Length
ANSWER: D

73. This attribute/field additionaliy used in segment linked list___.

A. Colour
B. Visibility
C. Scalex
D. Link
ANSWER: A

74. Which process is used to keep replication of original segment?

A. Create segment
B. Close segment
C. Rename segment
D. Delete segment
ANSWER: C
Que NoQuestion Option A Option B Option C Option D Answeweightag Unit
1 An example of POS expression is A + B(C + D) A'B + AC' + AB'C (A' + B + C)(A + B' + C) both (a) nad (b) C 1 mark Unit1
2 Karnaugh map is used for the purpose of Reducing the electronic circuits used. To map the given Boolean logic function. To minimize the terms in a Boolean expression. To maximize the terms of a given a Boolean expC 1 mark Unit1
3 The 2’s complement of the number 1101110 is 10001 10001 10010 None C 1 mark Unit1
4 Perform 2’s complement subtraction of (7)10 − (11)10 1100 (OR -4) 1101 (OR -5) 1011 (OR -3) 1110 (OR -6) A 1 mark Unit1
5 The bolean expression A + BC equals (A' + B)(A' + C) (A + B)(A + C) (A + B)(A' + C) none of the above B 1 mark Unit1
6 Minimize the following logic function using K-maps F(A,B,C,D) = m(1,3,5,8,9,11,15) + d(2A B' C' + C' D + B'D + A C' D + B'D + A A B' C' + B'D + A A B' C' + C' D + B'D A 1 mark Unit1
7 Reduce the following equation using k-map Y = (ABC)'+ A(CD)'+ AB'+ ABCD'+ (AB)'C B'+(AD)' B' (AD)' B'+AD A 1 mark Unit1
8 The expression _________ is an example of Commutative Law for Multiplication. AB+C = A+BC A(B+C) = B(A+C) AB=BA A+B=B+A C 1 mark Unit1
9 The 2’s complement of the number 1101101 is 101110 111110 110010 10011 D 1 mark Unit1
10 2's complement of any binary number can be calculated by adding 1's complement twice adding 1 to 1's complement subtracting 1 from 1's complement. calculating 1's compleme nt and inverting Most B 1 mark Unit1
11 The complement of a variable is always 1 0 inverse None C 1 mark Unit1
12 The Unsigned Binary representation can only represent positive binary numbers TRUE FALSE Both (A) and (B) None of Above A 1 mark Unit1
13 2's complement of 5 is 1101 1011 1010 1100 B 1 mark Unit1
14 the boolean expression AB'CD'is a sumterm a product term a literal term always 1 B 1 mark Unit1
15 Positive logic in a logic circuit is one in which logic 0 and 1 are represented by 0 and positive voltaglogic 0 and, - 1 are represented by negative and positive voltalogic 0 voltage level is higher than logic 1 voltage levlogic 0 voltage level is lower than logic 1 voltageD 1 mark Unit1
16 A binary digit is called a Bit Byte Number Character A 1 mark Unit1
17 The boolean expression X = AB + CD represents two ORs ANDed together a 4-input AND gate two ANDs ORed together an exclusiveOr C 1 mark Unit1
18 The Gray code for decimal number 6 is equivalent to 1100 1001 101 110 C 1 mark Unit2
19 Convert the decimal number 430 to Excess-3 code 11011000 11011000 11011001 110100001 A 1 mark Unit2
20 The gray code equivalent of (1011)2   is 1101 1010 1110 1111 D 1 mark Unit2
21 How many data select lines are required for selecting eight inputs? 1 2 3 4 C 1 mark Unit2
22 Half adder circuit is ______? Half of an AND gate A circuit to add two bits together Half of a NAND gate none of above B 1 mark Unit2
23 The full adder adds the Kth bits of two numbers to the difference of the previous bits sum of all previous bits carry from ( K - 1 )TH bit sum of previous bit C 1 mark Unit2
24 The number of two input multiplexers required to construct a 210 input multiplexer is 31 10 127 1023 D 1 mark Unit2
25 An AND circuit is a memory circuit gives an output when all input signals are present simultaneois a -ve OR gate is a linear circuit B 1 mark Unit2
26 A multiplexer is a logic circuit that accepts one input and gives several output accepts many inputs and gives many output accepts many inputs and gives one output accepts one input and gives one output C 1 mark Unit2
27 Logic gates with a set of input and outputs is arrangement of Combinational circuit Logic circuit Design circuits Register A 1 mark Unit2
28 Odd parity of word can beconveniently tested by OR gate AND gate NOR gate XOR gate D 1 mark Unit2
29 A demultiplexer is used to Route the data from single input to one of many outpSelect data from several inputs and route it to single output Perform serial to parallel conversion All of these A 1 mark Unit2
30 In which of the following gates, the output is 1, if and only if at least one input is 1? NOR AND` OR NAND C 1 mark Unit2
31 The time required for a gate or inverter to change its state is called Rise time Decay tim Propagation time Charging time C 1 mark Unit2
32 A combinational circuit is one in which the output depends on the input combination at the time input combination and the previous output input combination at that time and the previous inppresent output and the previous output A 1 mark Unit2
33 Which of the following statements accurately represents the two BEST methods of logic Boolean algebra and Karnaugh mapping Karnaugh mapping and circuit waveform analysis Actual circuit trial and error evaluation and wavefo Boolean algebra and actual circuit trial and erroA 1 mark Unit2
34 The binary numbers A = 1100 and B = 1001 are applied to the inputs of a comparator. WA > B = 1, A < B = 0, A < B = 1 A > B = 0, A < B = 1, A = B = 0 A > B = 1, A < B = 0, A = B = 0 A > B = 0, A < B = 1, A = B = 1 C 1 mark Unit2
35 A J-K flip-flop has two control inputs. What happens to the Q output on the active edge oThe Q output toggles to the other state. The Q output is set to 1. The Q output is reset to 0. The Q output remains unchanged A 1 mark Unit3
36 Flip-flop outputs are alway Complimentary The same Independent of each other same as previous input A 1 mark Unit3
37 The clear data and present input of the JK flip-flop are known as Synchronous inputs Directed input Either (a) or (b) None of these C 1 mark Unit3
38 Consider an RS flip-flops with both inputs set to 0. If a momentary '1' is applied at the inQ will flip from 0 to 1 and then back to 0 Q will flip from 0 to 1 and then back to 0 Q will flip from 1 to 0 Q will flip from 0 to 1 D 1 mark Unit3
39 The output of a sequential circuit depends on Present inputs only Past outputs only Both present and past inputs Present outputs only C 1 mark Unit3
40 In a digital counter circuit feedback loop is introduced to Improve distortion Improve stability Reduce the number of input pulses to reset the counAsynchron ous input and output pulses C 1 mark Unit3
41 A ring counter is same as up-down counter parallelcounter shift register Ripple carry Counter C 1 mark Unit3
42 The dynamic hazard problem occurs in Combinational circuit alone Sequential circuit only Both (a) and (b) None of these C 1 mark Unit3
43 A shift register can be used for Digital delay line Serial to parallel conversion Parallel to serial conversion All of these D 1 mark Unit3
44 Popular application of flip-flop are Transfer register Shift registers Counters All of these D 1 mark Unit3
45 To build a mod-19 counter the number of flip-flops required is 3 5 7 9 B 1 mark Unit3
46 The functional difference between S-R flip-flop and J-K flip-flop is that JK flip-flop is faster than SR flip-flop Has a feedback path Accepts both inputs 1 Both (a) and (b) C 1 mark Unit3
47 When an inverter is placed between both inputs of an SR flip-flop, then resulting flip-fl JK flip-flop D flip-flop SR flip-flop Master slave JK flip-flop B 1 mark Unit3
48 In a state diagram, the transition from a current state to the next state is determined by Current state and the inputs Current state and outputs Previous state and inputs Previous state and outputs A 1 mark Unit3
49 5-BIT JOHNSON COUNTER SEQUENCES THROUGH ____ STATES 7 10 32 25 B 1 mark Unit3
50 A positive edge-triggered flip-flop changes its state when ________________ Low-to-high transition of clock High-to-low transition of clock Enable input (EN) is set Preset input (PRE) is set A 1 mark Unit3
51 In ________ outputs depend only on the current state. Mealy machine Moore Machine State Reduction table State Assignment table B 1 mark Unit3
Que No Question Option A Option B Option C Option D Answer
1 The phenomenon of having a continuous glow of beam on the s Fluorescence Persistence Phosphorescence Incandescence C
2 Choose the correct statements monitors draw a picture one
m scan picture must be re
monitors draw a picture onewell
l suited for displaying A
3 Which statement about beam penetration method for producinused with raster scan monsed with random scan mtion method a wide range ofration gun, one for each g B
4 Which display is best suited for CAD systems RT with vector refresh monRT with raster scan mon Plasma panal display LED display B
5 When the computer is not able to maintain operation and disp Dropping out Snowing Flickering Blanking B
6 Which of the following adapters does not support. All points ad MGA EGA CGA VGA A
7 The resolution pffered by SVGA is ? 1024 x 768 pixels 720 x 348 pixels 800 x 600 pixels 640 x 350 pixels C
8 The typical aspect ratio of the CRT is ? 0.99 0.5 0.8 0.2 C
9 The CAD stands for ? Computer Aided Drawing Computer Aided Design Commonly Available Data Computer And Data B
10 Which one of the following transmits digital information to the Graphics tablet Mouse Joystick None of the above D
11 Which one of the following attributes is important for presenti Colour Character Format Font All D
12 A Scanner is specified by? tical and horizontal resolut Dots per inch can scan ength of the paper it can sca Rate of scanning A
13 In a display specified as 600x400 the number of pixels across t 600 400 240000 Both A and B A
14 If the resolution of a printer is 1200dpi, the number of dots per 1200 800 1200 x 1200 Both A and B C
15 Graphics programmes create images on the screen or printer e Bitmapped images Vector images Both A and B None of the above B
16 Graphics software packages are available for? Graphics Pictures Charts All of the above D
17 What technology is used for flat panel displays? Solid State RBG monitor VLSI Direct view storage tube A
18 Pixel stands for? Picture Element File Format Sound None of these A
19 Bitmap Image is also known as? Picture Photo Raster Images None of these C
20 SVGA system displays? 800 x 400 800 x 600 800 x 640 None of these B
21 Metafiles are_______that contains both raster and vector data. Multimedia Graphics WAV Word B
22 The number of LED display indicators in logic probe are? 1 2 Both A and B 4 B
23 The smallest addressable screen element is called as? Pixel Graph Voltage level Color Information A
24 Pixels on the graphics display represents? Mathemathical point tically can contain an infi Voltage values Picture B
25 The process of determining the approximate pixels for represe Rasterization Animation Both A and B Representation A
26 The relationship among the data and objects which are stored Application Programs Application Model Graphics Display Both A and B A
27 Selective or part erasing of screen is not possible in? Raster scan display Vector scan display DVST Both A and B C
28 Graphics software acts as a very powerful tool to create? Images Animated Pictures Both A and B System Interface C
29 Random-Scan monitors typically offer_____color choices? Only a few Wide Range Just1 or 2 Moderate range of A
30 RGB system needs____of storage for the frame buffer? 100 Megabytes 10 Megabytes 3 Megabytes 2 GB C
31 The SRGP package provides the ____to wide the variety of displ Interface Connection Link Way A
32 Replacing pixels is one of the methods of____? Thick Primitives Thin Primitives Stylish Primitives Both A and B A
33 When several types of output devices are available in graphics Bundled attributes Unbundles attributes Inquiry attributes All of the above A
34 The anti-aliasing technique which allows shift of 1/4, 1/2 and 3/ Pixel phasing Filtering Intesity compensation Sampling technique A
35 The major component of CRT are? Electronic Gun hosphorous coated scree Deflection plate All of the above D
36 The glow given off by the, phosphor during exposure of the ele Fluorescence Phosphorescence Persistence All of the above A
37 Raster is a synonym for the term? Array Matrix Model All of the above B
38 The___simply read each successive byte of data from the frame Digital Controller Data Controller Display Controller All of the above C
39 In ____computer graphics, the observer has no control over the Interactive Non interactive Visible Invisible B
40 In ____the displayed image is stored as a matrix of intensity va Clustered frame Clustered memory Frame buffer Frame section B
41 _____passes the content of the frame buffer to the monitor. Clustered frame Display controller Frame buffer Frame section B
42 The rectangular array of the picture elements is called as____. Cell Image Pixel Array C
43 For storing black and white images, black pixels represents as_ 0 1 2 3 B
44 To store 16 x 16 array of black and white pixels, the binary rep 24 28 30 32 D
45 _____plots continuos line and curves rather than seperate pixel Picture Image Line drawing Circle drawing C
46 Expansion of CRT is____. Cathode Ray Tube Computer Related Tube Component Related Tube Common Reflection Tube A
47 High resolution systems are often reffered as ____system. Horizontal Retrace High definition High persistence High filament B
48 ______display os based on television technology. Raster-Scan Random-Scan CRT Electron A
49 Random Scan monitors draw a picture one line at atime is calle Shape Vector Scalar Proportions B
50 Display list in random scan display is also called as _____. Refresh Display Raster Display Random Display Scalar Display A
51 _____in graphics systems are desugned as RGB monitors. Color CRT CMYK HS YIK A
52 A pixel is_____. mputer program that draw pre stored in secondary mlest resolvable part of the pi None C
53 In raster scan system the____beam is swept across screen. Electron Magnetic Electro Electrothermal A
54 In raster scan the elctron beam is swept across screen from____ Right to left Top to bottom Bottom to top Side to side B
55 Each screen point is referred to be as a_____. Point Pixel Position Element B
56 The primary output device in the graphics sytem is_____. Joystick Light Pen Keyboard Monitor D
57 The most common types of graphics monitor emplying a CRT is Raster Random CRT Electron A
58 The term_____refers to the total screen are Screen Gun Frame Pixel C
59 Example of random scan display is_____. Pen plotter Mouse Keyboard Printer A
60 Random scan monitor draw one picture at atime therefore they Vector Process Vector Monitor Vector Display Vector Picture C
61 An ____device is any device that provides information, which is Input Output CPU Memory A
62 Joystick consist of______. Stick Ball Wheel None of the above A
63 Isometric joystick has _____stick. Movable Partial movable Non-Movable Static C
64 ______Scanner with th resolution of 600 dots per inch. Dekstop full-color Flatbe Drum Color B
65 Refresh rates are described in the units of_____. Pixel meter Hertz Cubi C
66 A CRT monitor displays color picture by using a combination of Same Different Many Only One B
67 The non interactive computer graphics are also known as _____ Active Interactive Passive Video Games C
68 Aspect ratio is genrally defined as ratio of_____. Vertical to horizontal pointsorizontal to vertical poinertical to (Horizontal+Vertica Either A or B D
69 Pixel can be arrange in a regular____. One dimensional grid Two dimensional grid Three dimensional grid None of these B
70 Higher the no of pixels, _____the image quality. Bad Better Smaller None of the above B
71 TIFF(Tagged Image File Format) are used for___. Vector graphics Bitmap Both A and B None of these B
72 The resolution of raster scan display is _____. Low High definition Medium None A
73 Random scan systems are designed for_____. Line drawing applicationPixel drawing application Color drawing application None of these A
74 Beam penetration method is used in _____. Random Scan System Raster Scan System Both A and B None of these A
75 Graphics output devices are_____. Graphics tablet, Mouse Keyboard Light pen, Joystick None of these D
76 The inject printer is mostly common due to their____. Low cost Performance Both A and B None of these C
77 A joystick is a____. Graphics Input Device Graphics Output Device Both A and B None of these A
78 A wireless mouse works on Infra blue radiations Infra red radiation Infra green radiation None of these B
79 A 16 x 16 array of black and white pixels could be represented 64 bytes 32 bhytes 128 bytes 96 bytes B
80 The application area of computer graphics are Political Education and textbook CAD and entertainment All of these D
81 Images made upto thousand of pixels are called____. Bitmapped images Vector Story boards Graphics A
82 Vector images are____. Composed of pixels mposed of thousands of ddifficult to manipulate thanbjects such as lines, rectan D
83 Display processor is also called a ? Graphics controller Display coprocessor Both A and B Output device for graphic C
84 The process of display processor is ____from the graphics routi To free the CPU free the Secondary Mem To free the Main Memory Both A and C A
85 What is the name of the display feature that highlights are of th Pixel Reverse Video Touch Screen Cursor B
86 The operation of most ______is based on the standard cathode r Scanners Video monitors Printers Card readers B
87 Interactive computer graphics uses various kind of input devic Mouse Graphics tablet Joystick All of these D
88 A display controller serves to pass the contents of ______. Frame buffer to monitor Monitor to frame buffer Both A and B None of these A
89 The image is passed repeatedly to the monitor in the order to m 25 times a second 30 times a second 30 or more times a second None of these C
90 To store black and white images, black pixels are represented b Zero and One One and Zero Both A and B Non of these B
91 The display converter converts 0's and 1's into _____. TV monitor Video signal Electronic Signal None of these B
92 The image can be transmitted to the display point by _____. Line Segment Point None of these C
93 A basic interactive picture construction techniques are ioning and pointing, constravity field, rubber bandhing, dragging, inking and pai All of these D
94 The movement of different attributes of image would make the Picture Animation Painting None of these B
95 Which methods are used to get and set the position of a pixel , Drugging Method Basic Positioning Method Sketching Method Gravity Field Method B
96 Computer Graphics was first used by William Fetter in 1960 James Fetter in1969 James Gosling in1991 John Taylor in 1980 A
97 The component of interactive computer graphics are A light pen Display Unit Ank of Switches All of these D
98 Personal computer become powerful during the late 1960 1970 1980 1950 B
99 Which environment has been one of the most accepted tool for Graphics Macintosh Quake Multimedia B
100 Bresenham's circle algorithm uses the approach of Midpoint Point Line None of the above A
101 The side effects of scan conversion are Aliasing Anti aliasing Sampling None of the above A
102 The process of reducing aliasing is called Resolution Anti aliasing Sampling None of the above B
103 Two basic technique for anti- aliasing in ray tracing algorithmel sampling and super samp
ve sampling and super sael sampling and super sampl none of these B
104 The problem of aliasing are Staircase Unequal brightness Picket fence problem all of these D
105 The technique to minimizing aliasing are Increased no of resolutionify pixel sampling intens Super- sampling all of these D
106 What is the primary use of clipping in computer graphics? adding graphics emoving objects and line zooming copying B
107 A chain of connected line segments is called a ________. Polyline Polysegments Polygon Polychain A
A ploygon in which the line segment joining any two points wit
108 is called ________ polygon. Convex Concave Closed Complete A
109 __________ is a method for testing a pixel inside of a polygon. even-odd method winding number method A and B None of these C
110 The seed fill algorithm for filling polygon is classified as _______ flood, boundry even, odd edge, flood boundry, scan A
111 Polygoan filling algorithms those fill interior-defined regions ar flood fill boundry fill Scan line Edge fill A
112 Seed fill algo for filling polygon is ________ algorithm. recursive non-recursive A and B None of the above A
113 The process of selecting and viewing the picture with diffreren Clipping Windowing Segmenting All of the above B
114 Mapping the world co-ordinates into physical device co-ordina Translation mogeneous transformati co-ordinate conversion Viewing transformation D
115 An area on a physical device to which a window is mapped is c Window Segment Clip Viewport D
116 The region of a picture against which an object is to be clipped Clip Window Segment Clip Viewport A
117 Cohen-sutherland subdivision line clipping algorithm uses ____ 8 6 4 9 D
118 The transformation which maps the viewing co-ordinates to no Viewing transformation Translation normalization transformation
mogeneous transformati C
119 If both end points of a line are completely to the above of clipp
e is interior to the clipping w
rily completely exterior tmpletely exterior to the clipp None of these C
120 In computer graphics, a graphical object is known as________. Point Segment Parameter None of the above B
121 The line segment of polygon are called as _________. Edges Vertices Lines None of the above A
122 The rectangle space in which the world definition of region is d Screen coordinate system ing window or world win World coordinate system None of the above B
123 The process of coloring the area of a polygon is called__________ Polygon filling Polygon flow Aliasing Conversion A
124 The equation of scaling in 3D transformation will be x1=x+Tx,y1=y+Ty,z1=z+Tzx1=x.sx, y1=y.sy, z1=z.sz Both of these none of these B
125 In which transformation ,the mirror image of an object can be Reflection Shearing Translation none of these A
126 The transformation in which the size of an object can be modifi Translation Scaling Rotation All of these B
127 The transformation in which an object can be rotated about or Translation Scaling Rotation All of these C
128 The transformation in which an object can be shifted to any co Translation Scaling Rotation All of these A
129 _________as the most commonly used boundary presentation fo Data polygon Surface polygon System polygon none of these B
130 the line segment from the view plane to the view reference poin view-distance Projection distance view-path Both a & b A
131 The first viewing parameter we must consider is the? viewing window shift vector view reference point view reference plane C
132 A bilinear transformation can be simulated by the transformat
ormation, rotation and strettranslation and rotation ation, stretching and inversitretching, inversion and t D
133 Reflection of a point about x-axis, followed by a counter-clockw x = -y y=-x x=y x+y=1 C
134 The equation of translation in 3D transformation will be X1=x+Tx, Y1=y+Ty, Z1=z+TzX1=x.sx,Y1=y.sy, Z1=z.sz Both of these none of these A
135 The equation for describing surface of 3D plane are Ax+ By+ Cz+ D= 0 Ax+ By+ Cz = 0 Ax+ By+ D= 0 Ax+ By+ Cz+ D= 1 A
136 The object refers to the 3D representation through linear, circu Quadric surface Sweep representation Torus none of these B
137 If line is far away from the projection plane, _______ is its image Smaller Larger Neither smaller nor larger none of these A
138 The transformation in which an object is moved in a minimum Translation Scaling Rotation Reflection A
139 The transformation in which an object is moved from one posi Translation Scaling Rotation Reflection C
140 The transformation in which the dimension of an object are ch Translation Scaling Rotation Reflection B
141 Which attributes of image in 3D transformation changes the si SCALE-X SCALE-Y SCALE-Z All of these D
142 Which attributes of image in 3D transformation changes the po TRANSLATE-X TRANSLATE-Y TRANSLATE-Z All of these D
143 Which attributes of image in 3D transformation rotates the im ROTATE-X ROTATE-Y ROTATE-Z All of these D
144 The transformation that produces a parallel mirror image of a Reflection Shear Rotation Scaling A
145 A composite transformation matrix can be made by determinin Addition Subtraction Product none of these C
146 Apart from the basic transformation, ________are also used Shearing Reflection both a & b none of these C
147 The most basic transformation that are applied in three dimen Translation Scaling Rotation All of these D
148 A three dimensional graphics has Two axes Three axes both a & b none of these B
149 A transformation that slants the shape of objects is called the? shear transformation Translation Reflection Both a & b A
150 The transformation that produces a mirror image of an object Rotation Translation Reflection Both a & b C
151 A shearing transformation changes the__of an object? Size Location Shape Both a & b C
152 The projection that can be viewed as the projection that has a c Parallel Projection Perspective projection Isometric projection none of these B
153 The projection in which the projection plane is allowed to inter Wire frame model uctive solid geometry me Isometric projection Back face removal C
154 The types of parallel projection are hic projection and quadric ipc projection and oblique
e projection and quadric proj none of these B
155 The types of projection are rojection and perspective pcular and perspective prrojection and Perpendicular p none of these A
156 When the projection is obtained by projecting points along par isometric projection Perspective projection oblique projection cavalier projection C
157 In perspective projection, the lines of projection are not paralle Center of projection rojection reference poinrojection or projection refere interaction point C
158 Find the incorrect statement ve projection produces realrojection preserves realion gives realistic representat Both b & c D
159 Obliquee projection with an angle of 450 to the horizontal plan Cabinet projection isometric projection cavalier projection none of these C
160 Engineering drawing commonly applies? oblique projection Orthographic projection perspective projection none of these B
161 ______is a flexible strip that is used to produce smooth curve us Sp line Scan-line method Depth-sorting method None of these A
162 The types of sp line curve are Open sp line Closed sp line Both a & b None of these C
163 Cubic sp line are Simple to compute Provides continuity of cu Both a & b None of these C
164 The parametric form of 3D sp line are X=f(t),y=g(t),z=h(t) X=a0,y=b0,z=c0 F(t)=0,g(t)=0,h(t)=0 None of these A
165 The value of t lies between 1 and 2 1 and 10 0 and 1 0and 3 C
166 The surfaces that is blocked or hidden from view in a 3D scene Hidden surface Frame buffer Quad tree None of these A
167 The problem of hidden surface are Removal of hidden surface Identification of hidden Both a & b None of these C
168 Why we need removal of hidden surface for displaying realistic viewfor determining the clos Both a & b None of these C
169 How many types of hidden surface algorithm are 1 2 3 4 B
170 The algorithm of hidden surface are Object-space method image-space method Both a & b None of these C
171 The method which is based on the principle of comparing obje Object-space method image-space method Both a & b None of these A
172 The method which is based on the principle of checking the vis Object-space method image-space method Both a & b None of these B
173 The types of hidden surface removal algorithm are mparison, Z-buffer, back-fac Scan line algorithm, prio
method, area subdivision meAll of these D
174 Which surface algorithm is based on perspective depth Depth comparison Z-buffer or depth-buffer subdivision method back-face removal B
175 In which year Z- buffer algorithm are described 1995 1974 1945 1981 B
176 Z -buffer algorithm are Simplest algorithm Complex algorithm Largest algorithm None of these A
177 Which is a tree type of data structure in which every internal n Point quad tree Edge quad tree Quad tree None of these C
178 The array are used with scan line coherence algorithm are For intensity value For depth value Both a & b None of these C
179 The scan line coherence algorithm was developed by Wylie Evans Cat mull Both a & b D
180 Scan lines are used to scan from Top to bottom Bottom to top Both a & b None of these A
181 The painter algorithm were developed on 1972 by Newell 1972 by Evans 1974 by Cat mull None of these A
182 The painter algorithm are also called Depth sort algorithm Priority algorithm Both a & b None of these C
183 The painter algorithm are based on the property of Polygon Frame buffer Depth buffer None of these B
184 ___ fractals are commonly used to model trees other plants. self similar self affine invariant none of these A
185 ___ fractals includes self squaring fractals . self similar self affine invariant none of these D
186 koch curve is an example of___. self similar self affine invariant none of these A
187 ___ are one of the most essential object to create high resolution fractals curves ellipse bezier B
188 the Bspline blending function were designed to elliminate ___ c rough smooth sharp triangular C
189 in Cubic Bezier curve required ___ sample points. 8 6 4 3 C
190 Joystick are offen used to control typing video games voice none of these B
191 Example of presentation graphics is? bar chart CAD line graphics A and C D
192 CAD means__. car aided design computer art design computer aided design none of these C
193 image passed repeatedly to the monitor in order to maintain a 25 times a second 30 times a second 30 or more time a second none of these C
194 the display controller converts 0's and 1's into___. TV monitor video sisnals electronics signal none of these B
195 the function of a plotter is like a___. monitor projector printer none of these C
196 ___ ink is used in laser printer wet dry both A and B none of these B
197 fractals deals with curves that are ? irregularly irregular regularly irregular irregularly regular regularly regular B
198 if the eccentricity is less than one then the conic is? circle parabola ellipse hyperbola C
199 the best hidden surface removal algorithm is ? painters depth buffer area subdivision depends on application D
200 engineering drawing commonly applies? oblique projection orthographic projection perspective projection none of these B
201 back face removal is an example of ? object space method image space method combination of both none of these A
202 which of the following device has a relative origin ? joystick track ball mouse none of these C
203 the subcategories of orthographic projection are ? cavalier,cabinet,isometric cavalier,cabinet isometric,dimetric,trimetric isometric,cavalier,trime C
204 a three dimensional graphics has two axes three axes both A and B none of these B
205 ___ is the most commonly used boundary presentation for a 3D data polygon surface polygon system polygon none of these B
206 a three dimensional object can also be represented using___. method equation point none of these B
207 an___ can be considered as an extension of spherical surface bezier ellipsoid shearing none of these B
208 ___ curve is one of the sp. Line approximation method bezier ellipsoid shearing none of these A
209 which environment has been one of the most accepted tool for graphics macintosh quake multimedia B
210 three dimensional graphics becomes popular in game designin 1960 1970 1980 1990 D
211 raster graphics are composed of___ pixels paths palette none of these A
212 rough, jagged and random surfaces are called ___ fractals curves circle ellipse A
213 type of fractals are___. self similar self affine both A and B none of these C
214 the function of a plotter is like a___. monitor projector printer none of these C
215 ___ ink is used in laser printer wet dry both A and B none of these B
216 The dynamic effect of an image is called Video Animation Super sampling None of these B
217 The animation can be defined as a collection of images played i Not sequence Defined sequence Both a & b None of these B
218 When sound is included in the animation, it become Audio Video Both a & b None of these B
219 The animation graphics can be created by Hand Computer assistance Both a & b None of these C
220 The animation can be divided into One part Two parts Three parts Four parts B
221 The types of animation are Traditional animation Computer animation Both a & b None of these C
222 The types of computer animation are 2D computer animation 3D computer animation Both a & b None of these C
223 NVIDIA thought that 'unifying theme' of every forms of paralle CDA thread PTA thread CUDA thread CUD thread C
224 Which image files are a lossy format? JIF MPEG JPEG PNG C
225 How many step process for creating a 3D animation? 1 2 3 4 C
226 Which of the following is a technique to blend two or more ima Modeling Morphing Animating Warping B
227 How many types of video compressions? 2 3 4 5 A
228 Short films that use stop motion techniques are what type of an Frame-based animation HTML Animation Production A
229 What is another term to describe vector animation? Vector Path Animation Alpha Animation B
230 Which type of animation uses still frames with a graphic that s Animation Frame-based animation Vector Animation Pre-production B
231 What is the name of popular software used for creating 2D ani Corel draw Flash Banner creator Maya B
232 ____________is basically a form of pictorial presentation. Photography Animations Drawing Creativity B
Subject:-Computer Graphics
Objective type questions Unit-I Graphics Primitives and Scan Conversion

1) In computer graphics, pictures or graphics objects are presented as a collection of discrete picture
element called______.
A. dots
B. pixels
C. co-ordinates
D. points
ANSWER: B

2). _______is the smallest addressable screen element.

A. dots
B. point
C. pixels
D. spot
ANSWER: C

3.) ______is the smallest piece of the display screen which we can control.
A. dots
B. point
C. spot
D. pixel
ANSWER: D

4) We can control ____of the pixels which compose the screen.

A. intensity
B. size
C. shape
D. None
ANSWER: A

5) We can control ____of the pixels which compose the screen.

A. colour
B. size
C. shape
D. None
ANSWER: A

6) Each pixel on the graphics display represents______.

A. a single mathematical point
B. 2 mathematical point
C. 4 mathematical point
D. a region which theoretically can contain infinite points
ANSWER: D

7). A point (42,38) can be displayed on a screen by a pixel.

A. (4,3)
B. (3,4)
C. (5,4)
D. (4,4)
ANSWER: A
8) The process of determining the appropriate pixel for representing, picture or graphics objects is known
as___
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: B

9) The process representing continuous picture or graphics objects as a collection of descrete pixels is
called____.
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: A

10) The computer graphics allows____ on pictures before displaying it.

A. rotation
B. translation
C. scaling and projections
D. All of above
ANSWER: D

11) Graphics devices include_____.

A. input devices
B. output devices
C. a and b
D. None
ANSWER: C

12) Computer graphics allows_____.

A. user interface
B. plotting of graphics and chart
C. office automation and desktop publishing
D. all of above
ANSWER: D

13) Computer graphics allows______.

A. copmuter-aided drafting and design
B. simulaion and animation
C. art and commerce
D. all of above
ANSWER: D

14) Computer graphics allows_____.

A. process control
B. cartography
C. art and commerce
D. all of above
ANSWER: D

15) The software components of conceptual framework for interactive graphics is/are_____.
A. application modelB. application program
C. graphics system
D. all of above
ANSWER: D
16) The Hardware components of conceptual framework for interactive graphics is/are________.
A. input devices
B. output devices
C. a and b
D. none of these
ANSWER: C

17) The display devices are_____.

A. input
B. output
C. a and b
D. none of these
ANSWER: B

18) CRT stands for____.

A. Cathode Ray Tube
B. Colour Ray Tube
C. Cathode Radio Tube
D. Colour Radio Tube
ANSWER: A

19) A CRT is an evacuated _________ tube.

A. plastic
B. glass
C. steel
D. iron
ANSWER: B

20) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B

21) The deflection system of the CRT consistsof___________deflection plates.

A. vertical
B. horizontal
C. a and b
D. none of these
ANSWER: C

22) The techique(s) used for producing image on the CRT is/are__________ .
A. vector scan
B. raster scan
C. Both a and b
D. none of these
ANSWER: C

23) Vector scan technique is also called _________.

A. scalar scan
B. random scan
C. raster scan
D. beam scan
ANSWER: B
24) In vector scan display, buffer memory used is also called _________.
A. refresh memory
B. refresh buffer
C. buffer display
D. refresh circuit
ANSWER: B

25) In vector scan display, the phosphor is to be refreshed at least ________ times per second to avoid
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C

26) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B

27) The deflection system of the CRT consistsof___________deflection plates.

A. vertical
B. horizontal
C. a and b
D. none of these
ANSWER: C

28) The techique(s) used for producing image on the CRT is/are__________.
A. vector scan
B. raster scan
C. Both a and b
D. none of these
ANSWER: C

29) Vector scan technique is also called _________.

A. scalar scan
B. random scan
C. raster scan
D. beam scan
ANSWER: B

30) In vector scan display, buffer memory used is also called _________.
A. refresh memory
B. refresh bufferC. buffer display
D. refresh circuit
ANSWER: B

31) In vector scan display, the phosphor is to be refreshed at least ________ times per second to avoid
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C

32) In raster scan display,the display image is stored in the form of _________ in the refresh buffer.
A. 1s
B. 0s
C. 1s and 0s
D. none of these
ANSWER: C

33) In raster scan CRT, the beam is swept back and forth from _______ across the screen.
A. left to right
B. right to left
C. up to down
D. down to up
ANSWER: A

34) In raster Scan CRT, when a beam is moved from the left to the right,it s ____ and it is _____ when it is
moved from the right to the left.
A. ON,OFF
B. OFF,ON
C. ON,ON
D. OFF,OFF
ANSWER: A

35) In raster scan display, the screen image repeatedly scanned, this process is called _______.
A. buffering of screen
B. refreshig of screen
C. rendering of screen
D. heghlighting screen
ANSWER: B

36) On a black and white system with one bit per pixel , the frame buffer is called a__________.
A. bitmap
B. pixmap
C. bitpixmap
D. pixbitmap
ANSWER: A

37) The cost of vector scan display is___________ cost of raster scan dispay.
A. equal to
B. less than
C. more than
D. none of these

ANSWER: C

38) For ____________ display , scan conversion hardware is required.

A. vector scan
B. random scan
C. raster scan
D. none of these
ANSWER: C
39)Aspect ratio is the ratio of ________ to prodce equal length lines in both direction on the screen
A. vertical points to horizontal points
B. horizontal points to vertical points
C. left to riht and right to left diagonal points
D. right to left and left to right diagonal points
ANSWER: A

40)Display file can be implemented using __________ data structure.

A. array
B. linked list
C. paging
D. all of the above
ANSWER: D

41)The process of digitizing a picture definition given in an application program into a set of pixel-intensity
Values is called ____________.
A. animation
B. sampling
C. rasterization
D. scan-conversion
ANSWER: D

42)The size of frame buffer(video memory )depends on_____________.

A. resolution only
B. number of different colors only
C. both (B) and(C)
D. computer byte
ANSWER: C

43)A pixel of black_white image or graphics object takes _________ space in memory.
A. 1 bit
B. 2 bits
C. 1 nibble
D. 1 byte
ANSWER: C

44)The resolution of an image is __________.

A. number of pixels per unit area
B. number of pixels per unit length inhorizontal
C. number of pixels per unit length in vertical
D. none of these
ANSWER: A

45)Persistance can be defined as______.

A. intensity of a pixelB. pixels per unit area
C. the duration of phosphorescence exhibited by a phosphor
D. number of pixels in an image
ANSWER: C

46) The path the electron beam takes at the end of each refresh cycle is called______.
A. horizontal retrace
B. vertical retrace
C. diagonal retrace
D. left to right retrace
ANSWER: B
47) The path the electron beam takes when returning to the left side of the CRTscreen is called_____.
A. horizontal retrace
B. vertical retrace
C. diagonal retrace
D. top to bottom retrace
ANSWER: A

48) Frame buffer is used to store_____.

A. number if pixels in image
B. intencities of pixels
C. image definition
D. co-ordinate values of image
ANSWER: B

49) The clearity of a displayed image depends on the______.

A. resolution
B. floating point precision of system
C. associated software
D. aspect ratio
ANSWER: A

50)Random scan monitor can also referred to as______.

A. vector displays
B. stroke writing displays
C. calligraphic displays
D. none of the above
ANSWER: A

51) Which facility is provided by computer graphics to change the shape colour or other properties of
objects begin viewed.
A. Motion dynamics
B. Update dynamics
C. A & B
D. None of these
ANSWER: B

which factors affect resolution.

A. The type of phosphor
B. The intensity to be displayed
C. The focusing & deflection systems used in CRT
D. all of these

ANSWER: D

special area of the memory is dedicated to graphics only in raster scan display called_________ .
A. Frame buffer
B. video controller
C. display controler
D. Monitor
ANSWER: A

which is not true statement for raster scan generator.

A. It produces deflection signals
B. It consists of raster scan generator,x&y address register&pixel
C. it receive the intencity information of each pixel from frame buffer
D. it controls the x&y address registers
ANSWER: C

The disadvantage of raster graphics display system is ______.

A. It require large number of frame buffer memory cycles needed for video scan out
B. The burden of image generation is on the main CPU
C. Insufficient frame buffer memory band width
D. All of these
ANSWER: D

To store black and white images ,black pixels are represented by________ in the frame buffer and white
pixels by_______.
A. Zero and one
B. One and Zero
C. Both a & b
D. None of these
ANSWER: B

The image can be transmitted to the display point by________.

A. Line
B. Segment
C. Point
D. None of these
ANSWER: C

The center of display screen is computed as

A. X max ,y max
B. Xmax/2,ymax/2
C. Xmax/3,ymax/3
D. None of these
ANSWER: B

What is true about DDA algorithm for scan conversion of a line

A. General purpose method
B. Incremental
C. current calculation is independent of previous step
D. Is slower than the use of line equation
ANSWER: B

In DDA algorithm for scan conversion of line

A. if |m|<=1 then dx=1B. if |m|>=1 then dx=1
C. if |m|<=1 then dy=1
D. none of the above
ANSWER: A

Which of these is true about Bresenham's Line Algorithm?

A. Highly efficient incremental method
B. Uses scan conversion
C. uses integer addition,subtraction and multiplication by 2
D. all of the above
ANSWER: A

Integer addition,subtraction and multiplication by 2 in Bresenham's Line Algorithm can be done by

A. Simple arithmetic shift operation
B. circular shift operation
C. XOR Operation
D. none of the above
ANSWER: B

In Bresenham's algorithm for scan conversion of line

A. d=2dy-dx
B. d=2dx-dy
C. d=4dy-dx
D. d=4dx-dy
ANSWER: A

What is the basis of scan conversion of a circle?

A. Semi-circle symmetry
B. Quarter symmetry
C. Eight-way symmetry
D. none of the above
ANSWER: C

What is true about the Bresenhem's Circle algorithm?

A. if d<0 then d=d+4x+6
B. if d>0 then d=d+4x+6
C. if d<0 then d=d+4(x-y)+10 and y--
D. none of the above
ANSWER: A

which of these is a characteristic of midpoint circle algorithm?

A. Produces pixel points for an semicircle
B. Produces pixel points for an quadrant
C. Produces pixel points for an octant
D. none of the above
ANSWER: C

What is the initial value for the decision parameter in midpoint circle algorithm.
A. 5/4-r
B. 4/5-r
C. r-5/4
D. r-4/5
ANSWER: A

In Bresenham's line generation algorithm, the initial value of the decision parameter as p0 = __________,
where slope MOD (m) < 1
A. 2Δy – Δx
B. 2Δy – 2Δx
C. Δx – Δy
D. none of the above
ANSWER: A

If a line whose end point is (10, 12) and start point is (20, 20), then slope m =?
A. 1.2
B. 0.8
C. -0.4
D. none of the above
ANSWER: B

The Cartesian slope-intercept equation for a straight line is ________________.

A. y = m(a+b+c)
B. y = m.x + b
C. y = 2∆x-m
D. none of the above
ANSWER: B

The DDA algorithm is a faster method for calculating pixel positions than the direct use of Eq. y = m.x + b.
A. TRUE
B. FALSE
ANSWER: A

In Bresenham's Mid-point Circle Algorithm, the initial value of the decision parameter is p0 = 5/4 – r.
A. TRUE
B. FALSE
ANSWER: A

The method which used either delta x or delta y, whichever is larger, is chosen as one raster unit to draw
the line .the algorithm is called?
A. Bresenham`s Line Algorithm
B. Generalized Bresenham`s Algorithm
C. DDA Line Algorithm
D. Midpoint Line Algorithm
ANSWER: C

There are two standard methods of mathematically representing a circle centered at the origin. They are?
A. Polynomial Method, and Bresenham`s
B. Trigonometric Method and Bresenham`s
C. DDA, and Bresenham`s
D. Polynomial Method, and Trigonometric Method
ANSWER: D

In Bresenham's algorithm, while generating a circle , it is easy to generate?

A. One octant first and other by successive reflection
B. One octant first and other by successive rotation
C. One octant first and other by successive translation
D. All octants
ANSWER: A

Why a circle drawn on the screen appears to be elliptical ?

A. It is due to the aspect ratio of monitor
B. Screen has rectangular shape
C. Our eyes are not at the same level on screen
D. CRT is completely spherical
ANSWER: A

Which of the following technique is used in Midpoint Subdivision algorithm ?

A. Linear search
B. Binary Search
C. Heap sort
D. Bubble Sort
ANSWER: B

A circle, if scaled only in one direction becomes a ?

A. parabola
B. hyperbola
C. Ellipse
D. remains a circle
ANSWER: C

(2,4) is a point on a circle that has center at the origin. Which of the following points are also on circle ?
A. (2,-4),(-2,4)
B. (4,-2)
C. (-4,2)
D. All of above
ANSWER: D

A line can be represented by_________.

A. One point
B. Two points
C. Three points
D. Four points
ANSWER: B

Bresanham circle algorithm uses the approach of a ______________.

A. Midpoint
B. Point
C. Line
D. None of these
ANSWER: A

The side effect of scan conversion are________.

A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A

The process of reducing aliasing is called __________.

A. Resolution
B. Anti aliasing
C. Sampling

D. None of these
ANSWER: B

The problem of aliasing are_____________.

A. Staircase
B. Unequal brightness
C. Picket fence problem
D. All of these
ANSWER: D

The basic principle of Bresenham`s line algorithm is__?

A. A to select the optimum raster locations to represent a straight line
B. to select either Δx or Δy, whichever is larger, is chosen as one raster unit
C. we find on which side of the line the midpoint lies
D. both a and b
ANSWER: A

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?
A. x-increments = 1; y-increments =1
B. x-increments = 0.5; y-increments =1
C. x-increments = 1; y-increments =0.5
D. None of above
ANSWER: C

Line produced by moving pen is __ at the end points than the line produced by the pixel replication?
A. Thin
B. Straight
C. Thicker
D. both A and B
ANSWER: C

A line segment _____________.

A. extends forward
B. extends backward
C. ends at two points
D. extends forever both forward and backward
ANSWER: C

In DDA line drawing algorithm, dx or dy, whichever is________, is chosen as one raster unit.
A. 1
B. 0
C. smaller
D. larger
ANSWER: D

Sign function makes the DDA line drawing algorithm work in _____ quadrants.
A. I and II
B. B I and III
C. II and III
D. all
ANSWER:D

Floating point arithmetic in DDA algorithm is__________.A. time efficient

B. time consuming
C. fast
D. slow
ANSWER: B

DDA line drawing algorithm for calculating pixel positions is __________ the direct use of equation y =
mx + b.
A. slower than
B. faster than
C. of equal speed to that of
D. none of these
ANSWER: B

Expansion of line DDA algorithm is______.

A. Digital difference analyzer
B. Direct differential analyzer
C. Digital differential analyzer
D. Data differential analyzer
ANSWER: C
Which algorithm is a faster method for calculating pixel positions?
A. Bresenham’s line algorithm
B. Parallel line algorithm
C. Mid-point algorithm
D. DDA line algorithm
ANSWER: D

In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk is______
A. Positive
B. Equal
C. Negative
D. Option a or c
ANSWER: C

A dashed line could be displayed by generating_________.

A. Inter dash spacing
B. Very short dashes
C. Both A or B
D. A or B
ANSWER: A

Which of the following technique is used in Midpoint Subdivision algorithm ?

A. Linear search
B. Binary search
C. Heap sort
D. Bubble sort
ANSWER: B

Smallest size object that can be displayed on a monitor is called________.

A. Picture element
B. Point
C. Dot PitchD. Aspect ratio
ANSWER: A

The maximum number of points that can be displayed without overlap on a CRT
A. Aspect Ratio
B. Resolution
C. Brightness
D. Pixel
ANSWER: B

Each screen point is referred to as_________________.

A. Resolution
B. Pixel
C. Persistence
D. Dot Pitch
ANSWER: B

_____________is the number of points per centimeter that can be plotted horizontally and vertically.
A. Aspect Ratio
B. Pixel Depth
C. Resolution
D. Dot Pitch
ANSWER: C
__________is the ratio of horizontal points to vertical points necessary to produce equal length
lines in both direction.
A. Dot Pitch
B. Resolution
C. Aspect Ratio
D. Height-Width Ratio
ANSWER: C

Vector display is well suited for___________.

A. Animation
B. Line drawing applications
C. Cartoons
D. All of the above
ANSWER: B

Beam penetration method is usually used in______________.

A. LCD
B. Raster Scan display
C. Random scan display
D. DVST
ANSWER: C

An RGB color system with 24 bits os storage per pixel is known as________________.
A. Color CRT
B. True-color system
C. RGB monitor
D. Color- Depth
ANSWER: B

Digitizing a picture definition into a set of intensity values is known as .............A. Digitization
B. Scan conversion
C. Refreshing
D. Scanning
ANSWER: B

Raster graphics are composed of ____________.

A. Pixels
B. Paths
C. Palette
D. None of these
ANSWER: A

Which of the following allow for 8 mirror images?

A. Parabola
B. Ellipse
C. Hyperbola
D. Circle
ANSWER: D

The simplest output primitive is__________.

A. Straight line
B. Straight line segment
C. Point
D. Circle
ANSWER: C
A bitmap is________ bit(s) per pixels.
A. 0
B. 1
C. 2
D. 4
ANSWER: B

The quality of an image depend on_____________.

A. No. of pixel used by image
B. No. of line used by image
C. No. of resolution used by image
D. None
ANSWER: A

The basic geometric structures that describes a scene on display is called__________-.

A. Attributes
B. Output primitive
C. Lines
D. Curves
ANSWER: B

An accurate and efficient raster line-generating algorithm is_________.

A. DDA algorithm
B. Mid-point algorithm
C. Parallel line algorithm
D. Bresenham’s line algorithmANSWER: D
In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk is______.
A. Positive
B. Equal
C. Negative
D. Option a or c
ANSWER: C
 Subject:-Computer Graphics

MCQ on UNIT 2

A chain of connected line segments is called a ________.

A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: A

A closed polyline is called a _________.

A. Polychain
B. Polygon
C. Polyclosed
D. Closed chain
ANSWER: B

A ploygon in which the line segment joining any two points within the polygon lies completely inside the polygon,
is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: A

A Polygoan in which the line segment joining any two points within the polygon may not lie completely inside the
polygon, is called ________ polygon.
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B

__________ is a method for testing a pixel inside of a polygon.

A. even-odd method
B. winding number method
C. A and B
D. None of these

ANSWER:​ ​C

_________ is a basic approach used to fill the polygon.

A. seed fill
B. scan fill
C. A and B
D. None of these ANSWER: C
The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill algorithm.
A. flood, boundry
B. even, odd
C. edge, flood
D. boundry, scan
ANSWER:​ ​A

Polygoan filling algorithms those fill interior-defined regions are called _______ algorithms.
A. flood fill
B. boundry fill
C. scan line
D. edge fill
ANSWER: A

Polygoan filling algorithms those fill boundary defined regions are called _________ algorithms.
A. flood fill
B. boundry fill
C. edge line
D. A and B
ANSWER:D

In a boundary fill algorithm for filling polygon, boundary defined regions may be either _________ connected or
__________ connected.
A. 2,4
B. 4,8
C. 8,16
D. 8,6
ANSWER:B

The getpixel function gives the ______ of specified pixel.A. intensity

B. colour
C. Size
D. Shape
ANSWER:​ ​B

The putpixel function draws the pixel specified_______.

A. intensity
B. colour
C. Size
D. Shape
ANSWER:​ ​B

Seed fill algo for filling polygon is ________ algorithm.

A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:A

Scan line algorithm for filling polygon is ______ algorithm.

A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:B

The basic approach to represent polygon is __________.

A. Polygon drawing primitive approach
B. trapezoid primitive approach
C. line and point approach
D. all of above
ANSWER:D

The process of selecting and viewing the picture with diffrerent views is called_______.
A. Clipping
B. WindowingC. Segmenting
D. all of above
ANSWER:B

A Process which divides each segment of the picture into its visible and invisible portion, allowing the invisible
portion to be discarded is called__________.
A. Clipping
B. Windowing
C. Segmenting
D. all of above
ANSWER:A

A convenient cartesian co-ordinate system used for storing a picture in the computer memory is called__________.
A. X-Y co-ordinate system
B. World co-ordinate system
C. normalized co-ordinate system
D. viewing co-ordinate system
ANSWER:B

When a picture is displayed on the display device it is measeured in ________co-ordinate system.

A. World
B. Physical device
C. Viewing
D. Normalized
ANSWER:B

Mapping the world co-ordinates into physical device co-ordinates is called__________.

A. translation
B. homogeneous transformation
C. co-ordinate conversion
D. Viewing transformation
ANSWER: D
A finite world co-ordinate area selected to perform Viewing transformation for display is called a ____________.
A. Window
B. Segment
C. Clip
D. Viewport

ANSWER: A

An area on a physical device to which a window is mapped is called a __________.

A. Window
B. Segment
C. Clip
D. Viewport
ANSWER: D

The region of a picture against which an object is to be clipped is called a

A. Clip Window
B. Segment
C. Clip
D. Viewport
ANSWER: A

The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the window.
A. any line
B. one end
C. both end
D. any two
ANSWER: C

Cohen-sutherland subdivision line clipping algorithm uses ________ regions with diffrerent codes.
A. 8
B. 6
C. 4
D. 9
ANSWER: D

The transformation which maps the viewing co-ordinates to normalized device co-ordinte is called _______.
A. Viewing transformation
B. translation
C. normalization transformation
D. homogeneous transformation
ANSWER: C

The transformation of object description from normalized co-ordinates to device co-ordinates is called ________.A.
Workstation transformation
B. viewing transformation
C. normalization transformation
D. homogeneous transformation
ANSWER: A
If both end points of a line are exterior to the clipping window,__________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: B

If both end points of a line are completely to the right of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C

If both end points of a line are completely to the left of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C

If both end points of a line are completely to the above of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping window
C. the line is completely exterior to the clipping window
D. None of these
ANSWER: C

If both end points of a line are completely to the below of clipping window,________.
A. the line is interior to the clipping window
B. the line is not necessarily completely exterior to the clipping windowC. the line is completely exterior to the clipping
window
D. none of these
ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 1 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: A

In Cohen-sutherland subdivision line clipping algorithm, bit 2 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: B

In Cohen-sutherland subdivision line clipping algorithm, bit 3 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: C

In Cohen-sutherland subdivision line clipping algorithm, bit 4 in region code is set if _____.
A. end point of line is to the left of the window
B. end point of line is to the right of the window
C. end point of line is to the below of the window
D. end point of line is to the above of the window
ANSWER: D

In cohen- sutherland subdivision line clipping algorithm, all bits in region code are zero if__________.
A. end point of a line lies within a clipping window
B. end point of a line lies to the left of the clipping window
C. end point of a line lies to the right of the clipping window
D. None of theseANSWER: A

In cohen- sutherland subdivision line clipping algorithm,any line that has one in the same bit position in the region
codes for each end point are _________.
A. Completely inside the clipping rectangle
B. Completely outside the clipping rectangle
C. Completely left to the clipping rectangle
D. Completely right to the clipping rectangle
ANSWER: B

In cohen- sutherland subdivision line clipping algorithm, if the result of the logical AND operation with two end
point region codes is not 0000 __________.
A. the line is Completely inside the clipping region
B. the line is Completely outside the clipping region
C. the line is Completely left to the clipping region
D. the line is Completely right to the clipping region
ANSWER: B

In sutherland -Hodgeman polygon clipping algorithm, if the first vertex of the edge is outside the window boundry
and the second vertex of the edge is inside then _____ and ____ are added to the output vertex list.
A. first vertex, second vertex
B. first vertex, the intersection point of the polygon edge with the window boundry
C. Second vertex,the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: C

In sutherland -Hodgeman polygon clipping algorithm, if both vertices of the edge are inside the window boundry,
then _______ is addes to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: B

In sutherland-Hodgeman polygon clipping algorithm, if the first vertex of the edge is inside the window boundry
and the second vertex of the edge is outside then _____ and ____ are added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these

ANSWER: C

In sutherland-Hodgeman polygon clipping algorithm, if both vertices of the edge are outside the window boundry,
______is added to the output vertex list.
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: D

Which of the following clipping algorithm follows the Divide and Conquer strategy?
A. 4-bit algorithm
B. Midpoint algorithm
C. Cyrus break algorithm
D. Cohen- Sutherland algorithm
ANSWER:B

The selection and separation of a part of text or image for further operation are called__________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER:D

The complex graphics operations are_______.

A. Selection
B. Separation
C. Clipping
D. None of these
ANSWER: C

In computer graphics, a graphical object is known as________.

A. Point
B. Segment
C. Parameter
D. None of these
ANSWER: B
A many sided figure is termed as_________.A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B

The end point of polygon are called as__________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B

The line segment of polygon are called as _________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: A

What are the types of polygon___________.

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: C

If a line joining any of its two interior points lies completely within it are called____________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: A

If a line joining any two of its interior points lies not completely inside are called______________.
A. Convex polygon
B. Concave polygonC. Both a & b
D. None of these
ANSWER: B

In which polygon object appears only partially________________.

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None
ANSWER: B

The process of extracting a portion of a database or a picture inside or outside a specified region are
called_____________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D

The rectangle portion of the interface window that defines where the image will actually appear are
called_____________.
A. Transformation viewing
B. View port
C. Clipping window
D. Screen coordinate system
ANSWER: B

The rectangle space in which the world definition of region is displayed are called_______________.
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: B

The object space in which the application model is defined____________.

A. Screen coordinate system
B. Clipping window or world window
C. World coordinate systemD. None of these
ANSWER: C

The process of cutting off the line which are outside the window are called__________.
A. Shear
B. Reflection
C. Clipping
D. Clipping window
ANSWER: C

Some common form of clipping include_________.

A. curve clipping
B. point clipping
C. polygon clipping
D. All of these
ANSWER: D

A technique by which the vertical and /or horizontal scan frequency of video signal can be changed for different
purpose and applications is called__________.
A. Scan conversion
B. Polygon filling
C. Two dimensional graphics
D. Anti aliasing
ANSWER: A

The process of coloring the area of a polygon is called___________.

A. Polygon filling
B. Polygon flow
C. Aliasing
D. None of these
ANSWER: A

How many types of polygon filling ____________.

A. Two
B. One
C. Three
D. Four
ANSWER: C
The algorithm used for filling the interior of a polygon is called____________.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A

The function of scan line polygon fill algorithm are_______________.

A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
D. None of these
ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it, this is called___________.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B

The side effect of scan conversion are__________.

A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are
called____________.
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a
polygon____________.A. Even-odd method
B. Winding number method
C. Both a & b
D. None of these
ANSWER: C

The process of mapping a world window in world coordinate system to viewport are called___________.
A. Transformation viewing
B. View Port
C. Clipping window
D. Screen coordinate system
ANSWER: A

The space in which the image is displayed are called___________.

A. Screen coordinate system
B. Clipping window
C. World coordinate system
D. None of these
ANSWER: A
Some common form of clipping include__________.
A. Curve clipping
B. Point clipping
C. Polygon clipping
D. All of these
ANSWER: D

In a clipping algorithm of Cohen & Sutherland using region codes, a line is already clipped if the?
A. Codes of the end point are same
B. Logical AND of the end point code is not 0000
C. Logical OR of the end points code is 0000
D. Logical AND of the end point code is 0000
E. A and B
ANSWER: E

The transformation in which an object is moved in a minimum distance path from one position to another is
called________.
A. TranslationB. Scaling
C. Rotation
D. Reflection
ANSWER: A

The transformation in which the dimension of an object are changed relative to a specified fixed point is
called____________.
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER: B

An object can be viewed as a collection of___________.

A. One segment
B. Two segment
C. Several segments
D. None of these
ANSWER: C

The graphics method in which one object is transformed into another object are called___________.
A. Clipping
B. Morphing
C. Reflection
D. Shear
ANSWER: B

Scaling of a polygon is done by computing____________.

A. The product of (x, y) of each vertex
B. (x, y) of end points
C. Center coordinates
D. Only a
ANSWER: D

A chain of connected line segment is called a__________

A. Polyline
B. Polysegment
C. Polygon
.D. Polychain
ANSWER: A

A ploygon in which the line segment joining any two points within the polygon may not lies completely inside the
polygon, is called___________polygon .
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B

In the given point (x,y) and we want to access(x-1,y-1) in a single step we need to use_________.
A. 4-connected
B. 5-connected
C. 6-connected
D. 8-connected
ANSWER: D

In scan fill algorithm the scan lines which needs to be considered are from___________.
A. Ymax to ymin of the whole polygon
B. Ymax to ymin of the longest edge of the polygon
C. Ymax to ymin of the shortest edge of the polygon
D. None of these
ANSWER: A

Sutherland Hodgeman algorithm is used for_____________.

A. Polygon filling
B. Line clipping
C. Polygon clipping
D. Text clipping
ANSWER: C

Which of the following is not true w.r.t polygon clipping.

A. Line clipping algorithms are not used for polygon clipping
B. The shape of polygon may change after clipping
C. The sequence of clipping w.r.t. window edges is fixed
D. All of these
ANSWER: C

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner (80,80).
Whether a point at (10,50) is visible or not?
A. Visible
B. Partially Visible
C. Completely Exterior
D. None of the above
ANSWER:C

Following are coordinates of clipping window : Lower Left Corner (20,20) and Upper Right Corner
(100,100).What is the outcode of point (150,50)?
A. 0010
B. 1000
C. 0100
D. 0110
ANSWER: A

Which of the following is true with respect to Suther Hodge algorithm?

A. It clips only concave polygons
B. It is more time consuming and complex
C. It may insert extra edges in resultant polygon
D. None of these
ANSWER: C

In sutherland-hodgeman polygon clipping algorithm,if both vertices of the edge are outside the window boundary
then_______is added to the output vertex.
A. First vertex
B. The intersection point of the polygon edge with the window boundary
C. Second vertex
D. None of these
ANSWER: B

A clipping window has coordinates as A(50,10), B(80,10), C(80,40), D(50,40). A line segment has end coordinates
(40,15) and (75,45). What will be the end points of clipped line? Use Cohen – Sutherland Outcode Algorithm.
A. (23.67,50) and (69.06,40)
B. (50,23.67) and (69.06, 40)
C. (50,23.67) and (40,69.06)
D. None of Above
ANSWER:B

Adjacent pixels are likely to have same characteristics. This property is referred as_______.
A. Property of coherence
B. Spacial coherence
C. Spatial coherence
D. None of these
ANSWER: A

Clip a line starting from (-13, 5) and ending at (17, 11) against the window having lower left corner at (-8, -4) and
upper right corner at ( 12,8). What will be the end points of clipped line? Use Cohen – Sutherland Outcode
Algorithm.
A. (-8,6) and (2,8)
B. (-8,6) and (8,2)
C. (6,-8) and (2,8)
D. (8,-6) and (8,2)
ANSWER:A

Scale a square ABCD with co-ordinates A(0,0), B(5,0), C(5,5), D(0,5) by 2 units for x-direction and 3-units for y –
direction.
A. A(0,0) , B(10,0) , C(10,15) , D(0,15)
B. A(0,0) , B(0,0) , C(10,15) , D(0,15)
C. A(0,0) , B(10,0) , C(10,10) , D(15,0)
D. None of these
ANSWER:A

The first viewing parameter in perspective projection we must consider is the?

A. Viewing window
B. Shift vector
C. View reference point
D. View reference plane
ANSWER:C

In normalization transformation for window to viewport, window is lower left corner (1,1) and upper right corner at
(3,5) to a view point with lower left corner at (0,0) and upper right corner at(1/2,1/2) .Scaling factors Sx =___ &
Sy =___.
A. 0.25 & 0.125
B. 0.125 & 0.25
C. 4 & 8
D. 0.5 & 1
ANSWER:A

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line AB with end-points A(30, 55) and B(70, 40) will be___________.
A. Completely visible
B. Completely invisible
C. Partially visible
D. Partially invisible
ANSWER:C

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50) will be___________.
A. Completely visible
B. Completely invisible
C. Partially visible
D. Partially invisible
ANSWER:A

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin = -10 , Ymin = -30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50), the outcodes of P and Q will
be___________ and _________repectively.
A. 1000 and 0001
B. 0000 and 0000
C. 0100 and 0010
D. 1100 and 0011
ANSWER:B

In the Cohen-Sutherland outcode algorithm, given the clipping window co-ordinates as: Xmin =10 , Ymin = 30,
Xmax= 50 , Ymax = 70, the line PQ with end-points P(30, 55) and Q(70, 40) will have __________ number of
intersection points with the clipping window.
A. 0
B. 1
C. 2
D. 3
ANSWER:B

In the Cohen Sutherland Outcode Algorithm, the four bits in the outcode are set on the basis of positions of the line
end points to the ________ of clipping window regions in the order.
A. Top, Bottom, Right, Left
B. Right, Top, Bottom, Left
C. Top, Right, Left, BottomD. Bottom, Right, Left, Top
ANSWER:A

In the Cohen Sutherland Outcode Algorithm, if both the end-points of the line has outcode 1000, then the line lies
in the _________________region of the clipping window.
A. Left
B. Right
C. Top
D. Bottom
ANSWER:C

In the Cohen Sutherland Outcode Algorithm, if the point outcode is 1001, then the point lies in the
_________________regions of the clipping window.
A. Top and Right
B. Bottom and Right
C. Top and Left
D. Bottom and Left
ANSWER:C
The algorithm used for filling the interior of a polygon is called
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it. this is called
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B

The graphics can be

A. Drawing
B. Photograph, movies
C. Simulation
D. All of these

ANSWER: D

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
A. Scan-line fill algorithm
B. Boundary-fill algorithm
C. Flood-fill algorithm
D. Parallel curve algorithm
ANSWER: B

If we want to recolor an area that is not defined within a single color boundary is known as_________.
A. Boundary-fill algorithm
B. Parallel curve algorithm
C. Flood-fill algorithm
D. Only b
ANSWER: C

There are 2 types of polygons. They are?

A. Convex and concave
B. Square and rectangle
C. Hexagon and square
D. Octagon and convex
ANSWER: A

A many sided figure is termed as_____.

A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B

The end point of polygon are called as___________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B

The algorithm used for filling the interior of a polygon is called____________.A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon fill algorithm
D. None of these
ANSWER: A

The function of scan line polygon fill algorithm are________.

A. Find intersection point of the boundary of polygon and scan line
B. Find intersection point of the boundary of polygon and point
C. Both a & b
D. None of these
ANSWER: A

If the pixel is already filled with desired color then leaves it otherwise fills it. this is called_______.
A. Flood fill algorithm
B. Boundary fill algorithm
C. Scan line polygon filling algorithm
D. None of these
ANSWER: B

If a line joining any two of its interior points lies not completely inside are called____________.
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: B

In which polygon object appears only partially_______.

A. Convex polygon
B. Concave polygon
C. Both a & b
D. None of these
ANSWER: B

If the visit to the vertices of the polygon in the given order produces an anticlockwise loop are called______.
A. Negatively oriented
B. Positively orientedC. Both a & b
D. None of these
ANSWER: B

If the visit to the vertices of the polygon in the given order produces an clockwise loop are cComputer Graphics MCQ
1alled______.
A. Negatively oriented
B. Positively oriented
C. Both a & b
D. None of these
ANSWER: A

Which things are mainly needed to make a polygon and to enter the polygon into display file_____.
A. No of sides of polygon
B. Vertices points
C. Both a & b
D. None of these
ANSWER: C

Two types of coordinates are_________.

A. Positive and negative coordinates
B. Absolute and relative coordinates
C. Both a & b
D. None
ANSWER: B

Which approaches are used for determine whether a particular point is inside or outside of a polygon_____.
A. Even-odd method
B. Winding number method
C. Both a & b
D. None of these
ANSWER: C

For a seed-fill method, If a given point is (x, y) and we want to access (x-1, y-1) in the same iteration, we use which
of the following?
A. 4-connected method
B. 5-connected method
C. 7-connected method
D. 8-connected method

ANSWER: D

In a given triangle, a(10, 10), B(20, 20), C(30, 10), the point P(28, 20) is______.
A. Inside the triangle
B. Outside the triangle
C. On the vertex
D. On the edge
ANSWER: B
 MCQ on UNIT 3 
 
1.​ ​A three dimensional graphics has 
a.​ ​Two axes 
b.​ ​Three axes 
c.​ ​Both a & b 
d.​ ​None of these
 
2.​ ​_________as the most commonly used boundary presentation for a 3-D graphics object 
a.​ ​Data polygon 
b.​ ​Surface polygon 
c.​ ​System polygon 
d.​ ​None of these
 
3.​ ​A three dimensional object can also be represented using_______ 
a.​ ​Method 
b.​ ​Equation 
c.​ ​Point 
d.​ ​None of these
 
4.​ ​An_______ can be considered as an extension of spherical surface 
a.​ ​Bezier 
b.​ ​Ellipsoid 
c.​ ​Shearing 
d.​ ​None of these
 
5.​ ​_______curve is one of the sp line approximation methods 
a.​ ​Bezier 
b.​ ​Ellipsoid 
c.​ ​Shearing 
d.​ ​None of these
 
6.​ ​A Bezier curve is a polynomial of degree ___________the no of control points used 
a.​ ​One more than 
b.​ ​One less than 
c.​ ​Two less than 
d.​ ​None of these
 
7.​ ​The most basic transformation that are applied in three-dimensional planes are 
a.​ ​Translation 
b.​ ​Scaling 
c.​ ​Rotation 
d.​ ​All of these
 
8.​ ​The transformation in which an object can be shifted to any coordinate position in three dimensional
plane are called 
a.​ ​Translation 
b.​ ​Scaling 
c.​ ​Rotation 
d.​ ​All of these

9.​ ​The transformation in which an object can be rotated about origin as well as any arbitrary pivot point are
called 
a.​ ​Translation 
b.​ ​Scaling 
c.​ ​Rotation 
d.​ ​All of these
 
10.​ ​The transformation in which the size of an object can be modified in x-direction ,y-direction and
z-direction 
a.​ ​Translation 
b.​ ​Scaling 
c.​ ​Rotation 
d.​ ​All of these
 
11.​ ​Apart from the basic transformation ,________are also used 
a.​ ​Shearing 
b.​ ​Reflection 
c.​ ​Both a & b 
d.​ ​None of these
 
12.​ ​ In which transformation ,the shape of an object can be modified in any of direction depending upon the
value assigned to them 
a.​ ​Reflection 
b.​ ​Shearing 
c.​ ​Scaling 
d.​ ​None of these
 
13.​ ​In which transformation ,the mirror image of an object can be seen with respect to x-axis, y-axis ,z-axis as
well as with respect to an arbitrary line 
a.​ ​Reflection 
b.​ ​Shearing 
c.​ ​Translation 
d.​ ​None of these
 
14.​ ​How many types of projection are 
a.​ ​1 
b.​ ​2 
c.​ ​3 
d.​ ​4
 
15.​ ​The types of projection are 
a.​ ​Parallel projection and perspective projection 
b.​ ​Perpendicular and perspective projection 
c.​ ​Parallel projection and Perpendicular projection 
d.​ ​None of these
 
16.​ ​ How many types of parallel projection are 
a.​ ​1 
b.​ ​2 
c.​ ​3 
d.​ ​4
 
17.​ ​The types of parallel projection are 
a.​ ​Orthographic projection and quadric projection 
b.​ ​Orthographic projection and oblique projection 
c.​ ​oblique projection and quadric projection 
d.​ ​None of these
 
18.​ ​_________are the three dimensional analogs of quad trees 
a.​ ​Quadric 
b.​ ​Octrees 
c.​ ​Geometry 
d.​ ​None of these
 
19.​ ​By which more complex objects can be constructed 
a.​ ​Quadric surfaces 
b.​ ​Wire frame model 
c.​ ​Composite transformation 
d.​ ​None of these
 
20.​ ​_______refers to the common elements of graphics scenes ,often used in graphics package as primitive
components 
a.​ ​Quadric surfaces 
b.​ ​Wire frame model 
c.​ ​Composite transformation 
d.​ ​None of these

 
21.​ ​_________refer to the shapes created by union, intersection and difference of given shapes 
a.​ ​Wire frame model 
b.​ ​Composite transformation 
c.​ ​Constructive solid geometry methods 
d.​ ​ None of these
 
22.​ ​________refer to a model that represent all the dimension of an object external as well as internal 
a.​ ​Wire frame model 
b.​ ​Constructive solid geometry methods 
c.​ ​Composite transformation 
d.​ ​None of these
 
23.​ ​________refers to the result obtained by multiplying the matrix of the individual transformation
representation sequences 
a.​ ​Wire frame model 
b.​ ​Constructive solid geometry methods 
c.​ ​Composite transformation 
d.​ ​None of these
 
24.​ ​The projection in which the projection plane is allowed to intersect the x, y and z-axes at equal distances 
a.​ ​Wire frame model 
b.​ ​Constructive solid geometry methods 
c.​ ​Isometric projection 
d.​ ​Back face removal
 
25.​ ​In which projection ,the plane normal to the projection has equal angles with these three axes 
a.​ ​Wire frame model 
b.​ ​Constructive solid geometry methods 
c.​ ​Isometric projection 
d.​ ​Back face removal
 
26.​ ​___________is a simple object space algorithm that removes about half of the total polygon in an image
as about half of the faces of objects are back faces 
a.​ ​Wire frame model 
b.​ ​Constructive solid geometry methods 
c.​ ​Isometric projection 
d.​ ​Back face removal
 
27.​ ​By which ,we can take a view of an object from different directions and different distances  
a.​ ​Projection 
b.​ ​Rotation 
c.​ ​Translation 
d.​ ​Scaling
 
28.​ ​Parallel projection shows the 
a.​ ​True image of an object 
b.​ ​True size of an object 
c.​ ​True shape of an object 
d.​ ​all of these
 
29.​ ​Projection rays(projectors) emanate from a 
a.​ ​COP(centre of projection ) 
b.​ ​Intersect projection plane 
c.​ ​Both a & b 
d.​ ​None of these
 
30.​ ​The centre of projection for parallel projectors is at 
a.​ ​Zero 
b.​ ​Infinity 
c.​ ​One 
d.​ ​None of these
 
31.​ ​ In orthographic projection, engineering use 
a.​ ​Top view of an object 
b.​ ​Front view of an object 
c.​ ​Side view of an object 
d.​ ​All of these
 
32.​ ​The orthographic projection that show more than one side of an object are called 
a.​ ​Axonometric projection 
b.​ ​Isometric projection 
c.​ ​Both a & b 
d.​ ​None of these
 
33.​ ​The projection that can be viewed as the projection that has a centre of projection at a finite distance from
the plane of projection are called 
a.​ ​Parallel projection 
b.​ ​Perspective projection 
c.​ ​Isometric projection 
d.​ ​None of these
 
34.​ ​The perspective projection is more practical because the distant objects appear 
a.​ ​Smaller 
b.​ ​Larger 
c.​ ​Neither smaller nor larger 
d.​ ​None of these
 
35.​ ​The equation of scaling transformation will be 
​X​
1​
a.​ =x+Tx,y​1​=y+Ty,z​1​=z+Tz 
​X​ =x.sx,y​ =y.sy,z​ =z.sz 
1​ 1​ 1​
b.​
c.​ ​Both of these 
d.​ ​None of these
 
36.​ ​The equation of translation transformation will be 
​X​
1​
a.​ =x+Tx,y​1​=y+Ty,z​1​=z+Tz 
​X​ =x.sx,y​ =y.sy,z​ =z.sz 
1​ 1​ 1​
b.​
c.​ ​Both of these 
d.​ ​None of these
 
37.​ ​Sp line curve can be either 
a.​ ​Bezier sp line 
b.​ ​B sp line 
c.​ ​Both a & b 
d.​ ​None of these
 
38.​ ​Bezier sp line always passes through 
a.​ ​First and second control point 
b.​ ​Does not pass from First and second control point 
c.​ ​Both a & b 
d.​ ​None of these
 
39.​ ​The equation for describing surface of 3D plane are 
a.​ ​Ax+ By+ Cz+ D= 0 
b.​ ​Ax+ By+ Cz = 0 
c.​ ​Ax+ By+ D= 0 
d.​ ​Ax+ By+ Cz+ D= 1
 
40.​ ​The object refers to the 3D representation through linear, circular or some other representation are called 
a.​ ​Quadric surface 
b.​ ​Sweep representation 
c.​ ​Torus 
d.​ ​None of these

 
41.​ T
​ he distance of a line from the projection plane determines 
a.​ ​Its size on projection plane 
b.​ ​Its length on projection plane 
c.​ ​Its width on projection plane 
d.​ ​Its height on projection plane
 
42.​ ​The further the line from the projection plane, _______its image on the projection plane 
a.​ ​Smaller 
b.​ ​Larger 
c.​ ​Neither smaller nor larger 
d.​ ​None of these
 
43.​ ​The Bezier curve obtained from the four control points is called a 
a.​ ​Square Bezier curve 
b.​ ​Cubic Bezier curve 
c.​ ​Hectare Bezier curve 
d.​ ​Rectangle Bezier curve
 
44.​ ​The shape of a Bezier curve primarily depends upon the 
a.​ ​Position of control points 
b.​ ​Distance of control points 
c.​ ​Position of control panel 
d.​ ​None of these
 
45.​ ​The no of control points in a Bezier curve ensures the 
a.​ ​Jaggies of curve 
b.​ ​Smoothness of curve 
c.​ ​Straightness of curve 
d.​ ​None of these
 
46.​ ​ More the control points of a Bezier curve,________ quality of the curve 
a.​ ​Higher 
b.​ ​Lower 
c.​ ​Bad 
d.​ ​None of these
 
47.​ ​______is one of the function that is used to specify a single plane surface 
a.​ ​Meta-ball model 
b.​ ​Fill area 
c.​ ​Reflection 
d.​ ​None of these
 
48.​ ​Meta-ball is used to describe 
a.​ ​Simplest object 
b.​ ​Complex object 
c.​ ​Composite object 
d.​ ​None of these
 
49.​ ​Super quadrics is a class of object that contain 
a.​ ​Data 
b.​ ​Codes 
c.​ ​Both a & b 
d.​ ​None of these
 
50.​ ​ When two molecules move apart, which effect on molecular shapes 
a.​ ​Stretching 
b.​ ​Snapping 
c.​ ​Contracting 
d.​ ​All of these
 
51.​ ​ The sweep representation of an object refers to the 
a.​ ​2D representation 
b.​ ​3D representation 
c.​ ​Both a & b 
d.​ ​None of these 
f we multiply any matrix with___matrix then we get the original matrix A___.
A. Scaling matrix
B. Translation matrix
C. Identity matrix
D. Opposite matrix
ANSWER: C
A Pixel is represented dy a tuple Xw,Yw,w in______.
A. Normalised Device Coordinates
B. Homogeneous coordinates system
C. 3D coordinate system
D. None of these
ANSWER: B
A _______ transformation alters the size of an object.
A. Scaling
B. Rotation
C. Translation
D. Shear
ANSWER: A
If the angle Q is positive then the rotation direction will be _________.
A. Clockwise
B. Anticlockwise
C. Parallel
D. Perpendicular
ANSWER: B
Reflection of a point about x-axis ,followed by a conter-clockwise rotation of 90 ̊ is equivalent to reflection about the
line ______.
A. X=-Y
B. Y=-X
C. X=Y
D. X+Y=1
ANSWER: CThe shape of the object gets by _________transformation.
A. Scaling
B. Rotation
C. Translation
D. Shear
ANSWER: D
A_______is a transformation that produces a mirror image of an object.
A. Scaling
B. Translation
C. Reflection
D. Both B & C
ANSWER: C
If we multiply any matrix A with identity matrix then we get the________matrix.
A. Identity matrix
B. Translation matrix
C. Scaling matrix
D. Original matrix
ANSWER: D
In homogeneous co-ordinate system a pixel is represented as ____________.
A. X,Y
B. X,Y,Z
C. X,Y,W
D. Xw,Yw,w
ANSWER: D
Two consecutive transformation t1 and t2 are _________.
A. Additive
B. Substractive
C. Multiplicative
D. None of these
ANSWER: A
Reflection about the line Y=X is equivalent to ________,followed by a anticlockwise rotation 90 ̊.
A. Reflection about y-axis
B. Reflection about x-axisC. Reflection about origin
D. None of these
ANSWER: B
Two consecutive scaling transformation t1 and t2 are __________.
A. Additive
B. Substractive
C. Multiplicative
D. None of these
ANSWER: C
After scaling a triangle having coordinates A(0,0),B(5,0),C(5,5)by 2 units in X and 3 units in Y direction the new
coordinates will be___________.
A. A(0,0),B(10,0),C(10,15)
B. A(0,0),B(10,15),C(10,0)
C. A(0,0),B(0,10),C(15,10)
D. A(2,3),B(10,0),C(10,15)
ANSWER: A
After performing Y-shear transformation we got A(2,5),B(4,11),C(2,7).If the constant value is 2 then original
coordinates will be___________.
A. A(2,5),B(4,11),C(2,7)
B. A(2,1),B(4,3),C(2,3)
C. A(4,1),B(10,3),C(4,3)
D. A(5,11),B(3,4),C(3,2)
ANSWER: B
After rotating a triangle having A(0,0),B(6,0),C(3,3) by 90 ̊about origin in anticlockwise direction,thenresultin
triangle will be_____.
A. A(0,0),B(3,-3),C(0,6)
B. A(0,0),B(-3,3),C(0,6)
C. A(0,0),B(0,-6),C(3,-3)
D. A(0,0),B(0,6),C(-3,3)
ANSWER: D
The point (x,y) becomes (y,x) in____________transformation.
A. Reflection about origin y-axis
B. Reflection about x-axis
C. Reflection at line Y=XD. Reflection about y-axis
ANSWER: C
Which of the following transformation is not used in rotation about arbitrary point in 2D?
A. Scaling
B. Rotation
C. Translation
D. None of these
ANSWER: A
After performing X-shear on triangle having A(2,1),B(4,3)C(2,3) with the constant value as 2,the resultant triangle
will be______.
A. A(2,5),B(4,1),C(2,7)
B. A(10,3),B(4,5),C(4,1)
C. A(4,1),B(10,3),C(4,3)
D. A(5,2),B(4,11),C(7,2)
ANSWER: C
If the resultant object is given along with the set of transformations applied on it, then to find the original object we
have to use___________.
A. Affine transformation
B. Reverse transformation
C. Normal transformation
D. Inverse transformation
ANSWER: D
Two consecutive rotation transformation are always__________.
A. Additive
B. Subtractive
C. Multiplicative
D. None of these
ANSWER: A
Two consecutive rotation transformation are always commutative____________.
A. TRUE
B. FALSE
C. Not always
D. None of these
ANSWER: AA point (x,y) becomes (-x,y) in__________transformation.
A. Reflection at X axis
B. Reflection at Y axis
C. Reflection at origin
D. Reflection about line Y=X
ANSWER: B
In Y-shear transformation point (x,y) becomes_______.
A. x+yb,xa+y
B. x+yb,y
C. x,xa+y
D. None of these
ANSWER: C
Reflection about X-axis followed by reflection about Y-axis is equivalent to_______.
A. Reflection about line Y= X
B. Reflection about origin
C. Reflection about line Y=-X
D. Reflection about Y-axis
ANSWER: B
Two consecutive scaling transformation are always commutative___________.
A. TRUE
B. FALSE
C. Not always
D. None of these
ANSWER: A
If a circle is scaled in only one direction then it will become___________.
A. Parabola
B. Hyperbola
C. Ellipse
D. Circle
ANSWER: C
The transformation that changes the co-ordinate positions of an object along a circular path is called_______.
A. Translation
B. ScalingC. Rotation
D. Reflection
ANSWER: C
The result of two successive 2D rotations R(Q1) and R(Q2) is___________.
A. R(Q1+Q2)
B. R(Q1.Q2)
C. R(Q1-Q2)
D. R(Q1/Q2)
ANSWER: A
If we take mirror reflection of a points(x,y) along x-axis then the point becomes_________.
A. (x,-y)
B. (-x,-y)
C. (-x,y)
D. (y,x)
ANSWER: A
If we take mirror reflection of a points(x,y) along the line Y=X then the point becomes________.
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (y,x)
ANSWER: D
The number of matrices required to rotate an object about a point(1,1) are___________.
A. 1
B. 2
C. 3
D. 4
ANSWER: C
In X-shear transformation point(x,y)becomes_________.
A. (x+yb,xa+y)
B. (x+yb,y)
C. (x,xa+y)
D. None of these
ANSWER: BIf we take mirror reflection of a point (-x,y) along the origin then the point Becomes_________.
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (y,x)
ANSWER: A
Shear transformation can be formed by scaling and rotation,justify True or False .
A. TRUE
B. FALSE
C. Not always
D. None of these
ANSWER: A
If a point (x,-y)is rotated along y axis by 180 degree in clockwise direction Followed by90 degree in anticlockwise
direction then it becomes__________.
A. (x,-y)
B. (-y,-x)
C. (-x,y)
D. (-y,x)
ANSWER: D
Which transformation needs homogeneous coordinates to represent it in Matrix from?
A. Scaling
B. Rotation
C. Translation
D. Reflection
ANSWER: C
Which of the following statement is not correct with respect to homogeneous coordinates?
A. It is used to combine transformations
B. Each point is represented as (xw,yw,w)
C. It is used for representing translation in matrix form
D. Homogeneous coordinates are represented in 2*2 matrix form
ANSWER: D
Any 2D point is represented in a matrix form with dimension as_________.
A. 1*2B. 2*1
C. 1*1
D. 2*2
ANSWER: A
Any 2D point in homogeneous coordinates is represented in a matix form with dimension as________.
A. 1*2
B. 2*1
C. 1*3
D. 3*1
ANSWER: C
Which of the following 2D transformation is not represented in matrix form in non homogeneous coordinate
system?
A. Scaling
B. Rotation
C. Translation
D. Reflection
ANSWER: C
If we need to tilt the 2D object in one direction then we have to use_____transformation.
A. Scaling
B. Translation
C. Shear
D. Rotation
ANSWER: C
If we need to tilt the height of the object keeping width same as original object then we have to
use________transformations.
A. Scaling in Y direction
B. Scaling
C. Y-shearing
D. X-shearing
ANSWER: B
If we need to shift the width of the object keeping height as unchanged,then we have to
use__________transformations.
A. TranslationB. Scaling
C. Y-shearing
D. X-shearing
ANSWER: D
In Scaling transformation Sx Indicate______.
A. Scaling factor along X axis
B. Translation factor along X axis
C. Tilting factor along X axis
D. None of these
ANSWER: A
In translation transformation Ty indicates____________.
A. Scaling factor along Y direction
B. Translation factor along Y direction
C. Tilting factor along Y direction
D. None of these
ANSWER: B
If the size of triangle needs to be doubled by keeping the center triangle at the same position as that of original
triangle. then we need to apply ______transformation.
A. Only scaling
B. Only translation
C. Scaling and translation
D. Scaling and Rotation
ANSWER: C
If we have applied scaling by 2 units in both directions and received final coordinates of the polygon, then to recover
the original coordinates of the polygon we have to apply scaling transformation with...
A. Sx=2, Sy=2
B. Sx=1/2, Sy=1/2
C. Sx=1/2, Sy=2
D. Sx=2, Sy=1/2
ANSWER: B
If have the final coordinates of the polygen, then to recover the original coordinates of polygen we have to
apply___________.
A. Scaling
B. TranslationC. Inverse transformation
D. None of these
ANSWER: C
Which of the following transformation are needed if we want to scale the object with respect to a point other than
origin?
A. Scaling
B. Transformation
C. Both a and b
D. Rotation
ANSWER: C
A point x(2,3) is reprensented in homogeneous coordinates as_________.
A. (2,3)
B. (2,3,1)
C. (2,3,1)
D. (2,3,0)
ANSWER: C
The transformation matrix is used for__________.
A. Reflection at X axis
B. Reflection at Y axis
C. Reflection at origin
D. None of these
ANSWER: B
The transformation matrix is used for__________.
A. Reflection at X axis
B. Reflection at Y axis
C. Reflection at origin
D. Reflection at line Y=X
ANSWER: C
The transformation matrix is used for__________.
A. Reflection at origin
B. Reflection at X axis
C. Reflection at Y axis
D. Reflection at the line Y=XANSWER: D
The transformation matrix is used for_____________.
A. Scaling
B. Y-shear
C. X-shear
D. None of these
ANSWER: B
If we rotate a triangle ABC having A(1,1), B(10,1), C(5,5) by 90 degree in anticlockwise direction then the ABC will
become________.
A. A(1,1), B(10,1), C(5,-5)
B. A(-1,1), B(-10,1), C(-5,5)
C. A(-1,1), B(-1,10), C(-5,5)
D. A(-1,1), B(-1,10), C(-5,-5)
ANSWER: B
Find out final co-ordinate of a figure bounded by co-ordinate A(2,1), B(2,3), C(4,2), D(4,2) with scale factor
Sx=Sy=3.
A. A(6,3), B(6,9), C(6,12), and D(12,6)
B. A(6,3), B(6,9), C(6,12), and DANSWER: B6,12)
C. A(6,3), B(6,9), C(12,6), and D(12,6)
D. A(6,3), B(9,6), C(12,6), and D(6,12)
ANSWER: C
If we perform X shear on a triangle having A(2,1), B(4,3), C(2,3). With constant value as 2 then the new coordinate
will be________.
A. A(4,1), B(10,3), C(2,3)
B. A(4,1), B(10,3), C(4,3)
C. A(2,5), B(4,11), C(2,7)
D. A(2,5), B(4,11), C(7,2)
ANSWER: B
If we perform Y shear on a triangle having A(2,1), B(4,3), C(2,3). With constant value as 2 then the new coordinate
will be_________.
A. A(4,1), B(10,3), C(2,3)
B. A(4,1), B(10,3), C(4,3)
C. A(2,5), B(4,11), C(2,7)
D. A(2,5), B(4,11), C(7,2)ANSWER: C
If we rotate a triangle ABC having A(0,0), B(6,0) and C(3,3) by 90 degree about origin in anticlockwise direction
then triangle ABC will become as_________.
A. A(0,0), B(0,6), C(-3,3)
B. A(0,0), B(6,0), C(-3,3)
C. A(0,0), B(0,6), C(3,-3)
D. A(0,0), B(6,0), C(3,-3)
ANSWER: A
If we translate the square ABCD whose co-ordinate are A(0,0), B(3,0), C(3,3) and D(0,3) by 2 units in both
directions then the new coordinates of ABCD will be______.
A. A(2,2) , B(3,2), C(5,5), D(0,5)
B. A(2,2) , B(5,2), C(5,5), D(2,5)
C. A(2,2) , B(5,2), C(3,3), D(2,5)
D. A(2,2) , B(3,2), C(5,5), D(2,5)
ANSWER: B
If we scale the square ABCD whose co-ordinate are A(2,2), B(5,2), C(5,5), D(2,5) by 1.5 and 0.5 units in X and Y
directions respectively then the new coordinates of ABCD will be______.
A. A(3,1) , B(7.5,1), C(7.5,5), D(3,5)
B. A(3,3) , B(7.5,3), C(7.5,7.5), D(3,7.5)
C. A(3,1) , B(7.5,1), C(7.5,2.5), D(3,2.5)
D. A(3,3) , B(5,3), C(5,7.5), D(3,7.5)
ANSWER: C
If we scale a square ABCD with co-ordinate A(0,0), B(5,0), C(5,5) and D(0,5) by 2 units for x-direction and 3 units
for y-directions, then the final coordinates will be______.
A. A(0,0) , B(0,10), C(15,10) and D(15,0)
B. A(0,0) , B(10,0), C(10,15) and D(0,15)
C. A(0,0) , B(10,0), C(15,10) and D(0,15)
D. A(0,0) , B(10,0), C(15,10) and D(15,0)
ANSWER: B
If a final polygon co-ordinates are A(7,3), B(9,3), C(9,5) and D(7,5). We have applied translation by 1 in both x of y-
direction. Then the original polygon coordinates will be______.
A. A(6,3) , B(8,3), C(8,5), D(6,5)
B. A(7,2) , B(9,2), C(9,4), D(7,4)
C. A(6,2) , B(8,2), C(8,4), D(6,4)
D. None of theseANSWER: C
In 3D viewing, the world co-ordinate position of the objects are converted into viewing co-ordinates by _________
transformation.
A. Viewing
B. Projection
C. Workstation
D. 3D
ANSWER: A
In 3D viewing, mismatch between 3D objects and 2D displays is compensated by introducing_________.
A. Transformation
B. Projection
C. Rotation
D. Translation
ANSWER: B
In 3D viewing, the _________transformation is used to convert 3D description of objects in viewing co-ordinates to
the 2D projection co-ordinates.
A. Viewing
B. Projection
C. Workstation
D. 3D
ANSWER: B
In 3D viewing, ____________-transformation transforms the projection co-ordinates into the device coordinates.
A. Viewing
B. Projection
C. Workstation
D. 3D
ANSWER: C
A view Plane normal vector is perpendicular to _____________.
A. View Plane
B. Projection Plane
C. Reference Plane
D. None of these
ANSWER: AThe length of a directed line segment (the view plane normal vector) from the view plane to the view
reference point
is referred to as _________ distance.
A. Normal
B. Plane
C. View
D. Reference
ANSWER: C
Two Basic ways of projecting objects onto the view plane are _________ and _______- .
A. Serial, Parallel
B. Serial,Perspective
C. Parallel, Perspective
D. None of these
ANSWER: C
_____________ projection preserves relative proportions of the objects but does not produce the realistic views.
A. Serial
B. Perspective
C. Parallel
D. Any
ANSWER: C
_____________ projection produce the realistic views but does not preserves relative proportions.
A. Serial
B. Perspective
C. Parallel
D. Any
ANSWER: C
In perspective projection, the lines of projection converge at a single point called _________.
A. Center of projection
B. projection reference point
C. A & B
D. None of these
ANSWER: C
When the direction of the projection is normal to the view plane, we have an __________ parallel projection.
A. SerialB. Orthographic
C. Oblique
D. None of these
ANSWER: C
When the direction of the projection is not perpendicular to the view plane , we have an _______ parallel projection.
A. Serial
B. Orthographic
C. Oblique
D. None of these
ANSWER: C
The orthographic projection can display more that one face of an object, such an orthographic projection is called
__________ orthographic projection.
A. Axonometric
B. Isometric
C. Parallel
D. Perspective
ANSWER: A
The foreshortening factor is the ratio of the ____________.
A. Actual length of line to its projected length
B. Projected length of line to its true length
C. A Or B
D. None of these
ANSWER: B
Three types of axonometric projections are ________, _____, _________
A. Serial , Parallel, isometric
B. Paralle, Perspective , Isometric
C. Isometric, dimetric, trimetric
D. None of these
ANSWER: C
The vanishing point for any set of lines that are parallel to one of the three principle axes of an object is referred to as
a __________.
A. Principle vanishing point
B. Axis vanishing point
C. A or BD. None of these
ANSWER: C
The oblique projections are classified as ______ and ___________ projections.
A. Cavalier and Cabinet
B. Serial & Parallel
C. Parallel & Perspective
D. Isometric & dimetric
ANSWER: A
For the cavalier projection, the direction of projection makes a __________ angle with the view plane.
A. 40 degree
B. 45 degree
C. 63 degree
D. 63.4 Degree
ANSWER: B
When the direction of projection makes an angle of arc tan (2) = 63.4 degree with the view plane, the resulting view
is called a ____________ projection .
A. Parallel
B. Perspective
C. Cavalier
D. Cabinet
ANSWER: D
Cabinet projection appear ___________ realistic compared to cavalier projections.
A. More
B. Less
C. Equally
D. None of these
ANSWER: A
A Special form of the one-point perspective projection takes place when the vanishing point is placed centrally
within the figure.this type of projection is called a _________ projection.
A. Parallel
B. Perspective
C. Tunnel
D. Cavalier
ANSWER: CThe first viewing parameter in perspective projection we must consider is the?
A. Viewing window
B. Shift vector
C. View reference point
D. View reference plane
ANSWER: C
For a point (2,1,2) if we apply reflection about Y-axis, then the new point will become ___________.
A. (2,- 1,2)
B. (- 2,1,- 2)
C. (2,- 1,- 2)
D. (- 2,- 1,2)
ANSWER: B
Which of the following is not a type of perspective projection____________.
A. Isometric
B. One point
C. Two point
D. Three point
ANSWER: A
If we have applied scaling by 2 units in both directions and received final coordinates of the polygon, then to recover
the original coordinates of the polygon we have to apply scaling transformation with _____.
A. Sx = 2, Sy = 2
B. Sx = 1/2, Sy = 1/2
C. Sx = 1/2, Sy = 2
D. Sx = 2, Sy = 1/2
ANSWER: B
A cube is defined by 8 vertices A(0,0,0),B(2,0,0),C(2,2,0),D(0,2,0),E(0,0,2),F(0,0,2), G(2,0,2),H(2,2,2) After
translation by tx=1,ty=2,tz=1 resultant position is,
A. A(1,2,1), B(3,2,1), C(3,4,1), D(1,4,1), E(1,2,3), F(1,4,3),G(3,2,3), H(3,4,3)
B. A(1,2,1), B(1,2,3), C(3,4,1), D(1,1,1), E(1,2,3), F(1,4,3),G(3,2,3), H(3,3,3)
C. A(1,2,1), B(3,2,1), C(1,4,3), D(1,4,1), E(3,2,1), F(1,4,3),G(2,2,3), H(3,3,4)
D. None of the above.
ANSWER: A
After scaling a triangle having coordinates A(O,O),B(5,0), C(5,5) by 2 units in X and 3 units in Y direction, the new
coordinates will be_________.A. A(0,0),B(10,0), C(10,15)
B. A(0,0),B(10,15), C(10,0)
C. A(0,0),B(0,10), C(15,10)
D. A(2,3), B(10,0), C(10,15)
ANSWER: A
After performing Y-shear transformation we got A(2,5), B(4,11), C(2,7). If the constant value is 2 then the original
coordinates will be _________.
A. A(2,5), B(4,11), C(2,7)
B. A(2,l), B(4,3), C(2,3)
C. A(4,1), B(10,3), C(4,3)
D. A(5,11), B(3,4), C(3,2)
ANSWER: B
 Subject:-Computer Graphics
Objective type questions Unit-IV Segment and Animation

1. The color options are numerically coded with the following values.
A. Ranging from 0 through the positive integer
B. Ranging from 0 to 1
C. Ranging from 0 to -0
D. Only c
ANSWER: A

2. In color raster system, the number of color choices available depends on_____________.
A. colors in frame buffer
B. Amount of storage provided per pixel in frame buffer
C. RGB color
D. Neither a nor b
ANSWER: B

3. The color code “000” is for________.

A. White
B. Black
C. Blue
D. Green
ANSWER: B

4. Color information can be stored in____________.

A. Main memory
B. Secondary memory
C. Graphics card
D. Frame buffer
ANSWER: D

5. Whenever a particular color code is specified in an application program, the corresponding

binary value is placed in?
A. Color look-up table
B. Directly in frame buffer
C. a or b
D. Video lookup table
ANSWER: B

6. The range that specifies the gray or grayscale levels is___________.

A. The value range from -1 to 1
B. The value range from 0 to -1
C. The value range from 0 to 1
D. Any one of the above
ANSWER: C
7. With 3 bits per pixel, we can accommodate 8 gray levels. If we use 8 bits per pixel then what
is the value of gray
levels?
A. 18 gray levels
B. 128 gray levels
C. 256 gray levels
D. No color
ANSWER: C

8. If any intensity input value near 0.33 would be stored as the binary value 1 in the frame buffer,
then it displays__________.
A. Dark green color
B. Light gray color
C. Dark gray color
D. White or black
ANSWER: C

9. RGB colors on internet applications are called___________.

A. Safe colors
B. Colors space
C. Web colors
D. Safe web colors
ANSWER: D

10. Equation that describes hue is ___________.

A. H = H-90
B. H = H-100
C. H = H-120
D. H = H-180
ANSWER: C

11. 0 degree of red color in hue image will correspond to______________.

A. Boundary

B. Edges
C. White region
D. Black region
ANSWER: D
12. White color in a Cartesian coordinate system can be represented as____________.
A. (0,1,1)
B. (0,1,0)
C. (0,0,1)
D. (1,1,1)
ANSWER: D

13. Color model is also called___________.

A. color system
B. color space
C. color area
D. Both A and B
ANSWER: D

14. The additive color models use the concept of___________.

A. Printing ink
B. Light to display color
C. Printing line
D. None of these
ANSWER: B

15. The subtractive color model use the concept of ____________.

A. Printing ink
B. Light to display color
C. Printing line
D. None of these
ANSWER: A

16. Color apparent in additive model are the result of

A. Reflected light
B. Transmission of light
C. Flow of light
D. None of these

ANSWER: B

17. Color apparent in subtractive model are the result of

A. Amount of Reflected light
B. Transmission of light
C. Flow of light
D. None of these
ANSWER: A
18.Two dimensional color model are_____________.
A. RGB and CMKY
B. RBG and CYMK
C. RGB and CMYK
D. None
ANSWER: C

19. RGB model are used for____________.

A. Computer display
B. Printing
C. Painting
D. None of these
ANSWER: A

20. CMYK model are used for______________-.

A. Computer display
B. Printing
C. Painting
D. None of these
ANSWER: B

21. The intersection of three primary RGB color produces________.

A. White color
B. Black color
C. Magenta color
D. Blue color
ANSWER: A

22. The intersection of primary CMYK color produces__________.

A. White color

B. Black color
C. Cyan color
D. Magenta color
ANSWER: B

23. The RGB model display a much _______ percentage of the visible band as compared to
CMYK.
A. Lesser
B. Larger
C. Medium
D. None of these
ANSWER: B
24. Color depth can be defined by ________ which can be displayed on a display unit.
A. Bits per pixel
B. Bytes per pixel
C. Megabyte per pixel
D. None of these
ANSWER: A

25. Each bit represent

A. One color
B. Two color
C. Three color
D. None
ANSWER: A

26.RGB true color model has _______ color depth.

A. 24bit
B. 32bit
C. 64bit
D. None
ANSWER: A

27. CMYK true color model has _______ color depth.

A. 24bit
B. 32bit
C. 64bit
D. None

ANSWER: B

28. Hue and saturation, both together produce_________.

A. Brightness
B. Transitivity
C. Chromaticity
D. Reflectivity
ANSWER: C

29. Green plus blue color produces________.

A. Yellow
B. Red
C. Magenta
D. Cyan
ANSWER: D
30. Three primary colors are_________.
A. Red, green, blue
B. Red, cyan, blue
C. Red, white, black
D. Red, green, yellow
ANSWER: A

31. Total amount of energy from light source is called________.

A. Brightness
B. Reflectance
C. Luminance
D. Radiance
ANSWER: D

32. Hues opposites to each others are known as____________.

A. Edges

B. Boundaries
C. Complements
D. Saturation
ANSWER: C

33. Color spectrum consists of__________.

A. 4 colors
B. 6 colors
C. 7 colors
D. 8 colors
ANSWER: C

34. One that is not a color model is__________.

A. RCB
B. CMYK
C. RGB
D. HSV
ANSWER: A

35. Intensity can be converted to color transformation by assigning colors to___________.

A. pixels
B. coordinates
C. pixel depth
D. intensity levels
ANSWER: D
36. Color model used for monitors is__________.
A. CMYK
B. BGR
C. RGB
D. CMR
ANSWER: C

37. The dynamic effect of an image is called_________.

A. Video
B. Animation
C. Super sampling
D. None of these

ANSWER: B

38. The animation can be defined as a collection of images played in______.

A. Not sequence
B. Defined sequence
C. Both a & b
D. None of these
ANSWER: B

39. When sound is included in the animation, it become____________.

A. Audio
B. Video
C. Both a & b
D. None of these
ANSWER: B

40. Many online animation tools are used to create animation in the form of___________.
A. JPEG image
B. PDF image
C. GIF image
D. None of these
ANSWER: C

41. The types of animation are__________.

A. Traditional animation
B. Computer animation
C. Both a & b
D. None of these
ANSWER: C
42. The types of computer animation are____________.
A. 2D computer animation
B. 3D computer animation
C. Both a & b
D. None of these
ANSWER: C

43. In computer graphics, a graphical object is known as____________.

A. Point

B. Segment
C. Parameter
D. None of these
ANSWER:B

44. An object can be viewed as a collection of__________.

A. One segment
B. Two segment
C. Several segments
D. None of these
ANSWER:C

45. Every segment has its own attributes like________.

A. Size, visibility
B. Start position
C. Image transformation
D. All of these
ANSWER:D

46. By using the attributes of segment , we can________ any segment.

A. Control
B. Print
C. None of these
D. Change
ANSWER:A

47. A two-dimensional array contain the details of all the segment are called________.
A. Segmentation table
B. Segment name
C. Operation
D. None of these
ANSWER: A
48. We assign all the attributes of segment under the________.
A. Segment Name
B. Segment size
C. Array
D. None of these

ANSWER: A

49. The initial size of segment will be_______.

A. 1
B. 0
C. 2
D. 3
ANSWER: B

50. The removal of a segment with its details are called________.

A. Alter the segments
B. Deletion of segments
C. Closing the segment
D. None of these
ANSWER: B

51. Deletion of any segment is much________ than creation of any new segment.
A. Easier
B. Difficult
C. Higher
D. None of these
ANSWER:B

52. When a display file is divided into number of subparts then each part is called as____.
A. Segment
B. Page
C. Image
D. Structure
ANSWER: A

53. A segment is a __________.

A. Small part of the whole scene
B. The complete scene
C. The collection of all pictures of the scene
D. None of these
ANSWER: A
54. Segments are called as structures in ____________ System.
A. GKSB. PHIGS
C. Core
D. CGM
ANSWER: C

55. Which of the following attribute of the segment is used to make changes in image?
A. Visibility
B. Segment name
C. Image Transformation
D. Segment Size
ANSWER:D

56. Which of the following is not applied on segment?

A. Delete
B. Create
C. Close
D. Search
ANSWER: D

57. Which of the following operation is valid on Segment?

A. Copy
B. Search
C. Rename
D. Update
ANSWER: C

58. _______ attribute of segment is used to uniquely identify a particular segment.

A. Segment Start
B. Segment Name
C. Segment Size
D. Visibility
ANSWER: B

59. We can not have more than one segment open at a time. Statement true or false
A. TRUE
B. FALSE
C. Sometimes
D. None of these

ANSWER: A
60. The segment name is must be unique. State true or false.
A. TRUE
B. FALSE
C. Sometimes
D. None of these
ANSWER: A

61. For creation of new segment, we have to write ___________.

A. Seg_Start [Seg_Name]=Next free location in display file
B. Seg_Start [Seg_Name]= Current location in display file
C. Seg_Start [Seg_Start]=Next free location in display file
D. Seg_Start [Seg_Start]=Current location in display file
ANSWER: A

62. The default value of Visibility attribute is ______.

A. OFF
B. ON
C. 0
D. 1
ANSWER: B

63. Segment Name always start from_________.

A. 0
B. 1
C. -1
D) None of these
ANSWER: B

64. To delete a particular segment________.

A. Set Visibility attribute of that segment as OFF.
B. Shift all next segments up and overlap the segment to be deleted.
C. Make the size of the segment to be deleted as zero in segment table and update the segment
start attribute of next segment.
D. Both B & C
ANSWER: D

65. To delete all the segments simultaneusly_______

A. Set size of all segments to zero

B. Set visibility attribute of all segment as OFF
C. Set segment start of all the segment to one
D. Both A & C
ANSWER: A
66. After deleting a particular segment, .................. attribute of all next segments needs
modification.
A. Segment Size
B. Segment start
C. Segment name
D. Visibility
ANSWER: B

67. After deleting a particular segment, the segment start attribute of all next segment
become_________.
A. Segment start of a particular segment - size of segment to be deleted
B. Segment Start of particular segment - Size of segment start of segment to be deleted.
C. Segment start of particular segment - size of next segment
D. None of these
ANSWER: A

68. The segment is opened if_______.

A. The segment name is not in sorted order
B. More than two segments are not having same segment name
C. Segment name is starting from one
D. None of these
ANSWER: D

69. Which of the following statement says segment is invalid?

A. if the size of segment is zero.
B. If the segment name is zero
C. if two segment starts from same location.
D. None of these
ANSWER: C

70. Double Buffering concept in segments is nothing but_______.

A. maintaing two temporary buffers
B. Maintating two images
C. Modifying the existing image

D. None of these
ANSWER: B

71. It is necessary to organize the dispiay file in such away that it will be divided into several
______, which posses the portion of overall picture.
A. Line
B. Pixel
C. Segment
D. Curves
ANSWER:C

72. Which is not attribute associated with segment?

A. Segment no
B. Segment start
C. Segment size
D. Length
ANSWER: D

73. This attribute/field additionaliy used in segment linked list___.

A. Colour
B. Visibility
C. Scalex
D. Link
ANSWER: A

74. Which process is used to keep replication of original segment?

A. Create segment
B. Close segment
C. Rename segment
D. Delete segment
ANSWER: C
((MARKS)) 1
(1/2/3...)
The term computer graphics is given by which of following equations
((QUESTIO
N))
Computer Graphics = Data Structure + Algorithm
((OPTION_
A))
Computer Graphics = Data Structure + Languages
((OPTION_
B))
Computer Graphics = Data Structure + Algorithm + Languages
((OPTION_
C))
Computer Graphics = Data Structure
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
An application of computer vision is to create visual effect of
((QUESTIO
N))
camera focusing
((OPTION_
A))
camera tracking
((OPTION_
B))
camera clicking
((OPTION_
C))
 camera moving
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In computer graphics , a computer is used to create
((QUESTIO
N))
Picture
((OPTION_
A))
Data Structure
((OPTION_
B))
Algorithm
((OPTION_
C))
To modify existing object
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Examples of Presentation Graphics is
((QUESTIO
N))
Bar Charts
((OPTION_
A))
Line Graphs
((OPTION_
B))
CAD
((OPTION_
C))
Both A & B
((OPTION_
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Which devices provides positional information to the graphics system ?
((QUESTIO
N))
Input devices
((OPTION_
A))
Output devices
((OPTION_
B))
Pointing devices
((OPTION_
C))
Both A & C
((OPTION_
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Resolution of 2x2 inch image that has 512x512 pixels
((QUESTIO
N))
512x512 pixels per inch
((OPTION_
A))
512/2 pixels per inch
((OPTION_
B))
512 pixels per inch
((OPTION_
C))
None of above
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
 Width of an image having height of 5 inches and an aspect ratio 1.5
((QUESTIO
N))
7.5 inches
((OPTION_
A))
6 inches
((OPTION_
B))
5 inches
((OPTION_
C))
1.5 inches
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
What is the refresh rate of a 512x512 frame buffer , if access time for each pixel
((QUESTIO is 200 nanosecond(ns)
N))

20 frames per second

((OPTION_
A))
12 frames per second
((OPTION_
B))
19 frames per second
((OPTION_
C))
15 frames per second
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
24 bit plane frame buffer i.e. 8 bit planes per color will generate
((QUESTIO
N))
224 possible colours
((OPTION_
A))
212 possible colors
((OPTION_
B))
23 possible colors
((OPTION_
C))
28 possible colors
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 2
(1/2/3...)
The amount of memory requires by a 1 plane frame buffer each of R, G and B of
((QUESTIO
N)) 800 x 600 screen resolution is

1440000 bits
((OPTION_
A))
1920000 bits
((OPTION_
B))
480000 bits
((OPTION_
C))
500000 bits
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In ______________ each character is displayed as a group of dots or pixels.
((QUESTIO
N))
Text mode
((OPTION_
A))
Character mode
((OPTION_
B))
Graphics mode
((OPTION_
C))
All of above
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 2
(1/2/3...)
How many bits are required for a 512 x 512 raster with each pixel being
((QUESTIO represented by 3 bits?
N))

786431 bits
((OPTION_
A))
786432 bits
((OPTION_
B))
786433 bits
((OPTION_
C))
786344 bits
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
 What is the rate of 1024 x 1024 frame buffer with an average access rate per
((QUESTIO pixel of 200 ns on a simple color display?
N))

((OPTION_ 2
A))
((OPTION_ 3
B))
((OPTION_ 4
C))
((OPTION_ 1.6
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
What is the access rate / pixel of a 4096 x 4096 raster having a refresh rate of 30
((QUESTIO frames per seconds?
N))

((OPTION_ 1 ns

A))

((OPTION_ 2 ns
B))
((OPTION_ 3 ns
C))
((OPTION_ 4 ns
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
How many memory bits are required for a 24bit plane 1024 x 1024 element
((QUESTIO raster?
N))

1048576 bits
((OPTION_
A))
24576 bits
((OPTION_
B))
1048575 bits
((OPTION_
C))
25165824 bits
((OPTION_
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Pixel is the
((QUESTIO
N))
Largest screen element which user can control
((OPTION_
A))
Smallest screen element which user can control
((OPTION_
B))
particular colour of the screen
((OPTION_
C))
one object on screen
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
______ refers to the number of dots on screen
((QUESTIO
N))
pixel
((OPTION_
A))
Resolution
((OPTION_
B))
Aspect ratio
((OPTION_
C))
Frame buffer
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Frame buffer is part of the_________ which stores the image to be displayed on
((QUESTIO screen
N))

main memory
((OPTION_
A))
ROM
((OPTION_
B))
External memory
((OPTION_
C))
Dynamic memory
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
To store black and white images ,black pixels are represented by________ in the
((QUESTIO frame buffer and white pixels by_______
N))

Zero and one

((OPTION_
A))
One and Zero
((OPTION_
B))
Both a & b
((OPTION_
C))
((OPTION_ None
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In graphical system, the array of pixels in the picture are stored in
((QUESTIO
N))
Memory
((OPTION_
A))
Frame buffer
((OPTION_
B))
Processor
((OPTION_
C))
 All the above
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
The ____ simply reads each successive byte of data from the frame buffer ?
((QUESTIO
N))
Digital Controller
((OPTION_
A))
Data Controller
((OPTION_
B))
Display controller
((OPTION_
C))
All of above
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A 16*16array of black and white pixels could be represented by________
((QUESTIO
N))
64bytes
((OPTION_
A))
32bytes
((OPTION_
B))
128bytes
((OPTION_
C))
96bytes
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Aspect ratio means
((QUESTIO
N))
Number of pixels
((OPTION_
A))
Ratio of vertical points to horizontal points
((OPTION_
B))
Ratio of horizontal points to vertical points
((OPTION_
C))
Both b and c
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Color depth can be defined by ________ which can be displayed on a display
((QUESTIO unit
N))

Bits per pixel

((OPTION_
A))
Bytes per pixel
((OPTION_
B))
Megabyte per pixel
((OPTION_
C))
None of these
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
On a black and white system with one bit per pixel, the frame buffer is commonly
((QUESTIO called as
N))

Pix map
((OPTION_
A))
Multi map
((OPTION_
B))
Bitmap
((OPTION_
C))
All the above
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In computer graphics, pictures or graphic objects are presented as a collection of
((QUESTIO discrete picture elements called _____
N))

dots
((OPTION_
A))
pixels
((OPTION_
B))
coordinates
((OPTION_
C))
 points
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Pixel is also referred to as a ___
((QUESTIO
N))
point
((OPTION_
A))
do
((OPTION_
B))
pel
((OPTION_
C))
coordinate
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In raster scan display, the image is stored in the form of ____ in the refresh
((QUESTIO buffer.
N))

1s
((OPTION_
A))
0s
((OPTION_
B))
1s and 0s
((OPTION_
C))
None
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
_____ is the smallest addressable screen element.
((QUESTIO
N))
dot
((OPTION_
A))
((OPTION_ spot
B))
((OPTION_ point
C))
((OPTION_ pixel
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
The selection of the pixel will depend on the____of the line
((QUESTIO
N))
resolution
((OPTION_
A))
slope
((OPTION_
B))
length
((OPTION_
C))
breadth
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
 A point (4.2,3.8) can be displayed on screen by pixel_
((QUESTIO
N))
(4,3)
((OPTION_
A))
(3,4)
((OPTION_
B))
(5,4)
((OPTION_
C))
(4,4)
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
((QUESTION Which method supports scaling of character?
))

((OPTION_A Bitmap method

))

((OPTION_B Stroke method

))

((OPTION_C Starburst method

))

((OPTION_D none of the above

))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In UTF-8 Asian scripts are represented in
))

((OPTION_A 1 byte
))

((OPTION_B either 1 or 2 bytes

))

((OPTION_C 3 bytes
))

((OPTION_D 4 bytes
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Which Unicode encoding is supported on UNIX platforms
))
((OPTION_A UTF-8
))

((OPTION_B UTF-16
))

((OPTION_C UCS-2
))

((OPTION_D UTF-32
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION ___is not official Unicode standard
))

((OPTION_A UCS 2
))

((OPTION_B UTF 8
))

((OPTION_C UTF 16
))

((OPTION_D UTF 32
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Fixed width encoding supported by ___________
))

((OPTION_A UTF 32
))

((OPTION_B UTF 8
))

((OPTION_C UTF 16
))

((OPTION_D Both A and C

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION How many line segments used in Starbust Method
))

((OPTION_A 24
))

((OPTION_B 12
))
((OPTION_C 8
))
((OPTION_D 14
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Which method generates worst curve shape character
))

((OPTION_A Bitmap method

))

((OPTION_B Stroke method

))

((OPTION_C Starburst method

))

((OPTION_D All
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION Which method generates smooth curve shape character
))

((OPTION_A Bitmap method

))

((OPTION_B Stroke method

))

((OPTION_C Starburst method

))

((OPTION_D All
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In stroke method small series of ______________are drawn
)) like strokes of pen to form a character

((OPTION_A Line segments

))

((OPTION_B vectors
))

((OPTION_C arcs
))
((OPTION_D Pixels
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In UTF-16 Supplementary characters are represented in
)) ________ Bytes

((OPTION_A 1
))
((OPTION_B 2
))
((OPTION_C 3
))
((OPTION_D 4
))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Unicode Standard is a ………. encoding system
))
((OPTION_A character
))

((OPTION_B interger
))

((OPTION_C data
))

((OPTION_D real numbers

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Stroke method supports scaling of the character by
))

((OPTION_A Positioning the line segment

))

((OPTION_B changing the length of the line segment.

))

((OPTION_C rotating the line segment

))

((OPTION_D does not supoort scaling

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In Bitmap method character is placed on the screen
))

((OPTION_A By copying pixel values from character array into some portion
)) of the screen’s frame buffer.

((OPTION_B By copying 24-bit pattern values from character array into

)) some portion of the screen’s frame buffer.

((OPTION_C By copying lines from character array into some portion of

)) the screen’s frame buffer.

((OPTION_D All
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In starbust method to display character
))

((OPTION_A Out of 12 line segments , segments required to display

)) particular character are highlighted

((OPTION_B Out of 24 line segments , segments required to display

)) particular character are highlighted

((OPTION_C Out of 12 X 12 line segments , segments required to display

)) particular character are highlighted

((OPTION_D Out of 24 X 24 line segments , segments required to display

)) particular character are highlighted

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In midpoint line algorithm the decision parameter is given by
)) ____Note:(Xp,Yp) is the point plotted on the line in kth step.

((OPTION_A F(Xp +1,Yp+1/2)

))

((OPTION_B F(Xp+1,Yp+1)
))

((OPTION_C F(Xp+1/2,Yp+1/2)
))

((OPTION_D F(Xp , Yp)

))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In midpoint line algorithm if midpoint (M) of pixel A (pixel
)) above in next step) and B (pixel below in next step)lies below
true line then

((OPTION_A Pixel neither A nor B is selected to display

))

((OPTION_B Pixel B is selected to display

))

((OPTION_C Pixel A is selected to display

))

((OPTION_D Can not say

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In midpoint line algorithm if decision parameter (d) < 0 Which
pixel is selected to display in the next step.
)) NOTE: slope of line is between 0 to 1.

((OPTION_A Pixel neither A nor B is selected to display

))

((OPTION_B Pixel B is selected to display

))

((OPTION_C Pixel A is selected to display

))

((OPTION_D Can not say

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In parallel line drawing let given number of processors are np
)) =4 . Width of the line Δx =16. What is the width of each
partition?

((OPTION_A 4
))

((OPTION_B 10
))
((OPTION_C 15
))
((OPTION_D 16
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In parallel line drawing let given number of processors are
)) np=4 (0 to np -1) .Lets us assume we have line with width 16
and width of each partitions is 4. what is the starting ‘x’ co-
ordinate of the 1st partition? Note: left end coordinate of the
line is (x0,y0) and the slope is 0<m<1

((OPTION_A X0+4
))

((OPTION_B X0
))

((OPTION_C X0+8
))

((OPTION_D X0+12
))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Which line drawing algorithm has initial decision parameter
)) d0=2*dy-dx .NOTE:slope of the line is between 0 to 1

((OPTION_A Bresenham’s line algorithm

))

((OPTION_B DDA line algorithm

))

((OPTION_C Midpoint line algorithm

))

((OPTION_D Both A and C

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Bresanham circle algorithm uses the approach of
))

((OPTION_A Midpoint
))

((OPTION_B Point
))

((OPTION_C Line
))

((OPTION_D None of these

))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The side effect of scan conversion are
))

((OPTION_A Aliasing
))

((OPTION_B Anti aliasing

))

((OPTION_C Both a & b

))

((OPTION_D None of these

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The problem of aliasing are
))

((OPTION_A Staircase
))
((OPTION_B Unequal brightness
))

((OPTION_C Picket fence problem

))

((OPTION_D All of these

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The technique to minimizing aliasing are
))

((OPTION_A Increased no of resolution

))

((OPTION_B Modify pixel intensities

))

((OPTION_C Super sampling

))

((OPTION_D All of these

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION To generate the characters, which are required
))

((OPTION_A Hardware
))

((OPTION_B Software
))

((OPTION_C Both a & b

))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The method which uses array of dots for generating a character
)) is called

((OPTION_A Stoke method

))

((OPTION_B Bitmap method

))
((OPTION_C Star bust method
))

((OPTION_D None of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The Cartesian slope-intercept equation for a straight line is
))

((OPTION_A y = mx + b
))

((OPTION_B y = b x + m
))

((OPTION_C y =x x + m
))

((OPTION_D $y = b + $m \times $m
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Which algorithm is a faster method for calculating pixel
)) positions?

((OPTION_A Bresenham’s line algorithm

))

((OPTION_B Parallel line algorithm

))

((OPTION_C Mid-point algorithm

))

((OPTION_D DDA line algorithm

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION An accurate and efficient raster line-generating algorithm is
))

((OPTION_A DDA algorithm

))

((OPTION_B Mid-point algorithm

))

((OPTION_C Parallel line algorithm

))

((OPTION_D Bresenham’s line algorithm

))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Which is the best line algorithm to balance the processing load
)) among the processors?

((OPTION_A Parallel line algorithm

))

((OPTION_B DDA line algorithm

))

((OPTION_C Bresenham’s line algorithm

))

((OPTION_D Position Bresenham’s line algorithm

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The algorithm which uses multiple processors to calculate pixel
)) positions is

((OPTION_A Midpoint algorithm

))

((OPTION_B Parallel line algorithm

))

((OPTION_C Bresenham’s line algorithm

))

((OPTION_D All the above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION An array of values specifying the relative importance of sub-
)) pixel is referred as________ of sub-pixel weights.

((OPTION_A Sub-mask
))

((OPTION_B Mask
))

((OPTION_C Pixel phasing

))

((OPTION_D Pixel weighting

))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The algorithm which displays line-type attributes by plotting
)) pixel spans is

((OPTION_A Raster line algorithm

))

((OPTION_B Raster scan algorithm

))

((OPTION_C Random line algorithm

))

((OPTION_D Random scan algorithm

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Raster scan systems display a picture from a definition in a
))
((OPTION_A Display file program
))

((OPTION_B Frame buffer

))

((OPTION_C Display controller

))

((OPTION_D None of the above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Scan lines are numbered consecutively from 0, starting at the
)) top of the screen; and pixel columns are numbered from
0,___________ across each scan line.

((OPTION_A left to right

))

((OPTION_B right to left

))

((OPTION_C top to bottom

))

((OPTION_D bottom to top

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Given that the two endpoints of the segment are specified at
)) positions (x1, y1) and (x2, y2), value for the slope m is
calculated as:

((OPTION_A [(y2-y1) / (x2-x1)]

))

((OPTION_B [(x2-x1) / (y2-y1)]

))

((OPTION_C [(x2-y2) / (x1-y1)]

))

((OPTION_D None of above

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Given that the two endpoints of the segment are specified at
)) positions (x1, y1) and (x2, y2), value for y intercept b is
calculated as:
((OPTION_A b=y1-m *x1
))

((OPTION_B b=x1- m *y1

))

((OPTION_C $b=$y1-$x1/$2
))

((OPTION_D None of above

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION For lines with m = 1 and Δx = Δy ; the horizontal and vertical
)) deflections voltages are _______.

((OPTION_A equal
))

((OPTION_B unequal
))

((OPTION_C low
))

((OPTION_D high
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION For lines with m = 1 and ___________; the horizontal and
)) vertical deflections voltages are equal.

((OPTION_A Δx = Δy
))

((OPTION_B Δx < Δy
))

((OPTION_C Δx > Δy
))

((OPTION_D None of above

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION _____________ is decision parameter in DDA Line drawing
)) algorithm

((OPTION_A Error function

))
((OPTION_B midpoint of two point
))

((OPTION_C sum variable

))

((OPTION_D slope of a line

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION _____________ is decision parameter in Midpoint circle
)) Generation algorithm

((OPTION_A Error function

))

((OPTION_B midpoint of two point

))

((OPTION_C sum variable

))

((OPTION_D slope of a line

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION ______________ algorithm supports floating point operations
))

((OPTION_A Bresenham’s
))

((OPTION_B DDA
))

((OPTION_C scan line

))

((OPTION_D All of above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The process of Turning on pixels for a line segment is called
)) ______________

((OPTION_A scalar Generation

))

((OPTION_B Vector Generation

))
((OPTION_C Transformation
))

((OPTION_D Scaling
))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION ________________ is traditional method of circle drawing
))

((OPTION_A Midpoint
))

((OPTION_B Bresenham’s
))

((OPTION_C Trignometric method

))

((OPTION_D All of above

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION In bresnham’s circle generation first point on circumference of
)) circle will be ________

((OPTION_A (1,r)
))

((OPTION_B (r,0)
))

((OPTION_C (0,r)
))

((OPTION_D (r,r)
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION ____method consider each pixel to be composed of subpixels
))

((OPTION_A Supersampling
))

((OPTION_B Prefiltering
))

((OPTION_C A & B
))
((OPTION_D Pixel-phasing
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Bit map method is also called dot matrix method because
))

((OPTION_A Characters are represented by 24 bits

))

((OPTION_B Characters are represented an array of dots in matrix form.

))

((OPTION_C Characters are represented by line segments

))

((OPTION_D None of the above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In midpoint line algorithm initial decision parameter is _____
)) NOTE:slope of the line is between 0 to 1

((OPTION_A d0 = dy –2 dx
))

((OPTION_B d0 = 2 dy – 2dx
))

((OPTION_C d0 = 2 dy – dx
))

((OPTION_D d0 = dy – dx
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION For a sharp slope lines value of Xincrement Xinc and Y
)) increment Yinc are _____________

((OPTION_A 1,m
))

((OPTION_B 1/m,1
))

((OPTION_C 1,1
))

((OPTION_D m,m
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Using DDA line algorithm a computed line position of (20.48,
)) 34.51) using integer function, would be converted to pixel
position ________________.

((OPTION_A (20, 34)

))

((OPTION_B (21, 34)

))

((OPTION_C (34, 21)

))

((OPTION_D (20, 35)

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Find initial point for bresenham's circle generation algorithms
 )) whose radius is 10 and center co-ordinates are (0,0)

((OPTION_A (0,10)
))

((OPTION_B (10,0)
))

((OPTION_C (10,10)
))

((OPTION_D (-10,-10)
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
which algorithm works in all quadrants using integer arithmetic
((QUESTIO
N))
Bresenham`s Line Algorithm
((OPTION_
A))
Generalized Bresenham`s Algorithm
((OPTION_
B))
DDA Line Algorithm
((OPTION_
C))
Midpoint Line Algorithm
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
The basic principle of Bresenham`s line algorithm is
((QUESTIO
N))
to select the optimum raster locations to represent a straight line
((OPTION_
A))
to select either Δx or Δy, whichever is larger, is chosen as one raster unit
((OPTION_
B))
we find on which side of the line the midpoint lies
((OPTION_
C))
Both A and C
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
which are two standard methods for circle rasterization
((QUESTIO
N))
Polynomial Method, and Bresenham`s
((OPTION_
A))
 Trigonometric Method and Bresenham`s
((OPTION_
B))
DDA, and Bresenham`s
((OPTION_
C))
Polynomial Method, and Trigonometric Method
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
The Bresenham's circle drawing algorithm uses the __of the circle to generate?
((QUESTIO
N))
two-way symmetry
((OPTION_
A))
four-way symmetry
((OPTION_
B))
eight-way symmetry
((OPTION_
C))
Both A and B
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A circle, if scaled only in one direction becomes a?
((QUESTIO
N))
Parabola
((OPTION_
A))
Hyperbola
((OPTION_
B))
Ellipse
((OPTION_
C))
circle
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Why a circle drawn on the screen appears to be elliptical?
((QUESTIO
N))
It is due to the aspect ratio of monitor
((OPTION_
A))
 Our eyes are not at the same level on screen
((OPTION_
B))
CRT is completely spherical
((OPTION_
C))
Screen has rectangular shape
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Initial decision variable in Bresenham's Line drawing algorithm is
((QUESTIO
N))
2dy-dx
((OPTION_
A))
1/2-m
((OPTION_
B))
dy-2dx
((OPTION_
C))
3-2dx
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
which of the following used "decision parameter " to find next pixel?
((QUESTIO
N))
Bresenham’s Line Algorithm
((OPTION_
A))
DDA Algorithm
((OPTION_
B))
The FFTW Line Algorithm
((OPTION_
C))
All of the above
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Eight- way symmetry is used by ________ algorithm
((QUESTIO
N))
Bresenham’s circle
((OPTION_
A))
 DDA circle
((OPTION_
B))
Normal circle
((OPTION_
C))
Bitmap circle
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Initial decision variable (2dy-dx) is used by
((QUESTIO
N))
Bresenham's line
((OPTION_
A))
Bitmap line
((OPTION_
B))
Stroke line
((OPTION_
C))
DDA line
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
which algorithm uses incremental approach to rasterize
((QUESTIO
N))
Bresenham's line
((OPTION_
A))
DDA line
((OPTION_
B))
Midpoint line
((OPTION_
C))
All of above
((OPTION_
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
________ approach used by DDA line drawing algorithm
((QUESTIO
N))
Trignometric
((OPTION_
A))
 Polynomial
((OPTION_
B))
Incremental
((OPTION_
C))
Exponential
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
________ approach used by Bresenham's line drawing algorithm
((QUESTIO
N))
Trigonometric
((OPTION_
A))
Polynomial
((OPTION_
B))
Incremental
((OPTION_
C))
Exponential
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
________ approach used by Bresenham's Circle drawing algorithm
((QUESTIO
N))
Trigonometric
((OPTION_
A))
Polynomial
((OPTION_
B))
Incremental
((OPTION_
C))
Exponential
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Which of the following is Line drawing algorithm
((QUESTIO
N))
Midpoint
((OPTION_
A))
StartPoint
((OPTION_
B))
Endpoint
((OPTION_
C))
None of these
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Which of the following is Line drawing algorithm
((QUESTIO
N))
Digital Differential Analyser
((OPTION_
A))
StartPoint
((OPTION_
B))
Endpoint
((OPTION_
C))
None of these
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Which of the following is Line drawing algorithm
((QUESTIO
N))
Bresenham's line
((OPTION_
A))
StartPoint
((OPTION_
B))
Endpoint
((OPTION_
C))
None of these
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In DDA line algorithm for a line with coordinates(20,20) and (12,50)
((QUESTIO
N))
 Increment value of x by 1 and compute appropriate y
((OPTION_
A))
Increment value of y by 1 and compute appropriate x
((OPTION_
B))
Increment value of x and y by 1
((OPTION_
C))
Decrement value of x and y
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A line with(11,8) and (7,16) . what is the slope of the line.
((QUESTIO
N))

((OPTION_ 2
A))
((OPTION_ -2
B))
((OPTION_ 0.5
C))
((OPTION_ -0.5
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A circle with radius 5. What will be initial decision parameter Bresenham’s
((QUESTIO Circle algorithm
N))
((OPTION_ -7
A))
((OPTION_ 7
B))
((OPTION_ -17
C))
((OPTION_ -13
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A line with(11,8) and (7,16) . what is the initial error term by Bresenham’s line
((QUESTIO algorithm.
N))
((OPTION_ -12
A))
((OPTION_ 12
B))
((OPTION_ 0
C))
((OPTION_ 10
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Displayed primitives generated by raster algorithms have a jagged or, stairstep
((QUESTIO effect, called
N))
aliasing
((OPTION_
A))
antialiasing
((OPTION_
B))
pixel weighting
((OPTION_
C))
sampling
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Antialiasing by computing overlap areas is referred to as
((QUESTIO
N))
supersampling
((OPTION_
A))
prefiltering
((OPTION_
B))
pixel phasing
((OPTION_
C))
Pixel weighing masks
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
pixel phasing is an antialiasing technique for
((QUESTIO
N))
Hardware
((OPTION_
A))
Software
((OPTION_
B))
firmware
((OPTION_
C))
None of these
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In pixel weighing masks center subpixel is weighted by a factor of
((QUESTIO
N))
1/3
((OPTION_
A))
1/6
((OPTION_
B))
1/4
((OPTION_
C))
1/8
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
_______of the following is a hardware based antialiasing technique?
((QUESTIO
N))
supersampling
((OPTION_
A))
prefiltering
((OPTION_
B))
pixel phasing
((OPTION_
C))
Pixel weighing masks
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
_____ method can be applied by subdividing the total area and determining the
((QUESTIO
N)) number of subpixels inside the area boundary?

supersampling
((OPTION_
A))
prefiltering
((OPTION_
B))
pixel phasing
((OPTION_
C))
Pixel weighing masks
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Which antialiasing technique every subpixel is having equal weight age?
((QUESTIO
N))
supersampling
((OPTION_
A))
prefiltering
((OPTION_
B))
pixel phasing
((OPTION_
C))
Pixel weighing masks
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Pixel overlap areas are obtained by determing where object boundaries
((QUESTIO intersect individual ……………….. boundaries.
N))
curve
((OPTION_
A))
pixel
((OPTION_
B))
line
((OPTION_
C))
polygon
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
An array of weights of subpixels is called as
((QUESTIO
N))
supersampling
((OPTION_
A))
prefiltering
((OPTION_
B))
pixel phasing
((OPTION_
C))
Pixel weighing masks
((OPTION_
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
An array of values specifying the relative importance of sub-pixel is referred
((QUESTIO
N))
Su Submask
((OPTION_
A))
mask
((OPTION_
B))
Pixel phasing
((OPTION_
C))
Pixel weighting
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Nyquist sampling frequency fs is given by
((QUESTIO
N))
fs=2*fmax
((OPTION_
A))
fs=2-fmax
((OPTION_
B))
fs=2+fmax
((OPTION_
C))
fs=2/fmax
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Supersampling color of the pixel (x,y) uses the formula
((QUESTIO
N))
color of the pixel=∑ intensities of subpixels
((OPTION_
A))
color of the pixel=∑ weights of subpixels
((OPTION_
B))
color of the pixel=∑ intensities of subpixels/∑weights of subpixels
((OPTION_
C))
None of the above
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In pixel phasing stair steps are smoothed out by
((QUESTIO
N))
moving the electron beam to more nearly approximate positions specified by
((OPTION_ the object geometry.
A))
By subdividing the pixels into no.of sub-pixels
((OPTION_
B))
Computing the overlap area
((OPTION_
C))
None of the above
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
We can increase intensity levels to anti-alias the line, then
((QUESTIO
N))
We increase the number of sampling positions
((OPTION_
A))
We decrease the number of sampling positions
((OPTION_
B))
We increase the number of pixels
((OPTION_
C))
None of the above
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Super-sampling methods can be applied by
((QUESTIO
N))
Sub-dividing the total area
((OPTION_
A))
Determining the number of sub-pixels inside the area
((OPTION_
B))
Both a and b
((OPTION_
C))
None of the above
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Supersampling is a technique of
((QUESTIO
N))
Sampling object characteristics at a low resolution and displaying the results at a
((OPTION_ high resolution
A))
Sampling object characteristics at a high resolution and displaying the results at
((OPTION_ a low resolution
B))
Calculating the areas of overlap of each pixel with the objects to be displayed.
((OPTION_
C))
Shifting the display location of pixel areas
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In pixel weighting masks intensities for the grid of nine subpixels is averaged by
((QUESTIO
N))
Center subpixel is weighted by a factor of ¼, the top,bottom and side subpixels
((OPTION_ are weighted by a factor of 1/8 and the corner subpixels are weighted by 1/16.
A))
Center subpixel is weighted by a factor of1/3 ,the top,bottom and side subpixels
((OPTION_ are weighted by a factor of 1/9 and the corner subpixels are weighted by 1/18.
B))
Center subpixel is weighted by a factor of ¼,the top,bottom and side subpixels
((OPTION_ are weighted by a factor of 1/8 and the corner subpixels are weighted by 1/8.
C))
None of the above
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In pixel phasing the electron beam is typically shifted by
((QUESTIO
N))
1/2,1/8,3/4 of a pixel diameter to plot points closer to the true path of a line or
((OPTION_ object edge.
A))
1/2,1/4,3/4 of a pixel diameter to plot points closer to the true path of a line or
((OPTION_ object edge
B))
1/2,1/4,3/8 of a pixel diameter to plot points closer to the true path of a line or
((OPTION_ object edge
C))
1/2,1/8,3/4 of a pixel diameter to plot points closer to the true path of a line or
((OPTION_ object edge
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Overlap areas for pixels are calculated In Area sampling by
((QUESTIO
N))
Total no.of subpixels within the area
((OPTION_
A))
Determining how much of the trapezoid overlaps each pixel in vertical
((OPTION_ column(or horizontal row)
B))
Giving more weight to center subpixel
((OPTION_
C))
Moving the pixel positions
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A line connecting the points (1,1) and (5,3) is to be drawn, using DDA algorithm.
((QUESTIO Find the value of x and y increments
N))
x-increments = 1; y-increments =1
((OPTION_
A))
x-increments = 0.5; y-increments =1
((OPTION_
B))
x-increments = 1; y-increments =0.5
((OPTION_
C))
None of above
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Line produced by moving pen is __ at the end points than the line produced by
((QUESTIO
N)) the pixel replication?

Thin
((OPTION_
A))
Straight
((OPTION_
B))
Thicker
((OPTION_
C))
Both A and B
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A line segment _____________.
((QUESTIO
N))
extends forward
((OPTION_
A))
extends backward
((OPTION_
B))
has two end points
((OPTION_
C))
extends forever both forward and backward
((OPTION_
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
Round function makes the DDA line drawing algorithm work in _______
((QUESTIO quadrants.
N))
I and II
((OPTION_
A))
I and III
((OPTION_
B))
II and III
((OPTION_
C))
All
((OPTION_
D))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
The DDA line drawing algorithm is _____________dependent.
((QUESTIO
N))
Orientation
((OPTION_
A))
Length
((OPTION_
B))
Endpoints
((OPTION_
C))
Width
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
The process of determining which pixels provide the best approximation to the
((QUESTIO desired line is known as
N))
rasterization
((OPTION_
A))
random scan
((OPTION_
B))
vector scan
((OPTION_
C))
Both A and B
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A digital differential analyzer is a mechanical device for integrating
((QUESTIO
N))
differential equations
((OPTION_
A))
mathematical equations
((OPTION_
B))
Fourier transforms
((OPTION_
C))
All of these
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
A dashed line could be displayed by generating_________.
((QUESTIO
N))
Inter dash spacing
((OPTION_
A))
Very short dashes
((OPTION_
B))
Both Aand B
((OPTION_
C))
A or B
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
After completion of scanning of one line, the electron beam files back to the
((QUESTIO start of next line, this process is known as
N))
horizontal retrace
((OPTION_
A))
vertical retrace
((OPTION_
B))
Interleaving
((OPTION_
C))
Both A and B
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
which method uses small series of line segments.
((QUESTIO
N))
Bitmap method
((OPTION_
A))
Stroke method
((OPTION_
B))
Starburst method
((OPTION_
C))
none of the above
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 2
(1/2/3...)
 A computed line position of (10.48, 20.51), for example, would be converted to
((QUESTIO pixel position ________________.
N))

(10, 21)
((OPTION_
A))
(11, 20)
((OPTION_
B))
(11, 21)
((OPTION_
C))
(10, 20)
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In bresenham's line drawing algorithm error term is initialized to?
((QUESTIO
N))
m-1/2
((OPTION_
A))
1/2-m
((OPTION_
B))

((OPTION_ -1/2
C))
((OPTION_ None
D))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 2
(1/2/3...)
How many intermediate pixels with in line segment having end points A(5,5) and
((QUESTIO B(13,9) using Bresenham's Line drawing algorithm?
N))

((OPTION_ 6
A))
((OPTION_ 7
B))
((OPTION_ 8
C))
((OPTION_ 5
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 2
(1/2/3...)
Find points for bresenham's circle generation algorithms whose radius is 3 and
((QUESTIO center co-ordinates are (0,0)
N))

(0,3) (1,3) (2,2) (3,1)

((OPTION_
A))
(0,0) (0,1) (1,2) (1,3)
((OPTION_
B))
(3,0) (3,1) (2,1) (1,1)
((OPTION_
C))
Other than above
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 2
(1/2/3...)
Which one used a “decision parameter” to solve for how to change the
((QUESTIO secondary pixel?
N))

Bresenham’s Line Algorithm

((OPTION_
A))
The DDA Line Algorithm
((OPTION_
B))
The FFTW Line Algorithm
((OPTION_
C))
 All of the above
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
In midpoint line algorithm the error, that is ,the vertical distance between the
((QUESTIO chosen pixel and the actual line is always
N))

((OPTION_ <=1/2
A))
>=1/2
((OPTION_
B))
=1
((OPTION_
C))
None of these
((OPTION_
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)
((MARKS)) 1
(1/2/3...)
Line representation by an implicit form with coefficients a,b, and c is __F(x,y) =
((QUESTIO ax +by +c=0 If F(x,y) = 0 then it indicates
N))

Point (x,y) is below the line

((OPTION_
A))
Point (x,y) is on the line
((OPTION_
B))
Point (x,y) is above the line
((OPTION_
C))
None of these
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
((QUESTIO On a color monitor, the refresh buffer is also called ..
N))
((OPTION_ Frame buffer
A))
((OPTION_ Pixmap
B))
((OPTION_ Bitmap
C))
((OPTION_ Display file
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
___________ slope lines are closer to vertical lines
((QUESTIO
N))
Gentle
((OPTION_
A))
Sharp
((OPTION_
B))
random
((OPTION_
C))
All of above
((OPTION_
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
((QUESTIO Stroke method supports scaling of the character by
N))

((OPTION_ Positioning the line segment

A))
((OPTION_ changing the length of the line segment.
B))

((OPTION_ rotating the line segment

C))
((OPTION_ does not supoort scaling
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
((QUESTIO In Bitmap method character is placed on the screen
N))

((OPTION_ By copying pixel values from character array into some portion
A)) of the screen’s frame buffer.

((OPTION_ By copying 24-bit pattern values from character array into

B)) some portion of the screen’s frame buffer.

((OPTION_ By copying lines from character array into some portion of

C)) the screen’s frame buffer.

((OPTION_ All
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
((QUESTIO In starbust method to display character
N))

((OPTION_ Out of 12 line segments , segments required to display

A)) particular character are highlighted

((OPTION_ Out of 24 line segments , segments required to display

B)) particular character are highlighted

((OPTION_ Out of 12 X 12 line segments , segments required to display

C)) particular character are highlighted

((OPTION_ Out of 24 X 24 line segments , segments required to display

D)) particular character are highlighted

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
((QUESTIO In midpoint line algorithm the decision parameter is given by
N)) ____Note:(Xp,Yp) is the point plotted on the line in kth step.

((OPTION_ F(Xp +1,Yp+1/2)

A))
((OPTION_ F(Xp+1,Yp+1)
B))

((OPTION_ F(Xp+1/2,Yp+1/2)
C))
((OPTION_ F(Xp , Yp)
D))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

((MARKS)) 1
(1/2/3...)
((QUESTIO In midpoint line algorithm if decision parameter (d) < 0 Which
N)) pixel is selected to display in the next step.
NOTE: slope of line is between 0 to 1.
((OPTION_ Pixel neither A nor B is selected to display
A))
((OPTION_ Pixel B is selected to display
B))

((OPTION_ Pixel A is selected to display

C))
((OPTION_ Can not say
D))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL
)

The number of pixels stored in the frame buffer of a graphics system is

known as
A. Resolution
B. Depth
C. Resalution
D. Only a
ANSWER: D

In graphical system, the array of pixels in the picture are stored in

A. Memory
B. Frame buffer
C. Processor
D. All of the mentioned
ANSWER: B

The process of digitizing a given picture definition into a set of pixel-

intensity for storage in the frame buffer is called
A. Rasterization
B. Encoding
C. Scan conversion
D. True color system
ANSWER: C

Random-scan system mainly designed for

A. Realistic shaded screen
B. Fog effect
C. Line-drawing applications
D. Only b
ANSWER: C

The primary output device in a graphics system is_________

A. Scanner
B. Video monitor
C. Neither a nor b
D. Printer
ANSWER: B

On a black and white system with one bit per pixel, the frame buffer is
commonly called as
A. Pix map
B. Multi map
C. Bitmap
D. All of the mentioned
ANSWER: C

Aspect ratio means

A. Number of pixels
B. Ratio of vertical points to horizontal points
C. Ratio of horizontal points to vertical points
D. Both b and c
ANSWER: D

Smallest size object that can be displayed on a monitor is called

.....................
A. Picture element
B. Point
C. Dot Pitch
D. aspect ratio
ANSWER: A
.................. refers to pixel spacing.
A. Pixmap
B. Resolution
C. Pixel depth
D. Persistence
ANSWER: B

The distance from one pixel to the next pixel is called ...........
A. Resolution
B. Dot Pitch
C. Pixmap
D. ppi
ANSWER: A

In raster scan display, the frame buffer holds ......................

A. Line drawing commands
B. Scanning instructions
C. Image Resolution
D. Intensity information
ANSWER: D

Vector display is well suited for .................

A. Animation
B. Line drawing applications
C. Cartoons
D. All of the above
ANSWER: B

The Cartesian slope-intercept equation for a straight line is

A. y = m.x + b
B. y = b.x + m
C. y = x.x + m
D. y = b + m.m
ANSWER: A

For lines with slope magnitude |m|<1, x can be_________

A. A set corresponding vertical deflection
B. A set proportional to a small horizontal deflection voltage
C. Only a
D. All of the mentioned
ANSWER: B

On raster system, lines are plotted with

A. Lines
B. Dots
C. Pixels
D. None of the mentioned
ANSWER: C

Expansion of line DDA algorithm is

A. Digital difference analyzer
B. Direct differential analyzer
C. Digital differential analyzer
D. Data differential analyzer
ANSWER: B

The disadvantage of lineDDA is

A. Time consuming
B. Faster
C. Neither a nor b
D. None of the mentioned
ANSWER: A

An accurate and efficient raster line-generating algorithm is

A. DDA algorithm
B. Mid-point algorithm
C. Parallel line algorithm
D. Bresenham’s line algorithm
ANSWER: D

In Bresenham’s line algorithm, if the distances d1 < d2 then decision

parameter Pk is______
A. Positive
B. Equal
C. Negative
D. Option a or c
ANSWER: C

Which of the following is not a line-type?

A. Dashed line
B. Dark line
C. Dotted line
D. Only b
ANSWER: D

n stroke method small series of ______________are drawn like strokes of

pen to form a character
A. Line segments
B. vectors
C. arcs
D. Pixels
ANSWER: A
The side effect of scan conversion are
A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A

For lines with m = 1 and Δx = Δy ; the horizontal and vertical deflections

voltages are _______.
A. equal
B. unequal
C. low
D. high
ANSWER: A

For lines with m = 1 and ___________; the horizontal and vertical

deflections voltages are equal.
A. Δx = Δy
B. Δx < Δy
C. Δx > Δy
D. None of above
ANSWER: A
______________ algorithm supports floating point operations
A. Bresenham’s
B. DDA
C. scan line
D. All of above
ANSWER: B

The process of Turning on pixels for a line segment is called

______________
A. scalar Generation
B. Vector Generation
C. Transformation
D. Scaling
ANSWER: B

In bresnham’s circle generation first point on circumference of circle will

be ________
A. (1,r)
B. (r,0)
C. (0,r)
D. (r,r)
ANSWER: C

A line with(11,8) and (7,16) . what is the slope of the line.

A. 2
B. -2
C. 0.5
D. -0.5
ANSWER: B

A circle with radius 5. What will be initial decision parameter

Bresenham’s Circle algorithm
A. -7
B. 7
C. -17
D. -13
ANSWER: A

smallest addressable screen element is called as

A. Pixel
B. Dot
C. Point
D. None of the above

ANSWER: A
 ((MARKS)) 1
(1/2/3...)
((QUESTIO An -------------test is used to check whether a point is
outside of N))
the polygon
((OPTION_ Inside
A))
((OPTION_ Outside
B))
((OPTION_ Fill
C))
((OPTION_ Cover
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In an inside test if number of intersections are -----------
n point is inside
N)) of the polygon. Note : intersection point is not a vertex.
((OPTION_ Even
A))
((OPTION_ Odd
B))
 ((OPTION_ Infinite
C))
((OPTION_ None of the above
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In an inside test if number of intersections is odd then
----------------
N))of the polygon. Note : intersection point is not a vertex
((OPTION_ Inside
A))
((OPTION_ Outside
B))
((OPTION_ Color
C))
((OPTION_ Can't Say
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In an inside test if intersections point is a vertex and
eeting at that
N))vertex lies on same side of constructed horizontal line then the
of intersections are considered as ----------. Note : intersection point is a vertex
((OPTION_ Even Number
A))
((OPTION_ Odd Number
B))
((OPTION_ Infinite Number
C))
((OPTION_ Can't Say
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In an inside test if intersections point is a vertex and
eeting at that
N))vertex lies on ------------- side of constructed horizontal line then
ber of intersections are considered as even number . Note : intersection point is a

((OPTION_ Same
A))
((OPTION_ Opposite
B))
((OPTION_ On the
C))
((OPTION_ None of the above
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Two inside polygon test methods are __________ and
__ N))
((OPTION_ Even odd method , winding number method
A))
((OPTION_ Scan line and flood fill
B))
((OPTION_ Even odd method, flood fil
C))
((OPTION_ winding number method, Scan line
 D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The 8-Fill Polygon technique will correctly fill the
shown below
N))when seeded at the position shown with an X.
((OPTION_ TRUE
A))
((OPTION_ FALSE
B))
((OPTION_
C))
((OPTION_
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Following is the method for inside test of the polygon.
N))
((OPTION_ Even-odd method
A))
((OPTION_ Linear method
B))
((OPTION_ Inside method
C))
((OPTION_ Seed method
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Every side in winding number method has given a
called N))
((OPTION_ Winding Number
A))
((OPTION_ Integer no.
B))
 ((OPTION_ Direct number
C))
((OPTION_ Side Number
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The total of the winding no. in winding number method
e test is called
N))as
((OPTION_ winding.
A))
((OPTION_ collective winding
B))
((OPTION_ Net winding.
C))
((OPTION_ Summation winding.
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Winding number method always gives correct answer
lapping polygons
N))
((OPTION_ TRUE
A))
((OPTION_ FALSE
B))
((OPTION_
C))
((OPTION_
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Inside tests of polygon are useful in --------
N))
 ((OPTION_ Polygon filling
A))
((OPTION_ Line coloring
B))
((OPTION_ Shadowing
C))
((OPTION_ None of the above
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Even-odd method of inside test counts ----- to decide
tion of a point.
N))
((OPTION_ Edges
A))
((OPTION_ Vertices
B))
((OPTION_ Intersections
C))
((OPTION_ Pixels
D))
 ((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In winding number method an ------------------ edges ---
dered N))
((OPTION_ Horizontal , not
A))
((OPTION_ Vertical , not
B))
((OPTION_ Slanted , not
C))
((OPTION_ Horizontal , is
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Even-odd method of inside test is suitable for------
N))
((OPTION_ Polygons
A))
((OPTION_ Circles
B))
((OPTION_ Lines
C))
((OPTION_ All of above
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In winding number method an edge can have winding
as ----- N))
((OPTION_ Zero
A))
((OPTION_ +1 or -1
B))
 ((OPTION_ Only+1
C))
((OPTION_ Only-1
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO If the pixel is already filled with desired color then does
otherwise fills
N)) it. This is called
((OPTION_ Flood fill algorithm
A))
((OPTION_ Boundary fill algorithm
B))
((OPTION_ Scan line polygon filling algorithm
C))
((OPTION_ None of these
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The algorithm used for filling the interior of a polygon
N))
((OPTION_ Flood fill algorithm
A))
((OPTION_ Boundary fill algorithm
B))
((OPTION_ Scan line polygon fill algorithm
C))
((OPTION_ None of these
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO _________ procedure accepts the coordinates of an
point. N))
 ((OPTION_ Area fill
A))
((OPTION_ Boundary fill.
B))
((OPTION_ Line fill.
C))
((OPTION_ Scan fill.
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In 8 connected region by knowing one pixel we can get
ng ----------------
N)) neighboring pixels.
((OPTION_ 8
A))
((OPTION_ 4
B))
((OPTION_ 2
C))
((OPTION_ 16
D))
 ((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Following statement(s) is/are true about flood fill
m N))
((OPTION_ It need a seed pixel
A))
((OPTION_ It works at pixel level
B))
((OPTION_ Requires more memory
C))
((OPTION_ All of above
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Following statement(s) is/are false about flood fill
m N))
((OPTION_ It doesn’t need a seed pixel
A))
((OPTION_ It works at pixel level
B))
((OPTION_ Requires more memory
C))
((OPTION_ All of above
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Seed pixel in flood fill Algorithm is an
N))
((OPTION_ An interior pixel
A))
((OPTION_ Exterior pixel
B))
((OPTION_ Not a pixel
C))
((OPTION_ It is color of pixel
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In Boundary Fill method ____________ Data Structure
N))
((OPTION_ Stack
A))
((OPTION_ Array
B))
((OPTION_ Heap
C))
((OPTION_ None of above
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The 4-connected Polygon filling technique has
ntage(s) as N))
((OPTION_ Requires more memory
A))
((OPTION_ May fill polygon partially
B))
((OPTION_ Stack overflow
C))
((OPTION_ All of above
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In --------------algorithm edges can be specified in
t color. N))
((OPTION_ Flood fill
A))
((OPTION_ Boundary fill
B))
((OPTION_ DDA fill
C))
((OPTION_ BSA fill
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The process of coloring the area of a polygon is called
N))
((OPTION_ Polygon filling
A))
((OPTION_ Polygon flow
B))
((OPTION_ Aliasing
C))
((OPTION_ None of these
D))
 ((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Boundary fill algorithm uses -------- call to the fill
. N))
((OPTION_ Recursive
A))
((OPTION_ Static
B))
((OPTION_ One
C))
((OPTION_ None of these
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Boundary fill algorithm needs–
N))
((OPTION_ Boundary Color (BC) and (x,y) coordinates of seed
A)) point.
((OPTION_ Fill Color (FC) and (x,y) coordinates of seed point.
B))
((OPTION_ Boundary Color (BC), Fill Color (FC) and (x,y)
C)) coordinates of seed point.
((OPTION_ (x,y) coordinates of seed point.
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which polygon fill algorithm needs following
tion - 1.Boundary
N)) Color (BC), 2. Fill Color (FC) and 3. (x,y) coordinates of seed

((OPTION_ Boundary fill

A))
((OPTION_ Region fill
B))
 ((OPTION_ Scan fill
C))
((OPTION_ DDA fill
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which polygon fill algorithm needs following
tion - 1. Region
N)) Color (RC), 2. Fill Color (FC) and 3. (x,y) coordinates of seed

((OPTION_ Flood Fill

A))
((OPTION_ Region fill
B))
((OPTION_ Scan fill
C))
((OPTION_ DDA fill
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
 ((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Horizontal lines are not considered in scan line fill
m. N))
((OPTION_ TRUE
A))
((OPTION_ FALSE
B))
((OPTION_
C))
((OPTION_
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Scan line fill algorithm is more efficient than flood fill
m. N))
((OPTION_ TRUE
A))
((OPTION_ FALSE
B))
((OPTION_
C))
((OPTION_
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which statement is true about the 4 connected region.
N))
((OPTION_ It is faster than 8 connected region
A))
((OPTION_ Sometimes it leaves region unfilled.
B))
((OPTION_ Both A and B
C))
((OPTION_ Neither A or B
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Seed pixel in flood fill Algorithm is an
N))
((OPTION_ An interior pixel
A))
((OPTION_ Exterior pixel
B))
((OPTION_ Not a pixel
C))
((OPTION_ It is color of pixel
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO The function of scan line polygon fill algorithm are :
N))
((OPTION_ Find intersection point of the boundary of polygon and
A)) scan line
((OPTION_ Find intersection point of the boundary of polygon and
B)) point
((OPTION_ Both A and B
C))
((OPTION_ Neither A or B
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The edge table contains pointers back to the
________ toN))
identify vertices for each polygon edge.
((OPTION_ vertex table.
A))
((OPTION_ polygon table.
B))
((OPTION_ edge table.
C))
((OPTION_ expanded vertex table.
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Scan line polygon filling method uses
N))
((OPTION_ Scan-line coherence
A))
((OPTION_ Edge coherence
B))
((OPTION_ Area coherence
C))
((OPTION_ Both A and B
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Scan-line coherence property is used in
N))
((OPTION_ Line drawing algorithm
A))
((OPTION_ Scan line polygon filling algorithm
B))
((OPTION_ Flood fill polygon filling algorithm
C))
((OPTION_ None of above
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which of the following is true about scan line
m? N))
((OPTION_ It need a seed pixel
A))
((OPTION_ It works at pixel level
B))
((OPTION_ It uses scan lines to fill the polygon
C))
((OPTION_ All of above
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In scan line algorithm the intersection points are
N))
((OPTION_ sorted in ascending order
A))
((OPTION_ sorted in descending order
B))
((OPTION_ not sorted
C))
((OPTION_ Deleted
D))
 ((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which of the following algorithms to fill polygons was
used by realN))
rasterizers?
((OPTION_ Flood-Fill Polygons
A))
((OPTION_ Scan-Line Polygon
B))
((OPTION_ Boundary Fill Polygons
C))
((OPTION_ None of above
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Active edge table is used in following algorithm
N))
((OPTION_ Boundary fill
A))
((OPTION_ Region fill
B))
((OPTION_ Scan Line
C))
((OPTION_ Edge Fill
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Scan line polygon filling algorithm uses series of
……. To fillN))
the polygon.
((OPTION_ Scan lines
A))
((OPTION_ Points
B))
 ((OPTION_ Layers
C))
((OPTION_ None of above
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In scan line algorithm, Scan lines are processed in
ng (upward)N))
/ decreasing (downward) --------------------------.
((OPTION_ Y order
A))
((OPTION_ X order
B))
((OPTION_ Pixel order
C))
((OPTION_ Color order
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO When the current scan line in Scan line polygon fill
m moves above
N)) the upper / below the lower endpoint, the edge
((OPTION_ becomes inactive
A))
((OPTION_ becomes active
B))
((OPTION_ is discarded
C))
((OPTION_ is added.
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The edges crossed by current scan line in Scan line
fill algorithm
N))are called as
((OPTION_ Active edges
A))
((OPTION_ Inactive edges
B))
((OPTION_ Marked edges
C))
((OPTION_ None of these
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Scan line Fill Approach works at the
N))
((OPTION_ color level
A))
((OPTION_ edge level
B))
((OPTION_ polygon level
C))
((OPTION_ Pixel Level
D))
 ((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Following are the data structures used in Scan line
m to increase
N))
the efficiency.
((OPTION_ Active Edge list
A))
((OPTION_ Active Edge Table
B))
((OPTION_ Both A and B
C))
((OPTION_ Neither A or B
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Scan line polygon filling algorithm starts from
N))
((OPTION_ Either ymax or ymin
A))
((OPTION_ Either xmax or xmin
B))
((OPTION_ Only xmax
C))
((OPTION_ Only xmin
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Scan line polygon filling algorithm can be used for
onvex polygon.
N))
((OPTION_ TRUE
A))
((OPTION_ FALSE
B))
 ((OPTION_ Cant Say
C))
((OPTION_ None of these
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Using Cohen-Sutherland line clipping, it is impossible
rtex to be labeled
N)) 1111
((OPTION_ TRUE
A))
((OPTION_ FALSE
B))
((OPTION_ Cant Say
C))
((OPTION_ None of these
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which one is not valid out code to perform trivial
reject test inN))
line clipping
((OPTION_ 1101
A))
((OPTION_ 1001
B))
((OPTION_ 101
C))
((OPTION_ 1000
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Why the Cohen-Sutherland Line-Clipping Algorithm
s much moreN))
calculations than the other line clipping algorithms?
 ((OPTION_ Need to perform trivial accept / Reject test on end
A)) points of the line.
((OPTION_ Need to perform trivial accept / Reject test for every
B)) point on the line.
((OPTION_ Cannot say
C))
((OPTION_ None of these
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO If the x coordinate boundaries of the clipping rectangle
n and Xmax,N))
and the y coordinate boundaries are Ymin and Ymax, then
_____ must be satisfied for a point at (X,Y) to be inside the clipping rectangle
((OPTION_ Xmin > X < Xmax and Ymin > Y < Ymax
A))
((OPTION_ Xmin > X > Xmax and Ymin > Y > Ymax
B))
((OPTION_ Xmin < X < Xmax and Ymin < Y < Ymax
C))
((OPTION_ Xmin < X > Xmax and Ymin < Y > Ymax
D))
 ((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO determine whether points (P1, P2 and P3) are clipped
visible afterN))
clipping by applying the rules
((OPTION_ P1:Clipped away, P2: Clipped away, P3:Clipped Away
A))
((OPTION_ P1: Visible, P2:Visible, P3:Clipped Away
B))
((OPTION_ P1: Visible, P2:Visible, P3: Visible
C))
((OPTION_ P1: Clipped away, P2:Visible, P3:Clipped Away
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Outcode / Region Code used in Line Clipping is of size
s. N))
((OPTION_ 4
A))
((OPTION_ 3
B))
((OPTION_ 2
C))
((OPTION_ 1
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In Line Clipping algorithm, the two dimensional space
ed into ___ regions.
N))
((OPTION_ 6
A))
((OPTION_ 7
B))
 ((OPTION_ 9
C))
((OPTION_ 10
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Is 0011 valid region code / outcode used in Line
g algorithm?N))
((OPTION_ yes
A))
((OPTION_ no
B))
((OPTION_ Cannot say
C))
((OPTION_ None of these
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Cohen – Sutherland line clipping algorithm was
ed in ____ N))
((OPTION_ 1967
A))
((OPTION_ 1968
B))
((OPTION_ 1969
C))
((OPTION_ 1965
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Primitive types of clipping algorithms are
N))
 ((OPTION_ Point Clipping
A))
((OPTION_ Line Clipping
B))
((OPTION_ Polygon Clipping
C))
((OPTION_ All of above
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In ________ operation eliminates objects or portions of
hat are not visible
N)) through the window to ensure the proper construction of
onding image
((OPTION_ Clipping
A))
((OPTION_ Windowing
B))
((OPTION_ Viewing
C))
((OPTION_ Transformation
D))
 ((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The region against which an object is clipped is called
________ N))
((OPTION_ Clip window
A))
((OPTION_ Clip rectangl
B))
((OPTION_ Window
C))
((OPTION_ None of these
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO Cohen – Sutherland Line Clipping Algorithm is also
s ____________________
N))
((OPTION_ Sutherland - Hodgman Algorithm
A))
((OPTION_ Cohen - Sutherland Outcode Algorithm
B))
((OPTION_ Cyrus - Beck Algorithm
C))
((OPTION_ None of Above
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Following are coordinates of clipping window : Lower
rner (20,20)N))
and Upper Right Corner (200,200). What is the outcode of point
)?
((OPTION_ 110
A))
((OPTION_ 100
B))
 ((OPTION_ 0
C))
((OPTION_ 1000
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The selection and separation of a part of text or image
er operationN))
are called
((OPTION_ Translation
A))
((OPTION_ Shearing
B))
((OPTION_ Reflection
C))
((OPTION_ Clipping
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The complex graphics operations are
N))
((OPTION_ Selection
A))
((OPTION_ clipping
B))
((OPTION_ shear
C))
((OPTION_ None of these
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The process of extracting a portion of a database or a
nside or outside
N)) a specified region are called
 ((OPTION_ Translation
A))
((OPTION_ Shearing
B))
((OPTION_ Reflection
C))
((OPTION_ Clipping
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The rectangle space in which the world definition of
s displayed are
N))called
((OPTION_ Screen coordinate system
A))
((OPTION_ Clipping window or world window
B))
((OPTION_ World coordinate system
C))
((OPTION_ None of these
D))
 ((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO ............. identifies the picture portions that are exterior
ip window N))
((OPTION_ Interior clipping
A))
((OPTION_ Exterior clipping
B))
((OPTION_ Extraction
C))
((OPTION_ None of these
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO The region code of a point within the window is ............
N))
((OPTION_ 1111
A))
((OPTION_ 0
B))
((OPTION_ 1000
C))
((OPTION_ 1001
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO According to Cohen-Sutherland algorithm, a line is
ely outside the
N)) window if ............
((OPTION_ The region codes of line endpoints have a '1' in same bit
A)) position.
((OPTION_ The endpoints region code are nonzero values
B))
 ((OPTION_ If L bit and R bit are nonzero.
C))
((OPTION_ The region codes of line endpoints have a '0' in same
D)) bit position.
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The region code of a point is 1001. The point is in the
.... region ofN))
window.
((OPTION_ Top Left
A))
((OPTION_ Top right
B))
((OPTION_ bottom left
C))
((OPTION_ bottom right
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The result of logical AND operation with endpoint
odes is a nonzero
N)) value. Which of the following statement is true?
((OPTION_ The line is completely inside the window
A))
((OPTION_ The line is completely outside the window
B))
((OPTION_ The line is partially inside the window
C))
((OPTION_ The line is already clipped
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The left (L bit ) bit of the region code of a point (X,Y)
.....................
N))
 ((OPTION_ X > XWMIN
A))
((OPTION_ X< XWMIN
B))
((OPTION_ X< XWMAX
C))
((OPTION_ X>XWMAX
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The right bit (R bit)of the region code of a point (X,Y)
.....................
N))
((OPTION_ X > XWMIN
A))
((OPTION_ X< XWMIN
B))
((OPTION_ X< XWMAX
C))
((OPTION_ X>XWMAX
D))
 ((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The Most Significant Bit of the region code of a point
'1' if ......................
N))
((OPTION_ Y >YWMIN
A))
((OPTION_ Y< YWMIN
B))
((OPTION_ Y< YWMAX
C))
((OPTION_ Y>YWMAX
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO The bottom bit of the region code of a point is '0' if
.......... N))
((OPTION_ Y >YWMIN
A))
((OPTION_ Y< YWMIN
B))
((OPTION_ Y< YWMAX
C))
((OPTION_ Y>YWMAX
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The ...................... algorithm divides a 2D space into 9
of which only
N))the middle part (viewport) is visible.
((OPTION_ Cohen-Sutherland
A))
((OPTION_ Liang Barsky
B))
((OPTION_ Sutherland Hodegeman
C))
((OPTION_ None of these
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Sutherland Hodgeman algorithm works well for...........
N))
((OPTION_ Concave polygons
A))
((OPTION_ Convex Polygons
B))
((OPTION_ Smooth Curves
C))
((OPTION_ Line Segments
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
 ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO A line with endpoints codes as 0000 and 0100 is ?
N))
((OPTION_ Partially invisible
A))
((OPTION_ Completely visible
B))
((OPTION_ Completely invisible
C))
((OPTION_ Trivially invisible
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In a clipping algorithm of Cohen & Sutherland using
odes, a line N))
is already clipped if the ?
((OPTION_ codes of the end point are same
A))
((OPTION_ logical OR of the end points code is 0000
B))
((OPTION_ logical AND of the end point code is 0000
C))
((OPTION_ Only A
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Sutherland – Hodgman algorithm is used for
N))
((OPTION_ Line Clipping
A))
((OPTION_ Polygon Clipping
B))
((OPTION_ Point Clipping
C))
((OPTION_ Hybrid Clipping
D))
 ((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which polygon clipping algorithm executed by clipping
gon edges against
N)) the viewing screen edges one viewing screen edge at a time?
((OPTION_ Cohen-Sutherland
A))
((OPTION_ Sutherland Hodgman
B))
((OPTION_ Both A and B
C))
((OPTION_ Neither A or B
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
 ((MARKS)) 1
(1/2/3...)
((QUESTIO In Sutherland – Hodgman algorithm for polygon
, assume P N))
(present point ) lies inside the window and S ( Previous point) lies
the window. Then while processing through that window boundary we should
((OPTION_ Store interaction point of line PS (S’) only
A))
((OPTION_ Store point P and S’
B))
((OPTION_ Store point P only
C))
((OPTION_ Store points S and S’
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In Sutherland – Hodgman algorithm for polygon
, assume P N))
(present point ) lies outside the window and S ( Previous point) lies
the window. Then while processing through that window boundary we should
((OPTION_ Store interaction point of line PS (S’) only
A))
((OPTION_ Store point P and S’
 B))
((OPTION_ Store point P only
C))
((OPTION_ Store Nothing
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In Sutherland – Hodgman algorithm for polygon
, assume P N))
(present point ) lies outside the window and S ( Previous point) lies
he window. Then while processing through that window boundary we should
((OPTION_ Store interaction point of line PS (S’) only
A))
((OPTION_ Store point P and S’
B))
((OPTION_ Store point P only
C))
((OPTION_ Store points S and S’
D))
((CORREC A
T_CHOICE
))
 (A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In Sutherland – Hodgman algorithm for polygon
, assume P N))
(present point ) lies inside the window and S ( Previous point) lies
he window. Then while processing through that window boundary we should
((OPTION_ Store interaction point of line PS (S’) only
A))
((OPTION_ Store point P and S’
B))
((OPTION_ Store point P only
C))
((OPTION_ Store points S and S’
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
 ((QUESTIO In Sutherland – Hodgman algorithm for polygon
, clipping along
N)) boundaries sequence is used as
((OPTION_ Left -> Right -> Top -> Bottom
A))
((OPTION_ Left -> Bottom -> Right -> Top
B))
((OPTION_ Right -> Top -> Left -> Bottom
C))
((OPTION_ Left -> Bottom -> Top -> Right
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Polygon-Clipping algorithms include the:
N))
((OPTION_ Sutherland-Hodgeman method
A))
((OPTION_ Liang-Barsky method
B))
((OPTION_ Weiler-Atherton method
C))
 ((OPTION_ All of above
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO _______ is a ordered list of vertices where each vertex
ed with the next
N)) in the list.
((OPTION_ Line
A))
((OPTION_ Polygon
B))
((OPTION_ Parabola
C))
((OPTION_ None of the above
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Types of polygon :
N))
((OPTION_ Concave
A))
((OPTION_ Convex
B))
((OPTION_ Complex
C))
((OPTION_ All of above
D))
((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Concave and Convex are types of _______
N))
((OPTION_ Circle
A))
((OPTION_ Rectangle
B))
((OPTION_ Polygon
C))
((OPTION_ Ellipse
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In convex Polygon all interior angles are
N))
((OPTION_ Less than 90
A))
((OPTION_ Less than 180
B))
((OPTION_ greater than 180
C))
((OPTION_ greater than 90
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In concave Polygon atleast one interior angle is
N))
((OPTION_ Less than 90
A))
((OPTION_ Less than 180
B))
((OPTION_ greater than 180
C))
((OPTION_ greater than 90
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
 ((QUESTIO A region S is ____ , iff for any x1 and x2 in S, the
line segmentN))
connecting x1 and x2 is also contained in S.
((OPTION_ Concave
A))
((OPTION_ Convex
B))
((OPTION_ Self-intersecting
C))
((OPTION_ Polygon with hole
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO _____ may not always be Convex .
N))
((OPTION_ Paralleogram
A))
((OPTION_ Trapizoid
B))
((OPTION_ Polygon
C))
 ((OPTION_ Triangle
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO __________ is represented as a number of line
s connectedN))
end to end to form a closed figure.
((OPTION_ Circle
A))
((OPTION_ Line
B))
((OPTION_ Polygon
C))
((OPTION_ point
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO ___________ is not a Type of polygon
N))
((OPTION_ Concave
A))
((OPTION_ Convex
B))
((OPTION_ Linear
C))
((OPTION_ Complex
D))
((CORREC C
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Right angled Triangle is an example of ____ Polygon
N))
((OPTION_ Concave
A))
((OPTION_ Convex
B))
((OPTION_ Complex
C))
((OPTION_ Linear
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In an inside test if intersections point is a vertex and
N)) edges meeting at that vertex lies on same side of
constructed horizontal line then the number of
intersections are considered as ----------. Note :
intersection point is a vertex

((OPTION_ Even Number

A))

((OPTION_ Odd Number

B))

((OPTION_ Infinite Number

C))
((OPTION_ Can't Say
D))
((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The left (L bit ) bit of the region code of a point (X,Y)
N)) is '1' if ......................

((OPTION_ X > XWMIN

A))
((OPTION_ X< XWMIN
B))

((OPTION_ X< XWMAX

C))

((OPTION_ X>XWMAX
D))
((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO The right bit (R bit)of the region code of a point (X,Y)
N)) is '1' if ......................

((OPTION_ X > XWMIN

A))

((OPTION_ X< XWMIN

B))

((OPTION_ X< XWMAX

C))

((OPTION_ X>XWMAX
D))

((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO Which polygon clipping algorithm executed by clipping
N)) all polygon edges against the viewing screen edges one
viewing screen edge at a time?

((OPTION_ Cohen-Sutherland
A))

((OPTION_ Sutherland Hodgman

B))

((OPTION_ Both A and B

C))

((OPTION_ Neither A or B
D))

((CORREC B
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In winding number method , constructed horizontal line
N)) between point Q and point P intersects edge of the
polygon with winding no. +1 . Tell whether point Q is
inside or outside and what is the net winding ? Note : Q
is the point to be tested for inside test. P is point
outside the polygon.
((OPTION_ Outside , zero
A))

((OPTION_ Inside , zero

B))

((OPTION_ Outside , nonzero

C))

((OPTION_ Inside , nonzero

D))

((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In 4 connected region if one pixel is (5,5) then
N)) remaining neighboring pixels are

((OPTION_ (3, 3 ) (6,3) (2,4) (2,2)

A))

((OPTION_
B)) (2,2) (5, 4) (3,2) (6, 4)
((OPTION_ (3, 3 ) (4,2) (2,3) (2,2)
C))
((OPTION_ (6, 5 ) (4,5) (5,4) (5,6)
D))

((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 2
(1/2/3...)
((QUESTIO In scan line polygon filling algorithm for current scan
N)) line the x-intersections got are 20,10,50,30. How
pairing will be formed?

((OPTION_ (10,20)and (30,50)

A))
((OPTION_ (10,20)and (20,30)and (30,50)
B))

((OPTION_ (20,10)and (10,50)

C))

((OPTION_ (20,10)and (10,50)and (50,30)

D))

((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In 4 connected region if one pixel is (5,5) then
N)) remaining neighboring pixels are

((OPTION_ (3, 3 ) (6,3) (2,4) (2,2)

A))
((OPTION_ (2,2) (5, 4) (3,2) (6, 4)
B))

((OPTION_ (3, 3 ) (4,2) (2,3) (2,2)

C))

((OPTION_ (6, 5 ) (4,5) (5,4) (5,6)

D))

((CORREC D
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)
((MARKS)) 1
(1/2/3...)
((QUESTIO If one edge of the polygon has end coordinates (10,20)
N)) and (15,40) and current scan line is scanning at y=25.
What will be the intersection point?

((OPTION_ (11.2,25)
A))

((OPTION_ (12,25)
B))

((OPTION_ (12.2,25)
C))
((OPTION_ (25,11.2)
D))

((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1
(1/2/3...)
((QUESTIO In 8 connected region if one pixel is (2,3) then
N)) remaining neighbouring pixels are
 ((OPTION_ (1, 3 ) (3,3) (2,4) (2,2) (3,4) (3,2) (1,4) (1, 2)
A))

((OPTION_ (3, 3 ) (1,1) (2,4) (2,2) (2,2) (1, 4) (3,2) (3, 4)

B))

((OPTION_ (3, 3 ) (1,2) (2,3) (2,2)

C))

((OPTION_ (2, 2 ) (4,2) (3,3) (3,1)

D))

((CORREC A
T_CHOICE
))
(A/B/C/D)
((EXPLAN
ATION))
(OPTIONA
L)

((MARKS)) 1 UNIT 3 CG
(1/2/3...)
((QUESTION ___________ is basic change in shape & size of object
))
((OPTION_A Transformation
))

((OPTION_B Deformation
))

((OPTION_C illumination
))

((OPTION_D None of Above

))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Transformation is ___________ in nature.
))

((OPTION_A Flexible
))

((OPTION_B Rigid
))

((OPTION_C Composite
))

((OPTION_D All of above of Above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION There are ________________ basic transformations.
))
((OPTION_A 1
))
((OPTION_B 2
))
((OPTION_C 3
))
((OPTION_D 5
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION There are total __________ types of transformations
))

((OPTION_A 1
))
((OPTION_B 3
))
((OPTION_C 5
))
((OPTION_D 2
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION __________ is a process of changing position of an object in a
)) straight line path.

((OPTION_A Translation
))

((OPTION_B Scaling
))

((OPTION_C Rotation
))

((OPTION_D Reflection
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Translation distance pair is also called as
)) ____________________.

((OPTION_A Scaling factor

))
((OPTION_B shear value
))

((OPTION_C Pivot point

))

((OPTION_D Shift vector

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION _________ is repositioning of an object along a circular path.
))

((OPTION_A Rotation
))

((OPTION_B Reflection
))

((OPTION_C Translation
))

((OPTION_D Scaling
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION To perform Rotation we require __________ and
)) _____________.

((OPTION_A Translation distance

))

((OPTION_B Scaling Factor

))

((OPTION_C Pivot Point. Rotation angle

))

((OPTION_D All of above

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION __________ rotation denotes positive value of rotation angle.
))

((OPTION_A Clockwise
))

((OPTION_B Counterclockwise
))
((OPTION_C composite
))

((OPTION_D None of Above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION __________ values of rotation angle represents clockwise
)) rotation.

((OPTION_A 0
))
((OPTION_B 180
))
((OPTION_C negative
))

((OPTION_D positive
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION ________ is point about which rotation takes place.
))

((OPTION_A Pixel
))

((OPTION_B origin
))

((OPTION_C Pivot Point

))

((OPTION_D All of Above

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION ___________ is an angle through which rotation takes place.
))

((OPTION_A Rotation Angle

))

((OPTION_B Reflection angle

))

((OPTION_C Composite angle

))

((OPTION_D none of above

))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Rotation about origin is ________ in nature.
))

((OPTION_A Reflexive
))

((OPTION_B Transitive
))

((OPTION_C Commutative
))

((OPTION_D None of above

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Rotation other than origin is called as rotation about
)) ___________.

((OPTION_A Pivot Point

))

((OPTION_B X axis
))

((OPTION_C Y axis
))

((OPTION_D All of above

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION __________ steps are required to perform rotation about
)) arbitary point.

((OPTION_A 1
))
((OPTION_B 2
))
((OPTION_C 3
))
((OPTION_D 4
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION __________ is transformation carried out one after another
))

((OPTION_A Reflection
))

((OPTION_B shear
))

((OPTION_C Composite
))

((OPTION_D None of above

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION _______ transformation changes size of an object.
))
((OPTION_A Translation
))

((OPTION_B Reflection
))

((OPTION_C Rotation
))

((OPTION_D Scaling
))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Scaling factor_____ scales object in X direction.
))

((OPTION_A 0
))

((OPTION_B Sx
))

((OPTION_C Sy
))

((OPTION_D All of above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Scaling factor_____ scales object in Y direction.
))

((OPTION_A Sy
))

((OPTION_B Tx
))

((OPTION_C Ty
))

((OPTION_D Sx
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Values less than one of scaling factor will _________ size of
)) object.

((OPTION_A enlarge
))
((OPTION_B elongate
))

((OPTION_C expand
))

((OPTION_D reduce
))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Values greater than one of scaling factor will ______ object.
))

((OPTION_A enlarge
))

((OPTION_B elongate
))

((OPTION_C expand
))

((OPTION_D reduce
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In ________ scaling values of sx and sy are same.
))

((OPTION_A differential
))

((OPTION_B Uniform
))

((OPTION_C normal
))

((OPTION_D None of above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In differential scaling values of sx and sy are ________.
))

((OPTION_A Same
))

((OPTION_B different
))
((OPTION_C any
))

((OPTION_D All of above

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION For scaling factors we can use _____________ values.
))

((OPTION_A Positive
))

((OPTION_B negative
))

((OPTION_C float
))

((OPTION_D any
))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION Scaling is __________ in nature.
))

((OPTION_A Commutative
))

((OPTION_B Sequential
))

((OPTION_C Transitive
))
((OPTION_D All of these
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Two successive rotations are ______ in nature.
))

((OPTION_A Commutative
))

((OPTION_B Additive
))

((OPTION_C Flexible
))
((OPTION_D All of above
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION _________Coordinate system allows us to express all
)) transformation as matrix multiplication

((OPTION_A Homogeneous
))

((OPTION_B Polar
))

((OPTION_C Cartesian
))

((OPTION_D all of above

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION The Homogeneous Coordinate is represented by
)) _____________.

((OPTION_A Pair
))

((OPTION_B Triplet
))

((OPTION_C Quad
))

((OPTION_D All of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The Homogeneous Coordinate of point (X,Y) is represented by
)) _____________.

((OPTION_A (X,Y)
))

((OPTION_B (Xw,Yw)
))

((OPTION_C (Xw,Yw,W)
))
((OPTION_D (x,Y,Z)
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Homogeneous coordinate allows you to ___________.
))

((OPTION_A Combine transformation

))

((OPTION_B eliminate need of intermediate calculations

))

((OPTION_C saves time and memory

))

((OPTION_D All of these

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Reflection transformation produce ______ image of an object.
))

((OPTION_A mirror
))

((OPTION_B inverse
))

((OPTION_C sharp
))

((OPTION_D noisy
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Shear___________ shape of an object
))

((OPTION_A slants
))

((OPTION_B reduces
))

((OPTION_C enlarges
))

((OPTION_D changes
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION There are_____ types of shear transformation
))

((OPTION_A 1
))
((OPTION_B 2
))
((OPTION_C 3
))
((OPTION_D 4
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION ________ preserves Y coordinate.
))

((OPTION_A Z-shear
))
((OPTION_B Y-shear
))

((OPTION_C X-shear
))

((OPTION_D All of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Y-shear Preserves ________ coordinate.
))

((OPTION_A X
))
((OPTION_B Y
))
((OPTION_C Z
))
((OPTION_D None of these
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In X-shear _________ line tilts to right or left.
))

((OPTION_A Horizontal
))

((OPTION_B Parallel
))

((OPTION_C Vertical
))

((OPTION_D arbitary
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In Y shear for horizontal line __________ changes.
))

((OPTION_A length
))

((OPTION_B thickness
))
((OPTION_C intensity
))
((OPTION_D Slope
))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Shear Transformation may be expresses in terms of
)) ___________ and _____________.

((OPTION_A Translation , Rotation

))

((OPTION_B Rotation, Scaling

))

((OPTION_C Reflection, Translation

))

((OPTION_D None of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In 3D geometry we Require _________ axis
))

((OPTION_A 1
))
((OPTION_B 2
))
((OPTION_C 3
))
((OPTION_D 4
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Z axis corresponds to _________.
))

((OPTION_A Length
))

((OPTION_B Height
))

((OPTION_C Depth
))

((OPTION_D slope
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In parallel Projection __________ Coordinate is discarded
))

((OPTION_A Z
))
((OPTION_B Y
))
((OPTION_C X
))
((OPTION_D All of above
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Parallel projections ________ relative proportions of object
))
((OPTION_A does not preserve
))

((OPTION_B Preserves
))

((OPTION_C increases
))

((OPTION_D decreases
))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Parallel projections does not produce _________ views.
))

((OPTION_A elastic
))

((OPTION_B same
))

((OPTION_C realistic
))

((OPTION_D None of above

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In perspective projections lines of projections are
)) ______________.

((OPTION_A Parallel
))

((OPTION_B Tangent
))

((OPTION_C Normal
))

((OPTION_D Not Parallel

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Perspective projections produce _________ views
))

((OPTION_A elastic
))
((OPTION_B realistic
))

((OPTION_C same
))

((OPTION_D Shift vector

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In perspective projections all projections are converge at a
)) single point called as _____________________.

((OPTION_A origin
))

((OPTION_B center
))

((OPTION_C mean
))

((OPTION_D Center of projections

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION There are ________ Types of parallel projections
))

((OPTION_A 5
))
((OPTION_B 3
))
((OPTION_C 2
))
((OPTION_D 6
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION _____________ is a type of Parallel projection
))

((OPTION_A Orthographic
))

((OPTION_B Perspective
))

((OPTION_C one-point
))
((OPTION_D Two-point
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Oblique is a type of ________ projections
))

((OPTION_A One-point
))

((OPTION_B two-point
))

((OPTION_C Parallel
))

((OPTION_D perspective
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In orthographic projections projection plane is _________ to a
)) principle axis

((OPTION_A perpendicular
))

((OPTION_B Parallel
))

((OPTION_C not related

))

((OPTION_D none of above

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The oblique projections are classified as ___________ and
)) _____________.

((OPTION_A parallel, perspective

))

((OPTION_B orthographic, isometric

))

((OPTION_C cavalier ,cabinet

))
((OPTION_D none of these
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION 3D clipping uses _________ region code.
))

((OPTION_A 2-bit
))

((OPTION_B 6-bit
))

((OPTION_C 4-bit
))

((OPTION_D 1-bit
))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In 3D clipping bit 5 of region code has value _________ if end
)) point is in front of volume

((OPTION_A 0
))
((OPTION_B 1
))
((OPTION_C -1
))
((OPTION_D 10
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In 3D clipping bit 6 of region code has value _________ if end
)) point is in behind of volume

((OPTION_A 1
))
((OPTION_B 0
))
((OPTION_C -1
))
((OPTION_D 0.5
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Concept of window in 2D can be extended to
)) ________________ a in 3D Clipping.

((OPTION_A mirror
))

((OPTION_B surface
))
((OPTION_C projection
))

((OPTION_D View volume

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In 3D clipping we perform logical ______ operation.
))

((OPTION_A NOR
))
((OPTION_B XOR
))

((OPTION_C OR
))

((OPTION_D AND
))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Basic geometric transformation include _________.
))

((OPTION_A Translation
))

((OPTION_B Rotation
))
((OPTION_C Scaling
))

((OPTION_D All of these

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION Some additional transformation are __________
))

((OPTION_A Shear
))

((OPTION_B Reflection
))
((OPTION_C Both a & b
))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The transformation in which an object is moved from one
)) position to another along a straight line path is called

((OPTION_A Translation
))

((OPTION_B Scaling
))
((OPTION_C Rotation
))
((OPTION_D Reflection
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The transformation in which an object is moved from one
)) position to another in circular path around a specified pivot
point is called _____________

((OPTION_A Translation
))

((OPTION_B Scaling
))
((OPTION_C Rotation
))

((OPTION_D Reflection
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION The transformation in which the dimension of an object are
)) changed relative to a specified fixed point is called

((OPTION_A Translation
))

((OPTION_B Scaling
))

((OPTION_C Rotation
))

((OPTION_D Reflection
))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The selection and separation of a part of text or image for
)) further operation are called ___________.

((OPTION_A Translation
))

((OPTION_B Shear
))
((OPTION_C Reflection
))

((OPTION_D Clipping
))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The complex graphics operations are _____________
))

((OPTION_A Selection
))

((OPTION_B Separation
))
((OPTION_C Clipping
))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The transformation that produces a parallel mirror image of an
)) object are called __________.

((OPTION_A Reflection
))

((OPTION_B Shear
))

((OPTION_C Rotation
))

((OPTION_D Scaling
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The transformation that disturbs the shape of an object are
)) called __________

((OPTION_A Reflection
))

((OPTION_B Shear
))
((OPTION_C Rotation
))

((OPTION_D Scaling
))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The process of mapping a world window in world coordinate
)) system to viewport are called __________

((OPTION_A viewing Transformation

))

((OPTION_B View Port

))
((OPTION_C Clipping window
))

((OPTION_D Screen coordinate system

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In which transformation the shape of an object can be modified
)) in x-direction ,y-direction as well as in both the direction
depending upon the value assigned to shearing variables
___________
((OPTION_A Reflection
))

((OPTION_B Shearing
))
((OPTION_C Rotation
))

((OPTION_D Scaling
))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The process of extracting a portion of a database or a picture
)) inside or outside a specified region are called

((OPTION_A Translation
))

((OPTION_B Shear
))
((OPTION_C Reflection
))

((OPTION_D Clipping
))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The rectangle portion of the interface window that defines
)) where the image will actually appear are called

((OPTION_A Transformation viewing

))

((OPTION_B View port

))
((OPTION_C Clipping window
))

((OPTION_D Screen coordinate system

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The space in which the image is displayed are called
)) __________________

((OPTION_A Screen coordinate system

))

((OPTION_B Clipping window

))
((OPTION_C World coordinate system
))

((OPTION_D None of these

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The rectangle space in which the world definition of region is
)) displayed are called ________________

((OPTION_A Screen coordinate system

))
((OPTION_B Clipping window or world window
))

((OPTION_C World coordinate system

))

((OPTION_D None of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The object space in which the application model is defined
)) _____________

((OPTION_A Screen coordinate system

))

((OPTION_B Clipping window or world window

))

((OPTION_C World coordinate system

))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The process of cutting off the line which are outside the
)) window are called _____________

((OPTION_A Shear
))

((OPTION_B Reflection
))

((OPTION_C Clipping
))
((OPTION_D Clipping window
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Each successive transformation matrix _________ the product
)) of the preceding transformation

((OPTION_A pre-multiples
))

((OPTION_B post-multiples
))

((OPTION_C both a & b

))

((OPTION_D none of these

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Forming products of transformation matrices is often referred as
)) __________.

((OPTION_A Composition of matrix

))

((OPTION_B Concatenation of matrix

))

((OPTION_C Both a & b are same

))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Two consecutive translation transformation t1 and t2 are
)) _____________

((OPTION_A Additive
))

((OPTION_B Subtractive
))
((OPTION_C Multiplicative
))
((OPTION_D None of these
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Two consecutive rotation transformation R1 and R2 are
)) _______________

((OPTION_A Additive
))

((OPTION_B Subtractive
))

((OPTION_C Multiplicative
))

((OPTION_D None of these

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Two consecutive scaling transformation S1 andS2 are
)) _______________
((OPTION_A Additive
))

((OPTION_B Subtractive
))

((OPTION_C Multiplicative
))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The most basic transformation that are applied in three-
)) dimensional planes are _____________

((OPTION_A Translation
))

((OPTION_B Scaling
))
((OPTION_C Rotation
))

((OPTION_D All of these

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The transformation in which an object can be shifted to any
)) coordinate position
in three dimensional plane are called _____________.

((OPTION_A Translation
))

((OPTION_B Scaling
))
((OPTION_C Rotation
))
((OPTION_D All of these
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The transformation in which an object can be rotated about
)) origin as well as
any arbitrary pivot point are called __________________.

((OPTION_A Translation
))
((OPTION_B Scaling
))
((OPTION_C Rotation
))
((OPTION_D All of these
))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The transformation in which the size of an object can be
)) modified in x-direction ,y-direction and z-direction
_____________

((OPTION_A Translation
))

((OPTION_B Scaling
))
((OPTION_C Rotation
))

((OPTION_D All of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Apart from the basic transformation ,________are also used
))

((OPTION_A Shearing
))

((OPTION_B Reflection
))

((OPTION_C Both a & b

))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In which transformation ,the shape of an object can be modified
)) in any of direction depending upon the value assigned to them
______________

((OPTION_A Reflection
))
((OPTION_B Shearing
))

((OPTION_C Scaling
))

((OPTION_D None of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In which transformation , the mirror image of an object can be
)) seen with respect to x-axis, y-axis ,z-axis as well as with
respect to an arbitrary line ______________.

((OPTION_A Reflection
))

((OPTION_B Shearing
))

((OPTION_C Translation
))

((OPTION_D None of these

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Projection are broadly categorised as ______.types
))

((OPTION_A 1
))
((OPTION_B 2
))
((OPTION_C 3
))
((OPTION_D 4
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The types of projection are _______________.
))

((OPTION_A Parallel projection and perspective projection

))

((OPTION_B Perpendicular and perspective projection

))
((OPTION_C Parallel projection and Perpendicular projection
))

((OPTION_D None of these

))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION How many types of parallel projection are ______________.
))
((OPTION_A 1
))
((OPTION_B 2
))
((OPTION_C 3
))
((OPTION_D 4
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The types of parallel projection are _______________.
))
((OPTION_A Orthographic projection and quadric projection
))

((OPTION_B Orthographic projection and oblique projection

))

((OPTION_C oblique projection and quadric projection

))

((OPTION_D None of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION By __________ more complex objects can be constructed.
))
((OPTION_A Quadric surfaces
))

((OPTION_B Wire frame model

))

((OPTION_C Composite transformation

))

((OPTION_D None of these

))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION ________refers to the result obtained by multiplying the matrix
)) of the individual
transformation representation sequences.

((OPTION_A Wire frame model

))

((OPTION_B Constructive solid geometry methods

))

((OPTION_C Composite transformation

))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The projection in which the projection plane is allowed to
)) intersect the
x, y and z-axes at equal distances ___________________.

((OPTION_A Wire frame model

))

((OPTION_B Constructive solid geometry methods

))

((OPTION_C Isometric projection

))

((OPTION_D Back face removal

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In which projection , the plane normal to the projection has
)) equal angles
with these three axes ____________________.

((OPTION_A Wire frame model

))

((OPTION_B Constructive solid geometry methods

))
((OPTION_C Isometric projection
))

((OPTION_D Back face removal

))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION By which ,we can take a view of an object from different
)) directions and
different distances ______________.

((OPTION_A Projection
))

((OPTION_B Rotation
))

((OPTION_C Translation
))

((OPTION_D Scaling
))

((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Parallel projection shows the ______________.
))
((OPTION_A True image of an object
))

((OPTION_B True size of an object

))
((OPTION_C True shape of an object
))

((OPTION_D all of these

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The centre of projection for parallel projectors is at
)) _____________.

((OPTION_A Zero
))

((OPTION_B Infinity
))
((OPTION_C One
))

((OPTION_D None of these

))

((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION In orthographic projection, engineering use ___________.
))

((OPTION_A Top view of an object

))

((OPTION_B Front view of an object

))
((OPTION_C Side view of an object
))

((OPTION_D All of these

))

((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The orthographic projection that show more than one side of an
)) object
are called _______________.

((OPTION_A Axonometric projection

))

((OPTION_B Isometric projection

))
((OPTION_C Both a & b
))

((OPTION_D None of these

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 2
(1/2/3...)
((QUESTION To determine the form for the rotation matrix, consider the
)) point (1,0). If we rotate this point counterclockwise by an angle
, it becomes

((OPTION_A (cos , -sin )

))

((OPTION_B (sin , cos )

))

((OPTION_C (cos , sin )

))

((OPTION_D (-sin , cos )

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 2
(1/2/3...)
((QUESTION Consider the point (2,4), if we rotate this point counter
)) clockwise by an angle π/6 radians transformed point is

((OPTION_A (3.598, 0.232)

))

((OPTION_B (1.732, 2)
))
((OPTION_C (0.232, 3.598)
))

((OPTION_D (1, 3.464)

))

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1 UNIT 4 CG
(1/2/3...)
((QUESTION Many online animation tools are used to create animation in the
))
((OPTION_A JPEG image
))
((OPTION_B PDF image
))

((OPTION_C GIF image

))
((OPTION_D None of these
 ))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION For which purpose ,one needs to apply natural light effects to
rface ))
((OPTION_A Fractals
))
((OPTION_B Quad-tree
))

((OPTION_C Rendering
))
((OPTION_D None of these
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
 ((QUESTION A fast and simple method for rendering an object with polygon
ANSWER: C))
((OPTION_A Constant-intensity shading
))
((OPTION_B Flat shading
))

((OPTION_C Both a & b

))
((OPTION_D
)) None of these

((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Many online animation tools are used to create animation in the
))
((OPTION_A JPEG image
))
((OPTION_B PDF image
))

((OPTION_C GIF image

))
((OPTION_D None of these
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION An object can be viewed as a collection of
))
((OPTION_A One segment
))
((OPTION_B Two segment
))
((OPTION_C Several segments
))
((OPTION_D None of these
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Every segment has its own attributes like
))
((OPTION_A Size, visibility
))
((OPTION_B Start position
))
((OPTION_C Image transformation
))
((OPTION_D All of these
))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION By using the attributes of segment , we can________ any
))
((OPTION_A Change
))
((OPTION_B Control
))
((OPTION_C Print
))
((OPTION_D None of these
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
 TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION A two-dimensional array contain the details of all the segment
d ))
((OPTION_A Segmentation table
))
((OPTION_B Segment name
))
((OPTION_C Operation
))
((OPTION_D None of these
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION We assign all the attributes of segment under this
))
((OPTION_A Segment name
))
((OPTION_B Segment size
))
((OPTION_C Array
))
((OPTION_D None of these
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The initial size of segment will be_______
))
((OPTION_A 1
))
((OPTION_B 0
))
((OPTION_C 2
))
((OPTION_D 3
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
 (OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The removal of a segment with its details are called
))
((OPTION_A Alter the segments
))
((OPTION_B Deletion of segments
))
((OPTION_C Closing the segment
))
((OPTION_D None of these
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Deletion of any segment is much________ than creation of any
ment ))
((OPTION_A Easier
))
((OPTION_B Difficult
))
((OPTION_C Higher
))
((OPTION_D None
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION _______is very important in creating animated images on the
))
((OPTION_A Image transformation
))
((OPTION_B Morphing
))
((OPTION_C Clipping
))
((OPTION_D None of these
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
 ((MARKS)) 1
(1/2/3...)
((QUESTION The graphics method in which one object is transformed into
bject are called
))
((OPTION_A Clipping
))
((OPTION_B Morphing
))
((OPTION_C Reflection
))
((OPTION_D Shear
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Example of morphing are
))
((OPTION_A Oil takes the shape of a car
))
((OPTION_B A tiger turns into a bike
))
((OPTION_C Both a & b
))
((OPTION_D None of these
))
((CORRECT
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION A many sided figure is termed as
))
((OPTION_A Square
))
((OPTION_B Polygon
))
((OPTION_C Rectangle
))
((OPTION_D None
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The end point of polygon are called as
))
((OPTION_A Edges
))
((OPTION_B Vertices
))
((OPTION_C Line
))
((OPTION_D None of these
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Two dimensional color model are
))
((OPTION_A RGB and CMKY
))
((OPTION_B RBG and CYMK
))
((OPTION_C RGB and CMYK
))
((OPTION_D None
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION RGB model are used for
))
((OPTION_A Computer display
))
((OPTION_B Printing
))
((OPTION_C Painting
))
((OPTION_D A
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION CMYK model are used for
))
((OPTION_A computer display
))
((OPTION_B Printing
))
((OPTION_C Painting
))
((OPTION_D None of these
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The intersection of three primary RGB color produces
))
((OPTION_A White color
))
((OPTION_B Black color
))
((OPTION_C Magenta color
))
((OPTION_D Blue color
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
 (OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The intersection of primary CMYK color produces
))
((OPTION_A White color
))
((OPTION_B Black color
))
((OPTION_C Cyan color
))
((OPTION_D Magenta color
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The RGB model display a much _______ percentage of the
and as compared
)) to CMYK
((OPTION_A Lesser
))
((OPTION_B Larger
))
 ((OPTION_C Medium
))
((OPTION_D None of these
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Color depth can be defined by ________ which can be
on a display ))unit
((OPTION_A Bits per pixel
))
((OPTION_B Bytes per pixel
))
((OPTION_C Megabyte per pixel
))
((OPTION_D None of these
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)
((MARKS)) 1
(1/2/3...)
((QUESTION RGB true color model has _______ color depth
))
((OPTION_A 24bit
))
((OPTION_B 32bit
))
((OPTION_C 64bit
))
((OPTION_D None
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION CMYK true color model has _______ color depth
))
((OPTION_A 24bit
))
((OPTION_B 32bit
))
((OPTION_C 64bit
))
((OPTION_D None
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Grey scale images have a maximum color depth of
))
((OPTION_A 8bit
))
((OPTION_B 16bit
))
((OPTION_C 32bit
))
((OPTION_D 24 bit
))
((CORRECT A
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The color code “000” is for
))
((OPTION_A White
))
((OPTION_B Black
))
((OPTION_C Blue
))
((OPTION_D Green
))
((CORRECT B
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION Color information can be stored in
))
((OPTION_A Main memory
))
((OPTION_B Secondary memory
))
((OPTION_C Graphics card
))
((OPTION_D Frame buffer
))
((CORRECT D
_CHOICE))
(A/B/C/D)
((EXPLANA
 TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION The range that specifies the gray or grayscale levels is
))
((OPTION_A The value range from -1 to 1
))
((OPTION_B The value range from 0 to -1
))
((OPTION_C The value range from 0 to 1
))
((OPTION_D Any one of the above
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

((MARKS)) 1
(1/2/3...)
((QUESTION With 3 bits per pixel, we can accommodate 8 gray levels. If we
per pixel then
)) what is the value of gray levels?
((OPTION_A 18 gray levels
))
((OPTION_B 128 gray levels
 ))
((OPTION_C 256 gray levels
))
((OPTION_D No color
))
((CORRECT C
_CHOICE))
(A/B/C/D)
((EXPLANA
TION))
(OPTIONAL)

CG UNIT 1
Id 1
Question In computer graphics, pictures or graphics objects are presented as a

collection of discrete picture elements called________________

A Dots
B Pixels
C Coordinates
D Points
Answer B
Marks
Unit 1

Id 2
Question ___________is the smallest addressable screen element.

A Dot
B Point
C Pixel
D Spot
Answer C
Marks
Unit 1

Id 3
Question ______________is the smallest piece of the display screen which we can control.

A Dot
B Point
C Spot
D Pixel
Answer D
Marks
Unit 1

Id 4
Question We can control______________________of the pixels which compose the screen
A intensity
B size
C shape
D none of these
Answer A
Marks
Unit 1

Id 5
Question We can control________________ of the pixels compose the screen.

which
A Color
B Size
C Shape
D none of these
Answer A
Marks
Unit 1
Id 6
Question Each pixel on the graphics display represents _____________________

A a single mathematical Point

B 2 mathematical Points
C 4 mathematical Points
D a region which theoretically can

contain infinite Points

Answer D
Marks
Unit 1

Id 7
Question A point (4.2, 3.8) can be displayed on a screen bv a Pixel___________________

A (4,3)
B (3,4)
C (5,4)
D (4,4)
Answer A
Marks
Unit 1

Id 8
Question The Process of determining the appropriate pixel for representing picture or graphics object is
known as_______________________________

A Scan conversion
B rasterization
C Scanning
D Graphical representation
Answer B
Marks
Unit 1
Id 9
Question The process of. representing continuous picture or graphics object as a collection of discrete pixels is
called_______________________________

A Scan conversion
B rasterization
C Scanning
D Graphical representation
Answer A
Marks
Unit

Id 10
Question The computer graphics allows____________________on pictures before displaying it'

A Rotation
B Translation
C Scaling and projection
D All of the above
Answer D
Marks
Unit 1

Id 11
Question Graphics devices include_____________________________
A Input devices
B Output devices
C A and B
D None of the above
Answer C
Marks
Unit 1

Id 12
Question Computer graphics allows
A user interfaces
B plotting of graphics and chart
C office automation and desktop
publishing
D all of above
Answer D
Marks
Unit 1

Id 13
Question Computer graphics allows
A computer-aided drafting and design
B simulation and animation
C art and commerce
D all of above
Answer D
Marks
Unit 1

Id 14
Question Computer graphics allows
A process control
B Cartography
C art and commerce
D all of above
Answer D
Marks
Unit 1

Id 15
Question Computer graphics is used in
A Industry
B Business
C Government organizations
D all of above
Answer D
Marks
Unit 1

Id 16
Question Computer graphics is used in
A Education
B Entertainment
C Home
D all of above
Answer D
Marks
Unit 1

Id 17
Question The software components of conceptual

framework for interactive graphics is/are

A application model
B application program
C graphics system
D all of above
Answer D
Marks
Unit 1

Id 18
Question The hardware components of conceptual

framework for interactive graphics is/are

A input devices

B output devices
C (a) and (b)
D none of these
Answer C
Marks
Unit 1

Id 19
Question The display devices are devices.
A Input
B Output
C (a) and (b)
D none of these
Answer B
Marks
Unit 1

Id 20
Question The most commonly used output device

in a graphics system is

A Mouse

B Keyboard

C video monitor

D none of these

Answer C
Marks
Unit 1

Id 21
Question CRT stands for

A Cathode Ray Tube

B Color Ray Tube

C Cathode Radio Tube

D Color Radio Tube

Answer A
Marks
Unit 1

Id 22
Question A CRT is an evacuated tube.

A Plastic

B Glass

C Steel

D Iron

Answer B
Marks
Unit 1

Id 23
Question An____________ gun at the rear of the CRT

Produces a beam of electrons.

A Electronic

B Electron

C Element

D Emergency

Answer B
Marks
Unit 1
Id 24
Question The inner side of the CRT screen is

coated with _ substance.

A Phosphor

B Black

C Neon

D White

Answer A
Marks
Unit 1

Id 25
Question The phosphor coating at the inner side of

the CRT screen _ light when it is

stroked by electrons.
A Absorbs
B gives off
C Reflects
D none of these
Answer B
Marks
Unit 1

Id 26
Question The deflection system of the CRT consists

of deflection plates.
A Vertical
B Horizontal
C (a) and (b)
D none of these
Answer C
Marks
Unit 1

Id 27
Question The technique(s) used for producing

jmages on the CRT screen is/are _.

A vector scan

B raster scan

C (a) and (b)

D none of these

Answer C
Marks
Unit 1

Id 28
Question The _________ applied to deflection plates control the

deflection of the electron beam in CRT

A force

B magnetic fields

C Voltage

D None of the

Answer C
Marks
Unit 1

Id 29
Question Vector scan technique is also called
A scalar scan

B Random scan

C Raster scan

D beam scan

Answer B
Marks
Unit 1

Id 30
Question In CRT, phosphor light____________ after few milliseconds.
A Increase

B Decays

C reflects

D none of these

Answer B

Marks
Unit 1

Id 31
Question In vector scan display, the display buffer memory used is also called
A refresh memory
B refresh buffer
C Buffer display
D refresh circuit
Answer B
Marks
Unit 1

Id(39) 32
Question In vector scan display, the phosphor is to

be refreshed at least times per second to avoid flicker

A 10
B 20
C 30
D 40
Answer C
Marks
Unit 1

Id 33
Question In raster scan display, the display image

is stored in the form of __________________ in the refresh buffer.

A 1’s
B 0’s
C 1’s and 0’s
D None of these.
Answer C
Marks
Unit 1

Id 34
Question In raster scan CRT, the beam is swept back and forth from across the screen

A left to right
B right to left
C up to down
D down to up
Answer A
Marks
Unit 1

Id 35
Question In raster scan CRT, when a beam is

Moved from the left to the right, it is and it is when it is moved from the
when it is moved from the right to the left.

A ON, OFF
B OFF,ON
C ON,ON
D OFF,OFF
Answer A
Marks
Unit 1

Id 36
Question In raster scan CRT, when a beam reaches the bottom of the screern, it is made
and rapidly retraced back to the top.

A ON
B OFF
C Flickering
D half intensity
Answer B
Marks
Unit 1

Id 37
Question In raster scan display, the screen image is repeatedly scanned, this process is
called.

A buffering of screen
B refreshing of screen
C rendering of screen
D highlighting screen
Answer B
Marks
Unit 1
Id 38
Question In raster scan displays, a special area of memory is dedicated to graphics only,
called

A buffer area
B frame buffer
C buffer memory
D raster memory
Answer b
Marks
Unit 1

Id 39
Question Pixel is also referred to as a

A Point

B Dot

C Pel

D Coordinate

Answer c
Marks
Unit 1

Id 40

Question On a black and white system for one bit per

pixel' the frame buffer is called a ______

A bitmap

B pixmap

C bitpixmap
D pixbitmap

Answer a
Marks
Unit 1

Id 41
Question The frame buffer with multiple bits per pixel is reffered as a
A bitmap

B pixmap

C bitpixmap

D pixbitmap

Answer B
Marks
Unit 1

Id 42
Question The cost of vector scan display is…..cost of raster scan display
A Equal to

B Less than

C More than

D None of this

Answer C
Marks
Unit 1

Id 43
Question For _________ display scan conversion hardware is required
A Vector scan

B Random scan
C Raster scan

D None of this

Answer C

Marks
Unit 1

Id 44
Question ________display have ability to display areas filled with solid colosure or patterns
A Vector scan
B Random scan
C Raster scan
D Any
Answer C
Marks
Unit 1

Id 45
Question In display devices ,the time taken by the phosphor to decay the emmited light to one-
tenth of its original intensity ,is called ________
A Decay time
B Refresh time
C Persistence
D Delay
Answer C
Marks
Unit 1

Id 46
Question Lower persistence phosphor require _______ refreshing rates to maintain a picture on
the screen without flicker.
A Lower
B Higher
C Minimum
D Medium
Answer B
Marks
Unit 1

Id 47
Question _______ indicate the maximum no of points that can be displayed without overlapped on the
CRT

A Persistence
B Resolution
C Aspect ratio
D Type of display
Answer B
Marks
Unit 1

Id 48
Question The aspect ratio of _____ to produce equal length lines in the both direction on the screen.

A Vertical points to horizontal points

B Horizontal points to vertical points
C Left to right and right to left diagonal points
D Right to left and left to right diagonal points
Answer A
Marks
Unit 1

Id 49
Question SRGP stands far

A Simple raster graphics package

B System random graphics package
C System raster graphics package
D Simple random graphics package
Answer A
Marks
Unit 1

Id 50
Question Display file can be implemented using ________ data structure.

A Array
B Linked list
C Paging
D All of above
Answer D
Marks
Unit 1

Id 51
Question The process of determining pixel values from input geometric primitives

called ________

A Animation
B Sampling
C Rasterization
D Scan –conversion
Answer C
Marks
Unit 1

Id 52
Question The process of digitizing a picture definition given in an application program into set of pixel
intensity values is called ________

A Animation

B Sampling

C Rasterization

D Scan -conversion

Answer D
Marks
Unit 1

Id 53
Question The process of representing continuous graphic object as collection of discrete pixels is
called ____
A animation

B Rasterization

C Scan conversion

D sampling

Answer C
Marks
Unit 1

Id 54
Question Horizontal and vertical resolution of an image __________
A Res always equal

B May differ

C None of differ

D All of above

Answer B
Marks
Unit 1

Id 55
Question Ratio of vertical point to horizontal points to produce equal length line in both ditection
on the screen is called _______
A Resolution

B Aspect ratio
C Persistence

D None of this

Answer C
Marks
Unit 1

Id 56
Question In a shadow mask CRT at each pixel position how many phosphor color dot exist.
A 1

B 2

C 3

D 4

Answer C

Marks
Unit 1

Id 57
Question The role of flood gun direct view storage tube (DVST) devices is to _____
A Maintain the picture display
B Store picture pattern
C Provide the negative charge
D Selectively erase picture
Answer A
Marks
Unit 1

Id 58
Question Most of graphics monitor today operated as ________
A Random scan
B Zig –zag scan
C Flood scan
D Raster scan
Answer C
Marks
Unit 1

Id 59
Question The size of memory (video buffer) depends on ___
A Resolution only
B No of different colors only
C Both (a) and (b)
D Computer type
Answer C
Marks
Unit 1

Id 60
Question The random scan display the refresh display file consist a set of ___

A Line drawing command

B Pixel values
C Color codes
D Both (a) and (c)
Answer A
Marks
Unit 1

Id 61
Question The pixel of black white image or graphic object takes _____ space in memory.

A 1 bit
B 1 byte
C 1 nibble
D 3 byte
Answer B
Marks
Unit 1

Id 64
Question The resolution of an image is______

A number of pixels per unit area

B number of pixels per unit length in horizontal

C number of pixels per unit length in vertical

D none of these
Answer A
Marks
Unit 1

Id 65
Question The size of a 640*480 image at 240 pixels per inch is ________

A 8/3*2 inches
B 2*2 inches
C 3*2 inches
D none of these
Answer A
Marks
Unit 1

Id 66
Question The resolution of 2*2 inch images that has 512*512 pixel is _____.
A 256*256 pixel per inch

B 256 pixel per inch

C 128*128 pixels per inch

D 128 pixels per inch

Answer A
Marks
Unit 1
Id 67
Question If we want to resize a 1024*768 image to one that is 640 pixels wide with the same
aspect ratio ,the height resized image woulu be ____.
A 768

B 512

C 480

D 1024

Answer C
Marks
Unit 1

Id 68
Question Persistence can be define as ____
A Intensity of a pixel

B Pixel per unit area

C The duration of phosphorescence exhibited by phosphor

D Number of pixel in an Images

Answer C
Marks
Unit 1

Id 69
Question The path the electron beam takes at the end of each refresh cycle is called____
A Horizontal retrace

B Vertical retrace

C Diagonal retrace

D Left to right retrace

Answer B

Marks
Unit 1

Id 70
Question The path the electron beam takes when returning to the left side of the CRT screen is
called___
A Horizontal retrace

B Vertical retrace

C Diagonal retrace

D Top to bottom retrace

Answer A
Marks
Unit 1

Id 71
Question Frame buffer is used to store____
A Number of pixel in the images
B Intensities of a pixel
C Image definition
D Coordinator value of image
Answer B
Marks
Unit 1

Id 72
Question Raster system displays a picture from a definition in a_____
A Display the program
B Frame buffer
C Display controller
D None of the above
Answer B
Marks
Unit 1

Id 73
Question Shadow mask method are commonly used in____

A Raster scan system

B LED
C DVST
D LCD
Answer A
Marks
Unit 1

Id 74
Question Aspect ratio is generally define as the ratio of _____ on the screen

A Vertical to horizontal point

B Horizontal to vertical point
C Vertical to(horizontal+vertical) point
D Either (a) or (b)depending on the convention followed
Answer A
Marks
Unit 1

Id 75
Question The clarity of display image depends on the______

A Resolution
B Floating point precision of the system
C Associated software
D Aspect ratio
Answer A
Marks
Unit 1

Id 76
Question Random scan monitors are also referred to as ______

A Vector display
B Stroke writing display
C Calligraphic display
D None of the above
Answer A
Marks
Unit 1

Id 77
Question Which statements about the beam penetration method for producing color display is /are true?

A It is used with raster scan monitor

B It is used with random scan monitors
C By using beam penetration method a wide range of colours can be obtained.

D It uses three electron guns, one for each red, green and blue

Answer B

Marks

Unit 1

Id 78
Question The phenomenon of having a continuous glow of a beam on the screen even after it is
removed is called as______
A Fluorescence

B Persistence

C Phosphorescence

D Incandescence

Answer B
Marks
Unit 1
Id 79
Question Refreshing on raster scan displays is carried out at the rate of_____
A 6o to 8o frames per sec

B 40 to 60 frames per sec

C 30 to 60 frames per sec

D none of the above

Answer B
Marks
Unit 1

Id 80
Question The amount of light emitted by the phosphor coating depends on the____

A number of electrons striking the screen

B speed of electrons striking the screen

C distance from the cathode to the screen

D None of the above

Answer A
Marks
Unit 1

Id 81
Question The maximum number of points that can be displayed without overlap on a CRT is referred to
as_____

A Resolution

B Persistence

C Attenuation
D none of the

Answer A

Marks
Unit 1

Id 82
Question Gray scale is used in______
A monitors that have color capability
B monitors that have no color capability

C random scan displays

D none of the above

Answer B
Marks
Unit 1

Id 83
Question Shadow mask methods Produce______
A wider range of colors than beam penetration

B smaller range of colors than beam penetration

C equal number of colors as in beam penetration

D none of the above

Answer A
Marks
Unit 1

Id 84
Question Resolution is defined as______
A the number of Pixels in the horizontal direction x The number pixels in the vertical direction

B the number of pixels in the vertical direction x The number pixels in the horizontal direction

C The number of pixels in the vertical direction + The number pixels in the horizontal direction
D the number of pixels in the vertical direction / The number pixels in the horizontal direction

Answer A
Marks
Unit

Id 85
Question Aspect ratio is_____

A the ratio of image's height to its width

B the ratio of image's width to its heights

C the ratio of window to viewport height

D the ratio of image's intensity levels

Answer
Marks
Unit 1

Id 86
Question Refresh rate is_____

A The rate at which the number of bit planes are accessed at a given time

B The rate at which the Picture is redrawn

C The frequency at which anti aliasing takes place

D The frequency at which the contents of the frame butter is sent to the display monitor
Answer D
Marks

Unit 1

Id 87
Question The distance between the pixels on the screen is called ____.
A OCR

B LCD
C Dot point

D Refresh rate

Answer C
Marks
Unit 1

Id 88
Question ____ acts as a anode in CRT.
A The phosphorous coating

B The glass panel

C The deflectors

D None of these

Answer A
Marks
Unit 1

Id 89
Question The larger the number of pixels of a computer monitor the higher it’s _____.
A Resolution

B Refresh rate

C Dot point

D Data transfer rate

Answer A
Marks
Unit 1

Id 90
Question The fastest type of printer is _____.
A Dot-matrix printer
B Inkjet printer

C Laser printer

D Plotter

Answer C

Marks
Unit 1

Id 91
Question The resolution of a printer is measured in terms of ______.
A Pixel density
B Dot pitch
C Hertz
D dpi

Answer D
Marks
Unit 1

Id 92
Question The process of determining the appropriate pixels for representing picture or
Graphics object is known as _________.
A scan conversion
B rasterization
C Both of them
D None of these
Answer B
Marks
Unit 1

Id 93
Question The process of representing continuous picture or graphics object as a collection of
Discrete pixels are called ______.
A Rasterization
B Scan conversion
C Both of them
D None of these
Answer B
Marks
Unit 1

Id 94
Question Which are not the graphics object displayed in computer graphics?

A Diagrams
B Text
C Pictures
D charts
Answer B
Marks
Unit 1

Id 95
Question Which of the following operations performed in computer graphics?

A Performing various projections

B Translation
C Rotation
D All of these
Answer D
Marks
Unit 1

Id 96
Question Which of the following effects computer graphics does allow before final representation

of the picture?

A Transparency
B Hidden surface removal
C Shading
D All of these
Answer D
Marks
Unit 1

Id 97
Question Which of the following statements is not true for computer graphics?

A It is not relationship between input and output devices

B It provides tools for producing pictures
C It controls the animation by adjusting the speed
D It enhances the ability to visualize real objects
Answer A
Marks
Unit 1

Id 98
Question Which is a tool of computer graphics in which the user can move and tumble

objects with respect to a stationary observer?

A Motion dynamics
B Update dynamics
C Both of these
D None of these
Answer A
Marks
Unit 1

Id 99
Question Which facility is provided by computer graphics to change the shape, color or

other properties of the objects being viewed?

A Motion dynamics

B Update dynamic

C (a) and (b)

D None of these
Answer B
Marks
Unit 1

Id 100
Question The graphs and charts are very useful in business, government and educational

organizations for what purpose

A Physical and economic functions

B Mathematical operations

C Decision making

D user interfaces

Answer C
Marks
Unit 1

Id 101
Question Office automation is_______
A creation and dissemination of

information

B in,-house creation and printing of documents

C containing text, tables, graphs and other forms

D All of these

Answer D
Marks
Unit 1

Id 102
Question The computer-aided drafting uses graphics to design______
A VLSI

B Structure of buildings

C Optical system and computer

networks

D All of these

Answer D

Marks
Unit 1

Id 103
Question Which of the following statement is true about process control ?
A To control processes in the industry from a remote control room.
B To control processing parameters at a time
C process systems are shown on the computer with graphic symbols and identifications

D all of these
Answer D
Marks
Unit 1

Id 104
Question Which of the following application of computer graphics used for geographic

maps, contour maps, population density maps ?

A Cryptography
B pie-charts
C Cartography
D Oceanographic charts
Answer C
Marks
Unit 1

Id 105
Question High level conceptual framework consists of_____
A input and output devices
B graphics system
C application program and model
D all of these
Answer D
Marks
Unit 1

Id 106
Question Application model is__________

A to store data and information of

objects attributes
B to capture all the data and objects to be pictured on the screen

C to accept the series of graphics

D all of these
Answer B
Marks
Unit 1

Id 107
Question What is resolution?

A The number of points per centimeter that can be plotted horizontally and vertically

B The number of points per meter that can be plotted horizontally and vertically

C The maximum number of points that can be displayed without overlap on the CRT

D The maximum number of points that can be displayed with overlap on the CRT

Answer A
Marks
Unit 1

Id 108
Question Which factors affect resolution?

A The type of phosphor

B The intensity to be displayed
C The focusing and deflection systems used in CRT
D All of these
Answer D
Marks
Unit 1

Id 109
Question What is aspect ratio ?
A Ratio of horizontal points to vertical point to produce equal length lines in both directions on
the screen.

B Ratio of vertical points to horizontal points to produce equal length lines in both directions on
the screen.

C Ratio of vertical points to horizontal points to produce equal length lines in one directions on
the screen

D Ratio of horizontal points to vertical point to produce equal length lines in one directions on the
screen.

Answer B
Marks
Unit 1

Id 110
Question Which is graphics display device that can access array to determine the intensity at which
each pixel should be displayed.
A CRT

B Screen

C Frame buffer

D all of these

Answer C
Marks
Unit 1

Id 111
Question ______is used to control the operation of the display device.
A Video controller

B CPU

C Monitor

D DMA controller

Answer A

Marks
Unit 1

Id 112
Question speciat area of memory is dedicated to graphics only in raster scan display called as____

A Frame buffer
B Video controller
C Display controller
D Monitor
Answer A
Marks
Unit 1

Id 113
Question ____ receives the intensity information of each pixel from Frame buffer and display on screen.

A CPU
B Monitor
C Video controller
D CRT
Answer C
Marks
Unit 1

Id 114
Question Which is not true statement for raster scan generator?

A It produces deflection signals.

B It consist of raster -scan generator x and y address registers and pixel value register.
C It receives the intensity information of each pixel from frame buffer.
D It controls the x and y address registers.
Answer C
Marks
Unit

Id 115
Question Which of the following are the output forms of video controller?

A RGB
B Monochrome
C NTSC
D All of these
Answer D
Marks
Unit 1

Id 116
Question Abbreviation for the NTSC_______

A Nationalize television system committee

B Nationalize television system commercial
C North television system commercial
D National television system committee
Answer D
Marks
Unit 1

Id 117
Question video mixing is defined as________

A Accepts information of two images simultaneously.

B Mixing is accomplished with hardware that treats a designated pixel value.
C The video image is placed on top of the frame buffer image.
D All of these.
Answer A
Marks
Unit 1

Id 118
Question The disadvantage of raster graphics display system is :

A It requires large number of frame buffer memory cycles needed for video scan out.

B The burden of image generation is on the main CPU

C Insufficient frame buffer memory bandwidth.

D All of these

Answer D
Marks
Unit 1

Id 119
Question The most commonly used output device in a graphics system is a…….
A video controller

B display controller

C video monitor

D CRT

Answer C
Marks
Unit 1

Id 120
Question The operation of most video monitors is based on the standard………

A raster scan display

B random scan display

C cathode ray tube

D output devices

Answer C
Marks
Unit 1

Id 121
Question which of the following statement(s) are true about CRT ?
A it is an evacuated glass tube.

B It is possible to control the point at which the electron beam strikes the screen, therefore the
position of the dot upon the screen deflecting the electron beam.

C It produces the images using vector scan and raster scan.

D All of these.

Answer D

Marks
Unit 1

Id 122
Question …….is connected as an T/O peripheral to the central processing unit.

A video controller
B I/o controller
C display controller
D None of these
Answer C
Marks
Unit 1
Id 123
Question which of the following are cornponents of vector display architecture ?

A CPU
B Display controller
C Display buffer memory and CRT
D All of these
Answer D
Marks
Unit 1

Id 124
Question …….converts the digital co-ordinate values to analog voltages for beam-defl ection
circuit.
A CRT
B VECTOR generator
C ChARACter generator
D None of these
Answer B
Marks
Unit 1

Id 125
Question A display buffer is……

A to store display list

B to refresh the buffer memory
C both (a) and (b)
D none of these
Answer C
Marks
Unit 1

Id 126
Question Which buffer stores the image in the forms of 0's and 1's ?
A Display buffer
B Refresh buffer
C Frame buffer
D ALL of these
Answer B
Marks
Unit 1

Id 127
Question Which is the most common method of displaying images on the CRT screen ?

A Vector scan
B Random scan
C Raster scan
D None of these
Answer C
Marks
Unit 1

Id 128
Question Additional bits are required…..

A when colour and intensity variations can be increased.

B when colour and intensity variations can be decreased.

C when colour and intensity variations can be displayed .

D none of these
Answer C
Marks
Unit 1

Id 129
Question On a black and white system with one bit per pixel,the frame buffer is called____
A Bitmap

B Pixmap
C Both of them

D None of these

Answer A
Marks
Unit 1

Id 130
Question For system with multiple bits per pixel,the frame buffer is called____
A Pixmap

B Bitmap

C Dot-matrix

D Stroke

Answer A
Marks
Unit 1

Id 131
Question VVhich of the following are properties of vector scan display ?
A Scan conversion is not reqtrired.

B Scan conversion hardware iS not required.

C Vector display draws a continuous and smooth lines.

D All of these.

Answer D
Marks
Unit 1

Id 132
Question The main disadvantage of vector Scan display is_______
A the refresh process is independent of the complexity of the image.
B vector display flickers when the number of primitives in the buffer becomes too large.

C vector display has ability to display areas filled with solid colours or patterns.

D scan conversion hardware required in vector scan display

Answer B

Marks
Unit 1

Id 133
Question Which of the foliowing are not the characteristics of raster scan display ?

A The refresh process is independent of the complexity of the image.

B It display mathemarically smooth line, polygons and boundaries of curved prirnitives.

C It has ability to displav areas filled with solid coiors or patterns.

D Scan conversion hardrvare is not required.
Answer D
Marks
Unit 1

Id 134
Question As compared to CRT, what are features reduced in flat-panel display ?
A volume
B weight
C power requirements
D All of these
Answer D
Marks
Unit 1

Id 135
Question Which of the following examples of emissive displays ?
A LED
B plasma panel
C (a) and (b)
D LCD
Answer C
Marks
Unit 1

Id 136
Question The disadvantage(s) of beam-penetration technique is / are :_________

A It is an inexpensive technique.
B It can display only four colours.
C The quality of picture is not good.
D All of these.
Answer D
Marks
Unit 1

Id 137
Question In beam-penetration technique, the outer layer is of _ and inner layer is of_____

A red, yellow
B red, green
C orange, red
D green, red
Answer B
Marks
Unit 1

Id 138
Question Shadow mask technique used in_____

A random scan display

B raster scan displaly
C Color TV
D All of these
Answer B
Marks
Unit 1

Id 139
Question Advantages of DVST are:__

A Refreshing of CRT is required.

B Very complex pictures can be displayed at very high resolution without flicker.
C lt does not have flat screen.
D All of these.
Answer D
Marks
Unit 1

Id 140
Question Which of the following are _______not tine component of DVST?
A Flood gun

B Focusing and deflection system

C Storage grid

D Electron gun

Answer D
Marks
Unit 1

Id 141
Question Which of the following are disadvantages of DVST?
A They do not display colors and are available with single color and line intensity

B Erasing requires removal of charge on the storage grid

C Erasing of screen produces unpleasant flash over the entire screen surface.

D All of these.

Answer D
Marks
Unit 1

Id 142
Question Which is not component of plasma panel display?
A Gal panel

B Vertical conductors

C Gas plate

D Storage Grid

Answer D
Marks
Unit 1

Id 143
Question The space between two glass plates is filled with ____ and sealed in plasma panel
display.
A phosphors gas

B oxygen gas

C neon-based gas

D nitrogen gas

Answer C

Marks
Unit 1

Id 144
Question _______ Produces a very steady image totally free of flicker.
A LED (Light Emitting Diode)
B LCD(Liquid Crystal Display)
C plasma panel display
D Flat panel display
Answer C
Marks
Unit 1

Id 145
Question Which of the following disadvantages of plasma panel display?
A Poor resolution of about 60 dots per inch.
B Requires complex addressing and wiring.
C Costlier than the CRTs.
D All of these.
Answer D
Marks
Unit 1

Id 146
Question Flat panel displays commonly use _______
A nematic liquid crystal
B polarizer
C transparent conductor
D none of these
Answer A
Marks
Unit 1

Id 147
Question Which of the following are the disadvantages of LCD displays ?

A Low cost
B Low weight and small size
C Low power consumption
D None of these
Answer D
Marks
Unit 1

Id 148
Question Which of the following statements (s) are true about active matrix LCD?
A In the ON state, polarized light passes through the material.
B To turn OFF the pixel, we apply a voltage to the intersecting conductors to align the
molecules.
C Both (a) and (b).
D Use of transistors causes the crystal to change their state quickly and also to control the
degree to which the state has been changed.
Answer D
Marks
Unit 1

Id 149
Question An RGB color system with 24 bits of storage per pixel is generally referred to as a _____

A full-color system
B RGB color system
C RGB monitors
D none of these
Answer A
Marks
Unit 1

Id 150
Question Which of the following is not the application of flat -panel display?
A TV monitors

B Calculators

C Laptop computer

D CRT

Answer D
Marks
Unit 1

Id 151
Question Color CRTs in graphics system are design as-----
A RGB color system
B Full color system

C True color system

D RGB monitors

Answer D
Marks
Unit 1

Id 152
Question ----- are described in units of cycles per second or hertz.
A Refresh rates

B Aspect ratio

C Resolution

D None of these

Answer A
Marks
Unit 1

Id 153
Question Each frame is displayed in two passes using an -----refresh procedure.
A interacted

B interlaced

C interleaved

D None of these

Answer B

Marks
Unit 1

Id 154
Question Random-scan system is designed for -----
A Display filled with solid patterns
B Line-drawing application
C Not to display realistic shaded scenes
D None of these
Answer B
Marks
Unit 1

Id 155
Question Which of the following are not the interactive devices?
A Data glove
B Light pen
C Trackball
D Scanner
Answer D
Marks
Unit 1

Id 156
Question The devices which give input to the graphics system and provide necessary feedback to the user
about the accepted input are known as------

A Interactive devices
B Input /output devices
C Interfacing devices
D Display devices
Answer A
Marks
Unit 1

Id 157
Question Which of the following process of keyboard used for entering text and numbers?

A Keyboarding
B writing
C (a) And (b)
D None of these

Answer A
Marks
Unit 1

Id 158
Question Which of the following is primary input device?

A Keyboard
B Mouse
C joystick
D Light pen

Answer A
Marks
Unit 1

Id 159
Question Which of the following are the types of keys?

A The keys that produces letters

B The key that produces numbers
C The keys having specific function
D All of these
Answer D
Marks
Unit 1

Id 160
Question Which of the following are not subgroup of specific function keys?

A CAPSLOCK
B ENTER
C TAB and BACK SPACE
D All of these
Answer D
Marks
Unit 1

Id 161
Question Which of the following are the function of ‘ENTER’ key?

A Allows you to finalize data entry

B Use to choose commands
C Used to select options in many programs
D All of these
Answer D
Marks
Unit 1

Id 162
Question Which of the following are the modifier keys?
A SHIFT
B CTRL(Control)
C ALT(Alternate)
D All of these
Answer D
Marks
Unit 1

Id 163
Question Which of the following statements are true about modifier keys?
A Modify the input of other keys.
B Also known as alphanumeric keys.
C Move around the screens without using mouse.
D None of these.
Answer A
Marks

Unit 1

Id 164
Question ------- toggles between states for the numeric keypad ?
A Caps lock
B Num lock
C (a) and (b)
D None of these.
Answer B
Marks
Unit 1

Id 165
Question Which of the following are cursor movement keys?
A The arrow keys
B Home key
C Page up and page down key
D All of these
Answer D
Marks
Unit 1

Id 166
Question The key used to ‘back up’ one level in a multilevel environment is called as -----
A Back space key
B Enter key

C Escape key
D CTRL key
Answer C
Marks
Unit 1

Id 167
Question Which of the following is stationary pointing device that uses small touch –sensitive
surface ?
A Trackball
B Mouse
C Trackpad
D All of these
Answer C
Marks
Unit 1

Id 168
Question Which of the following is advantages of light pen

A Allows to user to point to displayed objects or draw on the screen

B Works with any CRT-based monitor

C Does not work with LCD screen projectors or other display devices
D All of these
Answer C
Marks
Unit 1

Id 169
Question -----are the most versatile and commonly used scanners.
A Sheet fed scanners
B Handheld scanners
C Flatbed scanners
D Drum scanners
Answer C
Marks
Unit 1

Id 170
Question The sonic tablets mainly used in -----

A 2D positioning devices

B 3D positioning devices

C 2D pointing devices

D 3D pointing devices

Answer B
Marks
Unit 1

Id 171
Question Which of the following device used bistable memory so that the necessity to continuously
refresh the display is eliminated.

A A.C activated plasma display

B D.C activated plasma display

C Hybrid A.C/D.C activated plasma display

D None of these

Answer A
Marks
Unit 1

Id 172
Question ----- tablets use sound waves to detect a stylus position

A Graphics

B Digitizer

C Acoustic

D None of these

Answer C
Marks
Unit 1

Id 173
Question Which of the following are statement is true about data glove?
A Construct with a series of sensor that detect hand and finger motion

B Provide information about the position and orientation of the hand

C Input from the glove can be used to position or manipulate object in a virtual scene
D All of these

Answer D
Marks
Unit 1

Id 174
Question ………allows the user to point at the screen directly with a finger to move the cursor around on
the screen.

A Mouse

B Trackballs

C Touch panel

D Joysticks

Answer C
Marks
Unit 1

Id 175
Question Which of the following are the most significant parameters of touch-panel ?

A The amount of pressure required for Activation

B Transparency

C Resolution

D All of These

Answer D
Marks
Unit 1

Id 176
Question ……… stores a wide variety of image data in tagged fields.
A Bmp

B Jpeg

C TIFF

D None of these

Answer C
Marks
Unit 1

Id 177
Question Which of the following thing(s) made TIFF format to be used over a wide variety of computer
systems ?

A TIFF is versatile

B TIFF open-ended and flexible

C Hundreds of different types of tagged fields are available and more can be developed as needed

D All of these

Answer D

Marks
Unit 1

Id 178
Question The largest possible TIFF file is 232- bytes

in length.
A 216

B 232
C 248
D None of these
Answer B
Marks
Unit 1
Id 179
Question The image file header in the TIFF file

format is…….
A 8 bytes
B 16 bytes
C 24 bytes
D 32 bytes
Answer A
Marks
Unit 1

Id 180
Question A TIFF file begins with an…….
A image file header
B version number
C IFD offset
D IFD
Answer A
Marks
Unit 1

Id 181
Question The first word of the TIFF file specifies the……..used within the file.

A version number
B byte order
C image file directory
D IFD offset
Answer B
Marks
Unit 1

Id 182
Question In TIFF file format each IFD is limited to total of………..tag fields.
A 64
B 128
C 256
D 512
Answer C
Marks
Unit 1

Id 183
Question TIFF class B belongs to…………..

A gray-scale image
B Fax

C bi-level (binary) image

D palette color image

Answer C
Marks
Unit 1

Id 184
Question TIFF class G belongs to………..

A gray-scale image
B Fax
C Bi-level (binary) image
D palette color image
Answer A
Marks
Unit 1

Id 185
Question TIFF class P belongs to…………

A Gray-scale image
B Fax
C Bi-level (binary) image
D Palette color image
Answer D
Marks
Unit 1

Id 186
Question Which of the following statement(s) is/are false in case TIFF format

A TIFF format is complex file format as compared to BMP file format.

B It is independent on any computer architecture and operating system.

C It does not support many compression schemes. Palette color image.

D It uses pointers

Answer C
Marks
Unit 1

Id 187

Question which of the following statement(s)

is/are true in case TIFF format ?

A TIFF format is complex file format as

Compared to BMP file format.

B It is independent on any computer

architecture and operating system.

C ft does not support multiple images

In one file.

D All of these.

Answer D
Marks
Unit 1
Id 188
Question ___is a multi-platform toolkit for crating graphical user interface?

A TIFF

B GTk+

C MS office

D None of these

Answer B
Marks
Unit 1

Id 189
Question Which of the following statements is/are true in case GTK+?.
A GTK+ is a cross platform.

B It written in the c programming language.

C GTK+ is an object oriented widget toolkit.

D All of these

Answer D
Marks
Unit 1

Id 190
Question GTK+ is written in the ____ programming language .
A C

B C++

C Java

D Python
Answer A

Marks
Unit 1

Id 191
Question Which of the following language the GTK+ does support?
A C
B C++
C Perl
D All of these
Answer D
Marks
Unit 1

Id 192
Question GIMP stands for ____.
A Generalized image manipulation program
B GNU image maintenance program
C GNU image manipulation program
D Graphics image manipulation program
Answer C
Marks
Unit 1

Id 193
Question ____is a low level core library that forms the basis of GTK+
A GLib
B Pango
C ATK
D Cairo
Answer A
Marks
Unit 1

Id 194
Question ___a library for 2D graphics with support for multiple output devices in a GTK+.

A GLib
B Pango
C ATK
D Cairo
Answer D
Marks
Unit 1

Id 195
Question _____a library for a set of interfaces providing accessibility in GTK+.

A Glib
B Pango
C ATK
D Cairo
Answer C
Marks
Unit 1

Id 196
Question ______a library for layout and rendering of a text with an emphasis on internationalization in
GTK+.

A Glib
B Pango
C ATK
D Cairo
Answer B
Marks
Unit 1

Id 197
Question The basic geometric structures provided
by graphics primitive packages are
referred to as
A inputs
B input primitives
C Outputs
D output
Answer D
Marks
Unit 2

Id 198
Question _____ and ____are the basic output primitives.
A Points, line segments
B Points, circles
C Line segments, curves
D Circles, polygon
Answer A
Marks
Unit 2

Id 199
Question ______ is the fundamental element of the
Picture representation.
A Line segment
B Point
C Circle
D Polygon
Answer B
Marks
Unit 2

Id 200
Question Minimum ______ Points are required to represent a line
A two
B Three
C Four
D None of these
Answer A
Marks
Unit 2

Id 201
Question If two points used to specify a line are
(*r, yr) and (x2, y2), then the equation of a line is given as ___
A

C
D
Answer B
Marks
Unit 2

Id 202
Question The equation of a line in slope intercept form is given as ________
A
B
C
D
Answer C
Marks
Unit 2

Id 203
Question In equation of a line, y = mx+ b, b is _____
A slope of a line be constant
B constant
C the height at which the line crosses
The x-axis.
D the height at which the line crosses
the y-axis.
Answer D
Marks
Unit 2
Id 204
Question when a line is represented by a equation
in general form as, rx+ sY + t = 0, the
values of r, s and t are taken so that _______
A

D
Answer B
Marks
Unit 2

Id 205
Question When a line is represented by equations,

Answer A
Marks
Unit 2

Id 206
Question

B
C

Answer B
Marks
Unit 2

Id 207
Question lf two lines are parallel, they have----------
slope.
A difrerent
B Zero
C same
D none of these
Answer C
Marks
Unit 2

Id 208
Question

Answer B
Marks
Unit 2

Id 209
Question

Answer A
Marks
Unit 2

Id 210
Question When we say a line, it
A extends forward
B extends backward
C ends at two points
D extends forever both
backward
Answer D
Marks
Unit 2

Id 211
Question A line sesment ---------------
A extends forward
B extends backward
C ends at two points
D exdends f,orever both forward and backword
Answer C
Marks
Unit 2

Id 212
Question

A
B
C
D
Answer D
Marks
Unit 2

Id 213
Question

A
B
C
D
Answer B
Marks
Unit 2

Id 214
Question

A
B
C
D
Answer A
Marks
Unit 2

Id 215
Question

Answer C
Marks
Unit 2

Id 216
Question If two endpoints of a line segment are

P1 (x1, y) and P2(x2, yz), then the

mid-point of the line segment is

A

Answer A
Marks
Unit 2

Id 217
Question A vector has ____.
A a single direction

B A length

C two directions

D Both a & b

Answer D
Marks
Unit 2

Id 218
Question If two vectors are V1 [ D*1, Dy1 ] and V2

lD*2, Dyrl , then the addition of V1 and V2 is given by _________.

A

Answer B
Marks
Unit 2

Id 219
Question lf a vector is to be multiplied by a number n, then __________.
A

Answer A
Marks
Unit 2

Id 220
Question The multiplicationof a vector and the reciprocal of its length is equal to __________.
A zero
B one
C can't define
D none of above
Answer B
Marks
Unit 2

Id 221
Question The process of turning on the pixels for a

line segment is called __________.

A vector generation
B line generation
C pixel generation
D (a) & (b)
Answer D
Marks
Unit 2

Id 222
Question The line drawn using line drawing algorithm should be displayed with _________brightress.

A varying
B constant
C minimum
D Maximum
Answer B
Marks
Unit 2

Id 223
Question The desired characteristic(s) of line is /are ____________.

A it should appear as a straight line

B it should start and end accurately
C it should be drawn rapidly
D all of above
Answer D
Marks
Unit 2

Id 224
Question The desired characteristic(s) of line is/are __________.

A it should start and end accurately

B it should be displayed with constant brightness
C it should be drawn rapidly
D all of above
Answer D
Marks
Unit 2

Id 225
Question The horizontal and vertical lines drawn by line drawing algorithm are _________.

A straight
B zig-zag
C curved
D none of these
Answer A
Marks
Unit 2

Id 226
Question The horizontal and vertical lines drawn
by line drawing algorithm have
______width.
A less
B more
C constant
D None of these
Answer C
Marks
Unit 2

Id 227
Question The width of 45" line drawn by line
drawing algorithm is______
A constant
B Non constant
C minimum
D maximum
Answer B
Marks
Unit 2

Id 228
Question The brightness of the line is dependent on the
______of the line.
A orientation
B start and end Points
C length
D none of these
Answer A
Marks
Unit 2

Id 229
Question The horizontal and vertical lines appear _________the 45" line.
A straight than
B brighter than
C longer than
D none of these
Answer B
Marks
Unit 2

Id 230
Question DDA stands for_________
A data differential algorithm
B digital data algorithm
C digital differential analyzer
D digital differential algorithm

Answer C
Marks
Unit 2

Id 231
Question The slope of a straight line is given as
A

Answer A
Marks
Unit 2

Id 232
Question The slope of a straight line is given as__________
A

D
Answer B
Marks
Unit 2

Id 233
Question In DDA line drawing algorithm, Ax or Ay,
whichever is _________ is chosen as one raster unit.
A 1
B 0
C smaller
D larger
Answer D
Marks
Unit 2

Id 234
Question Sig. function makes the DDA line drawing algorithm work in ________quadrants.
A I and II
B I and III
C II and III
D all
Answer D
Marks
Unit 2

Id 235
Question If a line is to be drawn from (0, 0) to
(4, 5) using DDA line drawing algorithm' the third point to be plotted is______
A (1,2)
B (2,3)
C (3,2)
D (2,1)
Answer A
Marks
Unit 2
Id 236
Question When a line with end-points (20, 10) and
(30, 18) is to be drawn using DDA line
drawing algorithm ,
_____
is chosen as one raster unit.
A
B
C (a) or (b)
D any of above
Answer A
Marks
Unit 2

Id 237
Question l4trhen a line is to be drawn from ( 0, 0) to
(6, 6) using DDA line drawing algorithm'
the initial values for x and Y are_______
A 0.5,0.5
B -0.5,-0.5
C 0,-0.5
D 0.5,0
Answer B
Marks
Unit 2

Id 238
Question The DDA line drawing algorithm is_______________ dependent..
A orientation
B length
C end points
D display.
Answer A
Marks
Unit 2

Id 239
Question The end point accuracy of DDA line drawing algorithm is __________.
A Good
B better
C Best
D poor
Answer D
Marks
Unit 2

Id 240
Question Floating point arithmetic in DDA algoritlrm is ________.
A Time efficient
B time consuming
C Fast
D slow
Answer B
Marks
Unit 2

Id 241
Question DDA line drawing algorithm for calculations pixel positions is _______ the
direct use of equation y = mx+ b.
A slower than
B faster than
C of equal speed to that of
D none of these
Answer B
Marks
Unit 2

Id 242
Question Algorithms those use the outputs of the previous iteration, in the computation of
outputs in the current iteration are called ______algorithms.
A successive approximation
B incremental
C double-referencing
D scan-line
Answer B
Marks
Unit 2

Id 243
Question The advantage of Bresenham's algorithm over conventional DDA algorithm is ________.
A no rounding operation
B use of integer addition and subtraction
C producing smooth appearance
D less number of iterations
Answer B
Marks
Unit 2

Id 244
Question If one octant of the circle is generated, to complete the generation of full circle,
how many reflections are required ?
A 1
B 2
C 4
D 8
Answer D
Marks
Unit 2

Id 245
Question The best line drawing algorithm among all possible line drawing algorithm is ______.
A DDA
B algorithm which uses direct equation of line
C Bresenham's algorithm
D None of them
Answer C
Marks
Unit 2
Id 246
Question The value of initial decision parameter in Bresenham's line drawing algorithm for l m l <
1 is:
A
B
C
D
Answer A
Marks
Unit 2

Id 247
Question The value of initial decision parameter in mid point circle drawing algorithm is :;::.
A 3-2r
B 5/4 - r
C 1-2r
D 3-r
Answer B
Marks
Unit 2

Id 248
Question Points P1(3.2, 7.8) and P2(3.7, 7.1) are both represented by pixel ___________.
A (3,8)
B (4,7)
C (3,7)
D (4,8)
Answer C
Marks
Unit 2

Id 249
Question Pixel phasing is an anti-aliasing technique based on ______.
A hardware
B software
C both hardware and software
D none of these
Answer A
Marks
Unit 2

Id 250
Question
The anti-aliasing technique which allows shift of and of a pixel diameter
enabling a closer path of a line is _________.
A pixel phasing
B filtering
C intensity compensation
D sampling technique
Answer A
Marks
Unit 2

Id 251
Question Pixel phasing is a technique for _______.
A shading
B anti-aliasing
C hidden line removal
D none of the above
Answer B
Marks
Unit 2

Id 252
Question A line connecting the points (1, 1) and
(5, 3) is to be drawn , using the DDA
algorithm. Find the values of x and y increments.
A x-increment=1; y-increment=1
B x-increment=0.5; y=increment=1
C x-increment= 1; y=increment-0.5
D None of the above
Answer C
Marks
Unit 2

Id 253
Question Which of the following algorithms can be
used for circle generation ?
A Bresenham's algorithm
B Midpoint algorithm
C Both (a) and (b)
D None of the above
Answer C
Marks
Unit 2

Id 254
Question Aliasing means ------.
A Rendering effect
B Shading effect
C Staircase effect
D Cueing effect
Answer C
Marks
Unit 2

Id 255
Question Slope of the line joining the points(1,2) and (3,4) is
A 0
B 1
C 2
D 3
Answer B
Marks
Unit 2

Id 256
Question -----is a global character set that enables information from any language to
be stored using a single character set.
A Gcode
B Unicode
C Mcode
D Globle code
Answer B
Marks
Unit 2

Id 257
Question ------- provides a unique code value for
every character, regardless of the
platform, program or language.
A Gcode
B Unicode
C Mcode
D Globalcode
Answer B
Marks
Unit 2

Id 258
Question ------- uses 8-bit encoding.
A UTF-8
B UCS-2
C UTF-16
D None of these
Answer A
Marks
Unit 2

Id 259
Question ------ uses 16-bit encoding.
A UTF-8
B UCS-2
C UTF-16
D Both b and c
Answer D
Marks
Unit 2

Id 260
Question ------ uses variable-width encoding.
A UTF-8
B UCS-2
C UTF-16
D Both b and c
Answer A
Marks
Unit 2

Id 261
Question One Unicode character can be 1 byte, 2 bytes, 3 bytes or 4 bytes in ------ encoding.
A UTF-8
B UCS-2
C UTF-16
D None of these
Answer A
Marks
Unit 2

Id 262
Question In UTF-8, European scripts are represented in -------
A 1 byte
B either 1 or 2 bytes
C 3 bytes
D 4 bytes
Answer B
Marks
Unit 2

Id 263
Question In UTF-8, Asian scripts are represented in ------
A 1 byte
B either 1 or 2 bytes
C 3 bytes
D 4 bytes
Answer C
Marks
Unit 2

Id 264
Question In UTF-8, Supplementary characters are represented in-------
A 1 byte
B either 1 or 2 bytes
C 3 bytes
D 4 bytes
Answer D
Marks
Unit 2

Id 265
Question ----- is the Unicode encoding supported on UNIX platforms.
A UTF-8
B UCS-2
C UTF-16
D Both b and c
Answer A
Marks
Unit 2

Id 266
Question ----- uses 16-bit encoding.
A UTF-8
B UCS-2
C UTF-16
D Both b and c
Answer A
Marks
Unit 2

Id 267
Question …………….is the Unicode encoding supported on Windows platforms.
A UTF-8
B UCS-2
C UTF-16
D Both b and c
Answer D
Marks
Unit 2

Id 268
Question …………………..uses 15 bit encoding
A UTF-8
B UCS-2
C UTF-16
D Both b & c
Answer D
Marks
Unit 2

Id 269
Question ………………..uses fixed-width encoding.
A UTF-8
B UCF-2
C UTF-16
D Both b & c
Answer B
Marks
Unit 2

Id 270
Question In…………code each character is 2 bytes
A UTF-8
B UCS-2
C UTF16
D Both b & c
Answer B
Marks
Unit 2

Id 271
Question In……..code each character is 2 or 4 bytes
A UTF-8
B UCS-2
C UTF-16
D Both b & c
Answer C
Marks
Unit 2

Id 272
Question ---------code provides faster string processing.
A UTF-8
B UCF-2
C UTF-16
D Both b & c
Answer B
Marks
Unit 2

Id 273
Question ……….is the Unicode encoding used by java and Microsoft Windows NT 4.0
A UTF-8
B UCS-2
C UTF-16
D Both b & c
Answer B
Marks
Unit 2
Id 274
Question ………….is 16-bit encoding & it supports the supplementary characters.
A UTF-8
B UCS-2
C UTF-16
D Both b & c
Answer C
Marks
Unit 2

Id 275
Question ………..is the main Unicode encoding used by Microsoft Windows 2000.
A UTF-8
B UCS-2
C UTF-16
D Both b & c
Answer C
Marks
Unit 2

Id 276
Question ………..provides better compatibility with java and Microsoft clients.
A UTF-8
B UCS-2
C UTF-16
D Both b & c
Answer C
Marks
Unit 2

@PICT 2012-2016

Q1. A pixel may be defined as

a) Smallest size object

b) Larger size object
c) Medium size object
d) None of these

Answer: a

Q2. A line can be represented by

a) One point
b) Two points
c) Three points
d) Four points

Answer: b

Q3. The function of scan line polygon fill algorithm are_________________

a) Find intersection point of the boundary of polygon and scan line
b) Find intersection point of the boundary of polygon and point
c) Both a & b
d) None of these

Answer: a

Q4. Bresanham circle algorithm uses the approach of

a) Midpoin
b) Point
c) Line
d) None of these

Answer: a

Q5. The side effect of scan conversion are

a) Aliasing
b) Anti aliasing
c) Both a & b
d) None of these

Answer: a

Q6. The process of reducing aliasing is called

a) Resolution
b) Anti aliasing
c) Sampling
d) None of these

Answer: b

Q7. Two basic technique for anti aliasing in ray tracing algorithm are

a) Pixel sampling and super sampling

b) Adaptive sampling and super sampling
c) Pixel sampling and super sampling
d) None of these

Answer: b

Q8. The problem of aliasing are

a) Staircase
b) Unequal brightness
c) Picket fence problem
d) All of these

Answer: d

Q9. The technique to minimizing aliasing are

a) Increased no of resolution
b) Modify pixel intensities
c) Super sampling
d) All of these

Answer: d

Q10. To generate the characters, which are required

a) Hardware
b) Software
c) Both a & b
d) None of these

Answer: c

Q11. The method which uses array of dots for generating a character is called

a) Stoke method
b) Bitmap method
c) Star bust method
d) None of these

Answer: b

Q12. What is name of temporary memory where the graphics data is stored to be displayed
on screen

a) RAM
b) ROM
c) Frame buffer
d) None
Answer: c

Q13. The division of the computer screen into rows and columns that define the no. of pixels
to display a picture is called

a) Persistence
b) Resolution
c) Encapsulated post script
d) None

Answer: b

Q14. Two types of coordinates are

a) Positive and negative coordinates

b) Absolute and relative coordinates
c) Both a & b
d) None

Answer: b

Q15. The Cartesian slope-intercept equation for a straight line is

a) y = m.x + b
b) y = b.x + m
c) y = x.x + m
d) y = b + m.m

Answer: a

Q16. On raster system, lines are plotted with

a) Lines
b) Dots
c) Pixels
d) None

Answer: c

Q17. Expansion of line DDA algorithm is

a) Digital difference analyzer

b) Direct differential analyzer
c) Digital differential analyzer
d) Data differential analyzer

Answer: c
Q18. Which algorithm is a faster method for calculating pixel positions?

a) Bresenham’s line algorithm

b) Parallel line algorithm
c) Mid-point algorithm
d) DDA line algorithm

Answer: a

Q19. The disadvantage of line DDA is

a) Time consuming
b) Faster
c) Neither a nor b
d) None

Answer: a

Q20. An accurate and efficient raster line-generating algorithm is

a) DDA algorithm
b) Mid-point algorithm
c) Parallel line algorithm
d) Bresenham’s line algorithm

Answer: d

Q21. In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter
Pk is______

a) Positive
b) Equal
c) Negative
d) Option a or c

Answer: c

Q22. Which is the best line algorithm to balance the processing load among the
processors?

a) Parallel line algorithm

b) DDA line algorithm
c) Bresenham’s line algorithm
d) Position Bresenham’s line algorithm

Answer: a
Q23. The algorithm which uses multiple processors to calculate pixel positions is

a) Midpoint algorithm
b) Parallel line algorithm
c) Bresenham’s line algorithm
d) All the above

Answer: b

Q24. Area-sampling is also known as

a) Pre-filtering
b) Pixel phasing
c) Post-filtering
d) Anti-aliasing

Answer: a

Q25. Raster objects can also be anti-aliased by shifting the display location of pixel
areas is known as

a) Super-sampling
b) Pixel shaping
c) Pixel phasing
d) Any of these

Answer: c

Q26. An array of values specifying the relative importance of sub-pixel is referred

as________ of sub-pixel weights.

a) Sub-mask
b) Mask
c) Pixel phasing
d) Pixel weighting

Answer: c

Q27. The technique that is more accurate method for anti-aliasing lines is

a) Filtering
b) Area-sampling
c) Super-sampling
d) None

Answer: a
Q28. Another method for determining the percentage of pixel area within a boundary
is

a) Mid-print algorithm
b) Mid-point algorithm
c) Pixel intensity
d) By using inquiry functions

Answer: b

Q29. The anti - aliasing technique which allows shift of 1/4,1/2 and 3/4 of a pixel diameter
enabling a closer path of a line is ?

a) Pixel phasing
b) Filtering
c) Intensity compensation
d) Sampling technique

Answer: a

Q30. Raster scan systems display a picture from a definition in a

a) Display file program

b) Frame buffer
c) Display controller
d) None of the above

Answer: b

Q31. A line connecting the points (1, 1) and (5, 3) is to be drawn, using the DDA algorithm.
Find the value of x and y increments.

a) x-increment =1 ; y-increment=1

b) x-increment =0.5 ; y-increment=1

c) x-increment =1 ; y-increment=0.5

d)none of these

Q32. For a black and-white raster system, on the other hand, a point is plotted by setting the
bit value corresponding to a specified screen position within the frame buffer to ----------------.

a) 1
b) 0
c) 0.5
d) None of above
Answer: a

Q33. A computed line position of (10.48, 20.51), for example, would be converted to pixel
position ________________.

a) (10, 21)
b) (11, 20)
c) (11, 21)
d) (10, 20)

Answer: a

Q34. Rounding of coordinate values to integers causes lines to be displayed with a

_______________ appearance.

a) Stair-step
b) Distorted
c) Curve
d) None of above

Answer: a

Q35. Scan lines are numbered consecutively from 0, starting at the bottom of the screen;
and pixel columns are numbered from 0,___________ across each scan line.

a) left to right
b) right to left
c) top to bottom
d) bottom to top

Answer: a

Q36. Scan lines are numbered consecutively from 0, starting at the_________of the
screen; and pixel columns are numbered from 0, left to right across each scan line.

a) bottom
b) left
c) right
d) top

Answer: a

Q37. The Cartesian slope-intercept equation for a straight line is

a) y = m.x+b
b) y = x + b
c) y = x + m.b
d) y = x + 1
Answer: a

Q38. Given that the two endpoints of the segment are specified at positions (x1, y1) and (x2,
y2), value for the slope m is calculated as:

a) [(y2-y1) / (x2-x1)]
b) [(x2-x1) / (y2-y1)]
c) [(x2-y2) / (x1-y1)]
d) None of above

Answer:

Q39. Given that the two endpoints of the segment are specified at positions (x1, y1) and (x2,
y2), value for y intercept b is calculated as:

a) b = y1 – m.x1
b) b = x1 – m.y1
c) b = y1 – x1 / 2
d) None of above

Answer: a

Q40. For lines with m = 1 and Δx = Δy ; the horizontal and vertical deflections voltages are
_______.

a) equal

b) unequal

c) low

d) high

Answer: a

Q41. For lines with m = 1 and ___________; the horizontal and vertical deflections voltages
are equal.

a) Δx = Δy

b) Δx < Δy

c) Δx > Δy
d) None of above

Answer: a

Q42. An accurate and efficient raster line-generating algorithm, developed by Bresenham,

scan converts lines using only incremental___________ calculations that can be adapted to
display circles

a) fractional

b) integer

c) complex

d) none of above

Answer: b

Q43. As in Bresenham's line algorithm, the midpoint method calculates pixel positions along
the circumference of a circle using__________ additions and subtractions

a) fractional

b) integer

c) complex

d) none of above

Answer: b

Q44. Scan lines are numbered consecutively from 0, starting at the bottom of the
screen; and_________________ are numbered from 0, left to right across each scan
line.

a) pixel columns
b) pixelrows
c) lines
d) None of above

Answer: a

Q45. . A computed line position of (20.48, 34.51), for example, would be converted to pixel
position ________________.
a) (20, 34)
b) (21, 34)
c) (34, 21)
d) (20, 35)

Answer: d

46) For a thick line width of a line has value __________________

a.1

b.2

c.none

d.gerater than one

ans.d

47) For a gentle slope line m value is _____________

a)less than one

b)greater than one

c)any value

d) None of above

Ans.a

48) For a gentle slope line value of x coordinate increase by ________ where as value of y
coordinate increases by ________

a. 1,m

b.m,1

c.1,1

d. None of above

Ans.a

49)For a sharp slope line value of x coordinate increase by ________ where as value of y coordinate
increases by ________

a. 1/m, m

b.1/m, 1
c.1,1

d. None of above

Ans.a

50) For a sharp slope line m value is _____________

a)less than one

b)greater than one

c)any value

d) None of above

Ans.b

51) DDA stands for _____________________

a. Digital differential Arithmetic

b. Digital differential Analysis

c. Digital differential Analyser

D.all of above

Ans.b

52) ____________ is example of Incremental method

a. Midpoint circle generation

b. Bresenham’s circle generation

c. DDA

d. All of above

Ans.c
53) _____________ is decision parameter in DDA Line drawing algorithm

a.Error function

b.midpoint of two point

c.sum variable

d.slope of a line

Ans.d

54) _____________ is decision parameter in Bresenham’s Line drawing algorithm

a.Error function

b.midpoint of two point

c.sum variable

d.slope of a line

Ans.a

55) _____________ is decision parameter in Midpoint circle Generation algorithm

a. Error function

b. midpoint of two point

c. sum variable

d. slope of a line

Ans. b

56) _____________ is decision parameter in Bresenham circle generation algorithm

a.Error function

b.midpoint of two point

c.sum variable

d.slope of a line
Ans.c

57)_______________ are round off functions used in DDA

a.Ceil(),Floor()

b)rnd()

c)abs()

d)fact()

Ans.a

58) ______________ algorithm supports floating point operations

a)Bresenham’s

b) DDA

c) scan line

d) All of above

Ans.b

59) ______________ algorithm supports floating point operations

a)Bresenham’s

b) DDA

c) scan line

d) All of above

Ans. A

60) There are _________________ character generation method

a.1

b.2

c.3
d.4

Ans. _c

61) ______________ is not a character generation method

a)Stroke Method

b)Scan line

c)Bit map

d)star bust method

Ans. b

62) ______________ uses 24 bit star bust pattern

a)Stroke Method

b)Scan line

c)Bit map

d)star bust method

Ans .d

63) The process of Turning on pixels for a line segment is called ______________

a. scalar Generation

b. Vector Generation

c)Transformation

d)Scaling

Ans. b

64)Gentle slope lines are closer to ___________ l lines

a)Horizontal

b)vertical
c)parallel

d)All of above

Ans. a

65)___________ slope lines are closer to vertical lines l lines

a)Gentle

b)Sharp

c) random

d) All of above

Ans. a

66) A line with start point (0,0) and endpoint (4,6) is __________ line

a) Gentle

b) sharp

c) slope value one

d) All of above

Ans. b

67) A line with start point(0,0) and (6,4) is _______________ line

a)sharp

b)Gentle

c) slope value one

d)All of above

Ans. b

68) There are _____________ character generation methods

a) 1
b) 2
 c) 3
d) 4
ANS. C

69) You can’t draw a character with rounded shape in _____________ method

a).Bitmap method

b)Stroke method

c) Starbust method

d) all of above

Ans.b

Q70) __________ is another name for Bitmap method

a) Dot marix
B) Stroke method
C) Star burst
D) None of above
Ans. a

Q71)Starbust method requires ______________ memory

a) less
b) More
c) Huge
d) Very Less
Ans.b

Q72)In starbust method each character has ____________ bit code

a)8

b) 16

c)24

d)32

Ans. c
Q73) In _____________ line appear as like a stair case

a) antialiasing
b) Aliasing
c) Sampling
d) Supersampling
Ans.b

Q74) Aliasing generally appears with _________________ resolution screen

a) High
b) Very High
c) Low
d) Moderate
Ans.c

Q75) In antialiasing we ___________________ intensities of pixel

a) adjust
b) increarse
c) Decrease
d) None of above
Ans. a

Q76) Aliasing effect can be reduced by _____________ resolution

a) decreasing
b) Multiplying
c) Increasing
d) All of above
Ans. c

Q77)Increasing resolution is

a) Cheap
b) Costly
c) Can’t say
d) Not possible
Ans.b

Q78)___________ is process of adjusting intensities of a pixel

a) Aliasing

b) Antialiasing

c) postfiltering
d) sampling

Ans.b

Q79)Process of shifting display location of pixel areas is called as _________________

a) Weighted area sampling

b) Filtering
c) Supersampling
d) Pixel Phasing
Ans. d

Q80) Circle drawing uses _____________ symmetry

a) 1-way
B) 2-way
C) $-way
D) 8-way
Ans. d

Q81) In Bresnham’s circle generation _________________ is decision variable

a)mid-point

b)sum-variable

c) slope

d)error function

Ans b

Q 82) For a Bresenham’s line drawing initial value of G is given as

a) G=0

b) G=2*dy-dx

c)g=x/y

d) g=dy/dx

Ans b
Q83)In bresenham’s line drawing if(G>0) condition is true g will be updated as

a)G=0

b)G=G+(2*dy-2*dx)

c)G=G+2*dy

d) G=G*G

Ans.b

Q84)In bresenham’s line drawing if(G>0) condition is false g will be updated as

a)G=0

b)G=G+(2*dy-2*dx)

c)G=G+2*dy

d) G=G*G

Ans.c

Q85) For a circle drawing algorithm initial values of X & Y coordinates are _________

a)0,r

b)r,0

c)r,r

d)1,1

Ans a

Q86) For a gentle slope lines value of Xinc any Yinc are _____________

a)1,m

b)m,1

c)1,1

d)m,m
Ans.a

Q87) For a sharp slope lines value of Xinc any Yinc are _____________

a)1,m

b)1/m,1

c)1,1

d)m,m

Ans.b

Q88) For line with slope value equals to one value of Xinc any Yinc are _____________

a)1,m

b)m,1

c)1,1

d)m,m

Ans.c

Q89) DDA is ____________ efficient in nature

a)Less

b)more

c) can’t say

d) None of above

Ans. a

Q90) Bresenham’s is ____________ efficient in nature

a)Less

b)more
c) can’t say

d) None of above

Ans. b

Q91) A line with start & endpoints (1,1)(5,3) respectively endpoints actual intermediate pixel
positions are _____________

a)(2,0.5)(3,1.5)(4,2.5)

b)(2,1.5),(3,2)(4,2.5)

c)(2,3)(3,3)(4,3)

d)None of above

Ans b

Q92) A line with start & endpoints (1,1)(3,5)respectively endpoints actual intermediate pixel
positions are _____________

a)(2,0.5)(3,1.5)(4,2.5)

b)(2,1.5),(3,2)(4,2.5)

c)((1.5,2),(2,3)(2.5,4)

d)None of above

Ans c

Q93) A line has by default width value __________________

a) 1
b) 2
c) 3
d) 0
Ans.a

Q94) In ________________ method it is possible to perform scaling operation on character

a)Starbust

b)Dotmatric
c)Stroke

d)None of above

Ans.c

Q95)________________ is traditional method of circle drawing

a)Midpoint

b)Bresenham’s

c) Trignometric method

d)All of above

Ans. c

Q96)________________ is traditional method of circle drawing

a)Polynomial

b)Bresenham’s

c) DDA

d)All of above

Ans. a

Q97)In midpoint circle generation value of initial decision parameter is given by _______

a)p=r

b)p=1-r

c)p=p+r

d)p=p*r

Ans. b

Q98)In Bresenham’s circle generation value of initial decision parameter is given by ________
a)s=s+r

b)s=s-r

c)s=3-2*r

d)s=0

Ans.c

Q99) In circle generation algorithm to move center from origin to respective location we perform
__________ operation

a)Scaling

b)reflection

c)Rotation

d)Translation

Ans.d

Q100) In bresnham’s circle generation first point on circumference of circle will be ________

a)(1,r)

b)(r,0)

c)(0,r)

d)(r,r)

Ans.c