This sheet is for 1 Mark

questions

Correct
S.r
Question a b c d Answe
No
r

a/b/c/
d

e.g 1Write down question Option a Option b Option c Option d

The DDA line drawing orientati length end points display
algorithm is ________ on
1 dependent a
The end point accuracy good better best poor
of DDA line drawing
2 algorithm is _ d
Floating point time time fast slow
3 arithmetic in DDA efficient consumi b
DDA line drawing slower faster of equal none of
algorithm calculating speed to these
pixel positions is _ that of
than direct use of
4 equation y = mx+ b. b
The advantage of no use of producing less
Bresenham's algorithm roundin integer smooth number
over conventional DDA g addition appearanc of
5 algorithm is operatio and e iteration b
 If one octant of the 1 2 4 8
circle is generated, to
complete the
generation of full circle,
6 how many reflections d
Why a circle drawn on It is due Screen Our eyes CRT is
the screen appears to to the has are not at complet
be elliptical  ? aspect rectanguthe same ely
ratio of lar level on spherica
7 monitor shape screen l a
In bresenhan's 0 1 -0.5 None of
8 algorithm error term is above a
The anti - aliasing Pixel Filtering Intensity Samplin
technique which allows phasing compensa g
shift of 1/4,1/2 and tion techniqu
3/4 of a pixel diameter e
enabling a closer path
9 of a line is ? a
The best line drawing DDA Algorith Bresenha none of
algorithm among all m which m's these
possible line drawing uses algorithm
10 algorithm is direct c
The value of initial 3-2r 5/4 -r 1-2r 3-r
decision parameter in
mid point circle
11 drawing algorithm is: b
Pixel phasing is a shading anti- hidden linenone of
12 technique for ____ aliasing removal these b
Which of the following Bresenh Midpoin Both (a) none of
algorithms can be used am's t and (b) these
13 for circle generation ? algorith algorith c
Aliasing means __ RenderinShading Staircase Cueing
14 g effect effect effect effect c
Slope of the line joining0 1 2 3
the points(1, 2) and (3,
15 4) is __ . b
 This sheet is for 2 Mark
questions
S.r Corre
Question a b c d
No ct
e.g a/b/
1 Write down question Option a Option b Option c Option d c/d
______provides a Gcode Unicode Mcode GlobalCod
unique code value e
for every character
regardless of the
platform, program
1 or language b
2 ____ uses 8-bit UTF-8 UTF-16 UCS-2 Both 2 and a
3 ____ uses 16-bit UTF-8 UTF-16 UCS-2 Both 2 and d
________ uses UTF-8 UTF-16 UCS-2 Both 2 and
variable-width 3
4 encoding a
One Unicode UTF-8 UTF-16 UCS-2 none of
character can be 1 these
byte, 2 bytes, 3
bytes or 4 bytes in
5 _____ encoding. a
6 UTF-8, European 1 byte either 1 3 bytes 4 bytes b
7 UTF-8, Ashian 1 byte either 1 3 bytes 4 bytes c
In UTF-8, 1 byte either 1 3 bytes 4 bytes
Supplementary byte or 2
Characters are byte
8 represented in __ . d
_______ is the UTF-8 UTF-16 UCS-2 Both 2 and
unicode supported 3
9 on UNIX platforms. a
_____ is the UTF-8 UTF-16 UCS-2 Both 2 and
unicode encoding 3
supported on
10 Windows d
_______ uses fixed- UTF-8 UTF-16 UCS-2 Both 2 and
11 width encoding. 3 c
__ is the Unicode UTF-8 UTF-16 UCS-2 Both 2 and
encoding used by 3
Java and
12 Microsoft c
_______ is the main UTF-8 UTF-16 UCS-2 Both 2 and
unicode encoding 3
used by Microsoft
13 Windows 2000. b
__ provides better UTF-8 UTF-16 UCS-2 Both 2 and
compatibility with 3
Java and
14 Microsoft clients. b
 How many pixels 2 4 5 6
will be there in the
line segment with
the end points A(1,
15 1) and B(5,3) ? c
 This sheet is for
3 Mark questions
S.r Correc
Question Image a b c d
No t
e.g Write down img. Option Option OptionOptiona/b/c/
1 question jpg a b c d d
What is the
refresh rate
of a 512x512 19 15
20 12
frame buffer frame frame
frames frames
if access s per s per c
per per
time for each secon secon
second second
pixel is 200 d d
nanosecond(
1 ns)
24 bit plane
frame buffer 224 212 23 28
i.e. 8 bit possibl possibl possib possib
a
planes per e e le le
color will colourscolors colors colors
2 generate
The
amoun
t of
memor
y
require
s by a
1 plane
frame 14400 48000 19200 a
buffer 00 bits 0 bits 00 bits
each of
The amount R, G
of memory and B
requires by a of 800
1 plane x 600
frame buffer screen
each of R, G resolut
3 and B of
on is
How many
bits are
required for
a 512 x 512 78643 78643 78643 78634
raster with b
1 bits 2 bits 3 bits 4 bits
each pixel
being
represented
4 by 3 bits?
 What is the
rate of 1024
x 1024 frame
buffer with
an average
2 3 1.8 1.6 d
access rate
per pixel of
200 ns on a
simple color
5 display?
What is the
access rate /
pixel of a
4096 x 4096
raster having
1 ns 2 ns 3 ns 4 ns b
a refresh
rate of 30
6 frames per
How many
memory bits
are required 25165
for a 24bit 10485 24576 10485
824 d
plane 1024 x 76 bits bits 75 bits
bits
1024
element
7 raster?
Find points
for
bresenham's
circle
(3,0)
generation (0,3) (1 (0,0) (0 Other
(3,1)
algorithms 3) (2,2) 1) (1,2) than a
(2,1)
whose (3,1) (1,3) above
(1,1)
radius is 3
and center
co-ordinates
8 are (0,0)
How many
intermediate
pixels with in
line segment
having end
points A(5,5) 6 7 8 5 b
and B(13,9)
using
Bresenham's
Line drawing
9 algorithm?
 A computed
line position
of (10.48,
20.51), for
example, (11, (10,
(10, 21)(11, 20) a
would be 21) 20)
converted to
pixel position
_____________
___.
10
 This sheet is for 1 Mark questions

Correct
S.r No Question a b c d Answe
r

a/b/c/
e.g 1 Write down question Option a Option b Option c Option d d
Flood fill
Line Scan line
Scan-line coherence polygon None of
drawing polygon filling b
property is used in filling above
algorithm algorithm
1 algorithm
It uses
Which of the following is
It need a It works at scan lines All of
true about scan line c
seed pixel pixel level to fill the above
algorithm?
2 polygon
Which of the following
Boundary
algorithms to fill polygons Flood-Fill Scan-Line None of
Fill b
was the one used by real Polygons Polygon above
Polygons
3 rasterizers?
Active edge table is used in Boundary
Region fill Scan Line Edge Fill c
4 following algorithm fill
Scan line polygon filling
None of
algorithm uses series of Scan lines Points Layers a
above
5 ……………. To fill the polygon.
In scan line algorithm, Scan
lines are processed in
Color
increasing (upward) / Y order X order Pixel order a
order
decreasing (downward) ------
6 --------------------.
When the current scan line
in Scan line polygon fill
becomes becomes is
algorithm moves above the is added. a
inactive active discarded
upper / below the lower
7 endpoint, the edge
The edges crossed by
current scan line in Scan Active Marked None of
Inactive edges a
line polygon fill algorithm edges edges these
8 are called as
Scan line Fill Approach polygon Pixel
color level edge level c
9 works at the level Level
Following are the data
structures used in Scan line Active Active Edge Both A andNeither A
c
algorithm to increase the Edge list Table B or B
10 efficiency.
Either
Scan line polygon filling Either xmax orOnly Only
ymax or a
algorithm starts from xmin xmax xmin
11 ymin
 Scan line polygon filling
None of
algorithm can be used for TRUE FALSE Cant Say a
these
12 filling Convex polygon.
Outcode / Region Code
used in Line Clipping is of 4 3 2 1 a
13 size ____ bits.
Is 0011 valid region code /
Cannot None of
outcode used in Line yes no b
say these
14 Clipping algorithm?
Primitive types of clipping Point Polygon All of
Line Clipping d
15 algorithms are Clipping Clipping above
 This sheet is for 2 Mark questions
S.r No Question a b c d Correct Answer
e.g 1 Write down question Option a Option b Option c Option d a/b/c/d
The Most Significant Bit
of the region code of a Y >YWMIN Y< YWMIN Y< YWMAXY>YWMAX d
point (X,Y) is '1' if ............
1 .........
Following are
coordinates of clipping
window : Lower Left Partially Completely None of
Corner (10,10) and Visible c
Visible Exterior the above
Upper Right Corner (100,
100). Whether a point at
2 (5 50) is visible or not?
Following are
coordinates of clipping
window : Lower Left
Corner (20,20) and 110 100 0 1000 d
Upper Right Corner (200,
200). What is the
3 outcode of point (75 250)
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, (80, 16.66) (80, 16.66) (80, 16.66) (16.66, 80) c
20) and (100, 10). What and (20, 70 and (70, 20 and (70, 20
will be the end points of
clipped line? Use Cohen
– Sutherland Outcode
4
Algorithm
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 (-8,6) and (-8,6) and (6,-8) and (8,-6) and a
corner at ( 12,8). What (2,8) (8,2) (2,8) (8,2)
will be the end points of
clipped line? Use Cohen
– Sutherland Outcode
5
Algorithm
A rectangular clipping
window whose lower left
corner is at (-3,1) and
upper right corner is at (2
6). If line segment has (-3, 11/3) (3/11, -3) (-3, 3/11) (-11/3, 3)
end coordinates (-4,2) and (-8/5, and ( -5/8, and (-8/5, and a
and (-1,7). What will the 6) 6) 6) (-6, 8/5)
end coordinates of
clipped line (use Cohen –
Sutherland Outcode
6
Algorithm)
 In scan line algorithm,
using Edge coherence
property the next
incremental x- xs+1= xs + xs+1= xs + xs+1= xs + xs+1= xs +
c
intersection(xs+1) can bem 1 1/m m/2
calculated as: ------------
Note: Xs is the previous
7
x-intersection
In scan line algorithm,
Let an edge is
represented by Formula y
= mx + b and for Xs = (s- Xs = (s-b)/ Xs = (s-
scan_line s value of y = b)+m Xs = (s-b) c
m b)*m
s. What will be the Xs ?
Note : Scan line is
intersecting with edge at
8
(s Xs)
If a pixel If edge of If a pixel
on a scan the on a edge
line lies polygon lies within
within a intersects a polygon,
‘Scan-line coherence ‘ polygon, a given None of
pixels near a
means pixels near polygon , it will most above
it will most pixels near likely lie
likely lie it will most within the
within the likely lie polygon
9
polygon within the
Find Find
intersectio intersectio
The function of scan line n point of n point of None of
Both a & b a
polygon fill algorithm are the the these
boundary boundary
10 of polygon of polygon
Boundary Fill Color Boundary
Color (BC) (FC) and (x Color (BC), (x,y)
Boundary fill algorithm and (x,y) y) Fill Color coordinate
c
needs– coordinate coordinate (FC) and (x s of seed
s of seed s of seed y) point.
point. point. coordinate
11 s of seed
Which polygon fill
algorithm needs
following information - 1.Boundary
Boundary Color (BC), 2. fill Region fill Scan fill DDA fill a
Fill Color (FC) and 3. (x,y)
coordinates of seed
12 point
Which polygon fill
algorithm needs
following information - 1.
Region Color (RC), 2. Fill Flood Fill Region fill Scan fill DDA fill a
Color (FC) and 3. (x,y)
coordinates of seed
13 point
 Using Cohen-Sutherland
line clipping, it is None of
TRUE FALSE Cant Say a
impossible for a vertex to these
14 be labeled 1111
The result of logical AND
operation with endpoint The line is The line is The line is The line is
region codes is a completely completely partially
already b
nonzero value. Which of inside the outside the inside the clipped
the following statement window window window
15 is true?
This sheet is for 3 Mark
questions
S.r
Question a b c d Correct Answer
No
Write down
a/b/c/d
e.g 1question Option a Option b Option c Option d
Following are
coordinates of
clipping window
Lower Left
Corner (20,20)
and Upper Right
Corner (200,200)
A line has end
Completely Partially Completely None of
coordinates as c
Visible Visible Invisible Above
(0,10) and (250,
15). The given
line segment is
___________. Use
Cohen –
Sutherland
Outcode
Algorithm.
1
(x+1, y ) (x+1, y )
In 8 connected
(x-1,y) (x, (x-1,y) (x,
region if one (x-1,y-1) (x+1, y )
y+1) (x,y-1) y+1) (x,y)
pixel is (x,y) then (x-1, y+1) (x-1,y) (x,
(x-1,y-1) (x-1,y-1) a
remaining (x+1, y-1) y+1) (x,y-1)
(x-1, y+1) (x-1, y+1)
neighboring (x+1, y+1) (x-1,y-1)
(x+1, y-1) (x+1, y-1)
pixels are
2 (x+1, y+1) (x+1, y+1)
(x+1, y ) (x+1, y )
In 4 connected
(x-1,y) (x, (x-1,y) (x,
region if one (x-1,y-1)
y+1) (x,y-1) y+1) (x,y) (x+1, y )
pixel is (x,y) then (x-1, y+1)
(x-1,y-1) (x-1,y-1) (x-1,y) (x, d
remaining (x+1, y-1)
(x-1, y+1) (x-1, y+1) y+1) (x,y-1)
neighboring (x+1, y+1)
(x+1, y-1) (x+1, y-1)
pixels are
3 (x+1, y+1) (x+1, y+1)
If edge of
If a pixel
the If a pixel
on a scan
polygon on a edge
line lies
intersects lies within
within a
‘Scan-line a given a polygon,
polygon, None of
coherence ‘ polygon , pixels near a
pixels near above
means pixels near it will most
it will most
it will most likely lie
likely lie
likely lie within the
within the
within the polygon
polygon
polygon
4
 Find
Find
intersectio
intersectio
The function of n point of
n point of
scan line the None of
the Both a & b a
polygon fill boundary these
boundary
algorithm are of polygon
of polygon
and scan
and point
line
5

In scan line
algorithm, using
Edge coherence
property the next
incremental x-
xs+1= xs + xs+1= xs + xs+1= xs + xs+1= xs +
intersection(xs+ c
m 1 1/m m/2
1) can be
calculated as: ----
--------Note: Xs is
the previous x-
intersection.
6
In 8 connected
region if one (2, 2 ) (4,2) (3, 3 ) (1,1)
pixel is (3,2) (3,3) (3,1) (2,4) (2,2) (3, 3 ) (1,2) (2, 2 ) (4,2)
a
then remaining (4,3) (4,1) (2,2) (1, 4) (2,3) (2,2) (3,3) (3,1)
neighboring (2,3) (2, 1) (3,2) (3, 4)
7 pixels are
If one edge of
the polygon has
end coordinates
(10,20) and (15,
40) and current
scan line is (11.2,25) (12,25) (12.2,25) (25,11.2) a
scanning at
y=25. What will
be the
intersection
point?
8
In 4 connected
region if one
pixel is (3,3) (3, 3 ) (1,3) (2,2) (1, 4) (3, 3 ) (1,2) (4, 3 ) (2,3)
d
then remaining (2,4) (2,2) (3,2) (3, 4) (2,3) (2,2) (3,4) (3,2)
neighboring
9 pixels are
 In scan line
polygon filling
algorithm for
current scan line (10,20)and (20,10)and
(10,20)and (20,10)and
the x- (20,30)and (10,50)and a
(30,50) (10,50)
intersections got (30,50) (50,30)
are 20,10,50,30.
How pairing will
be formed?
10
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
 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
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. ________ is defined in terms of basic shapes, such as polygons or splines.

A : Storyboard layout

B : Object

C : Keyframe

D : In-between frames

Q.no 2. Hue property refers to……

A : Colour Purity

B : Dominant frequency of light

C : Saturation

D : Brightness

Q.no 3. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : 1+M

D : 1-M

Q.no 4. The basic geometric transformations are

A : Translation

B : Rotation

C : Scaling

D : All of the above

Q.no 5. Three primary colors are

A : Red, green, blue

B : Red, cyan, blue

C : Red, white, black

D : Red, green, yellow

Q.no 6. You can’t draw a character with rounded shape in _____________ method

A : Bitmap method

B : Stroke method

C : Starbust method

D : all of above

Q.no 7. Color model used for monitors is

A : CMYK

B : CMY

C : RGB

D : HIS

Q.no 8. What is the name of area of the triangle in C.I E chromatic diagram that shows a
typical range of colors produced by RGB monitors?

A : Color gamut

B : Tricolor

C : Color game

D : Chromatic colors

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. 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

Q.no 10. 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

Q.no 11. Cohen-Sutherland algorithm is used for

A : point clipping

B : line clipping

C : fill-area clipping

D : All of the above

Q.no 12. Cohen-Sutherland clipping is an example of _________________

A : polygon clipping

B : line clipping

C : text clipping

D : curve clipping

Q.no 13. We can correctly clip a polygon by processing the polygon boundary as a whole
against each ___________

A : side wall

B : top edge

C : window edge

D : bottom edge

Q.no 14. A closed polyline is called a

A : Polychain

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Polygon

C : Polyclosed

D : Closed chain

Q.no 15. _____is the basic approach used to fill the polygon

A : Seed fill

B : Scan line fill

C : Vector fill

D : both a & b

Q.no 16. 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

Q.no 17. In Cohen-Sutherland subdivision line clipping algorithm, all bits in Region code is
set if_________

A : End point of the line lies within clipping window

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 18. The process of removing objects that lie outside view point is called

A : clipping

B : projection transformation

C : hidden surface removal

D : hidden surface detection

Q.no 19. The transformation that is used to alter the size of an object is

A : Scaling

B : Rotation

C : Translation
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : Reflection

Q.no 20. 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

Q.no 21. ______________ uses 24 bit star bust pattern

A : Stroke Method

B : Scan line

C : Bit map

D : star bust method

Q.no 22. The process of selecting & viewing the picture with different views is called
_____________

A : Clipping

B : Windowing

C : Segmenting

D : All of the above

Q.no 23. The line is said to be interior to the clipping window if _______points are interior to
the window.

A : One end point

B : Both end points

C : Mid point

D : None of these

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

A : Rotation angle ϴ

B : Distances dx and dy

C : Rotation distance

D : All of the mentioned

Q.no 25. A two-dimensional array contain the details of all the segment are called
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Segment Table

B : Segment Name

C : Operation

D : Segmentation

Q.no 26. Polygon filling algorithm who fills interior-defined regions are called___algorithms

A : Flood fill

B : Boundary fill

C : Scan line fill

D : Seed fill

Q.no 27. In DDA line drawing algorithm, For lines with a slope less than or equal to 1, for
every value of X the value of Y is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 28. RGB and CMY are ...........and ............colour models respectively.

A : Additive, Additive

B : Additive, Subtractive

C : Subtractive, Additive

D : Subtractive, Subtractive

Q.no 29. The logical ______ of the endpoint codes determines if the line is completely inside
the window

A : AND

B : OR

C : NOT

D : NOR

Q.no 30. If we need to tilt the 2D object in one direction then we have to
use_____transformation.

A : Reflection

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Shear

C : Rotation

D : Scaling

Q.no 31. A bitmap is collection of ___________________ that describes an image

A : Bits

B : Colors

C : algorithms

D : pixels

Q.no 32. Color model is also called

A : color system

B : color space

C : color area

D : Both A & B

Q.no 33. Two primaries that produce…………colour are referred to as complementary

colors.

A : Black

B : White

C : Red

D : Grey

Q.no 34. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 35. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : voxel level and screen level

Q.no 36. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………

A : Black

B : White

C : Yellow

D : Magenta

Q.no 37. How many pixels will be there in the line segment with end points A(40,10) and B
(20, 60)?

A : 20

B : 50

C : 21

D : 51

Q.no 38. A line with start point (0,0) and endpoint (4,6) is __________ line

A : Gentle

B : Steep

C : slope value one

D : All of above

Q.no 39. In Cohen-Sutherland subdivision line clipping algorithm bit 2 in Region code is set if

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

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 40. 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
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 41. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the
equation

A : x’=x+dx and y’=y+dx

B : x’=x+dx and y’=y+dy

C : X’=x+dy and Y’=y+dx

D : X’=x-dx and y’=y-dy

Q.no 42. The graphics method in which one object is transformed into another object are
called

A : Clipping

B : Morphing

C : Shearing

D : Reflection

Q.no 43. To draw Line From (1,1) to (5,3) using digitial differential analyser algorithm what
will be the incremental value of x…..

A:1

B:2

C : -2

D : -4

Q.no 44. The Cohen-Sutherland algorithm divides the region into _____ number of spaces

A:8

B:6

C:7

D:9

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

A : Reflection about origin

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 46. 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
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

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

Q.no 47. For circle drawing, if f(x,y)<0 then ___________

A : x,y is inside the circle boundary

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

Q.no 48. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 49. When a line with end points (10,20) and (30,18) is to be drawn using dda line
algoithm , _______is chosen as one raster unit.

A : dx

B : dy

C : a or b

D : None of these

Q.no 50. Reflection of a point about x-axis, followed by a counter-clockwise rotation of 90° , is
equivalent. to reflection about the line

A : x = -y

B : y=-x

C : x=y

D:x+y=1

Q.no 51. A face is identified as VISIBLE face if the angle between view direction and surface/
face normal is .........

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : 0-45 degree

B : 0-90 degree

C : 90-180 degree

D : Greater than 180 degree

Q.no 52. 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

Q.no 53. For Thick line segment to calculate Wy where Wy is thickness from center boundary
line to lower boundary

A : wy= squareroot[(x2-x1)2+ (y2-y1)2] / (2* |x2-x1|)

B : wy= (w-1) * squareroot((x2-x1)2+ (y2-y1)2 )/ (2* |x2-x1|)

C : wy= (w-1) * squareroot[(x2-x1)2+ (y2-y1)2] / ( |x2-x1|)

D : wy= (w-1) * ((x2-x1)2+ (y2-y1)2)/ (2* |x2-x1|)

Q.no 54. If both end points of a line are completely to the left of 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

Q.no 55. Using DDA line algorithm a computed line position of (20.48, 34.51) using integer
function, would be converted to pixel position ________________.

A : (20, 34)

B : (21, 34)

C : (34, 21)

D : (20, 35)

Q.no 56. Match the following.

I. Line II. Convex fill-area III. Convex and concave fill-area with A. Sutherland-Hodgeman
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

algorithm
B. Cohen-Sutherland algorithm
C. Weiler-Atherton Algorithm

A : I-A, II-B, III-C

B : I-B, II-A, III-C

C : I-C, II-B, III-A

D : I-A, II-C, III-B

Q.no 57. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

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

A : Scaling

B : Rotation

C : Translation

D : None of this

Q.no 59. 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.

Q.no 60. Line with the coordinates (x1,y1) and (x2,y2) having thickness w with gentle slope ,
then correct boundaries are

A : (x1, y1+wy) ,(x2,y2+wy), (x1, y1-wy) ,(x2,y2-wy)

B : (x1+wx, y1) ,(x2+wx,y2), (x1-wx, y1) ,(x2-wx,y2)

C : Both A and B

D : Can not say

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is b

Answer for Question No 2. is b

Answer for Question No 3. is b

Answer for Question No 4. is d

Answer for Question No 5. is a

Answer for Question No 6. is b

Answer for Question No 7. is c

Answer for Question No 8. is a

Answer for Question No 9. is c

Answer for Question No 10. is b

Answer for Question No 11. is b

Answer for Question No 12. is b

Answer for Question No 13. is c

Answer for Question No 14. is b

Answer for Question No 15. is d

Answer for Question No 16. is c

Answer for Question No 17. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is a

Answer for Question No 19. is a

Answer for Question No 20. is b

Answer for Question No 21. is d

Answer for Question No 22. is b

Answer for Question No 23. is b

Answer for Question No 24. is a

Answer for Question No 25. is a

Answer for Question No 26. is a

Answer for Question No 27. is a

Answer for Question No 28. is b

Answer for Question No 29. is b

Answer for Question No 30. is b

Answer for Question No 31. is d

Answer for Question No 32. is d

Answer for Question No 33. is b

Answer for Question No 34. is c

Answer for Question No 35. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is b

Answer for Question No 37. is d

Answer for Question No 38. is b

Answer for Question No 39. is b

Answer for Question No 40. is b

Answer for Question No 41. is b

Answer for Question No 42. is b

Answer for Question No 43. is a

Answer for Question No 44. is d

Answer for Question No 45. is c

Answer for Question No 46. is b

Answer for Question No 47. is a

Answer for Question No 48. is c

Answer for Question No 49. is a

Answer for Question No 50. is c

Answer for Question No 51. is b

Answer for Question No 52. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is b

Answer for Question No 54. is c

Answer for Question No 55. is a

Answer for Question No 56. is b

Answer for Question No 57. is c

Answer for Question No 58. is a

Answer for Question No 59. is a

Answer for Question No 60. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. A closed polyline is called a

A : Polychain

B : Polygon

C : Polyclosed

D : Closed chain

Q.no 2. A bitmap is collection of ___________________ that describes an image

A : Bits

B : Colors

C : algorithms

D : pixels

Q.no 3. The process of selecting & viewing the picture with different views is called
_____________

A : Clipping

B : Windowing
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Segmenting

D : All of the above

Q.no 4. ________ is the art of creating moving images via the use of computers.

A : picture

B : image processing

C : computer animation

D : image enhancement

Q.no 5. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 6. What is the primary use of clipping in computer graphics?

A : adding graphics

B : removing objects and lines

C : Copying

D : Zooming

Q.no 7. The transformation that disturbs the shape of an object are called

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 8. For a Bresenham’s line drawing initial decision parameter value of G is given as

A : G=0

B : G=2dy-dx

C : G=x/y

D : G=dy/dx

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. You can’t draw a character with rounded shape in _____________ method

A : Bitmap method

B : Stroke method

C : Starbust method

D : all of above

Q.no 10. Mapping of the world co-ordinates into physical co-ordinates is called _____.

A : Homogeneous transformation

B : Co-ordinate conversion

C : Viewing transformation

D : Physical transformation

Q.no 11. We can correctly clip a polygon by processing the polygon boundary as a whole
against each ___________

A : side wall

B : top edge

C : window edge

D : bottom edge

Q.no 12. 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

Q.no 13. Color model used for monitors is

A : CMYK

B : CMY

C : RGB

D : HIS

Q.no 14. ________ is defined in terms of basic shapes, such as polygons or splines.

A : Storyboard layout

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Object

C : Keyframe

D : In-between frames

Q.no 15. 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

Q.no 16. RGB and CMY are ...........and ............colour models respectively.

A : Additive, Additive

B : Additive, Subtractive

C : Subtractive, Additive

D : Subtractive, Subtractive

Q.no 17. In CMY colour model WHITE colour is represented by....

A : 1,1,1

B : 1,1,0

C : 1,0,1

D : 0,0,0

Q.no 18. The transformation that is used to alter the size of an object is

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 19. Which vertex of the polygon is clipped first in polygon clipping?

A : top right

B : bottom right

C : bottom left

D : top left
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 20. The basic geometric transformations are

A : Translation

B : Rotation

C : Scaling

D : All of the above

Q.no 21. The Bresenham's circle drawing algorithm uses the __of the circle to generate?

A : two-way symmetry

B : four-way symmetry

C : eight-way symmetry

D : Either two way or four way symmetry

Q.no 22. Which colour model is preferably used in printing

A : RGB

B : YIQ

C : CMYK

D : HSV

Q.no 23. Hue and saturation, both together produce

A : brightness

B : transitivity

C : chromaticity

D : reflectivity

Q.no 24. 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

Q.no 25. An object can be viewed as a collection of

A : One segment

B : Two segments
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Three segments

D : several segments

Q.no 26. Cohen-Sutherland algorithm is used for

A : point clipping

B : line clipping

C : fill-area clipping

D : All of the above

Q.no 27. 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

Q.no 28. In DDA circle generation algorithm total _____ of the arc to be drawn is needed

A : length

B : distanance

C : angle

D : None of the above

Q.no 29. ______________ uses 24 bit star bust pattern

A : Stroke Method

B : Scan line

C : Bit map

D : star bust method

Q.no 30. Two primaries that produce…………colour are referred to as complementary

colors.

A : Black

B : White

C : Red

D : Grey
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 31. The transformation that changes the co-ordinate positions of an object along a
circular path is called_______.

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 32. In _____________ method, direction number is given to each boundary line

A : Winding

B : Even-Odd

C : unwinding

D : None of these

Q.no 33. A simple color frame buffer is implemented with _____bit planes

A:8

B:3

C:4

D:6

Q.no 34. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 35. If both end points of a line are exterior to the clipping window,then
___________________.

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

Q.no 36. For a gentle slope lines value of Xincrement Xinc and Y increment Yinc are
_____________

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : 1,m

B : m,1

C : 1,1

D : m,m

Q.no 37. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

Q.no 38. 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

Q.no 39. _______ is most straightforward method for defining a motion sequence.

A : Direct motion specification

B : Goal – Directed Systems

C : Kinematics and Dynamics

D : All of these

Q.no 40. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………

A : Black

B : White

C : Yellow

D : Magenta

Q.no 41. The graphics method in which one object is transformed into another object are
called

A : Clipping
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Morphing

C : Shearing

D : Reflection

Q.no 42. A line with start point (0,0) and endpoint (4,6) is __________ line

A : Gentle

B : Steep

C : slope value one

D : All of above

Q.no 43. 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

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

A : Reflection about origin

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 45. Every segment has its own attributes like

A : Size,visibility

B : Start position

C : Image transformation

D : All of these

Q.no 46. In RGB colour model (0,0,0) to (1,1,1) diagonal represents.............

A : Red scale

B : Green scale

C : Grey scale

D : Blue Scale
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

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

A : Translation distances

B : Translation difference

C : X and Y

D : Only a

Q.no 48. An outcode can have ____ bits for two-dimensional clipping

A:4

B:6

C:2

D:1

Q.no 49. Reflection of a point about x-axis, followed by a counter-clockwise rotation of 90° , is
equivalent. to reflection about the line

A : x = -y

B : y=-x

C : x=y

D:x+y=1

Q.no 50. When a line with end points (10,20) and (30,18) is to be drawn using dda line
algoithm , _______is chosen as one raster unit.

A : dx

B : dy

C : a or b

D : None of these

Q.no 51. Two consecutive translation transformation t1 and t2 are

A : Additive

B : Multiplicative

C : Subtractive

D : none of above

Q.no 52. For circle drawing, if f(x,y)<0 then ___________

A : x,y is inside the circle boundary

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

Q.no 53. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

Q.no 54. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 55. In Cohen-Sutherland subdivision line clipping algorithm bit 2 in Region code is set if

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

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 56. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

Q.no 57. To draw Line From (1,1) to (5,3) using digitial differential analyser algorithm what
will be the incremental value of x…..

A:1

B:2

C : -2

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : -4

Q.no 58. For Thick line segment to calculate Wy where Wy is thickness from center boundary
line to lower boundary

A : wy= squareroot[(x2-x1)2+ (y2-y1)2] / (2* |x2-x1|)

B : wy= (w-1) * squareroot((x2-x1)2+ (y2-y1)2 )/ (2* |x2-x1|)

C : wy= (w-1) * squareroot[(x2-x1)2+ (y2-y1)2] / ( |x2-x1|)

D : wy= (w-1) * ((x2-x1)2+ (y2-y1)2)/ (2* |x2-x1|)

Q.no 59. Line with the coordinates (4,5) and (7,10) is rasterized using DDA. What is the value
of the next pixel

A : (4,6)

B : (5,7)

C : (7,5)

D : (6,4)

Q.no 60. Resolution is 240 pixels per inch and if size of the screen is 5 inch x 7 inch, then total
number of pixels that screen has

A : 4800

B : 208900

C : 2016000

D : None of the above

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is b

Answer for Question No 2. is d

Answer for Question No 3. is b

Answer for Question No 4. is c

Answer for Question No 5. is b

Answer for Question No 6. is b

Answer for Question No 7. is b

Answer for Question No 8. is b

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is c

Answer for Question No 12. is b

Answer for Question No 13. is c

Answer for Question No 14. is b

Answer for Question No 15. is b

Answer for Question No 16. is b

Answer for Question No 17. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is a

Answer for Question No 19. is d

Answer for Question No 20. is d

Answer for Question No 21. is c

Answer for Question No 22. is c

Answer for Question No 23. is c

Answer for Question No 24. is c

Answer for Question No 25. is d

Answer for Question No 26. is b

Answer for Question No 27. is c

Answer for Question No 28. is c

Answer for Question No 29. is d

Answer for Question No 30. is b

Answer for Question No 31. is b

Answer for Question No 32. is a

Answer for Question No 33. is b

Answer for Question No 34. is c

Answer for Question No 35. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is b

Answer for Question No 39. is a

Answer for Question No 40. is b

Answer for Question No 41. is b

Answer for Question No 42. is b

Answer for Question No 43. is d

Answer for Question No 44. is c

Answer for Question No 45. is d

Answer for Question No 46. is c

Answer for Question No 47. is d

Answer for Question No 48. is a

Answer for Question No 49. is c

Answer for Question No 50. is a

Answer for Question No 51. is a

Answer for Question No 52. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is a

Answer for Question No 54. is c

Answer for Question No 55. is b

Answer for Question No 56. is b

Answer for Question No 57. is a

Answer for Question No 58. is b

Answer for Question No 59. is a

Answer for Question No 60. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. To generate a rotation , we must specify

A : Rotation angle ϴ

B : Distances dx and dy

C : Rotation distance

D : All of the mentioned

Q.no 2. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 3. A two-dimensional array contain the details of all the segment are called

A : Segment Table

B : Segment Name
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Operation

D : Segmentation

Q.no 4. Three primary colors are

A : Red, green, blue

B : Red, cyan, blue

C : Red, white, black

D : Red, green, yellow

Q.no 5. A bitmap is collection of ___________________ that describes an image

A : Bits

B : Colors

C : algorithms

D : pixels

Q.no 6. Hue property refers to……

A : Colour Purity

B : Dominant frequency of light

C : Saturation

D : Brightness

Q.no 7. 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

Q.no 8. Two primaries that produce…………colour are referred to as complementary colors.

A : Black

B : White

C : Red

D : Grey

Q.no 9. In _____________ method, direction number is given to each boundary line

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Winding

B : Even-Odd

C : unwinding

D : None of these

Q.no 10. Use of Display File interpreter is....

A : Execute instructions to draw an image

B : Interprete the data

C : Store image

D : Decide image color

Q.no 11. Mapping of the world co-ordinates into physical co-ordinates is called _____.

A : Homogeneous transformation

B : Co-ordinate conversion

C : Viewing transformation

D : Physical transformation

Q.no 12. In Cohen-Sutherland subdivision line clipping algorithm, all bits in Region code is
set if_________

A : End point of the line lies within clipping window

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 13. A closed polyline is called a

A : Polychain

B : Polygon

C : Polyclosed

D : Closed chain

Q.no 14. If we need to tilt the 2D object in one direction then we have to
use_____transformation.

A : Reflection

B : Shear
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Rotation

D : Scaling

Q.no 15. For a circle drawing algorithm initial values of X & Y coordinates are _________

A : 0,r

B : r,0

C : r,r

D : 1,1

Q.no 16. An object can be viewed as a collection of

A : One segment

B : Two segments

C : Three segments

D : several segments

Q.no 17. 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

Q.no 18. What is the primary use of clipping in computer graphics?

A : adding graphics

B : removing objects and lines

C : Copying

D : Zooming

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

A : Reflection

B : Shear

C : Rotation

D : Scaling

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 20. If have the final coordinates of the polygon, then to recover the original coordinates
of polygon we have to apply ______

A : Scaling

B : Translation

C : Inverse transformation

D : None of these

Q.no 21. ______ refers to the number of dots on screen

A : pixel

B : Resolution

C : Aspect ratio

D : Frame buffer

Q.no 22. The transformation that is used to alter the size of an object is

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 23. Color model used for monitors is

A : CMYK

B : CMY

C : RGB

D : HIS

Q.no 24. For a Bresenham’s line drawing initial decision parameter value of G is given as

A : G=0

B : G=2dy-dx

C : G=x/y

D : G=dy/dx

Q.no 25. The transformation that changes the co-ordinate positions of an object along a
circular path is called_______.

A : Scaling
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Rotation

C : Translation

D : Reflection

Q.no 26. 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

Q.no 27. ______________ uses 24 bit star bust pattern

A : Stroke Method

B : Scan line

C : Bit map

D : star bust method

Q.no 28. We can correctly clip a polygon by processing the polygon boundary as a whole
against each ___________

A : side wall

B : top edge

C : window edge

D : bottom edge

Q.no 29. A simple color frame buffer is implemented with _____bit planes

A:8

B:3

C:4

D:6

Q.no 30. The process of selecting & viewing the picture with different views is called
_____________

A : Clipping

B : Windowing

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Segmenting

D : All of the above

Q.no 31. In DDA line drawing algorithm, For lines with a slope less than or equal to 1, for
every value of X the value of Y is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 32. Color model is also called

A : color system

B : color space

C : color area

D : Both A & B

Q.no 33. The logical ______ of the endpoint codes determines if the line is completely inside
the window

A : AND

B : OR

C : NOT

D : NOR

Q.no 34. ________ is the art of creating moving images via the use of computers.

A : picture

B : image processing

C : computer animation

D : image enhancement

Q.no 35. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………

A : Black

B : White

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Yellow

D : Magenta

Q.no 36. 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

Q.no 37. Using DDA line algorithm a computed line position of (20.48, 34.51) using integer
function, would be converted to pixel position ________________.

A : (20, 34)

B : (21, 34)

C : (34, 21)

D : (20, 35)

Q.no 38. If both end points of a line are exterior to the clipping window,then
___________________.

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

Q.no 39. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

Q.no 40. An outcode can have ____ bits for two-dimensional clipping

A:4

B:6

C:2
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D:1

Q.no 41. _______ is most straightforward method for defining a motion sequence.

A : Direct motion specification

B : Goal – Directed Systems

C : Kinematics and Dynamics

D : All of these

Q.no 42. 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

Q.no 43. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

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

A : Scaling

B : Rotation

C : Translation

D : None of this

Q.no 45. For circle drawing, if f(x,y)<0 then ___________

A : x,y is inside the circle boundary

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

Q.no 46. To draw Line From (1,1) to (5,3) using digitial differential analyser algorithm what
will be the incremental value of x…..
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A:1

B:2

C : -2

D : -4

Q.no 47. A face is identified as VISIBLE face if the angle between view direction and surface/
face normal is .........

A : 0-45 degree

B : 0-90 degree

C : 90-180 degree

D : Greater than 180 degree

Q.no 48. If both end points of a line are completely to the left of 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

Q.no 49. A point P(3, 4) is a on circle that has center at origin. Which of the following point is
also on the circle ?

A : (3, -4)

B : (-4, 3)

C : (4, 3)

D : All of these

Q.no 50. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

Q.no 51. Equation that describes hue is

A : H = H-90
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 52. How many pixels will be there in the line segment with end points A(40,10) and B
(20, 60)?

A : 20

B : 50

C : 21

D : 51

Q.no 53. In Cohen-Sutherland subdivision line clipping algorithm bit 2 in Region code is set if

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

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 54. The graphics method in which one object is transformed into another object are
called

A : Clipping

B : Morphing

C : Shearing

D : Reflection

Q.no 55. The Cohen-Sutherland algorithm divides the region into _____ number of spaces

A:8

B:6

C:7

D:9

Q.no 56. For Thick line segment to calculate Wy where Wy is thickness from center boundary
line to lower boundary

A : wy= squareroot[(x2-x1)2+ (y2-y1)2] / (2* |x2-x1|)

B : wy= (w-1) * squareroot((x2-x1)2+ (y2-y1)2 )/ (2* |x2-x1|)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : wy= (w-1) * squareroot[(x2-x1)2+ (y2-y1)2] / ( |x2-x1|)

D : wy= (w-1) * ((x2-x1)2+ (y2-y1)2)/ (2* |x2-x1|)

Q.no 57. 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

Q.no 58. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

Q.no 59. 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)

Q.no 60. In HSV model black and white is represented by which pair of V and S values
respectively

A : V= 0 S =0

B : V= 0 S =1

C : V= 1 S =0

D : V= 1 S =1

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is a

Answer for Question No 2. is b

Answer for Question No 3. is a

Answer for Question No 4. is a

Answer for Question No 5. is d

Answer for Question No 6. is b

Answer for Question No 7. is b

Answer for Question No 8. is b

Answer for Question No 9. is a

Answer for Question No 10. is a

Answer for Question No 11. is c

Answer for Question No 12. is a

Answer for Question No 13. is b

Answer for Question No 14. is b

Answer for Question No 15. is a

Answer for Question No 16. is d

Answer for Question No 17. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is b

Answer for Question No 19. is a

Answer for Question No 20. is c

Answer for Question No 21. is b

Answer for Question No 22. is a

Answer for Question No 23. is c

Answer for Question No 24. is b

Answer for Question No 25. is b

Answer for Question No 26. is c

Answer for Question No 27. is d

Answer for Question No 28. is c

Answer for Question No 29. is b

Answer for Question No 30. is b

Answer for Question No 31. is a

Answer for Question No 32. is d

Answer for Question No 33. is b

Answer for Question No 34. is c

Answer for Question No 35. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is b

Answer for Question No 37. is a

Answer for Question No 38. is b

Answer for Question No 39. is a

Answer for Question No 40. is a

Answer for Question No 41. is a

Answer for Question No 42. is d

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is a

Answer for Question No 46. is a

Answer for Question No 47. is b

Answer for Question No 48. is c

Answer for Question No 49. is d

Answer for Question No 50. is b

Answer for Question No 51. is c

Answer for Question No 52. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is b

Answer for Question No 54. is b

Answer for Question No 55. is d

Answer for Question No 56. is b

Answer for Question No 57. is b

Answer for Question No 58. is c

Answer for Question No 59. is a

Answer for Question No 60. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. An area on a physical device to which a window is mapped, is called a __________

A : Window

B : Segment

C : Clip

D : View port

Q.no 2. ________ is defined in terms of basic shapes, such as polygons or splines.

A : Storyboard layout

B : Object

C : Keyframe

D : In-between frames

Q.no 3. ________ is the art of creating moving images via the use of computers.

A : picture

B : image processing

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : computer animation

D : image enhancement

Q.no 4. Three primary colors are

A : Red, green, blue

B : Red, cyan, blue

C : Red, white, black

D : Red, green, yellow

Q.no 5. In DDA circle generation algorithm total _____ of the arc to be drawn is needed

A : length

B : distanance

C : angle

D : None of the above

Q.no 6. We can correctly clip a polygon by processing the polygon boundary as a whole
against each ___________

A : side wall

B : top edge

C : window edge

D : bottom edge

Q.no 7. One that is not a color model is

A : RCB

B : RGB

C : CMY

D : HIS

Q.no 8. If we need to tilt the 2D object in one direction then we have to

use_____transformation.

A : Reflection

B : Shear

C : Rotation

D : Scaling
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. 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

Q.no 10. In _____________ method, direction number is given to each boundary line

A : Winding

B : Even-Odd

C : unwinding

D : None of these

Q.no 11. Mapping of the world co-ordinates into physical co-ordinates is called _____.

A : Homogeneous transformation

B : Co-ordinate conversion

C : Viewing transformation

D : Physical transformation

Q.no 12. Two primaries that produce…………colour are referred to as complementary

colors.

A : Black

B : White

C : Red

D : Grey

Q.no 13. The process of selecting & viewing the picture with different views is called
_____________

A : Clipping

B : Windowing

C : Segmenting

D : All of the above

Q.no 14. ______________ uses 24 bit star bust pattern

A : Stroke Method
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Scan line

C : Bit map

D : star bust method

Q.no 15. For a circle drawing algorithm initial values of X & Y coordinates are _________

A : 0,r

B : r,0

C : r,r

D : 1,1

Q.no 16. Cohen-Sutherland algorithm is used for

A : point clipping

B : line clipping

C : fill-area clipping

D : All of the above

Q.no 17. In CMY colour model WHITE colour is represented by....

A : 1,1,1

B : 1,1,0

C : 1,0,1

D : 0,0,0

Q.no 18. 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

Q.no 19. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M

C : 1+M
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : 1-M

Q.no 20. 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

Q.no 21. If have the final coordinates of the polygon, then to recover the original coordinates
of polygon we have to apply ______

A : Scaling

B : Translation

C : Inverse transformation

D : None of these

Q.no 22. The logical ______ of the endpoint codes determines if the line is completely inside
the window

A : AND

B : OR

C : NOT

D : NOR

Q.no 23. A closed polyline is called a

A : Polychain

B : Polygon

C : Polyclosed

D : Closed chain

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

A : Rotation angle ϴ

B : Distances dx and dy

C : Rotation distance

D : All of the mentioned

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 25. Hue and saturation, both together produce

A : brightness

B : transitivity

C : chromaticity

D : reflectivity

Q.no 26. RGB and CMY are ...........and ............colour models respectively.

A : Additive, Additive

B : Additive, Subtractive

C : Subtractive, Additive

D : Subtractive, Subtractive

Q.no 27. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 28. The process of removing objects that lie outside view point is called

A : clipping

B : projection transformation

C : hidden surface removal

D : hidden surface detection

Q.no 29. The transformation that changes the co-ordinate positions of an object along a
circular path is called_______.

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 30. Which colour model is preferably used in printing

A : RGB

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : YIQ

C : CMYK

D : HSV

Q.no 31. The Bresenham's circle drawing algorithm uses the __of the circle to generate?

A : two-way symmetry

B : four-way symmetry

C : eight-way symmetry

D : Either two way or four way symmetry

Q.no 32. A two-dimensional array contain the details of all the segment are called

A : Segment Table

B : Segment Name

C : Operation

D : Segmentation

Q.no 33. Cohen-Sutherland clipping is an example of _________________

A : polygon clipping

B : line clipping

C : text clipping

D : curve clipping

Q.no 34. What is the name of area of the triangle in C.I E chromatic diagram that shows a
typical range of colors produced by RGB monitors?

A : Color gamut

B : Tricolor

C : Color game

D : Chromatic colors

Q.no 35. When a line with end points (10,20) and (30,18) is to be drawn using dda line
algoithm , _______is chosen as one raster unit.

A : dx

B : dy

C : a or b
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : None of these

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

A : Scaling

B : Rotation

C : Translation

D : None of this

Q.no 37. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

Q.no 38. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………

A : Black

B : White

C : Yellow

D : Magenta

Q.no 39. Using DDA line algorithm a computed line position of (20.48, 34.51) using integer
function, would be converted to pixel position ________________.

A : (20, 34)

B : (21, 34)

C : (34, 21)

D : (20, 35)

Q.no 40. Two consecutive translation transformation t1 and t2 are

A : Additive

B : Multiplicative

C : Subtractive

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : none of above

Q.no 41. Every segment has its own attributes like

A : Size,visibility

B : Start position

C : Image transformation

D : All of these

Q.no 42. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

Q.no 43. A line with start point (0,0) and endpoint (4,6) is __________ line

A : Gentle

B : Steep

C : slope value one

D : All of above

Q.no 44. 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

Q.no 45. How many pixels will be there in the line segment with end points A(40,10) and B
(20, 60)?

A : 20

B : 50

C : 21

D : 51

Q.no 46. For circle drawing, if f(x,y)<0 then ___________

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : x,y is inside the circle boundary

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

Q.no 47. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 48. A face is identified as VISIBLE face if the angle between view direction and surface/
face normal is .........

A : 0-45 degree

B : 0-90 degree

C : 90-180 degree

D : Greater than 180 degree

Q.no 49. A point P(3, 4) is a on circle that has center at origin. Which of the following point is
also on the circle ?

A : (3, -4)

B : (-4, 3)

C : (4, 3)

D : All of these

Q.no 50. Reflection of a point about x-axis, followed by a counter-clockwise rotation of 90° , is
equivalent. to reflection about the line

A : x = -y

B : y=-x

C : x=y

D:x+y=1

Q.no 51. Match the following.

I. Line II. Convex fill-area III. Convex and concave fill-area with A. Sutherland-Hodgeman
algorithm

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B. Cohen-Sutherland algorithm
C. Weiler-Atherton Algorithm

A : I-A, II-B, III-C

B : I-B, II-A, III-C

C : I-C, II-B, III-A

D : I-A, II-C, III-B

Q.no 52. If both end points of a line are completely to the left of 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

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

A : Translation distances

B : Translation difference

C : X and Y

D : Only a

Q.no 54. To draw Line From (1,1) to (5,3) using digitial differential analyser algorithm what
will be the incremental value of x…..

A:1

B:2

C : -2

D : -4

Q.no 55. For Thick line segment to calculate Wy where Wy is thickness from center boundary
line to lower boundary

A : wy= squareroot[(x2-x1)2+ (y2-y1)2] / (2* |x2-x1|)

B : wy= (w-1) * squareroot((x2-x1)2+ (y2-y1)2 )/ (2* |x2-x1|)

C : wy= (w-1) * squareroot[(x2-x1)2+ (y2-y1)2] / ( |x2-x1|)

D : wy= (w-1) * ((x2-x1)2+ (y2-y1)2)/ (2* |x2-x1|)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 56. The Cohen-Sutherland algorithm divides the region into _____ number of spaces

A:8

B:6

C:7

D:9

Q.no 57. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

Q.no 58. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

Q.no 59. 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)

Q.no 60. Using the starbust method character A is represented as

A : 0011 0100 0011 1100 1110 0011

B : 0011 0000 0011 1100 1110 0001

C : 0011 0011 0011 1100 1110 0001

D : 0011 1100 0011 1100 1110 0001

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is d

Answer for Question No 2. is b

Answer for Question No 3. is c

Answer for Question No 4. is a

Answer for Question No 5. is c

Answer for Question No 6. is c

Answer for Question No 7. is a

Answer for Question No 8. is b

Answer for Question No 9. is c

Answer for Question No 10. is a

Answer for Question No 11. is c

Answer for Question No 12. is b

Answer for Question No 13. is b

Answer for Question No 14. is d

Answer for Question No 15. is a

Answer for Question No 16. is b

Answer for Question No 17. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is c

Answer for Question No 19. is b

Answer for Question No 20. is c

Answer for Question No 21. is c

Answer for Question No 22. is b

Answer for Question No 23. is b

Answer for Question No 24. is a

Answer for Question No 25. is c

Answer for Question No 26. is b

Answer for Question No 27. is c

Answer for Question No 28. is a

Answer for Question No 29. is b

Answer for Question No 30. is c

Answer for Question No 31. is c

Answer for Question No 32. is a

Answer for Question No 33. is b

Answer for Question No 34. is a

Answer for Question No 35. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is a

Answer for Question No 37. is a

Answer for Question No 38. is b

Answer for Question No 39. is a

Answer for Question No 40. is a

Answer for Question No 41. is d

Answer for Question No 42. is b

Answer for Question No 43. is b

Answer for Question No 44. is b

Answer for Question No 45. is d

Answer for Question No 46. is a

Answer for Question No 47. is c

Answer for Question No 48. is b

Answer for Question No 49. is d

Answer for Question No 50. is c

Answer for Question No 51. is b

Answer for Question No 52. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is d

Answer for Question No 54. is a

Answer for Question No 55. is b

Answer for Question No 56. is d

Answer for Question No 57. is c

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. The Bresenham's circle drawing algorithm uses the __of the circle to generate?

A : two-way symmetry

B : four-way symmetry

C : eight-way symmetry

D : Either two way or four way symmetry

Q.no 2. Which colour model is preferably used in printing

A : RGB

B : YIQ

C : CMYK

D : HSV

Q.no 3. A closed polyline is called a

A : Polychain

B : Polygon

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Polyclosed

D : Closed chain

Q.no 4. The transformation that is used to alter the size of an object is

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 5. The line is said to be interior to the clipping window if _______points are interior to
the window.

A : One end point

B : Both end points

C : Mid point

D : None of these

Q.no 6. Polygon filling algorithm who fills interior-defined regions are called___algorithms

A : Flood fill

B : Boundary fill

C : Scan line fill

D : Seed fill

Q.no 7. ______ refers to the number of dots on screen

A : pixel

B : Resolution

C : Aspect ratio

D : Frame buffer

Q.no 8. A two-dimensional array contain the details of all the segment are called

A : Segment Table

B : Segment Name

C : Operation

D : Segmentation

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. 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

Q.no 10. Color model is also called

A : color system

B : color space

C : color area

D : Both A & B

Q.no 11. An object can be viewed as a collection of

A : One segment

B : Two segments

C : Three segments

D : several segments

Q.no 12. Hue property refers to……

A : Colour Purity

B : Dominant frequency of light

C : Saturation

D : Brightness

Q.no 13. Color model used for monitors is

A : CMYK

B : CMY

C : RGB

D : HIS

Q.no 14. Use of Display File interpreter is....

A : Execute instructions to draw an image

B : Interprete the data

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Store image

D : Decide image color

Q.no 15. If we need to tilt the 2D object in one direction then we have to
use_____transformation.

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 16. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 17. An area on a physical device to which a window is mapped, is called a __________

A : Window

B : Segment

C : Clip

D : View port

Q.no 18. A bitmap is collection of ___________________ that describes an image

A : Bits

B : Colors

C : algorithms

D : pixels

Q.no 19. The basic geometric transformations are

A : Translation

B : Rotation

C : Scaling

D : All of the above

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 20. In _____________ method, direction number is given to each boundary line

A : Winding

B : Even-Odd

C : unwinding

D : None of these

Q.no 21. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 22. ________ is defined in terms of basic shapes, such as polygons or splines.

A : Storyboard layout

B : Object

C : Keyframe

D : In-between frames

Q.no 23. The process of selecting & viewing the picture with different views is called
_____________

A : Clipping

B : Windowing

C : Segmenting

D : All of the above

Q.no 24. For a circle drawing algorithm initial values of X & Y coordinates are _________

A : 0,r

B : r,0

C : r,r

D : 1,1

Q.no 25. The logical ______ of the endpoint codes determines if the line is completely inside
the window

A : AND
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : OR

C : NOT

D : NOR

Q.no 26. One that is not a color model is

A : RCB

B : RGB

C : CMY

D : HIS

Q.no 27. For a Bresenham’s line drawing initial decision parameter value of G is given as

A : G=0

B : G=2dy-dx

C : G=x/y

D : G=dy/dx

Q.no 28. In CMY colour model WHITE colour is represented by....

A : 1,1,1

B : 1,1,0

C : 1,0,1

D : 0,0,0

Q.no 29. A simple color frame buffer is implemented with _____bit planes

A:8

B:3

C:4

D:6

Q.no 30. Cohen-Sutherland algorithm is used for

A : point clipping

B : line clipping

C : fill-area clipping

D : All of the above

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 31. 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

Q.no 32. The transformation that disturbs the shape of an object are called

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 33. Mapping of the world co-ordinates into physical co-ordinates is called _____.

A : Homogeneous transformation

B : Co-ordinate conversion

C : Viewing transformation

D : Physical transformation

Q.no 34. In DDA line drawing algorithm, For lines with a slope less than or equal to 1, for
every value of X the value of Y is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 35. The Cohen-Sutherland algorithm divides the region into _____ number of spaces

A:8

B:6

C:7

D:9

Q.no 36. Example of morphing are

A : Oil takes the shape of a car

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : A tiger turns into a bike

C : Both A & B

D : None of these

Q.no 37. In Cohen-Sutherland subdivision line clipping algorithm bit 2 in Region code is set if

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

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 38. When a line with end points (10,20) and (30,18) is to be drawn using dda line
algoithm , _______is chosen as one raster unit.

A : dx

B : dy

C : a or b

D : None of these

Q.no 39. How many pixels will be there in the line segment with end points A(40,10) and B
(20, 60)?

A : 20

B : 50

C : 21

D : 51

Q.no 40. For Thick line segment to calculate Wy where Wy is thickness from center boundary
line to lower boundary

A : wy= squareroot[(x2-x1)2+ (y2-y1)2] / (2* |x2-x1|)

B : wy= (w-1) * squareroot((x2-x1)2+ (y2-y1)2 )/ (2* |x2-x1|)

C : wy= (w-1) * squareroot[(x2-x1)2+ (y2-y1)2] / ( |x2-x1|)

D : wy= (w-1) * ((x2-x1)2+ (y2-y1)2)/ (2* |x2-x1|)

Q.no 41. An outcode can have ____ bits for two-dimensional clipping

A:4

B:6

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C:2

D:1

Q.no 42. _______ is most straightforward method for defining a motion sequence.

A : Direct motion specification

B : Goal – Directed Systems

C : Kinematics and Dynamics

D : All of these

Q.no 43. A line with start point (0,0) and endpoint (4,6) is __________ line

A : Gentle

B : Steep

C : slope value one

D : All of above

Q.no 44. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

Q.no 45. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the
equation

A : x’=x+dx and y’=y+dx

B : x’=x+dx and y’=y+dy

C : X’=x+dy and Y’=y+dx

D : X’=x-dx and y’=y-dy

Q.no 46. A point P(3, 4) is a on circle that has center at origin. Which of the following point is
also on the circle ?

A : (3, -4)

B : (-4, 3)

C : (4, 3)

D : All of these
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 47. If both end points of a line are exterior to the clipping window,then
___________________.

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

Q.no 48. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

Q.no 49. 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

Q.no 50. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

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

A : Translation distances

B : Translation difference

C : X and Y

D : Only a

Q.no 52. Using DDA line algorithm a computed line position of (20.48, 34.51) using integer
function, would be converted to pixel position ________________.

A : (20, 34)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : (21, 34)

C : (34, 21)

D : (20, 35)

Q.no 53. For circle drawing, if f(x,y)<0 then ___________

A : x,y is inside the circle boundary

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

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

A : Scaling

B : Rotation

C : Translation

D : None of this

Q.no 55. 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

Q.no 56. The graphics method in which one object is transformed into another object are
called

A : Clipping

B : Morphing

C : Shearing

D : Reflection

Q.no 57. If both end points of a line are completely to the left of the clipping window
,____________________.

A : The line is interior to the clipping window

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

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

Q.no 58. A face is identified as VISIBLE face if the angle between view direction and surface/
face normal is .........

A : 0-45 degree

B : 0-90 degree

C : 90-180 degree

D : Greater than 180 degree

Q.no 59. 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.

Q.no 60. In HSV model black and white is represented by which pair of V and S values
respectively

A : V= 0 S =0

B : V= 0 S =1

C : V= 1 S =0

D : V= 1 S =1

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is c

Answer for Question No 2. is c

Answer for Question No 3. is b

Answer for Question No 4. is a

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is b

Answer for Question No 8. is a

Answer for Question No 9. is b

Answer for Question No 10. is d

Answer for Question No 11. is d

Answer for Question No 12. is b

Answer for Question No 13. is c

Answer for Question No 14. is a

Answer for Question No 15. is b

Answer for Question No 16. is b

Answer for Question No 17. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is d

Answer for Question No 19. is d

Answer for Question No 20. is a

Answer for Question No 21. is c

Answer for Question No 22. is b

Answer for Question No 23. is b

Answer for Question No 24. is a

Answer for Question No 25. is b

Answer for Question No 26. is a

Answer for Question No 27. is b

Answer for Question No 28. is d

Answer for Question No 29. is b

Answer for Question No 30. is b

Answer for Question No 31. is c

Answer for Question No 32. is b

Answer for Question No 33. is c

Answer for Question No 34. is a

Answer for Question No 35. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is c

Answer for Question No 37. is b

Answer for Question No 38. is a

Answer for Question No 39. is d

Answer for Question No 40. is b

Answer for Question No 41. is a

Answer for Question No 42. is a

Answer for Question No 43. is b

Answer for Question No 44. is a

Answer for Question No 45. is b

Answer for Question No 46. is d

Answer for Question No 47. is b

Answer for Question No 48. is b

Answer for Question No 49. is d

Answer for Question No 50. is b

Answer for Question No 51. is d

Answer for Question No 52. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is a

Answer for Question No 54. is a

Answer for Question No 55. is c

Answer for Question No 56. is b

Answer for Question No 57. is c

Answer for Question No 58. is b

Answer for Question No 59. is a

Answer for Question No 60. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. The process of removing objects that lie outside view point is called

A : clipping

B : projection transformation

C : hidden surface removal

D : hidden surface detection

Q.no 2. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 3. An object can be viewed as a collection of

A : One segment

B : Two segments

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Three segments

D : several segments

Q.no 4. The transformation that changes the co-ordinate positions of an object along a
circular path is called_______.

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 5. ______ refers to the number of dots on screen

A : pixel

B : Resolution

C : Aspect ratio

D : Frame buffer

Q.no 6. Use of Display File interpreter is....

A : Execute instructions to draw an image

B : Interprete the data

C : Store image

D : Decide image color

Q.no 7. Cohen-Sutherland algorithm is used for

A : point clipping

B : line clipping

C : fill-area clipping

D : All of the above

Q.no 8. We can correctly clip a polygon by processing the polygon boundary as a whole
against each ___________

A : side wall

B : top edge

C : window edge

D : bottom edge
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. A simple color frame buffer is implemented with _____bit planes

A:8

B:3

C:4

D:6

Q.no 10. 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

Q.no 11. The line is said to be interior to the clipping window if _______points are interior to
the window.

A : One end point

B : Both end points

C : Mid point

D : None of these

Q.no 12. A bitmap is collection of ___________________ that describes an image

A : Bits

B : Colors

C : algorithms

D : pixels

Q.no 13. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 14. The Bresenham's circle drawing algorithm uses the __of the circle to generate?

A : two-way symmetry
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : four-way symmetry

C : eight-way symmetry

D : Either two way or four way symmetry

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

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 16. Mapping of the world co-ordinates into physical co-ordinates is called _____.

A : Homogeneous transformation

B : Co-ordinate conversion

C : Viewing transformation

D : Physical transformation

Q.no 17. In DDA circle generation algorithm total _____ of the arc to be drawn is needed

A : length

B : distanance

C : angle

D : None of the above

Q.no 18. The basic geometric transformations are

A : Translation

B : Rotation

C : Scaling

D : All of the above

Q.no 19. Which colour model is preferably used in printing

A : RGB

B : YIQ

C : CMYK

D : HSV
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 20. ______________ uses 24 bit star bust pattern

A : Stroke Method

B : Scan line

C : Bit map

D : star bust method

Q.no 21. 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

Q.no 22. In Cohen-Sutherland subdivision line clipping algorithm, all bits in Region code is
set if_________

A : End point of the line lies within clipping window

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 23. 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

Q.no 24. Cohen-Sutherland clipping is an example of _________________

A : polygon clipping

B : line clipping

C : text clipping

D : curve clipping

Q.no 25. What is the primary use of clipping in computer graphics?

A : adding graphics
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : removing objects and lines

C : Copying

D : Zooming

Q.no 26. Color model is also called

A : color system

B : color space

C : color area

D : Both A & B

Q.no 27. You can’t draw a character with rounded shape in _____________ method

A : Bitmap method

B : Stroke method

C : Starbust method

D : all of above

Q.no 28. Which vertex of the polygon is clipped first in polygon clipping?

A : top right

B : bottom right

C : bottom left

D : top left

Q.no 29. A two-dimensional array contain the details of all the segment are called

A : Segment Table

B : Segment Name

C : Operation

D : Segmentation

Q.no 30. For a circle drawing algorithm initial values of X & Y coordinates are _________

A : 0,r

B : r,0

C : r,r

D : 1,1
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 31. The logical ______ of the endpoint codes determines if the line is completely inside
the window

A : AND

B : OR

C : NOT

D : NOR

Q.no 32. ________ is defined in terms of basic shapes, such as polygons or splines.

A : Storyboard layout

B : Object

C : Keyframe

D : In-between frames

Q.no 33. The transformation that is used to alter the size of an object is

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 34. In CMY colour model WHITE colour is represented by....

A : 1,1,1

B : 1,1,0

C : 1,0,1

D : 0,0,0

Q.no 35. To draw Line From (1,1) to (5,3) using digitial differential analyser algorithm what
will be the incremental value of x…..

A:1

B:2

C : -2

D : -4

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

A : Reflection about origin

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 37. An outcode can have ____ bits for two-dimensional clipping

A:4

B:6

C:2

D:1

Q.no 38. 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

Q.no 39. Match the following.

I. Line II. Convex fill-area III. Convex and concave fill-area with A. Sutherland-Hodgeman
algorithm
B. Cohen-Sutherland algorithm
C. Weiler-Atherton Algorithm

A : I-A, II-B, III-C

B : I-B, II-A, III-C

C : I-C, II-B, III-A

D : I-A, II-C, III-B

Q.no 40. Every segment has its own attributes like

A : Size,visibility

B : Start position

C : Image transformation

D : All of these

Q.no 41. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Black

B : White

C : Yellow

D : Magenta

Q.no 42. Using DDA line algorithm a computed line position of (20.48, 34.51) using integer
function, would be converted to pixel position ________________.

A : (20, 34)

B : (21, 34)

C : (34, 21)

D : (20, 35)

Q.no 43. 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

Q.no 44. If both end points of a line are completely to the left of 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

Q.no 45. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

Q.no 46. For a gentle slope lines value of Xincrement Xinc and Y increment Yinc are
_____________

A : 1,m
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : m,1

C : 1,1

D : m,m

Q.no 47. Two consecutive translation transformation t1 and t2 are

A : Additive

B : Multiplicative

C : Subtractive

D : none of above

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

A : Scaling

B : Rotation

C : Translation

D : None of this

Q.no 49. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

Q.no 50. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

Q.no 51. A line with start point (0,0) and endpoint (4,6) is __________ line

A : Gentle

B : Steep

C : slope value one

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : All of above

Q.no 52. 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

Q.no 53. For Thick line segment to calculate Wy where Wy is thickness from center boundary
line to lower boundary

A : wy= squareroot[(x2-x1)2+ (y2-y1)2] / (2* |x2-x1|)

B : wy= (w-1) * squareroot((x2-x1)2+ (y2-y1)2 )/ (2* |x2-x1|)

C : wy= (w-1) * squareroot[(x2-x1)2+ (y2-y1)2] / ( |x2-x1|)

D : wy= (w-1) * ((x2-x1)2+ (y2-y1)2)/ (2* |x2-x1|)

Q.no 54. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the
equation

A : x’=x+dx and y’=y+dx

B : x’=x+dx and y’=y+dy

C : X’=x+dy and Y’=y+dx

D : X’=x-dx and y’=y-dy

Q.no 55. A face is identified as VISIBLE face if the angle between view direction and surface/
face normal is .........

A : 0-45 degree

B : 0-90 degree

C : 90-180 degree

D : Greater than 180 degree

Q.no 56. In Cohen-Sutherland subdivision line clipping algorithm bit 2 in Region code is set if

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

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

C : End point of the line is below of the window

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : End point of the line is above of the window

Q.no 57. In RGB colour model (0,0,0) to (1,1,1) diagonal represents.............

A : Red scale

B : Green scale

C : Grey scale

D : Blue Scale

Q.no 58. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 59. Using the starbust method character A is represented as

A : 0011 0100 0011 1100 1110 0011

B : 0011 0000 0011 1100 1110 0001

C : 0011 0011 0011 1100 1110 0001

D : 0011 1100 0011 1100 1110 0001

Q.no 60. A line is having pixels (10,10,) and (20,16) . what is the initial error term by
Bresenham’s line algorithm.

A : -2

B:2

C : -22

D : 22

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is a

Answer for Question No 2. is c

Answer for Question No 3. is d

Answer for Question No 4. is b

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is b

Answer for Question No 8. is c

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is b

Answer for Question No 12. is d

Answer for Question No 13. is b

Answer for Question No 14. is c

Answer for Question No 15. is a

Answer for Question No 16. is c

Answer for Question No 17. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is d

Answer for Question No 19. is c

Answer for Question No 20. is d

Answer for Question No 21. is c

Answer for Question No 22. is a

Answer for Question No 23. is b

Answer for Question No 24. is b

Answer for Question No 25. is b

Answer for Question No 26. is d

Answer for Question No 27. is b

Answer for Question No 28. is d

Answer for Question No 29. is a

Answer for Question No 30. is a

Answer for Question No 31. is b

Answer for Question No 32. is b

Answer for Question No 33. is a

Answer for Question No 34. is d

Answer for Question No 35. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is c

Answer for Question No 37. is a

Answer for Question No 38. is c

Answer for Question No 39. is b

Answer for Question No 40. is d

Answer for Question No 41. is b

Answer for Question No 42. is a

Answer for Question No 43. is b

Answer for Question No 44. is c

Answer for Question No 45. is b

Answer for Question No 46. is a

Answer for Question No 47. is a

Answer for Question No 48. is a

Answer for Question No 49. is c

Answer for Question No 50. is b

Answer for Question No 51. is b

Answer for Question No 52. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is b

Answer for Question No 54. is b

Answer for Question No 55. is b

Answer for Question No 56. is b

Answer for Question No 57. is c

Answer for Question No 58. is c

Answer for Question No 59. is b

Answer for Question No 60. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 2. Cohen-Sutherland clipping is an example of _________________

A : polygon clipping

B : line clipping

C : text clipping

D : curve clipping

Q.no 3. _____is the basic approach used to fill the polygon

A : Seed fill

B : Scan line fill

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Vector fill

D : both a & b

Q.no 4. 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

Q.no 5. RGB and CMY are ...........and ............colour models respectively.

A : Additive, Additive

B : Additive, Subtractive

C : Subtractive, Additive

D : Subtractive, Subtractive

Q.no 6. In DDA line drawing algorithm, For lines with a slope less than or equal to 1, for
every value of X the value of Y is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 7. The Bresenham's circle drawing algorithm uses the __of the circle to generate?

A : two-way symmetry

B : four-way symmetry

C : eight-way symmetry

D : Either two way or four way symmetry

Q.no 8. What is the primary use of clipping in computer graphics?

A : adding graphics

B : removing objects and lines

C : Copying

D : Zooming
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. The transformation that disturbs the shape of an object are called

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 10. If have the final coordinates of the polygon, then to recover the original coordinates
of polygon we have to apply ______

A : Scaling

B : Translation

C : Inverse transformation

D : None of these

Q.no 11. If we need to tilt the 2D object in one direction then we have to
use_____transformation.

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 12. 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

Q.no 13. The basic geometric transformations are

A : Translation

B : Rotation

C : Scaling

D : All of the above

Q.no 14. A bitmap is collection of ___________________ that describes an image

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Bits

B : Colors

C : algorithms

D : pixels

Q.no 15. Cohen-Sutherland algorithm is used for

A : point clipping

B : line clipping

C : fill-area clipping

D : All of the above

Q.no 16. For a Bresenham’s line drawing initial decision parameter value of G is given as

A : G=0

B : G=2dy-dx

C : G=x/y

D : G=dy/dx

Q.no 17. Three primary colors are

A : Red, green, blue

B : Red, cyan, blue

C : Red, white, black

D : Red, green, yellow

Q.no 18. The logical ______ of the endpoint codes determines if the line is completely inside
the window

A : AND

B : OR

C : NOT

D : NOR

Q.no 19. You can’t draw a character with rounded shape in _____________ method

A : Bitmap method

B : Stroke method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Starbust method

D : all of above

Q.no 20. ________ is the art of creating moving images via the use of computers.

A : picture

B : image processing

C : computer animation

D : image enhancement

Q.no 21. The transformation that changes the co-ordinate positions of an object along a
circular path is called_______.

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 22. 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

Q.no 23. Color model used for monitors is

A : CMYK

B : CMY

C : RGB

D : HIS

Q.no 24. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 25. Use of Display File interpreter is....

A : Execute instructions to draw an image

B : Interprete the data

C : Store image

D : Decide image color

Q.no 26. A simple color frame buffer is implemented with _____bit planes

A:8

B:3

C:4

D:6

Q.no 27. Which vertex of the polygon is clipped first in polygon clipping?

A : top right

B : bottom right

C : bottom left

D : top left

Q.no 28. Hue and saturation, both together produce

A : brightness

B : transitivity

C : chromaticity

D : reflectivity

Q.no 29. 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

Q.no 30. One that is not a color model is

A : RCB

B : RGB
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : CMY

D : HIS

Q.no 31. Which colour model is preferably used in printing

A : RGB

B : YIQ

C : CMYK

D : HSV

Q.no 32. In Cohen-Sutherland subdivision line clipping algorithm, all bits in Region code is
set if_________

A : End point of the line lies within clipping window

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 33. We can correctly clip a polygon by processing the polygon boundary as a whole
against each ___________

A : side wall

B : top edge

C : window edge

D : bottom edge

Q.no 34. ________ is defined in terms of basic shapes, such as polygons or splines.

A : Storyboard layout

B : Object

C : Keyframe

D : In-between frames

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

A : Translation distances

B : Translation difference

C : X and Y

D : Only a
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

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

A : Scaling

B : Rotation

C : Translation

D : None of this

Q.no 37. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the
equation

A : x’=x+dx and y’=y+dx

B : x’=x+dx and y’=y+dy

C : X’=x+dy and Y’=y+dx

D : X’=x-dx and y’=y-dy

Q.no 38. For a gentle slope lines value of Xincrement Xinc and Y increment Yinc are
_____________

A : 1,m

B : m,1

C : 1,1

D : m,m

Q.no 39. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 40. The graphics method in which one object is transformed into another object are
called

A : Clipping

B : Morphing

C : Shearing

D : Reflection

Q.no 41. Every segment has its own attributes like

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Size,visibility

B : Start position

C : Image transformation

D : All of these

Q.no 42. 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

Q.no 43. Two consecutive translation transformation t1 and t2 are

A : Additive

B : Multiplicative

C : Subtractive

D : none of above

Q.no 44. For Thick line segment to calculate Wy where Wy is thickness from center boundary
line to lower boundary

A : wy= squareroot[(x2-x1)2+ (y2-y1)2] / (2* |x2-x1|)

B : wy= (w-1) * squareroot((x2-x1)2+ (y2-y1)2 )/ (2* |x2-x1|)

C : wy= (w-1) * squareroot[(x2-x1)2+ (y2-y1)2] / ( |x2-x1|)

D : wy= (w-1) * ((x2-x1)2+ (y2-y1)2)/ (2* |x2-x1|)

Q.no 45. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

Q.no 46. A point P(3, 4) is a on circle that has center at origin. Which of the following point is
also on the circle ?

A : (3, -4)

B : (-4, 3)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : (4, 3)

D : All of these

Q.no 47. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

Q.no 48. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

Q.no 49. To draw Line From (1,1) to (5,3) using digitial differential analyser algorithm what
will be the incremental value of x…..

A:1

B:2

C : -2

D : -4

Q.no 50. 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

Q.no 51. Using DDA line algorithm a computed line position of (20.48, 34.51) using integer
function, would be converted to pixel position ________________.

A : (20, 34)

B : (21, 34)

C : (34, 21)

D : (20, 35)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 52. The Cohen-Sutherland algorithm divides the region into _____ number of spaces

A:8

B:6

C:7

D:9

Q.no 53. In Cohen-Sutherland subdivision line clipping algorithm bit 2 in Region code is set if

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

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

C : End point of the line is below of the window

D : End point of the line is above of the window

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

A : Reflection about origin

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 55. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………

A : Black

B : White

C : Yellow

D : Magenta

Q.no 56. In RGB colour model (0,0,0) to (1,1,1) diagonal represents.............

A : Red scale

B : Green scale

C : Grey scale

D : Blue Scale

Q.no 57. 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
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

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

Q.no 58. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

Q.no 59. In HSV model black and white is represented by which pair of V and S values
respectively

A : V= 0 S =0

B : V= 0 S =1

C : V= 1 S =0

D : V= 1 S =1

Q.no 60. Using the starbust method character A is represented as

A : 0011 0100 0011 1100 1110 0011

B : 0011 0000 0011 1100 1110 0001

C : 0011 0011 0011 1100 1110 0001

D : 0011 1100 0011 1100 1110 0001

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is c

Answer for Question No 2. is b

Answer for Question No 3. is d

Answer for Question No 4. is c

Answer for Question No 5. is b

Answer for Question No 6. is a

Answer for Question No 7. is c

Answer for Question No 8. is b

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is b

Answer for Question No 12. is c

Answer for Question No 13. is d

Answer for Question No 14. is d

Answer for Question No 15. is b

Answer for Question No 16. is b

Answer for Question No 17. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is b

Answer for Question No 19. is b

Answer for Question No 20. is c

Answer for Question No 21. is b

Answer for Question No 22. is c

Answer for Question No 23. is c

Answer for Question No 24. is b

Answer for Question No 25. is a

Answer for Question No 26. is b

Answer for Question No 27. is d

Answer for Question No 28. is c

Answer for Question No 29. is b

Answer for Question No 30. is a

Answer for Question No 31. is c

Answer for Question No 32. is a

Answer for Question No 33. is c

Answer for Question No 34. is b

Answer for Question No 35. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is a

Answer for Question No 37. is b

Answer for Question No 38. is a

Answer for Question No 39. is c

Answer for Question No 40. is b

Answer for Question No 41. is d

Answer for Question No 42. is d

Answer for Question No 43. is a

Answer for Question No 44. is b

Answer for Question No 45. is b

Answer for Question No 46. is d

Answer for Question No 47. is b

Answer for Question No 48. is a

Answer for Question No 49. is a

Answer for Question No 50. is b

Answer for Question No 51. is a

Answer for Question No 52. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is b

Answer for Question No 54. is c

Answer for Question No 55. is b

Answer for Question No 56. is c

Answer for Question No 57. is b

Answer for Question No 58. is c

Answer for Question No 59. is a

Answer for Question No 60. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. Cohen-Sutherland algorithm is used for

A : point clipping

B : line clipping

C : fill-area clipping

D : All of the above

Q.no 2. Two primaries that produce…………colour are referred to as complementary colors.

A : Black

B : White

C : Red

D : Grey

Q.no 3. A closed polyline is called a

A : Polychain

B : Polygon

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Polyclosed

D : Closed chain

Q.no 4. ______ refers to the number of dots on screen

A : pixel

B : Resolution

C : Aspect ratio

D : Frame buffer

Q.no 5. 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

Q.no 6. The Bresenham's circle drawing algorithm uses the __of the circle to generate?

A : two-way symmetry

B : four-way symmetry

C : eight-way symmetry

D : Either two way or four way symmetry

Q.no 7. If we need to tilt the 2D object in one direction then we have to

use_____transformation.

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 8. The logical ______ of the endpoint codes determines if the line is completely inside the
window

A : AND

B : OR

C : NOT

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : NOR

Q.no 9. What is the primary use of clipping in computer graphics?

A : adding graphics

B : removing objects and lines

C : Copying

D : Zooming

Q.no 10. We can correctly clip a polygon by processing the polygon boundary as a whole
against each ___________

A : side wall

B : top edge

C : window edge

D : bottom edge

Q.no 11. Mapping of the world co-ordinates into physical co-ordinates is called _____.

A : Homogeneous transformation

B : Co-ordinate conversion

C : Viewing transformation

D : Physical transformation

Q.no 12. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 13. The transformation that is used to alter the size of an object is

A : Scaling

B : Rotation

C : Translation

D : Reflection

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

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Rotation angle ϴ

B : Distances dx and dy

C : Rotation distance

D : All of the mentioned

Q.no 15. One that is not a color model is

A : RCB

B : RGB

C : CMY

D : HIS

Q.no 16. A simple color frame buffer is implemented with _____bit planes

A:8

B:3

C:4

D:6

Q.no 17. Which colour model is preferably used in printing

A : RGB

B : YIQ

C : CMYK

D : HSV

Q.no 18. Cohen-Sutherland clipping is an example of _________________

A : polygon clipping

B : line clipping

C : text clipping

D : curve clipping

Q.no 19. In DDA line drawing algorithm, For lines with a positive slope greater than 1, for
every value of Y the value of X is incremented by ____

A:M

B : 1/M

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : 1+M

D : 1-M

Q.no 20. In CMY colour model WHITE colour is represented by....

A : 1,1,1

B : 1,1,0

C : 1,0,1

D : 0,0,0

Q.no 21. 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

Q.no 22. 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

Q.no 23. In _____________ method, direction number is given to each boundary line

A : Winding

B : Even-Odd

C : unwinding

D : None of these

Q.no 24. The line is said to be interior to the clipping window if _______points are interior to
the window.

A : One end point

B : Both end points

C : Mid point

D : None of these
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 25. The process of removing objects that lie outside view point is called

A : clipping

B : projection transformation

C : hidden surface removal

D : hidden surface detection

Q.no 26. Which vertex of the polygon is clipped first in polygon clipping?

A : top right

B : bottom right

C : bottom left

D : top left

Q.no 27. An object can be viewed as a collection of

A : One segment

B : Two segments

C : Three segments

D : several segments

Q.no 28. A two-dimensional array contain the details of all the segment are called

A : Segment Table

B : Segment Name

C : Operation

D : Segmentation

Q.no 29. Polygon filling algorithm who fills interior-defined regions are called___algorithms

A : Flood fill

B : Boundary fill

C : Scan line fill

D : Seed fill

Q.no 30. An area on a physical device to which a window is mapped, is called a __________

A : Window

B : Segment
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Clip

D : View port

Q.no 31. 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

Q.no 32. In DDA circle generation algorithm total _____ of the arc to be drawn is needed

A : length

B : distanance

C : angle

D : None of the above

Q.no 33. If have the final coordinates of the polygon, then to recover the original coordinates
of polygon we have to apply ______

A : Scaling

B : Translation

C : Inverse transformation

D : None of these

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 : None of these

Q.no 35. Reflection of a point about x-axis, followed by a counter-clockwise rotation of 90° , is
equivalent. to reflection about the line

A : x = -y

B : y=-x

C : x=y

D:x+y=1
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 36. 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

Q.no 37. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

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

A : Reflection about origin

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 39. In Cohen-Sutherland subdivision line clipping algorithm bit 2 in Region code is set if

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

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 40. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

Q.no 41. When a line with end points (10,20) and (30,18) is to be drawn using dda line
algoithm , _______is chosen as one raster unit.

A : dx
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : dy

C : a or b

D : None of these

Q.no 42. 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

Q.no 43. If both end points of a line are exterior to the clipping window,then
___________________.

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

Q.no 44. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 45. For a gentle slope lines value of Xincrement Xinc and Y increment Yinc are
_____________

A : 1,m

B : m,1

C : 1,1

D : m,m

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

A : Scaling

B : Rotation

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Translation

D : None of this

Q.no 47. An outcode can have ____ bits for two-dimensional clipping

A:4

B:6

C:2

D:1

Q.no 48. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

Q.no 49. In RGB colour model (0,0,0) to (1,1,1) diagonal represents.............

A : Red scale

B : Green scale

C : Grey scale

D : Blue Scale

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

A : Translation distances

B : Translation difference

C : X and Y

D : Only a

Q.no 51. A line with start point (0,0) and endpoint (4,6) is __________ line

A : Gentle

B : Steep

C : slope value one

D : All of above

Q.no 52. In homogeneous co-ordinate system a pixel is represented as ____________.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : X,Y

B : X,Y,Z

C : X,Y,W

D : Xw,Yw,w

Q.no 53. A point P(3, 4) is a on circle that has center at origin. Which of the following point is
also on the circle ?

A : (3, -4)

B : (-4, 3)

C : (4, 3)

D : All of these

Q.no 54. Every segment has its own attributes like

A : Size,visibility

B : Start position

C : Image transformation

D : All of these

Q.no 55. If both end points of a line are completely to the left of 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

Q.no 56. Match the following.

I. Line II. Convex fill-area III. Convex and concave fill-area with A. Sutherland-Hodgeman
algorithm
B. Cohen-Sutherland algorithm
C. Weiler-Atherton Algorithm

A : I-A, II-B, III-C

B : I-B, II-A, III-C

C : I-C, II-B, III-A

D : I-A, II-C, III-B

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 57. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

Q.no 58. For circle drawing, if f(x,y)<0 then ___________

A : x,y is inside the circle boundary

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

Q.no 59. 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.

Q.no 60. Line with the coordinates (x1,y1) and (x2,y2) having thickness w with gentle slope ,
then correct boundaries are

A : (x1, y1+wy) ,(x2,y2+wy), (x1, y1-wy) ,(x2,y2-wy)

B : (x1+wx, y1) ,(x2+wx,y2), (x1-wx, y1) ,(x2-wx,y2)

C : Both A and B

D : Can not say

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is b

Answer for Question No 2. is b

Answer for Question No 3. is b

Answer for Question No 4. is b

Answer for Question No 5. is c

Answer for Question No 6. is c

Answer for Question No 7. is b

Answer for Question No 8. is b

Answer for Question No 9. is b

Answer for Question No 10. is c

Answer for Question No 11. is c

Answer for Question No 12. is c

Answer for Question No 13. is a

Answer for Question No 14. is a

Answer for Question No 15. is a

Answer for Question No 16. is b

Answer for Question No 17. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is b

Answer for Question No 19. is b

Answer for Question No 20. is d

Answer for Question No 21. is c

Answer for Question No 22. is b

Answer for Question No 23. is a

Answer for Question No 24. is b

Answer for Question No 25. is a

Answer for Question No 26. is d

Answer for Question No 27. is d

Answer for Question No 28. is a

Answer for Question No 29. is a

Answer for Question No 30. is d

Answer for Question No 31. is c

Answer for Question No 32. is c

Answer for Question No 33. is c

Answer for Question No 34. is b

Answer for Question No 35. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is c

Answer for Question No 37. is b

Answer for Question No 38. is c

Answer for Question No 39. is b

Answer for Question No 40. is a

Answer for Question No 41. is a

Answer for Question No 42. is b

Answer for Question No 43. is b

Answer for Question No 44. is c

Answer for Question No 45. is a

Answer for Question No 46. is a

Answer for Question No 47. is a

Answer for Question No 48. is b

Answer for Question No 49. is c

Answer for Question No 50. is d

Answer for Question No 51. is b

Answer for Question No 52. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is d

Answer for Question No 54. is d

Answer for Question No 55. is c

Answer for Question No 56. is b

Answer for Question No 57. is c

Answer for Question No 58. is a

Answer for Question No 59. is a

Answer for Question No 60. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. In Cohen-Sutherland subdivision line clipping algorithm, all bits in Region code is set
if_________

A : End point of the line lies within clipping window

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

C : End point of the line is below of the window

D : End point of the line is above of the window

Q.no 2. The process of removing objects that lie outside view point is called

A : clipping

B : projection transformation

C : hidden surface removal

D : hidden surface detection

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

A : Reflection

B : Shear
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Rotation

D : Scaling

Q.no 4. If we need to tilt the 2D object in one direction then we have to

use_____transformation.

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 5. An object can be viewed as a collection of

A : One segment

B : Two segments

C : Three segments

D : several segments

Q.no 6. Color model used for monitors is

A : CMYK

B : CMY

C : RGB

D : HIS

Q.no 7. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 8. Hue and saturation, both together produce

A : brightness

B : transitivity

C : chromaticity

D : reflectivity

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. What is the primary use of clipping in computer graphics?

A : adding graphics

B : removing objects and lines

C : Copying

D : Zooming

Q.no 10. In CMY colour model WHITE colour is represented by....

A : 1,1,1

B : 1,1,0

C : 1,0,1

D : 0,0,0

Q.no 11. ________ is the art of creating moving images via the use of computers.

A : picture

B : image processing

C : computer animation

D : image enhancement

Q.no 12. For a circle drawing algorithm initial values of X & Y coordinates are _________

A : 0,r

B : r,0

C : r,r

D : 1,1

Q.no 13. The process of selecting & viewing the picture with different views is called
_____________

A : Clipping

B : Windowing

C : Segmenting

D : All of the above

Q.no 14. Which vertex of the polygon is clipped first in polygon clipping?

A : top right

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : bottom right

C : bottom left

D : top left

Q.no 15. Color model is also called

A : color system

B : color space

C : color area

D : Both A & B

Q.no 16. In _____________ method, direction number is given to each boundary line

A : Winding

B : Even-Odd

C : unwinding

D : None of these

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

A : Rotation angle ϴ

B : Distances dx and dy

C : Rotation distance

D : All of the mentioned

Q.no 18. In DDA line drawing algorithm, For lines with a slope less than or equal to 1, for
every value of X the value of Y is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

Q.no 19. If have the final coordinates of the polygon, then to recover the original coordinates
of polygon we have to apply ______

A : Scaling

B : Translation

C : Inverse transformation
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : None of these

Q.no 20. 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

Q.no 21. The transformation that disturbs the shape of an object are called

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 22. The transformation that changes the co-ordinate positions of an object along a
circular path is called_______.

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 23. An area on a physical device to which a window is mapped, is called a __________

A : Window

B : Segment

C : Clip

D : View port

Q.no 24. Cohen-Sutherland clipping is an example of _________________

A : polygon clipping

B : line clipping

C : text clipping

D : curve clipping

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 25. Two primaries that produce…………colour are referred to as complementary

colors.

A : Black

B : White

C : Red

D : Grey

Q.no 26. What is the name of area of the triangle in C.I E chromatic diagram that shows a
typical range of colors produced by RGB monitors?

A : Color gamut

B : Tricolor

C : Color game

D : Chromatic colors

Q.no 27. 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

Q.no 28. 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

Q.no 29. ______ refers to the number of dots on screen

A : pixel

B : Resolution

C : Aspect ratio

D : Frame buffer

Q.no 30. You can’t draw a character with rounded shape in _____________ method

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Bitmap method

B : Stroke method

C : Starbust method

D : all of above

Q.no 31. _____is the basic approach used to fill the polygon

A : Seed fill

B : Scan line fill

C : Vector fill

D : both a & b

Q.no 32. Use of Display File interpreter is....

A : Execute instructions to draw an image

B : Interprete the data

C : Store image

D : Decide image color

Q.no 33. The Bresenham's circle drawing algorithm uses the __of the circle to generate?

A : two-way symmetry

B : four-way symmetry

C : eight-way symmetry

D : Either two way or four way symmetry

Q.no 34. The line is said to be interior to the clipping window if _______points are interior to
the window.

A : One end point

B : Both end points

C : Mid point

D : None of these

Q.no 35. A point P(3, 4) is a on circle that has center at origin. Which of the following point is
also on the circle ?

A : (3, -4)

B : (-4, 3)
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : (4, 3)

D : All of these

Q.no 36. 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

Q.no 37. For a gentle slope lines value of Xincrement Xinc and Y increment Yinc are
_____________

A : 1,m

B : m,1

C : 1,1

D : m,m

Q.no 38. An outcode can have ____ bits for two-dimensional clipping

A:4

B:6

C:2

D:1

Q.no 39. Two consecutive translation transformation t1 and t2 are

A : Additive

B : Multiplicative

C : Subtractive

D : none of above

Q.no 40. To draw Line From (1,1) to (5,3) using digitial differential analyser algorithm what
will be the incremental value of x…..

A:1

B:2

C : -2

D : -4
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 41. How many pixels will be there in the line segment with end points A(40,10) and B
(20, 60)?

A : 20

B : 50

C : 21

D : 51

Q.no 42. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

Q.no 43. 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

Q.no 44. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

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

A : Translation distances

B : Translation difference

C : X and Y

D : Only a

Q.no 46. The Cohen-Sutherland algorithm divides the region into _____ number of spaces

A:8
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B:6

C:7

D:9

Q.no 47. Bitmap method is also called dot matrix method because

A : Characters are represented by 24 bits

B : Characters are represented an array of dots in matrix form.

C : Characters are represented by line segments

D : None of the above

Q.no 48. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the
equation

A : x’=x+dx and y’=y+dx

B : x’=x+dx and y’=y+dy

C : X’=x+dy and Y’=y+dx

D : X’=x-dx and y’=y-dy

Q.no 49. Reflection of a point about x-axis, followed by a counter-clockwise rotation of 90° , is
equivalent. to reflection about the line

A : x = -y

B : y=-x

C : x=y

D:x+y=1

Q.no 50. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

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

A : Reflection about origin

B : Reflection about x-axis

C : Reflection at line Y=X

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : Reflection about y-axis

Q.no 52. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 53. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………

A : Black

B : White

C : Yellow

D : Magenta

Q.no 54. 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

Q.no 55. If both end points of a line are completely to the left of 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

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

A : Scaling

B : Rotation

C : Translation
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : None of this

Q.no 57. For circle drawing, if f(x,y)<0 then ___________

A : x,y is inside the circle boundary

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

Q.no 58. 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

Q.no 59. Using the starbust method character A is represented as

A : 0011 0100 0011 1100 1110 0011

B : 0011 0000 0011 1100 1110 0001

C : 0011 0011 0011 1100 1110 0001

D : 0011 1100 0011 1100 1110 0001

Q.no 60. 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)

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is a

Answer for Question No 2. is a

Answer for Question No 3. is a

Answer for Question No 4. is b

Answer for Question No 5. is d

Answer for Question No 6. is c

Answer for Question No 7. is c

Answer for Question No 8. is c

Answer for Question No 9. is b

Answer for Question No 10. is d

Answer for Question No 11. is c

Answer for Question No 12. is a

Answer for Question No 13. is b

Answer for Question No 14. is d

Answer for Question No 15. is d

Answer for Question No 16. is a

Answer for Question No 17. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is a

Answer for Question No 19. is c

Answer for Question No 20. is c

Answer for Question No 21. is b

Answer for Question No 22. is b

Answer for Question No 23. is d

Answer for Question No 24. is b

Answer for Question No 25. is b

Answer for Question No 26. is a

Answer for Question No 27. is b

Answer for Question No 28. is c

Answer for Question No 29. is b

Answer for Question No 30. is b

Answer for Question No 31. is d

Answer for Question No 32. is a

Answer for Question No 33. is c

Answer for Question No 34. is b

Answer for Question No 35. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is b

Answer for Question No 37. is a

Answer for Question No 38. is a

Answer for Question No 39. is a

Answer for Question No 40. is a

Answer for Question No 41. is d

Answer for Question No 42. is b

Answer for Question No 43. is c

Answer for Question No 44. is c

Answer for Question No 45. is d

Answer for Question No 46. is d

Answer for Question No 47. is b

Answer for Question No 48. is b

Answer for Question No 49. is c

Answer for Question No 50. is a

Answer for Question No 51. is c

Answer for Question No 52. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is b

Answer for Question No 54. is d

Answer for Question No 55. is c

Answer for Question No 56. is a

Answer for Question No 57. is a

Answer for Question No 58. is b

Answer for Question No 59. is b

Answer for Question No 60. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Seat No -
Total number of questions : 60
1000318_T1 COMPUTER GRAPHICS
Time : 1hr
Max Marks : 50
N.B

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. ____________is a method for testing a pixel inside of a polygon.

A : Even-odd method

B : Winding number method

C:A&B

D : None of these

Q.no 2. In CMY colour model WHITE colour is represented by....

A : 1,1,1

B : 1,1,0

C : 1,0,1

D : 0,0,0

Q.no 3. An object can be viewed as a collection of

A : One segment

B : Two segments

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 1/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Three segments

D : several segments

Q.no 4. A simple color frame buffer is implemented with _____bit planes

A:8

B:3

C:4

D:6

Q.no 5. Hue and saturation, both together produce

A : brightness

B : transitivity

C : chromaticity

D : reflectivity

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

A : Reflection

B : Shear

C : Rotation

D : Scaling

Q.no 7. Which vertex of the polygon is clipped first in polygon clipping?

A : top right

B : bottom right

C : bottom left

D : top left

Q.no 8. In DDA line drawing algorithm, For lines with a slope less than or equal to 1, for
every value of X the value of Y is incremented by ____

A:M

B : 1/M

C : 1+M

D : 1-M

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 2/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 9. The transformation that changes the co-ordinate positions of an object along a
circular path is called_______.

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 10. What is the name of area of the triangle in C.I E chromatic diagram that shows a
typical range of colors produced by RGB monitors?

A : Color gamut

B : Tricolor

C : Color game

D : Chromatic colors

Q.no 11. Three primary colors are

A : Red, green, blue

B : Red, cyan, blue

C : Red, white, black

D : Red, green, yellow

Q.no 12. In _____________ method, direction number is given to each boundary line

A : Winding

B : Even-Odd

C : unwinding

D : None of these

Q.no 13. ________ is the art of creating moving images via the use of computers.

A : picture

B : image processing

C : computer animation

D : image enhancement

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

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 3/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Serial, Parallel

B : Serial,Perspective

C : Parallel, Perspective

D : None of these

Q.no 15. For a circle drawing algorithm initial values of X & Y coordinates are _________

A : 0,r

B : r,0

C : r,r

D : 1,1

Q.no 16. The transformation that is used to alter the size of an object is

A : Scaling

B : Rotation

C : Translation

D : Reflection

Q.no 17. For a Bresenham’s line drawing initial decision parameter value of G is given as

A : G=0

B : G=2dy-dx

C : G=x/y

D : G=dy/dx

Q.no 18. Polygon filling algorithm who fills interior-defined regions are called___algorithms

A : Flood fill

B : Boundary fill

C : Scan line fill

D : Seed fill

Q.no 19. Use of Display File interpreter is....

A : Execute instructions to draw an image

B : Interprete the data

C : Store image
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 4/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

D : Decide image color

Q.no 20. _____is the basic approach used to fill the polygon

A : Seed fill

B : Scan line fill

C : Vector fill

D : both a & b

Q.no 21. Cohen-Sutherland clipping is an example of _________________

A : polygon clipping

B : line clipping

C : text clipping

D : curve clipping

Q.no 22. The logical ______ of the endpoint codes determines if the line is completely inside
the window

A : AND

B : OR

C : NOT

D : NOR

Q.no 23. The basic geometric transformations are

A : Translation

B : Rotation

C : Scaling

D : All of the above

Q.no 24. Two primaries that produce…………colour are referred to as complementary

colors.

A : Black

B : White

C : Red

D : Grey

Q.no 25. In translation transformation Ty indicates____________.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 5/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : Scaling factor along Y direction

B : Translation factor along Y direction

C : Tilting factor along Y direction

D : None of these

Q.no 26. A closed polyline is called a

A : Polychain

B : Polygon

C : Polyclosed

D : Closed chain

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

A : Rotation angle ϴ

B : Distances dx and dy

C : Rotation distance

D : All of the mentioned

Q.no 28. The line is said to be interior to the clipping window if _______points are interior to
the window.

A : One end point

B : Both end points

C : Mid point

D : None of these

Q.no 29. Mapping of the world co-ordinates into physical co-ordinates is called _____.

A : Homogeneous transformation

B : Co-ordinate conversion

C : Viewing transformation

D : Physical transformation

Q.no 30. If we need to tilt the 2D object in one direction then we have to
use_____transformation.

A : Reflection

B : Shear
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 6/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Rotation

D : Scaling

Q.no 31. Which colour model is preferably used in printing

A : RGB

B : YIQ

C : CMYK

D : HSV

Q.no 32. Color model used for monitors is

A : CMYK

B : CMY

C : RGB

D : HIS

Q.no 33. 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

Q.no 34. ______________ uses 24 bit star bust pattern

A : Stroke Method

B : Scan line

C : Bit map

D : star bust method

Q.no 35. Example of morphing are

A : Oil takes the shape of a car

B : A tiger turns into a bike

C : Both A & B

D : None of these

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 7/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

Q.no 36. When a line with end points (10,20) and (30,18) is to be drawn using dda line
algoithm , _______is chosen as one raster unit.

A : dx

B : dy

C : a or b

D : None of these

Q.no 37. In RGB colour model (0,0,0) to (1,1,1) diagonal represents.............

A : Red scale

B : Green scale

C : Grey scale

D : Blue Scale

Q.no 38. In _________ the forces that produce the velocities and accelerations are specified

A : Kinematics

B : Dynamics

C : Inverse Kinematics

D : All of these

Q.no 39. A face is identified as VISIBLE face if the angle between view direction and surface/
face normal is .........

A : 0-45 degree

B : 0-90 degree

C : 90-180 degree

D : Greater than 180 degree

Q.no 40. Using DDA line algorithm a computed line position of (20.48, 34.51) using integer
function, would be converted to pixel position ________________.

A : (20, 34)

B : (21, 34)

C : (34, 21)

D : (20, 35)

Q.no 41. The Cohen-Sutherland algorithm divides the region into _____ number of spaces

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 8/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A:8

B:6

C:7

D:9

Q.no 42. For circle drawing, if f(x,y)<0 then ___________

A : x,y is inside the circle boundary

B : x,y is on the circle boundary

C : x,y is outside the circle boundary

D : None of these

Q.no 43. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the
equation

A : x’=x+dx and y’=y+dx

B : x’=x+dx and y’=y+dy

C : X’=x+dy and Y’=y+dx

D : X’=x-dx and y’=y-dy

Q.no 44. In CMY model Positions within

the unit cube are described by
subtracting the specified amounts of
the primary colors from ……………

A : Black

B : White

C : Yellow

D : Magenta

Q.no 45. The graphics method in which one object is transformed into another object are
called

A : Clipping

B : Morphing

C : Shearing

D : Reflection

Q.no 46. In homogeneous co-ordinate system a pixel is represented as ____________.

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 9/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

A : X,Y

B : X,Y,Z

C : X,Y,W

D : Xw,Yw,w

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

A : Scaling

B : Rotation

C : Translation

D : None of this

Q.no 48. In CG, a region (fill area) is defined broadly in two ways:

A : pixel level and geometric

B : pixel level and voxel level

C : pixel level and screen level

D : voxel level and screen level

Q.no 49. A line with start point (0,0) and endpoint (4,6) is __________ line

A : Gentle

B : Steep

C : slope value one

D : All of above

Q.no 50. Reflection of a point about x-axis, followed by a counter-clockwise rotation of 90° , is
equivalent. to reflection about the line

A : x = -y

B : y=-x

C : x=y

D:x+y=1

Q.no 51. Two consecutive translation transformation t1 and t2 are

A : Additive

B : Multiplicative
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 10/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

C : Subtractive

D : none of above

Q.no 52. A point P(3, 4) is a on circle that has center at origin. Which of the following point is
also on the circle ?

A : (3, -4)

B : (-4, 3)

C : (4, 3)

D : All of these

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

A : Translation distances

B : Translation difference

C : X and Y

D : Only a

Q.no 54. If both end points of a line are completely to the left of 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

Q.no 55. Match the following.

I. Line II. Convex fill-area III. Convex and concave fill-area with A. Sutherland-Hodgeman
algorithm
B. Cohen-Sutherland algorithm
C. Weiler-Atherton Algorithm

A : I-A, II-B, III-C

B : I-B, II-A, III-C

C : I-C, II-B, III-A

D : I-A, II-C, III-B

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

A : Reflection about origin

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 11/12
12/18/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1

B : Reflection about x-axis

C : Reflection at line Y=X

D : Reflection about y-axis

Q.no 57. Equation that describes hue is

A : H = H-90

B : H = H-100

C : H = H-120

D : H = H-180

Q.no 58. _______ is most straightforward method for defining a motion sequence.

A : Direct motion specification

B : Goal – Directed Systems

C : Kinematics and Dynamics

D : All of these

Q.no 59. Line with the coordinates (4,5) and (7,10) is rasterized using DDA. What is the value
of the next pixel

A : (4,6)

B : (5,7)

C : (7,5)

D : (6,4)

Q.no 60. Line with the coordinates (x1,y1) and (x2,y2) having thickness w with gentle slope ,
then correct boundaries are

A : (x1, y1+wy) ,(x2,y2+wy), (x1, y1-wy) ,(x2,y2-wy)

B : (x1+wx, y1) ,(x2+wx,y2), (x1-wx, y1) ,(x2-wx,y2)

C : Both A and B

D : Can not say

https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5469&code=1052000&showTest=0&actForm=edit&set=1 12/12
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 1. is c

Answer for Question No 2. is d

Answer for Question No 3. is d

Answer for Question No 4. is b

Answer for Question No 5. is c

Answer for Question No 6. is a

Answer for Question No 7. is d

Answer for Question No 8. is a

Answer for Question No 9. is b

Answer for Question No 10. is a

Answer for Question No 11. is a

Answer for Question No 12. is a

Answer for Question No 13. is c

Answer for Question No 14. is c

Answer for Question No 15. is a

Answer for Question No 16. is a

Answer for Question No 17. is b

https://sppu.wheebox.com/WAC-3/openanswers.obj 1/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 18. is a

Answer for Question No 19. is a

Answer for Question No 20. is d

Answer for Question No 21. is b

Answer for Question No 22. is b

Answer for Question No 23. is d

Answer for Question No 24. is b

Answer for Question No 25. is b

Answer for Question No 26. is b

Answer for Question No 27. is a

Answer for Question No 28. is b

Answer for Question No 29. is c

Answer for Question No 30. is b

Answer for Question No 31. is c

Answer for Question No 32. is c

Answer for Question No 33. is b

Answer for Question No 34. is d

Answer for Question No 35. is c

https://sppu.wheebox.com/WAC-3/openanswers.obj 2/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 36. is a

Answer for Question No 37. is c

Answer for Question No 38. is b

Answer for Question No 39. is b

Answer for Question No 40. is a

Answer for Question No 41. is d

Answer for Question No 42. is a

Answer for Question No 43. is b

Answer for Question No 44. is b

Answer for Question No 45. is b

Answer for Question No 46. is d

Answer for Question No 47. is a

Answer for Question No 48. is a

Answer for Question No 49. is b

Answer for Question No 50. is c

Answer for Question No 51. is a

Answer for Question No 52. is d

https://sppu.wheebox.com/WAC-3/openanswers.obj 3/4
12/18/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj

Answer for Question No 53. is d

Answer for Question No 54. is c

Answer for Question No 55. is b

Answer for Question No 56. is c

Answer for Question No 57. is c

Answer for Question No 58. is a

Answer for Question No 59. is a

Answer for Question No 60. is a

https://sppu.wheebox.com/WAC-3/openanswers.obj 4/4
 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…………………………………………..
 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 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
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 model
B. 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 buffer
C. 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 pixel
B. 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=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
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
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 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
Su
bje
ct:
-
Compu
terGraph
ics
Obj
ec
ti
vety
peque
sti
onsUnit
-IGr
aph
icsPr
imi
t
ive
sandS
canCo
nve
rsi
on

1)
Inc o
mp ut
ergrap
hics
,pi
ct
ure
sorg
rap
hic
sob
jec
tsar
epr
ese
nte
dasac
oll
ect
i
ono
fdi
sc
ret
epi
ct
ure
el
ementcall
ed_
_____.
A.dot
s
B.pi
xels
C.co
-or
dinat
es
D.poi
nts
ANS WER: B

2)
.____
___
ist
hes
mal
le
stad
dre
ssab
les
cre
ene
leme
nt.
A.dot
s
B.po
int
C.pi
xel
s
D.spot
ANS WER: C

3.
)____
__i
sth
esmal
le
stp
iec
eoft
hed
isp
lays
cre
enwh
ichwec
anc
ont
rol
.
A.dot
s
B.po
int
C.s
pot
D.pi
xel
ANS WER: D

4)
Wec anco
ntr
ol_
___
oft
hep
ixe
lswh
ichc
omp
oset
hes
cre
en.
A.inte
nsi
ty
B.si
ze
C.s
h ape
D.No ne
ANS WER:A

5)
Wec anco
ntr
ol_
___
oft
hep
ixe
lswh
ichc
omp
oset
hes
cre
en.
A.col
o ur
B.si
ze
C.sh
ap e
D.No ne
ANS WER: A

6)
Eachpixe
lonthegraphi
csdi
spl
ayrepr
esent
s___
___.
A.asi
nglemathe
matic
alpoint
B.2mat
hemati
calpo
int
C.
4mathemati
calpo
int
D.areg
ionwhi
chtheor
eti
cal
lycanco
ntai
ninfi
nit
epoi
nt
s
ANS WER: D

7)
.Ap oi
nt(
42,
38)
canb
edi
spl
aye
donas
cre
enb
yap
ixe
l.
A.(4
,3)
B.(
3,4
)
C.(
5,
4)
D.(4
,4)
ANS WER: A
8)
Th eproce
ssofde
ter
mini
ngt
heap
pro
pri
atep
ixe
lfo
rre
pre
sen
ti
ng,
pic
tur
eorg
rap
hic
sob
jec
tsi
skno
wn
as_
_ _
A.scanc o
nver
sio
n
B.raste
ri
zati
on
C.scanni
ng
D.graphic
alrepr
ese
ntat
io
n
ANS WER: B

9)Th epr
oces
srepre
sent
ingc
ont
i
nuo
usp
ict
ureo
rgr
aph
icso
bje
ctsasac
oll
ect
i
ono
fde
scr
etep
ixe
lsi
s
cal
led____
.
A.scanc o
nvers
ion
B.raste
ri
zati
on
C.scanni
ng
D.graphic
alrepr
esent
ati
on
ANS WER: A

10)
Thecompute
rgraphi
csal
lows
___
_onp
ict
ure
sbe
for
edi
spl
ayi
ngi
t
.
A.rot
ati
on
B.t
ransl
ati
on
C.s
cali
ngandproj
ect
i
ons
D.Allofabov
e
ANS WER: D

11
)Graphi
csdevi
cesi
ncl
ude
___
__.
A.input
devi
ces
B.out
putdev
ice
s
C.aandb
D.No ne
ANS WER: C

12
)Co mput
ergraphi
csall
ows_
____
.
A.userint
erf
ace
B.pl
otti
ngofgraphi
csandch
art
C.of
ficeau
tomati
onanddesk
topp
ubli
shi
ng
D.allofabov
e
ANS WER: D

13
)Co mput
ergraph
icsal
lows
___
___.
A.copmute
r-ai
deddraf
ti
ngandd
esi
gn
B.si
mu l
aio
nandanimatio
n
C.ar
t andcommerc
e
D.allofabo
v e
ANS WER: D

14
)Co mpute
rgraphi
csal
lows
___
__.
A.p r
oces
sc o
ntro
l
B.cart
ography
C.artandcommerce
D.allofabove
ANS WER: D

15
)Thes o
ftwareco
mp o
nent
sofc
onc
ept
ualf
rame
wor
kfo
rint
erac
ti
veg
rap
hic
sis
/ar
e__
___
.
A.applic
atio
nmo de
lB.app
li
cat
i
onpro
gram
C.gr
ap hi
cssyst
em
D.allofabove
ANS WER: D
16)
Th eHardwarec
omp
one
ntso
fco
nce
ptu
alf
rame
wor
kfo
rint
erac
ti
veg
rap
hic
sis
/ar
e__
___
___
.
A.input
devi
ces
B.out
putde
vic
es
C.aandb
D.noneoft
hese
ANS WER: C

17
)Thedis
playde
vic
esar
e__
___
.
A.input
B.out
put
C.aandb
D.noneoft
h e
se
ANS WER: B

18
)CRTs tand
sfor_
___.
A.Catho
deRayTu be
B.Col
ourRayTu be
C.Cat
hodeRad i
oTube
D.Col
ourRad i
oTube
ANS WER: A

19)
ACRTi sane
vac
uat
ed_
___
___
__t
ube
.
A.plas
ti
c
B.gl
ass
C.st
eel
D.ir
on
ANS WER:B

20)An________
___
_gu
nat
ther
earo
fth
eCRTp
rod
uce
sab
eamo
fel
ect
rons
.
A.ele
ctr
onic
B.e
lect
ron
C.e
lement
D.emerge
ncy
ANS WER: B

21
)Thedefl
ect
ions
yst
emo
fth
eCRTc
ons
is
tso
f__
___
___
___
def
lec
ti
onp
lat
es.
A.vert
i
cal
B.ho
rizo
ntal
C.aandb
D.noneofth
ese
ANS WER: C

22
) Thete
chiq
ue(s
)us
edf
orp
rod
uci
ngi
mag
eont
heCRTi
s/
are
___
___
___
_.
A.vect
orscan
B.ras
terscan
C.Bot
haandb
D.noneofthes
e
ANS WER: C

23
)Ve cto
rs c
antec
hni
quei
sal
soc
all
ed_
___
___
__.
A.scalarscan
B.r
and oms can
C.r
as t
erscan
D.be
ams can
ANS WER: B
24
)Inv e
cto
rscandis
play
,bu
ffe
rme
mor
yus
edi
sal
soc
all
ed_
___
___
__.
A.ref
res
hme mory
B.r
efre
shbuff
er
C.bu
ffe
rdisp
lay
D.ref
res
hcirc
uit
ANS WER: B

25)Inve
cto
rsc
and
isp
lay
,th
eph
osp
hori
stob
ere
fre
she
dat
leas
t__
___
___t
i
mesp
ers
eco
ndt
oav
oid
fl
ic
k e
r.
A.10
B.20
C.30
D.40
ANS WER:C

26)
An _______
___
__g
unat
ther
earo
fth
eCRTp
rod
uce
sab
eamo
fel
ect
rons
.
A.ele
ctr
onic
B.e
lect
ron
C.e
lement
D.emerge
ncy
ANS WER: B

27
)Thedefle
cti
ons
yst
emo
fth
eCRTc
ons
is
tso
f__
___
___
___
def
lec
ti
onp
lat
es.
A.vert
i
cal
B.ho
rizo
ntal
C.aandb
D.noneofthe
se
ANS WER: C

28
)Thetechi
que(
s)u
sedf
orp
rod
uci
ngi
mag
eont
heCRTi
s/
are
___
___
___
_.
A.vect
orscan
B.ras
tersc
an
C.Bot
haandb
D.noneofthe
se
ANS WER: C

29)
Ve ctorscante
chni
quei
sal
soc
all
ed_
___
___
__.
A.scalarscan
B.r
and oms can
C.r
as t
erscan
D.beams can
ANS WER: B

30)
Inv ec
torsc
andispl
ay,
buffe
rme
mor
yus
edi
sal
soc
all
ed_
___
___
__.
A.ref
res
hme mory
B.r
efr
eshbuffe
rC.bu
ffe
rdis
play
D.re
fres
hcirc
uit
ANS WER: B

31
)Invec
tors
cand
isp
lay
,th
eph
osp
hori
stob
ere
fre
she
dat
leas
t__
___
___t
i
mesp
ers
eco
ndt
oav
oid
fl
ic
ker
.
A.10
B.20
C.30
D.40
ANS WER: C
32
) Inras
terscand
isp
lay
,t
hed
isp
layi
mag
eiss
tor
edi
nth
efo
rmo
f__
___
___
_int
her
efr
eshb
uff
er.
A.1s
B.0s
C.1
sand0s
D.noneoft
h e
se
ANS WER: C

33
)Inr astersc
anCRT,
theb
eami
sswe
ptb
ackandf
ort
hfr
om_
___
___ac
ros
sth
esc
ree
n.
A.lef
ttor i
ght
B.r
ighttoleft
C.uptodown
D.downt oup
ANS WER: A

34
) Inraste
rS c
anCRT,whe
nabe
ami
smo
vedf
romt
hel
eft
tot
her
igh
t,
it
s__
__andi
ti
s__
___wh
eni
ti
s
movedfromtheri
ght
tot
hel
eft
.
A.ON, OFF
B.OFF,ON
C.ON, ON
D.OFF, OFF
ANS WER: A

35
)Inrasterscandis
play
,th
esc
ree
nimag
ere
peat
edl
ysc
anne
d,t
hi
spr
oce
ssi
scal
le
d__
___
__.
A.buf
fer
ingo fsc
reen
B.r
efr
eshigofscre
en
C.r
ender
ingo fsc
reen
D.heg
hli
gh t
ingscr
een
ANS WER: B

36)
Onab lac
kandwh
it
esy
ste
mwi
t
honeb
itp
erp
ixe
l,t
hef
rameb
uff
eri
scal
le
da_
___
___
___
.
A.bi
tmap
B.pi
xmap
C.b
it
pixmap
D.pi
xbit
map
ANS WER: A

37
)Theco st
ofvec
tors
cand
isp
layi
s__
___
___
___c
ost
ofr
ast
ers
cand
isp
ay.
A.equalto
B.l
essthan
C.morethan
D.noneofthes
e

ANS
WER:
C

38
)For_ __
______
___d
isp
lay,
scanc
onv
ers
ionh
ard
war
eisr
equ
ire
d.
A.vect
orscan
B.r
ando mscan
C.r
astersc
an
D.noneofthes
e
ANS WER: C

39)
Aspectr
ati
oist
herat
ioo
f__
______t
opr
odc
eeq
uall
eng
thl
ine
sinb
othd
ire
cti
ono
nth
esc
ree
n
A.ver
ti
calpoi
nt
stoho
riz
ont
alp
oint
s
B.
hori
zont
alpoi
ntst
overt
i
calpoi
nts
C.
lef
ttori
htandri
ghtt
ole
ftdi
agonalpo
int
s
D.r
ightt
olef
tandle
ftt
orig
htdi
agonalpoi
nt
s
ANS WER: A

40)
Di s
playfi
lecanb
eimp
leme
nte
dus
ing_
___
___
___d
atas
tru
ctu
re.
A.array
B.l
inkedli
st
C.pagi
ng
D.allofth
eab o
ve
ANS WER: D

41
)Theproces
so fd
igi
ti
zi
ngapi
ctu
red
efi
ni
ti
ong
ive
ninanap
pli
cat
i
onp
rog
rami
nt
oas
eto
fpi
xel
-i
nt
ens
it
y
Valuesi
sc al
led____
_____
___
.
A.animati
o n
B.sampli
ng
C.rast
eri
zati
on
D.scan-
convers
ion
ANS WER: D

42
)Thesi
zeo ff
ramebuff
er(
vi
deomemo
ry)
dep
end
son_
___
___
___
___
.
A.reso
luti
ononly
B.numberofdi
ffe
rent
colo
rsonly
C.bo
th(B)and(C)
D.compute
rb y
te
ANS WER: C

43
)Ap i
xelo
fblac
k_wh
it
eimag
eorg
rap
hic
sob
jec
ttak
es_
___
___
__s
pac
einme
mor
y.
A.1bi
t
B.2bi
ts
C.1ni
bbl
e
D.1byt
e
ANS WER: C

44
)There
sol
u t
i
onofanimageis_
____
_____.
A.numberofpi
xelsp
eruni
tarea
B.numbe
rofpixel
speruni
tle
ngt
hinho
riz
ont
al
C.nu
mb e
rofpixel
speruni
tl
engt
hinver
ti
cal
D.noneoft
hese
ANS WER: A

45
)Pe rsi
stancecanbede
fine
das___
_ _
_.
A.intens
ityo fapi
xelB.
pixel
spe
ru ni
tare
a
C.t
h edurati
o nofph
osph
oresc
enc
eexhibi
t
edbyap
hos
pho
r
D.nu mbero fpi
xel
sinanimage
ANS WER: C

46)Thepat
htheelect
ronb
eamt
akesat
thee
ndo feac
href
res
hcyc
leiscal
le
d__
____.
A.hori
zont
alretr
ace
B.ver
ti
calre
trace
C.di
agonalre
trace
D.lef
ttori
ghtret
race
ANS WER: B
47)
Thep at
htheelec
tro
nbeamt
ake
swhenret
urningt
oth
elef
tsi
deofth
eCRTs c
ree
nisc
all
ed_
___
_.
A.hori
zont
alretr
ace
B.ver
ti
calre
trace
C.
diag
onalre
trac
e
D.t
optobo
tt
omr e
trac
e
ANS WER: A

48
)Frameb uff
erisusedt
ost
ore
___
__.
A.numberifpixelsi
nimage
B.i
nte
nci
tiesofpixels
C.i
maged e
fini
tio
n
D.co
-or
dinatevaluesofi
mage
ANS WER: B

49)Thecleari
tyofadis
play
edimaged
epe
ndso
nth
e__
___
_.
A.resol
u t
i
o n
B.fl
oati
ngp oi
ntp r
eci
si
onofsy
ste
m
C.ass
ociatedsof
tware
D.aspectrati
o
ANS WER: A

50)
Rand omsc anmonit
orcanal
sor
efe
rre
dtoas
___
___
.
A.vect
ordis
p l
ay s
B.st
rokewri
tingdispl
ays
C.c
alli
graphicdis
plays
D.noneoftheab o
ve
ANS WER: A

51
)Wh ichfaci
li
tyi
spro
vid
edb
yco
mpu
terg
rap
hic
stoc
hang
eth
esh
apec
olo
uro
rot
herp
rop
ert
i
eso
f
ob
jec
tsb e
ginvie
wed.
A.Mo ti
ondynamic
s
B.Upd at
ed y
namics
C.A&B
D.No neofthese
ANS WER: B

whi
chfac
torsaff
ect
resol
uti
on.
A.Thety
peo fph
ospho
r
B.
Th ei
nte
nsityt
obedi
splay
ed
C.
Thefocus
ing&d e
fle
cti
onsys
temsu
sedi
nCRT
D.al
lofthe
se

ANS
WER:
D

sp
eci
alareaofth
ememo
ryi
sde
dic
ate
dtog
rap
hic
son
lyi
nras
ters
cand
isp
layc
all
ed_
___
___
__.
A.Framebuff
er
B.vi
deoco
ntro
lle
r
C.di
spl
aycont
role
r
D.Mo ni
tor
ANS WER: A

whi
chisnott
ruestat
ementforras
terscang e
ne r
ator
.
A.Itprod
ucesdefl
ect
ionsi
gnals
B.
It c
onsi
stsofrast
erscangener
ator,x&yaddressr
egi
st
er&pi
xel
C.
itre
cei
vetheint
enci
tyinf
ormati
ono feachpixelfr
omframebuf
fer
D.i
tcont
rol
sthex&yad dre
ssregi
st
e r
s
ANS WER: C
Th
edisadv
antag eofr
ast
ergrap
hic
sdi
spl
aysyst
emis__
____
.
A.It
r eq
uirelargenumb
eroffr
amebuff
ermemoryc
ycl
esne
ede
dfo
rvi
deos
cano
ut
B.
Theb ur
deno fimag
egener
ati
oniso
nthemainCPU
C.
Insuffi
ci
ent f
ramebuf
fermemor
ybandwid
th
D.Allofth
e s
e
ANSWER: D

Tost
o r
eblackandwh
it
eimag
es,
bl
ackp
ixe
lsar
ere
pre
sent
edb
y__
___
___i
nth
efr
ameb
uff
erandwh
it
e
pi
xelsby_
_ _
____.
A.Ze roandone
B.OneandZe ro
C.Botha&b
D.No neofthe
se
ANS WER: B

Th
eimagecanbet
rans
mit
te
dtot
hed
isp
layp
oint
by_
___
___
_.
A.Li
ne
B.
Segment
C.
Po i
nt
D.Noneofth
ese
ANS WER: C

Th
ece
nte
rofdi
spl
ays
cre
eni
sco
mpu
tedas
A.Xmax,ymax
B.
Xmax/2,
ymax/
2
C.
Xmax/3,
ymax/
3
D.No
neofthe
se
ANSWER: B

Wh ati
strueabout
DDAal gori
t
hmf orsc
anconve
rsi
ono
fal
ine
A.Generalpurp
oseme
thod
B.
Inc r
e ment
al
C.
cu r
rentcal
cul
ati
oni
sinde
pendento
fprevi
ouss
tep
D.Isslowerth
antheu
seofli
neequati
on
ANS WER: B

InDDAal gori
t
hmf o
rscanc
o nv
ersi
ono
fli
ne
A.if|
m|<=1t
hendx=1B.i
f|m|
>=1th
endx=1
C.i
f|m|<
=1thendy=1
D.noneofth
eab o
ve
ANS WER: A

Wh i
cho fthe
seistr
ueabou
tBr es
enham'
sLineAlgo
rit
hm?
A.Hi gh l
yeff
ici
enti
ncr
ementalmeth
od
B.
Us esscanconve
rsi
on
C.
u s
e sint
egeraddi
ti
on,
sub
tract
ionandmul
tip
li
cat
i
onb y2
D.alloftheabove
ANS WER: A

Int
egeraddi
ti
on,
sub
tract
io
nandmul
ti
pl
ic
ati
onb
y2i
nBr
ese
nham'
sLi
neAl
gor
it
hmc
anb
edo
neb
y
A.Simplear
it
hmeti
cshif
tope
rat
i
on
B.ci
rcul
arshi
fto
perati
on
C.XOROp er
ati
on
D.noneofth
eabove
ANS WER: B
InBres
enham'
sal
gor
it
hmf
ors
canc
onv
ers
iono
fli
ne
A.d=2d
y-d
x
B.d
=2dx-d
y
C.d
=4dy-
dx
D.d=4
dx-dy
ANS WER: A

Wh ati
sthebasi
sofsc
anco
nve
rsi
ono
fac
ir
cle
?
A.S e
mi-
ci
rcl
es y
mme t
ry
B.
Qu art
ersymmetr
y
C.
Ei g
ht-
ways y
mme t
ry
D.noneofth
eab o
ve
ANS WER: C

Wh ati
stru
eab ou
ttheBres
enhe
m'sCi
rc
leal
gor
it
hm?
A.ifd<
0thend =d
+4x+6
B.
ifd>0thend=d+4x+6
C.
ifd<0thend=d+4(
x-y)
+10andy-
-
D.noneoftheabov
e
ANS WER: A

whi
chofthesei
sac haract
eri
st
ico
fmidpo
intc
ir
cleal
gor
it
hm?
A.Pr o
ducespixe
lpo i
ntsf
oransemic
ir
cle
B.
Pr oduce
sp i
xelpoint
sforanquadr
ant
C.
Pr oduc
esp i
xelpoint
sforanoct
ant
D.noneoftheabov
e
ANS WER: C

Whatist
hei
ni
ti
alv
alu
efo
rth
ede
cis
ionp
arame
teri
nmi
dpo
int
cir
cleal
gor
it
hm.
A.5/
4-
r
B.
4/5-
r
C.
r-5
/4
D.r
-4/
5
ANS WER:A

InBr e
senham'
sli
nege
ner
ati
onal
gor
it
hm,
thei
ni
ti
alv
alu
eoft
hed
eci
si
onp
arame
terasp
0=_
___
___
___
,
wheresl
opeM OD( m)
<1
A.2Δy–Δx
B.2Δy–2 Δx
C.Δx–Δy
D.noneoftheab
ove
ANS WER: A

Ifali
newhos
eendpoi
nti
s(1
0,1
2)ands
tar
tpo
int
is(
20,
20)
,t
hens
lop
em=?
A.1.
2
B.0.
8
C.-
0.4
D.noneo
fth
eabove
ANS WER: B

Th
eCartes
iansl
ope-
i
nte
rce
pte
quat
i
onf
oras
trai
ght
linei
s__
___
___
___
___
__.
A.y=m(a+b+c)
B.
y=m. x+b
C.
y=2 Δx-m
D.no
neoftheabo
ve
ANS WER: B
Th
eDDAal go
rit
hmi
saf
ast
erme
tho
dfo
rcal
cul
ati
ngp
ixe
lpo
sit
i
onst
hant
hed
ire
ctu
seo
fEq
.y=m.
x+b
.
A.TRUE
B.
FALS E
ANS WER:A

InBre
senh
am'sM i
d-
poi
ntCi
rc
leAl
gor
it
hm,
thei
ni
ti
alv
alu
eoft
hed
eci
si
onp
arame
teri
sp0=5
/4–r
.
A.TRUE
B.FALSE
ANS WER: A

Themet
hodwh ic
hu se
de i
t
herdel
taxorde
lt
ay,
whi
che
veri
slar
ger
,isc
hos
enaso
ner
ast
eru
nit
tod
raw
t
heli
ne.t
heal go
rit
hmiscall
ed?
A.Brese
nh am`sLi neAl go
rit
hm
B.Gene
rali
z e
dBr e
senham`sAl g
ori
t
hm
C.DDALi neAl g
orit
hm
D.Mi d
pointLineAl g
orit
hm
ANS WER: C

Th
erearetwost
andardmetho
dsofmathemat
ic
all
yrep
res
ent
i
ngac
ir
clec
ent
ere
dat
theo
rig
in.
The
yar
e?
A.Polynomi
alM eth
od,andBrese
nham`s
B.
Trigo
nometri
cM etho
dandBresenham`s
C.
DDA, andBres
enham`s
D.Poly
nomialM et
hod,andTri
gonomet
ricM e
tho
d
ANS WER: D

InBres
enham'
salgor
it
hm,whi
lege
nerat
ingacir
cle,i
ti
seas
ytog
ene
rat
e?
A.Oneoct
antfi
rs
tandoth
erbysu
cces
siv
erefl
ect
io
n
B.Oneoc
tantf
ir
standot
herb
ysucce
ssi
verot
ati
on
C.Oneoc
tantf
ir
standot
herb
ysucc
essi
vetr
ansl
ati
o n
D.Alloc
tant
s
ANS WER: A

Whyac ir
c l
edrawno nthescre
e napp
earst
obee
ll
ip
ti
cal?
A.Itisduetotheaspec
trati
oo fmoni
tor
B.
S c
reenh asre
ctangul
ars hape
C.
Ou reyesarenotatth
es amel ev
elo
nscre
en
D.CRTi sc o
mplete
lyspheri
cal
ANS WER: A

Whic
hofthefol
lowi
ngt
ech
niq
uei
sus
edi
nM i
dpo
int
Sub
div
isi
onal
gor
it
hm?
A.Li
nearsearc
h
B.
BinaryS
e ar
ch
C.
He apso
r t
D.Bubb
leSort
ANS WER: B

Acirc
le,
ifs
cal
edonl
yino
ned
ire
cti
onb
eco
mesa?
A.parab
ola
B.
hyperb
ola
C.
Elli
pse
D.r
emainsaci
rc
le
ANS WER: C

(
2,
4)i
sapoi
ntonac
ir
clet
hat
hasc
ent
erat
theo
rig
in.
Whi
cho
fth
efo
llo
win
gpo
int
sar
eal
soo
nci
rc
le?
A.(
2,
-4
),
(-
2,
4)
B.
(4,
-
2 )
C.
(-
4,
2)
D.Allofab
ove
ANS WER: D

Alinecanb ere
pre
sent
edb
y__
___
___
_.
A.Onep o
int
B.
Twop o
ints
C.
Th re
epo i
nts
D.Fourpoints
ANS WER: B

Br
esanhamcirc
leal
gor
it
hmu
sest
heap
pro
acho
fa_
___
___
___
___
_.
A.Mi d
p o
int
B.
Po i
nt
C.
Line
D.Noneo ft
hes
e
ANS WER: A

Th
esi
deeffe
ctofs
canc
onv
ers
ionar
e__
___
___
.
A.Al
iasi
ng
B.
Antial
iasi
ng
C.
Bot
ha&b
D.No
neo fth
ese
ANSWER: A

Th
eproc
essofre
duc
ingal
ias
ingi
scal
le
d__
___
___
__.
A.Res
olut
ion
B.
An t
iali
asi
ng
C.
Sampli
ng

D.
Noneo
fth
ese
ANSWER:B

Th
eproblemofali
asi
ngar
e__
___
___
___
__.
A.St
air
case
B.
Une qualbri
ght
ness
C.
Picketfe
nceprob
lem
D.Allofthe
se
ANS WER: D

Th
ebasicpri
nci
pleo
fBrese
nham`sl i
nealgori
thmis_
_?
A.Atos e
lec
ttheop
ti
mumr as
terl
ocat
ionst
orepre
sentast
rai
ght
line
B.
tosel
ectei
th
erΔxo rΔy,whi
che
verislar
ger
,ischos
enasoner
as t
eru
nit
C.
wefindonwh i
chsi
deoft
heli
nethemidpo
int
lies
D.bo
thaandb
ANS WER: A

Al i
nec onnect
i
ngthep o
int
s(1,
1)and(
5,3
)ist
obed
rawn,
usi
ngDDAal
gor
it
hm.
Findt
hev
alu
eofxandy
i
ncreme nt
s?
A.x-increment
s=1 ;
y-i
ncrement
s=1
B.x-i
nc re
ments=0.5;y-
incr
ements=1
C.x-
inc re
ments=1;y-
incre
ments=0.5
D.No neofabove
ANS WER: C
Li
nep r
oduce
dbymo
vingp
eni
s__at
thee
ndp
oint
sth
ant
hel
inep
rod
uce
dbyt
hep
ixe
lre
pli
cat
i
on?
A.Thin
B.
S t
rai
ght
C.
Th i
cker
D.bo
thAan dB
ANS WER: C

Ali
nes e
g ment___
_____
____
_.
A.ext
endsforward
B.
extendsbackward
C.
endsat t
wop oi
nts
D.e
xtendsfore
verbot
hfor
wardandb
ack
war
d
ANS WER: C

InDDAl i
ned
rawi
ngal
gor
it
hm,
dxo
rdy
,wh
ich
eve
ris
___
___
__,
isc
hos
enaso
ner
ast
eru
nit
.
A.1
B.0
C.s
mall
er
D.l
arge
r
ANS WER:D

Si
gnfunc
ti
onmak
est
heDDAl
ined
rawi
ngal
gor
it
hmwo
rki
n__
___q
uad
rant
s.
A.IandII
B.BIandIII
C.IIandIII
D.all
ANS WER:D

Fl
oati
ngpoi
ntari
thme
ti
cinDDAal
gor
it
hmi
s__
___
___
__.
A.t
i
mee
ffi
ci
ent
B.
ti
mec o
nsuming
C.
fast
D.sl
ow
ANS WER: B

DDAl i
ned rawingal
gor
it
hmf
orc
alc
ulat
i
ngp
ixe
lpo
sit
i
onsi
s__
___
___
__t
hed
ire
ctu
seo
feq
uat
i
ony=
mx+b .
A.slo
we rthan
B.
fasterthan
C.
o feq
u alspeedtot
hato
f
D.noneo ft
hese
ANS WER: B

Expansi
onofli
neDDAal go
rit
hmi
s__
___
_.
A.Digit
aldif
fere
nceanalyze
r
B.Dire
ctdi
ffe
renti
alanalyze
r
C.Digi
taldi
ff
erenti
alanaly
zer
D.Datad i
ff
erent
ialanaly
zer
ANS WER: C

Whic
hal g
o r
it
hmisafaste
rmeth
odf
orc
alc
ulat
i
ngp
ixe
lpo
sit
i
ons
?
A.Bre
s e
nham’sli
nealgo
rit
hm
B.
Par all
elli
nealgo
rit
hm
C.
Mi d-po
intal
gori
thm
D.DDAl i
nealgo
rit
hm
ANS WER: D
InBrese
nham’
sli
neal
gor
it
hm,
ift
hed
ist
anc
esd
1<d
2th
end
eci
si
onp
arame
terPki
s__
___
_
A.Posit
iv
e
B.Eq
ual
C.Negat
ive
D.Opt
ionaorc
ANS WER: C

Adashedli
necoul
dbedi
spl
aye
dbyg
ene
rat
i
ng_
___
___
__.
A.Int
erdashspaci
ng
B.
Ve r
ys h
ortd
ashes
C.
Bo t
hAo rB
D.Ao rB
ANS WER: A

Whic
hofthefol
lowi
ngt
ech
niq
uei
sus
edi
nM i
dpo
int
Sub
div
isi
onal
gor
it
hm?
A.Li
nearsearc
h
B.
Binarys
earch
C.
He apso
r t
D.Bubb
lesort
ANS WER: B

Smal
le
stsiz
eobj
ect
thatcanbed
isp
lay
edo
namo
nit
ori
scal
le
d__
___
___
.
A.Pict
ureel
ement
B.Poi
nt
C.DotPit
chD.Aspect
rati
o
ANS WER: A

Th
emaximumnumb
ero
fpo
int
sth
atc
anb
edi
spl
aye
dwi
t
hou
tov
erl
apo
naCRT
A.As
pectRati
o
B.
Resol
uti
on
C.
Bri
ght
ness
D.Pi
xel
ANSWER: B

Eachsc
reenpoi
nti
sre
fer
redt
oas
___
___
___
___
___
__.
A.Re s
olut
io
n
B.Pixel
C.Persi
st
ence
D.Do t
Pitch
ANS WER: B

__
___
_______
_ist
henu
mbe
rofp
oint
spe
rce
nti
met
ert
hat
canb
epl
ot
te
dho
riz
ont
all
yandv
ert
i
cal
ly
.
A.Aspec
tRatio
B.Pi
xelDept
h
C.Re
solu
ti
on
D.DotPit
ch
ANSWER: C

___
_ _
_____i
sther
ati
oofh
ori
zont
alp
oint
stov
ert
i
calp
oint
sne
ces
sar
ytop
rod
ucee
quall
eng
th
l
inesi
nb o
thdi
rect
i
on.
A.Do tPit
ch
B.Resol
uti
on
C.AspectRati
o
D.He i
ght-
WidthRati
o
ANS WER: C
Vec
tordi
sp l
ayiswel
lsui
t
edfo
r__
___
___
___
.
A.Animat i
on
B.
Linedr awi
ngappli
cat
io
ns
C.
Cartoons
D.Alloftheabov
e
ANS WER: B

Be
amp e
net
rati
onmetho
disu
sual
lyu
sedi
n__
___
___
___
___
.
A.LCD
B.
Raste
rScandis
play
C.
Randomscandi
splay
D.DVST
ANS WER:C

AnRGBc o l
orsyst
emwi
t
h24b
it
soss
tor
agep
erp
ixe
lisk
nownas
___
___
___
___
___
_.
A.Co
lorCRT
B.
True-
col
o rsys
tem
C.
RGBmo nit
or
D.Co
lor-
De p
th
ANSWER: B

Di
git
iz
ingap i
ct
ured
efi
ni
ti
oni
nt
oas
eto
fint
ens
it
yval
uesi
skno
wnas.
.
..
.
..
.
..
.
..
A.Di
gi
ti
zat
i
on
B.
Scanconver
sio
n
C.
Re f
reshi
ng
D.Sc
anning
ANS WER: B

Rast
ergraphi
csar
eco
mpo
sedo
f__
___
___
___
_.
A.Pixel
s
B.Path
s
C.
Pal e
tt
e
D.Noneo ft
hes
e
ANS WER: A

Whic
hofthefol
lowi
ngal
lowf
or8mi
rr
ori
mag
es?
A.Parabol
a
B.
Ell
ipse
C.
Hy per
bola
D.Ci
rcl
e
ANS WER: D

Th
es i
mp l
estout
putpr
imit
iv
eis_
____
____
_.
A.Str
aightl
ine
B.
S t
raight
linese
gment
C.
Po int
D.Cir
c l
e
ANS WER: C
Ab i
t
mapi s____
____bit
(s
)perpi
xel
s.
A.0
B.
1
C.
2
D.4
ANS WER: B

Th
equ
ali
t
yofani
mag
ede
pendo
n__
___
___
___
__.
A.No
.ofpixelusedbyimag
e
B.
No.ofl
ineu s
edb yi
mage
C.
No.ofr
esolut
ionu s
edbyi
mag
e
D.No
ne
ANSWER: A

Th
ebasicgeo
metr
ics
tru
ctu
rest
hat
des
cri
besas
ceneo
ndi
spl
ayi
scal
le
d__
___
___
__-
.
A.Att
ribu
tes
B.
Ou t
putpri
mit
i
ve
C.
Lines
D.Cur
ves
ANS WER: B

Anaccurateandeff
ic
ientras
terli
ne-
gener
ati
ngalg
ori
t
hmis__
_____
__.
A.DDAal gor
ith
m
B.Mid-poi
ntalgo
rit
hm
C.Parall
elli
nealgor
it
h m
D.Brese
nham’sli
nealgori
thmANS WER: D
InBrese
nham’sli
nealg o
rit
hm,ift
hedi
s t
ance
sd1<d2t
hend
eci
sio
nparame
terPki
s__
___
_.
A.Posit
ive
B.Eq
ual
C.Negati
ve
D.Opt
ionao rc
ANS WER: C
 S
ubj
ec
t:
-Co
mpu
terGr
aph
ics

M CQo
nUNIT2

Achai
no fco
nnect
edl
ines
egme
ntsi
scal
le
da_
___
___
_.
A.Poly
li
ne
B.
Po l
yse
g ment
s
C.
Po l
ygon
D.Pol
ychain
ANS WER: A

Aclo
sedpolyl
inei
scal
le
da_
___
___
__.
A.Poly
chain
B.
Po l
ygon
C.
Po l
yclo
sed
D.Cl
osedchai
n
ANS WER: B

Ap l
oygoninwhic
hthel
ines
egme
ntj
oi
ni
nganyt
wop
oint
swi
t
hint
hep
oly
gonl
ie
sco
mpl
et
el
yins
idet
hep
oly
gon
,
i
scal
led_______
_p o
lyg
on.
A.Convex
B.Concave
C.Cl
o s
ed
D.Comp l
et
e
ANS WER: A

APo ly
goaninwhicht
heli
nes
egment
joi
ni
nganyt
wop
oint
swi
t
hint
hep
oly
gonmayno
tli
eco
mpl
et
el
yins
idet
he
po
lyg
on,iscal
led_
_____
__pol
ygon
.
A.Conve
x
B.Co
ncave
C.Cl
osed
D.Complet
e
ANS WER: B

__
_____
___i
same t
hodfo
rte
sti
ngap
ixe
lins
ideo
fap
oly
gon.
A.ev
en-
oddmet
hod
B.wi
ndi
ngnumbermet
hod
C.AandB
D.Noneoft
hes
e

ANS
WER:
C

__
_ _
___ _
_isab as
icap
proachus
edt
ofil
lth
ep o
lygo
n.
A.seedfi
ll
B.sc
anf i
ll
C.AandB
D.No neofthes
e ANS WER: C
Theseedfi
llalg
ori
thmfo
rfil
li
ngpol
ygo
nisclas
sif
ie
das_
___
___
_fi
llal
gor
it
hmand_
___
___f
il
lal
gor
it
hm.
A.flo
od ,
boundry
B.ev
en, o
dd
C.ed
ge,flood
D.boundry,s
can
ANS WER: A

Po
lyg
oanf
il
li
ngal
gor
it
hmst
hos
efi
lli
nt
eri
or-
def
ine
dre
gio
nsar
ecal
le
d__
___
__al
gor
it
hms
.
A.f
loodf
il
l
B.
boundr
yfi
ll
C.
scanli
ne
D.e
dgefi
ll
ANS WER: A

Pol
ygoanfi
ll
ingal
gor
it
hmst
hos
efi
llb
ound
aryd
efi
nedr
egi
onsar
ecal
le
d__
___
___
_al
gor
it
hms
.
A.f
loodfi
ll
B.
boundryf
il
l
C.
edgeli
ne
D.AandB
ANS WER: D

Inaboundar
yfil
lalg
ori
t
hmf
orf
il
li
ngp
oly
gon,
bou
ndar
yde
fi
nedr
egi
onsmayb
eei
t
her_
___
___
__c
onne
cte
dor
__
_____
_ _
_connec
ted
.
A.2,
4
B.4,
8
C.8
,1
6
D.8,
6
ANS WER: B

Th
egetp
ixe
lfu
nct
i
ong
ive
sth
e__
___
_ofs
pec
if
ie
dpi
xel
.
A.i
nt
ens
it
y
B.
col
our
C.
Siz
e
D.Sh
ape
ANS WER:B

Th
eputpi
xelf
unc
ti
ond
rawst
hep
ixe
lsp
eci
fi
ed_
___
___
.
A.i
nte
nsi
ty
B.
col
our
C.
Siz
e
D.Sh
ape
ANS WER: B

Se
edfi
llalg
oforfi
ll
ingp
oly
goni
s__
___
___al
gor
it
hm.
A.re
cursi
ve
B.no
n-re
curs
ive
C.AandB
D.Noneofthes
e
ANS WER: A

Sc
anlinealgor
it
hmf
orf
il
li
ngp
oly
goni
s__
___
_al
gor
it
hm.
A.re
cursi
ve
B.no
n-rec
u r
si
ve
C.AandB
D.Noneo fth
ese
ANS WER: B

Th
eb asicapp
roachtorepr
ese
ntpol
ygo
nis_
___
___
___
.
A.Po lygond
rawingprimi
ti
veapp
roac
h
B.
trapezoidp
rimit
i
veapp r
oach
C.
lineandp o
intappro
ach
D.allofabov
e
ANS WER: D

Th
epr
oce
sso
fse
lec
ti
ngandv
iewi
ngt
hep
ict
urewi
t
hdi
ff
rer
ent
vie
wsi
scal
le
d__
___
__.
A.Cl
ippi
ng
B.
Wi ndo
wingC.
Seg
ment
i
ng
D.al
lofabov
e
ANS WER:B

APr oc
es swh i
chdi
vi
dese
achsegment
ofthep
ict
urei
nt
oit
svi
si
bl
eandi
nvi
si
bl
epo
rti
on,
all
owi
ngt
hei
nvi
si
bl
e
po
rti
ontob edisc
ard
edi
scall
ed_
__ _
_____
_.
A.Cli
pping
B.Windowi ng
C.Se
gment i
ng
D.al
lofab o v
e
ANS WER: A

Aconve
nientcart
esi
anc o-
ord
inat
esy
ste
mus
edf
ors
tor
ingap
ict
urei
nth
eco
mpu
terme
mor
yisc
all
ed_
___
___
___
.
A.X-Yco-
o r
dinat
es yst
em
B.
Wo rl
dco -
ordi
natesyst
em
C.
normali
zedco-o
rdinat
esyst
em
D.v
iewi
ngc o
-ordi
natesyst
em
ANS WER: B

Whenap ic
tur
eisdi
spl
aye
dont
hed
isp
layd
evi
cei
ti
sme
ase
ure
din_
___
___
_co
-or
dinat
esy
ste
m.
A.World
B.
Ph ys
icalde
vic
e
C.
Viewing
D.Normaliz
ed
ANS WER: B

M ap p
ingthewo r
ldco-
ordi
natesi
ntophy
sic
aldev
icec
o-o
rdinate
siscal
le
d___
____
___.
A.transl
ati
on
B.
h omogeneoustr
ansformat
ion
C.
co-ordi
nateconver
sion
D.Vi e
wingtransfo
rmation
ANS WER: D
Afinit
ewo r
ldc o
-ord
inat
ear e
as e
lect
edt
operf
ormViewingtransf
ormat
io
nford
isp
layi
scal
le
da_
___
___
___
__.
A.Wi ndow
B.
S egment
C.
Cl i
p
D.Vi e
wp o
rt

ANS
WER:
A

Anareaonaphy
sic
ald
evi
cet
owh
ichawi
ndo
wismap
pedi
scal
le
da_
___
___
___
.
A.Window
B.
Seg
me nt
C.
Cli
p
D.Vi
ewport
ANSWER: D

Th
eregi
onofapi
ct
ureag
ains
twh
ichano
bje
cti
stob
ecl
ip
pedi
scal
le
da
A.Cl
ipWindow
B.
Segment
C.
Cli
p
D.Vi
ewport
ANSWER: A

Th
elinei
ssai
dtob
eint
eri
ort
oth
ecl
ip
pingwi
ndo
wif_
___
___
___
_po
int
(s
)is
/ar
eint
eri
ort
oth
ewi
ndo
w.
A.anyli
ne
B.
o neend
C.
b ot
hend
D.anytwo
ANS WER: C

Co
hen-
sut
her
lands
ubd
ivi
si
onl
inec
li
ppi
ngal
gor
it
hmu
ses_
___
___
_re
gio
nswi
t
hdi
ff
rer
ent
cod
es.
A.8
B.
6
C.
4
D.9
ANS WER:D

Th
etransf
ormati
onwhic
hmap st
hev
iewi
ngc
o-o
rdi
nat
est
ono
rmal
iz
edd
evi
cec
o-o
rdi
nt
eisc
all
ed_
___
___
.
A.Viewi
ngtransf
ormat
ion
B.
transl
ati
on
C.
normali
zati
ontr
ansfo
rmati
on
D.homoge
neoust
ransf
ormati
on
ANS WER: C

Thet ransformat i
ono fo bje
ctd es
cri
pti
onfrom no
rmali
zedco-o
rdi
nat
estod
evi
cec
o-o
rdi
nat
esi
scal
le
d__
___
___
.A.Wo
rks
tat
i
on
t
ransfor mati
on
B.vi
ewi ngtransformation
C.normal i
zati
o ntransf
or mati
on
D.homo ge
neoust r
ans f
ormation
ANS WER: A
Ifbothe ndpointsofalinear eexte
ri
ortoth
ecli
ppi
ngwindow,
____
_____
_.
A.thel i
neisinteri
o rt
othec l
ippi
ngwindow
B.thelineisnot neces
sarilycomple
tel
yexte
ri
ortot
hecl
ipp
ingwindo
w
C.th
el ineiscomp le
tel
ye xter
iortot
hecli
ppi
ngwindo
w
D.No neo fthese
ANS WER: B

Ifbo
the ndpoint
sofalineareco
mp l
ete
lytother
igh
t o
fcli
ppi
ngwind
ow,
___
___
__.
A.th
el i
neisinte
ri
ortothecli
ppi
ngwindow
B.t
helineisnotnec
essaril
ycompl
et
elyext
er i
ort
othecl
ip
pingwi
ndow
C.t
helineiscomple
tel
ye xt
eri
ort
othecli
ppingwi
ndow
D.No neofthese
ANS WER: C

Ifbo
the ndpoint
sofalineareco
mp l
ete
lytothel
eft
o fc
li
ppingwind
ow,_
___
___
_.
A.th
el i
neisinte
ri
ortothecli
ppi
ngwindow
B.t
helineisnotnec
essaril
ycompl
et
elyext
er i
ort
othecl
ipp
ingwindow
C.t
helineiscomple
tel
ye xt
eri
ort
othecli
ppingwi
ndow
D.No neofthese
ANS WER: C

Ifbo
the ndpoint
sofalineareco
mp l
ete
lytotheabo
veofcl
ippi
ngwind
ow,
___
___
__.
A.th
el i
neisinte
ri
ortothecli
ppi
ngwindow
B.t
helineisnotnec
essaril
ycompl
et
elyext
er i
ort
othec
lip
pingwind
ow
C.t
helineiscomple
tel
ye xt
eri
ort
othecli
ppingwind
ow
D.No neofthese
ANS WER: C

Ifbo
thendpoint
sofalinear
ecomp l
ete
lyt
otheb
elo
wofcl
ippi
ngwind
ow,
___
_ _
__ _
.
A.th
elinei
sinte
ri
ortothecl
ip
pingwindow
B.t
heli
neisnotnec
essari
lyc
omp l
et
elyext
eri
ort
oth
ecl
ip
pingwind
owC.t
hel
ineiscomp
let
el
yext
eri
ort
oth
ecl
ip
pingwi
ndo
w
D.noneoft
hese
ANS
WER:
C

InCohe
n-su
ther
landsub
div
isi
onli
nec li
ppingal
gor
it
hm,
bit
1inr
egi
onc
odei
sse
tif_
___
_.
A.endpo
intofl
inei
stot
helef
tofthewindo w
B.e
ndpoi
ntofli
neist
otheri
ghtofthewind o
w
C.e
ndpoi
ntofli
neist
othebel
owo ft
h ewindow
D.endp
ointo
fli
neistot
heaboveofthewindow
ANS WER: A

InCohe
n-su
ther
landsub
div
isi
onli
nec li
ppingal
gor
it
hm,
bit
2inr
egi
onc
odei
sse
tif_
___
_.
A.endpo
intofl
inei
stot
helef
tofthewindo w
B.e
ndpoi
ntofli
neist
otheri
ghtofthewind o
w
C.e
ndpoi
ntofli
neist
othebel
owo ft
h ewindow
D.endp
ointo
fli
neistot
heaboveofthewindow
ANS WER: B

InCohe
n-su
ther
landsub
div
isi
onli
nec li
ppingal
gor
it
hm,
bit
3inr
egi
onc
odei
sse
tif_
___
_.
A.endpo
intofl
inei
stot
helef
tofthewindo w
B.e
ndpoi
ntofli
neist
otheri
ghtofthewind o
w
C.e
ndpoi
ntofli
neist
othebel
owo ft
h ewindow
D.endp
ointo
fli
neistot
heaboveofthewindow
ANS WER: C

InCohe
n-su
ther
landsub
div
isi
onli
nec li
ppingal
gor
it
hm,
bit
4inr
egi
onc
odei
sse
tif_
___
_.
A.endpo
intofl
inei
stot
helef
tofthewindo w
B.e
ndpoi
ntofli
neist
otheri
ghtofthewind o
w
C.e
ndpoi
ntofli
neist
othebel
owo ft
h ewindow
D.endp
ointo
fli
neistot
heaboveofthewindow
ANS WER: D

Incohen-su
therl
andsubd
ivi
si
onli
necl
ippi
ngalgor
it
hm,al
lbi
t
sinr
egi
onc
odear
eze
roi
f__
___
___
__.
A.endp o
intofali
neli
eswit
hinacl
ipp
ingwindow
B.e
ndp oi
ntofalinel
ie
stothele
fto
fthecl
ip
pingwindo
w
C.e
ndp oi
ntofalinel
ie
stotheri
ght
ofthec
lip
pingwind
ow
D.No neofthes
eANS WER: A

Incohe
n-sut
herl
andsubd
ivi
si
onli
neclip
pingal
gor
it
hm,
anyl
inet
hat
haso
nei
nth
esameb
itp
osi
t
ioni
nth
ere
gio
n
co
desfo
reachendpoi
ntare____
_____.
A.Comple
tel
yinsi
deth
ecli
ppi
ngrect
angle
B.Compl
ete
lyout
sid
ethecl
ip
pingre
ctangle
C.Compl
et
elyle
ftt
othecl
ippi
ngrec
tangle
D.Comple
tel
yrig
httot
hecli
ppi
ngrect
angle
ANS WER: B

Incohe
n- s
u t
herl
andsubdivi
si
onli
necli
ppi
ngalgor
it
hm,
ift
her
esu
lto
fth
elo
gic
alANDo
per
ati
onwi
t
htwoe
nd
po
intre
g i
oncodesi
snot 0000_ _
________
.
A.thel
ineisComp l
et
elyinsi
deth
ecli
ppi
ngr e
gio
n
B.t
heli
neisCo mple
tel
yo ut
sid
ethecl
ip
pingregi
on
C.t
heli
neisCo mple
tel
yl e
ftt
othecl
ipp
ingregi
on
D.th
elineisComplet
el
yr ig
httot
hecli
ppi
ngregi
on
ANS WER: B

Insuthe
rland-
Ho dgemanpolygo
nc l
ippi
ngalgor
it
hm,i
fth
efirs
tver
texoft
heedgei
sou
tsi
det
hewi
ndo
wbo
und
ry
andthese
condver
texoftheedg
eisinsi
dethe
n_ _
___and____areadde
dtotheo
utpu
tve
rte
xli
st
.
A.fi
rstve
r t
ex,
sec
ondv e
rtex
B.fi
rs
t v
erte
x,t
heinte
rsec
tio
np o
intoft
hepolyg
onedgewi
ththewind
owb ou
ndry
C.
Sec
ondver
tex,
thei
nt
ers
ect
i
onp
oint
oft
hep
oly
gone
dgewi
t
hth
ewi
ndo
wbo
und
ry
D.Noneo
fthese
ANSWER: C

Insut
h e
rland-Hodgemanpol
ygoncli
ppi
ngalgo
rit
hm,i
fbo
thv
ert
i
ceso
fth
eed
gear
eins
idet
hewi
ndo
wbo
und
ry,
t
hen_______isadd
estotheou
tputv
ert
exlis
t.
A.fi
rstve
r t
ex
B.Se
condv er
tex
C.t
heint
ersect
io
npointoft
hepol
ygonedg
ewitht
hewind
owbou
ndry
D.Noneo fthes
e
ANS WER: B

Insut
h e
rland-
Ho dg
emanp ol
ygo
ncli
ppi
ngalgor
it
hm, i
fth
efi
rstv
ert
exoft
heedg
eisins
idet
hewind
owb
ound
ry
andt
hes e
condvert
exofth
ee d
geiso
uts
idet
hen____
_and_ __
_areadde
dtoth
eoutp
ut v
ert
exli
st
.
A.fi
rstve
r t
ex
B.Se
condv er
tex
C.t
heint
ersect
io
npoint
ofthepol
ygo
nedgewit
hthewindowbou
ndry
D.Noneo fthes
e

ANS
WER:
C

Insut
h er
land-
Ho dge
manpoly
goncl
ipp
ingal
gor
it
hm,i
fbot
hver
ti
ceso
fth
eed
gear
eou
tsi
det
hewi
ndo
wbo
und
ry,
__
____isaddedtot
heout
putv
ert
exli
st
.
A.fi
rstvert
ex
B.Se
condv er
tex
C.t
heinte
rsect
io
np o
into
fth
epoly
gonedgewi
t
hthewi
ndowbou
ndry
D.Noneo fthes
e
ANS WER: D

Whic
ho ft
hefol
lowi
ngcli
ppi
ngal
gor
it
hmf
oll
owst
heDi
vi
deandCo
nqu
ers
trat
egy
?
A.4-
bi
talgo
rit
hm
B.
Mi dpoi
ntalg
orit
hm
C.
Cyrusbre
akalgori
th
m
D.Cohe
n-Sut
herl
andalgor
it
hm
ANS WER: B

Th
eselec
ti
onands
epar
ati
ono
fap
art
oft
ext
ori
mag
efo
rfu
rth
ero
per
ati
onar
ecal
le
d__
___
___
__.
A.Transl
ati
on
B.
S h
ear
C.
Re fl
ect
i
on
D.Cli
ppi
ng
ANS WER: D

Th
ecomple
xg r
aphi
cso
per
ati
onsar
e__
___
__.
A.Se
lec
ti
on
B.
Separ
ati
on
C.
Cli
ppi
ng
D.Noneoft
hese
ANS WER: C

Incomputergr
aphi
cs
,ag
rap
hic
alo
bje
cti
skno
wnas
___
___
__.
A.Po i
nt
B.Se
gme nt
C.Parameter
D.No neofth
ese
ANS WER: B
Amanys i
dedf
igu
rei
ste
rme
das
___
___
___
.A.
Squ
are
B.
Polygon
C.
Rectangl
e
D.None
ANSWER: B

Th
eendpoi
ntofpol
ygo
nar
ecal
le
das
___
___
___
_.
A.Edg
es
B.
Ve r
ti
ces
C.
Line
D.Noneofth
ese
ANS WER: B

Th
elinesegment
ofp
oly
gonar
ecal
le
das_
___
___
__.
A.Edges
B.
Ve rti
ces
C.
Line
D.No neofth
ese
ANS WER: A

Whatareth
etype
sofp
oly
gon_
___
___
___
_.
A.Co
nvexp ol
ygo
n
B.
Concavepol
ygon
C.
Botha&b
D.Noneofthe
se
ANSWER: C

Ifal
inejo
ini
nganyofi
t
stwoi
nt
eri
orp
oint
sli
esc
omp
let
el
ywi
t
hini
tar
ecal
le
d__
___
___
___
_.
A.Conve
xp o
lygo
n
B.Co
ncavepol
ygon
C.Bo
tha&b
D.Noneofthe
se
ANS WER: A

Ifal
inejo
ini
nganytwoo
fit
sint
eri
orp
oint
sli
esno
tco
mpl
et
el
yins
idear
ecal
le
d__
___
___
___
___
.
A.Conve
xp o
lygo
n
B.Co
ncavepol
ygonC.
Bot
ha&b
D.Noneofthe
se
ANS WER: B

Inwhic
hpol
ygonobj
ec
tap
pear
sonl
ypar
ti
all
y__
___
___
___
___
__.
A.Conve
xpoly
gon
B.Co
ncavep
olygo
n
C.Bo
tha&b
D.None
ANS WER: B

Thepro
ces
sofext
rac
ti
ngap
ort
i
ono
fad
atab
aseo
rap
ict
urei
nsi
deo
rou
tsi
deas
pec
if
ie
dre
gio
nar
e
cal
le
d_____
_____
___
.
A.Transl
ati
on
B.She
ar
C.Refl
ect
i
on
D.Cli
ppi
ng
ANS WER: D

There
ctang
lep
ort
i
ono ft
hei
nt
erf
acewi
ndo
wth
atd
efi
neswh
eret
hei
mag
ewi
llac
tual
lyap
pearar
e
cal
le
d_____
___
_____
.
A.Transf
ormat
ionvi
ewi
ng
B.
Viewp or
t
C.
Cli
p pi
ngwindow
D.Sc
reencoor
dinat
esy
ste
m
ANS WER: B

Th
erect
angl
es paceinwhic
hth
ewo r
ldd
efi
ni
ti
ono
fre
gio
nisd
isp
lay
edar
ecal
le
d__
___
___
___
___
_.
A.Sc
ree
nc o
ordinatesy
ste
m
B.
Cli
ppingwindowo rworl
dwind
ow
C.
Wo rl
dcoor
d i
natesyst
em
D.Noneoft
he s
e
ANS WER: B

Th
eobj
ectsp
ac einwhi
chtheap
pli
cat
ionmode
lisd
efi
ned
___
___
___
___
.
A.Sc
ree
nc o
ord i
nat
esyst
em
B.
Cli
ppingwindoworworldwi
ndow
C.
Wo rl
dcoordi
natesy
ste
mD. Noneofth
ese
ANS WER: C

Th
eproces
sofcu
tt
ingo
fft
hel
inewh
ichar
eou
tsi
det
hewi
ndo
war
ecal
le
d__
___
___
__.
A.Sh
ear
B.
Refle
c t
i
on
C.
Cli
pping
D.Cl
ipp
ingwind
ow
ANS WER: C

So
mec ommonformofc
li
ppi
ngi
ncl
ude
___
___
___
.
A.curv
ec l
ip
ping
B.po
intcl
ippi
ng
C.p
olygoncli
ppi
ng
D.Allofthes
e
ANS WER: D

At e
chni
quebywh ichtheve
rti
caland/
orho
riz
ont
als
canf
req
uenc
yofv
ide
osi
gnalc
anb
ech
ang
edf
ord
if
fer
ent
pu
r p
oseandapp l
icati
onsi
scalled
____
___
___.
A.Scanconver
s i
on
B.Polyg
onf i
ll
ing
C.Twodimensi
onalg raph
ics
D.Antiali
asi
ng
ANS WER: A

Th
epr
oces
sofcol
ori
ngt
hear
eao
fap
oly
goni
scal
le
d__
___
___
___
.
A.Po
lygo
nfi
lli
ng
B.
Poly
gonfl
ow
C.
Ali
asi
ng
D.No
neofth
ese
ANSWER: A

Howmanyt
ype
sofp
oly
gonf
il
li
ng_
___
___
___
__.
A.Two
B.
One
C.
Three
D.Fou
r
ANS WER:
C

Th
ealgor
it
hmu s
edforf
il
li
ngt
hei
nt
eri
oro
fap
oly
goni
scal
le
d__
___
___
___
_.
A.Fl
oodfi
llal
gori
t
hm
B.
Boundaryfi
llal
gor
it
hm
C.
Scanli
nepolygo
nfi
llal
gor
it
hm
D.Noneofth
ese
ANS WER: A

Th
efunc
tio
no fsc
anli
nepoly
gonfi
llalg
ori
th
mar e
______
_______
__.
A.Fi
ndint
ers
e c
ti
onpoi
ntoft
heboundar
yofpol
ygonandsc
anline
B.
Findi
nter
sect
ionp
ointo
fthebo
undaryofpo
lyg
onandpoint
C.
Botha&b
D.Noneofth
e s
e
ANS WER: A

Ift
hep i
xelisalr
eadyfi
lle
dwit
hdes
ir
edc
olo
rth
enl
eav
esi
tot
her
wis
efi
ll
sit
,t
hi
sisc
all
ed_
___
___
___
_.
A.Floodfi
llalgor
it
hm
B.Boundaryfi
llalgo
rit
hm
C.Sc
anl i
nep o
lygonfi
ll
ingal
gor
it
hm
D.No neofthes
e
ANS WER: B

Th
esi
deeffe
ctofs
canc
onv
ers
ionar
e__
___
___
__.
A.Al
iasi
ng
B.
Antial
iasi
ng
C.
Bot
ha&b
D.No
neo fth
ese
ANSWER: A

Ifth
ev i
si
ttoth
ev e
rti
ceso
fth
epo
lyg
oni
nth
egi
veno
rde
rpr
odu
cesanant
i
clo
ckwi
sel
oopar
e
cal
led
___________
_.
A.Ne gat
ivel
yori
ente
d
B.Posit
iv
elyori
ent
ed
C.Bot
ha&b
D.No neofthe
se
ANS WER: B

Wh i
chap p
roache
sareusedf
ordet
ermi
newhe
the
rap
art
i
cul
arp
oint
isi
nsi
deo
rou
tsi
deo
fa
po
lygon_____
______
_.A.Eve
n-o
ddme t
hod
B.Windingnumbermeth
od
C.Bot
ha&b
D.No neofthe
se
ANS WER: C

Th
epr o
ces
so fmappi
ngawo r
ldwi
ndo
winwo
rldc
oor
dinat
esy
ste
mtov
iewp
ort
arec
all
ed_
___
___
___
_.
A.Transf
ormati
onvi
ewing
B.
ViewPo rt
C.
Cli
p pi
ngwi n
dow
D.Sc
reencoordi
nat
esys
tem
ANS WER: A

Th
espaceinwhichth
eimagei
sdi
spl
aye
dar
ecal
le
d__
___
___
___
.
A.Sc
ree
nc oo
rdinat
esyst
em
B.
Cli
ppingwindow
C.
Wo rl
dcoordi
natesys
tem
D.Noneofthes
e
ANS WER: A

S
omec
ommo
nfo
rmo
fcl
ip
pingi
ncl
ude
___
___
___
_.
A.Cu
rvecl
ippi
ng
B.
Pointc
li
pping
C.
Polygo
ncli
p p
ing
D.Al
lofthe
se
ANSWER: D

Inacli
ppingalg
ori
th
mo fCohe
n&S ut
herl
andusi
ngr
egi
onc
ode
s,al
inei
sal
read
ycl
ip
pedi
fth
e?
A.Code
so fth
eendpoi
ntares
ame
B.Lo
gicalANDo ft
heendpoi
ntc
odeisnot0000
C.Lo
gic
alORo ft
heendpoi
nt
scod
eis0000
D.Logi
calANDo fth
eendpoi
ntco
deis0000
E.AandB
ANS WER: E

Thetr
ansformati
oni
nwh i
chano
bje
cti
smo
vedi
nami
ni
mumd
ist
anc
epat
hfr
omo
nep
osi
t
iont
oano
the
ris
cal
le
d_ _
______.
A.Translat
ionB.Sc
ali
ng
C.Rotati
on
D.Reflect
io
n
ANS WER: A

Thetransformat
ioninwh
icht
hed
ime
nsi
ono
fano
bje
ctar
ech
ang
edr
elat
i
vet
oas
pec
if
ie
dfi
xedp
oint
is
cal
le
d _ _
________
_ _
.
A.Tr anslat
ion
B.Scaling
C.Ro tati
on
D.Re flect
io
n
ANS WER: B

Anobj
ectc
anbevie
wedasac
oll
ect
i
ono
f__
___
___
___
.
A.Onese
gment
B.
Twos e
gment
C.
Seve
ralse
gments
D.Noneoft
hese
ANS WER: C

Th
egraphi
csmet
hodi
nwh
icho
neo
bje
cti
str
ans
for
medi
nt
oano
the
rob
jec
tar
ecal
le
d__
___
___
___
.
A.Cl
ippi
ng
B.
Mo rphi
ng
C.
Re f
le
cti
on
D.Sh
ear
ANS WER: B

Sc
al i
ngo fapolygonisdoneb
ycomput
i
ng_
___
___
___
__.
A.Th eproduct
o f(x,y)
ofeachv
ert
ex
B.(x,y)ofendpoints
C.Centercoor
dinates
D.Onl ya
ANS WER: D

Ac h
ainofco
nnect
edl
ines
egme
nti
scal
le
da_
___
___
___
A.Po l
yl
ine
B.Polys
egment
C.Poly
gon
.
D.Po l
ychai
n
ANS WER: A
Ap l
oygoninwhi
cht
hel
ines
egment
joi
ni
nganyt
wop
oint
swi
t
hint
hep
oly
gonmayno
tli
esc
omp
let
el
yins
idet
he
po
lygon,i
scal
led
___
___
____
_pol
ygon.
A.Convex
B.Concave
C.Cl
o s
ed
D.Comp l
et
e
ANS WER: B

Inthegiv
enpoint
(x,
y)andwewant
toac
ces
s(x-
1,
y-
1)i
nas
ing
les
tepwene
edt
ous
e__
___
___
_.
A.4-
connect
ed
B.5-
connec
ted
C.6-
connect
ed
D.8-
connect
ed
ANS WER: D

Inscanfi
llalgor
it
hmthesc
anlineswhic
hneed
stobec
ons
ide
redar
efr
om_
___
___
___
_.
A.Ymaxt oyminofth
ewh ol
epoly
g o
n
B.Ymaxtoy minoft
helong
estedg
eo ft
hepo
lygo
n
C.Ymaxtoy minoft
heshor
tes
tedgeoft
hepol
ygon
D.No neo
fth e
se
ANS WER: A

Su
the
rlandHo dgemanal
gor
it
hmi
sus
edf
or_
___
___
___
___
.
A.Polygonfi
ll
ing
B.Li
necli
p p
ing
C.Pol
ygonc l
ip
ping
D.Te
xt cl
ippi
ng
ANS WER: C

Whic
hofthef
oll
owingisnott
ruew.
r.tp
oly
goncli
pping.
A.Li
necli
ppi
ngalgori
thmsarenotu
sedfo
rpolygo
nc li
ppi
ng
B.
Theshapeofp
o l
ygonmaychangeaft
ercl
ippi
ng
C.
Thesequ
enceofcl
ippi
ngw.r.
t.wi
ndowedge
sisfi
xe d
D.Allo
fthes
e
ANS WER: C

Fo
llo
wingarecoor
dinat
eso
fcl
ip
pingwindo
w:Lo
werLe
ftCo
rne
r(2
0,2
0)andUp
perRi
ght
Cor
ner(
80,
80)
.
Whethe
rap oi
ntat(
10,5
0)i
svi
si
bleornot
?
A.Visi
ble
B.
Par t
ial
lyVisi
bl
e
C.
Comp l
ete
lyExte
ri
o r
D.Noneoftheabov
e
ANS WER: C

Fol
lowingar
eco
ord
inat
esofcl
ipp
ingwindo
w: Lo
werLe
ftCo
rne
r(2
0,2
0)andUp
perRi
ght
Cor
ner
(
100,100)
.What
ist
heout
codeofpoi
nt(
150,
50)
?
A.001 0
B.1000
C.0100
D.0110
ANS WER:A

Whic
ho fthefol
lowingist
ruewit
hrespe
cttoSu
the
rHo
dgeal
gor
it
hm?
A.Itcl
ipsonlyconcavepoly
gons
B.
Itismo ret
imec o
nsumingandcomple
x
C.
Itmayi nser
textraedgesinre
sul
tantpo
lyg
on
D.Noneo fth
ese
ANS
WER:
C

Insut
h er
land-
hodg
emanp o
lygo
ncli
ppi
ngal
gori
th
m,i
fbot
hve
rti
cesoft
hee
dgear
eou
tsi
det
hewi
ndo
wbo
und
ary
t
hen_______i
sadde
dtoth
eo ut
putv
ert
ex.
A.Firstv
erte
x
B.Theint
ersec
ti
onpoi
ntoft
hepoly
goned
gewit
hthewi
ndowbo
und ar
y
C.Se
condv e
rte
x
D.No neofthe
se
ANS WER: B

Aclip
p i
ngwi ndowh ascoor
d i
nat
esasA(50,
10)
,B(
80,1
0),
C(80,
40)
,D(50,
40)
.Alinese
gmenthase
ndcoo
rdi
nat
es
(
40,
15)and(75,4
5).Wh atwillbet
heendp
oint
sofcl
ip
pedli
ne?UseCoh
en–S u
the
rlandOut
cod
eAl g
ori
t
hm.
A.(23
.67,
50)an d(69.06,4
0)
B.(
50,23.
67)and(69.06, 4
0)
C.(
50,
2 3.
67)
and( 40,69.06)
D.No neofAb ove
ANS WER: B

Adj
acentpixelsarel
ike
lyt
ohav
esamec
har
act
eri
st
ic
s.Th
isp
rop
ert
yisr
efe
rre
das
___
___
_.
A.Propertyofcoher
enc
e
B.
Spacialcoherenc
e
C.
Spat
ialc oh
er e
nce
D.Noneo fthese
ANS WER: A

Cl
ipalinestart
ingfro
m(-1
3,5
)ande
ndi
ngat(
17
,11
)agai
nst
thewi
ndowh
avi
nglowe
rlef
tcorne
rat
(-
8,-
4)and
up
perri
g htcor
ne rat
(12,
8)
.Whatwi
llb
eth
eendpo
int
sofcl
ipp
edl
ine
?UseCoh
en–S u
ther
landOu
tco
de
Algor
it
h m.
A.(-
8,
6) and(2,
8)
B.(
-8
,6)and( 8
,2)
C.(
6,-
8)and(2,8
)
D.(
8,-
6)and( 8,
2)
ANS WER: A

Sc
aleas q
u areABCDwi t
hco-
ord
inat
esA(
0,0)
,B(
5,
0),
C(5
,5
),D(
0,5
)by2u
nit
sfo
rx-
di
re
cti
onand3
-uni
t
sfo
ry–
di
re
cti
on.
A.A(0,0), B(1
0,0),
C(10,
15),
D(0,1
5)
B.A(0,0),B(0,0),
C(10,
15),
D(0,1
5)
C.A(0,0),B(10,
0),C(1
0,1
0),D(15
,0)
D.No neofthese
ANS WER: A

Th
efi
rst
v i
ewi
ngp ar
amete
rinp
ers
pec
ti
vep
roj
ec
ti
onwemu
stc
ons
ide
rist
he?
A.Vi
ewingwindow
B.
Shi
ftv
e c
tor
C.
Vie
wr efe
renc
ep o
int
D.Vi
ewr e
fer
encepl
ane
ANSWER: C

Innormali
zat
io
ntransf
ormati
onfo
rwindo
wt ov
iewpo
rt,
wind
owisl
owerl
eft
corne
r(1,
1)andu
pperr
igh
tcor
nerat
(
3,5
)toavie
wp oi
ntwit
hlowerle
ftc
orne
rat(0,
0)anduppe
rri
ght
cor
nerat
(1
/2,
1/
2).
Scal
ingfac
tor
sSx=___&
Sy=___.
A.0.25&0.1
25
B.0.
125&0.25
C.4&8
D.0.5&1
ANS WER: A
Inth
eCo h
en-Sut
herl
andoutc
odeal
gor
it
hm,g
ive
nt h
ecl
ip
p i
ngwind
owco-
ord
inat
esas:
Xmi n=1
0,Ymi
n=3
0,
Xmax=5 0,Ymax=7 0,
theli
neABwithe
nd-p
oint
sA(30,55
)andB(
70,4
0) wi
llb
e____
_____
__.
A.Comple
tel
yv i
si
ble
B.Compl
ete
lyinvi
si
ble
C.Part
i
allyvi
sibl
e
D.Part
iall
yinvi
si
ble
ANS WER: C

Inth
eCo h
en-Sut
herl
andoutc
odeal
gor
it
hm,gi
venthec
li
ppi
ngwindo
wc o-
ord
inat
esas
:Xmin=-1
0,Ymi
n=-
30,
Xmax=5 0,Ymax=7 0,
theli
nePQwithe
nd-p
o i
nt
sP(0,60)andQ(4
0,50)wil
lbe_
___
____
___.
A.Comple
tel
yv i
si
ble
B.Compl
ete
lyinvi
si
ble
C.Part
i
allyvi
sibl
e
D.Part
iall
yinvi
si
ble
ANS WER: A

IntheCohe
n-Su
the
rlandout
codeal
gori
thm,
giv
enthec
li
ppi
ngwindo
wc o-
ord
inat
esas:
Xmin=-
10,Ymi
n=-3
0,
Xmax=5 0,Ymax=7 0,t
helinePQwi t
hend-
poi
nt
sP(0,60)andQ(4
0,50),t
heout
cod
eso
fPandQwil
l
be
_______
____and_____
____repe
cti
vel
y.
A.1000and0001
B.0000and0000
C.0100and0010
D.11
00and001 1
ANS WER:B

IntheCohe
n-S
uthe
rlandout
codeal
gori
t
hm,giv
enthec
li
ppi
ngwindo
wc o
-or
dinat
esas
:Xmin=10,Ymi
n=30,
Xmax=5 0,Ymax=7 0,th
elinePQwi t
hend-
poi
nt
sP(30,5
5)andQ(7
0,40)wil
lhave_
____
____
_numbe
rof
i
nte
rsect
i
onpoi
ntswit
hthecl
ippi
ngwindow.
A.0
B.1
C.2
D.3
ANS WER: B

IntheCohenSut
her
landOutc
odeAlg
ori
thm,th
efourbi
tsint
heout
cod
ear
ese
tont
heb
asi
sofp
osi
t
ionso
fth
eli
ne
endpoi
ntst
othe___
_____ofc
li
ppi
ngwindowregi
onsi
nt h
eorde
r.
A. To
p,Bott
om,Right
,Lef
t
B.Right
,Top,Bo
tt
om,Left
C.Top,Rig
ht,Le
ft
,Bott
omD.Bott
om,Rig
ht,Left
,Top
ANS WER: A

IntheCohe
nSuth
erl
andOutc
odeAl
gor
it
hm,i
fbo
ththee
nd-
poi
nt
soft
hel
ineh
aso
utc
ode1
000,
the
nth
eli
nel
ie
s
i
nthe_____
____
____
____r
egi
onoft
hec
li
ppi
ngwind
ow.
A.Le f
t
B.Right
C.Top
D.Bott
om
ANS WER: C

IntheCohe
nSuthe
rlandOut
cod
eAl g
orit
hm,
ift
hep
oint
out
cod
eis1
001
,th
ent
hep
oint
lie
sint
he
__
_ _
______
____
___regi
onso
fthec
li
ppingwi
ndo
w.
A.TopandRight
B.Bott
omandRight
C.TopandLef
t
D.Bott
omandLeft
ANS WER: C

Th
eal
gor
it
hmu
sedf
orf
il
li
ngt
hei
nt
eri
oro
fap
oly
goni
scal
le
d
A.Fl
oodfi
llal
g or
it
hm
B.
Boundaryfi
llalgo
rit
hm
C.
Scanli
nepolygonfi
llal
gor
it
hm
D.Noneofthe
se
ANS WER: A

Ift
hep i
xelisalr
eadyfi
lle
dwit
hdes
ir
edc
olo
rth
enl
eav
esi
tot
her
wis
efi
ll
sit
.t
hi
sisc
all
ed
A.Floodfi
llalgor
it
hm
B.Boundaryfi
llalgo
rit
hm
C.Sc
anl i
nep o
lygonfi
ll
ingal
gor
it
hm
D.No neofthes
e
ANS WER: B

Th
eg r
ap h
icscanb
e
A.Drawing
B.
Ph ot
o g
raph,mo
vie
s
C.
Simulati
on
D.Allofthes
e

ANS
WER:
D

Ifth
eb oundaryisspec
if
iedi
nas
ing
lec
olo
r,andi
fth
eal
gor
it
hmp
roc
eed
spi
xelb
ypi
xelu
nti
lth
ebo
und
aryc
olo
ris
enc
ounterediscall
ed
A.Scan-li
nef i
llal
gori
thm
B.Boundary-fi
llal
gori
thm
C.Flo
od -
fi
llalgori
thm
D.Par all
elcurvealgor
it
hm
ANS WER: B

Ifwewant t
orecolo
ranareat
hat
isno
tde
fi
nedwi
t
hinas
ing
lec
olo
rbo
und
aryi
skno
wnas
___
___
___
.
A.Boundary-
fi
llalgor
it
hm
B.Paral
lelcur
v ealg
ori
thm
C.Fl
ood-
fi
llalg
o ri
th
m
D.Onlyb
ANS WER: C

Th
ereare2ty
pesofpoly
gons
.Th
eyar
e?
A.Conv
exandconcave
B.
S q
uareandre
ctangl
e
C.
He xagonandsquare
D.Oct
agonandconvex
ANS WER: A

Amanys i
dedf
igu
rei
ste
rme
das
___
__.
A.Sq
uare
B.
Po l
ygon
C.
Rectangl
e
D.None
ANS WER: B

Th
eendpoi
ntofpol
ygo
nar
ecal
le
das
___
___
___
__.
A.Edg
es
B.
Ve r
ti
ces
C.
Line
D.Noneofth
ese
ANS WER: B
Th
ealgor
it
hmu sedforfi
ll
ingthei
nt
eri
oro
fap
oly
goni
scal
le
d__
___
___
___
_.A.
Flo
odf
il
lal
gor
it
hm
B.
Boundaryfi
llalgo
rit
hm
C.
Scanli
nepolygonfil
lalgor
it
hm
D.Noneofth
ese
ANS WER: A

Th
efunc
tio
no fsc
anli
nepoly
gonfi
llalg
ori
th
mar e
______
__.
A.Fi
ndint
ers
e c
ti
onpoi
ntoft
heboundar
yofpol
ygonandsc
anline
B.
Findi
nter
sect
ionp
ointo
fthebo
undaryofpo
lyg
onandpoint
C.
Botha&b
D.Noneofth
e s
e
ANS WER: A

Ift
hep i
xelisalr
eadyfi
lle
dwit
hdes
ir
edc
olo
rth
enl
eav
esi
tot
her
wis
efi
ll
sit
.t
hi
sisc
all
ed_
___
___
.
A.Floodfi
llalgor
it
hm
B.Boundaryfi
llalgo
rit
hm
C.Sc
anl i
nep o
lygonfi
ll
ingal
gor
it
hm
D.No neofthes
e
ANS WER: B

Ifal
inejo
ini
nganytwoo
fit
sint
eri
orp
oint
sli
esno
tco
mpl
et
el
yins
idear
ecal
le
d__
___
___
___
_.
A.Conve
xp o
lygo
n
B.Co
ncavepol
ygon
C.Bo
tha&b
D.Noneofthe
se
ANS WER: B

Inwhic
hpol
ygonobj
ec
tap
pear
sonl
ypar
ti
all
y__
___
__.
A.Conve
xpoly
gon
B.Co
ncavep
olygo
n
C.Bo
tha&b
D.Noneoft
hese
ANS WER: B

Ift
hevi
si
ttoth
ev e
rti
ceso
fthep
oly
goni
nth
egi
veno
rde
rpr
odu
cesanant
i
clo
ckwi
sel
oopar
ecal
le
d__
___
_.
A.Negat
ivel
yori
ente
d
B.Pos
it
iv
elyori
ent
edC.Botha&b
D.Noneofthe
se
ANS WER: B

Ifth
ev i
si
ttoth
ev e
rti
ceso
fth
epo
lyg
oni
nth
egi
veno
rde
rpr
odu
cesanc
loc
kwi
sel
oopar
ecCo
mpu
terGr
aph
icsM CQ1
all
ed_
___
__.
A.Ne gat
ivel
yori
ente
d
B.Posit
iv
elyori
ent
ed
C.Bot
ha&b
D.No neofthe
se
ANS WER: A

Whic
hthi
ng saremai
nlyne
ede
dtomak
eap
oly
gonandt
oent
ert
hep
oly
goni
nt
odi
spl
ayf
il
e__
___
.
A.Noofs i
desofpo
lyg
on
B.
Verti
cespoint
s
C.
Botha&b
D.Noneofthese
ANS WER: C

Twot
ype
sofc
oord
inat
esar
e__
______
_.
A.Pos
it
iv
eandnegat
i
veco
ord
inat
es
B.
Absol
uteandr
elat
i
vec
oor
dinat
es
C.
Bot
ha&b
D.No
ne
ANSWER: B

Whic
hap pro
achesareus
edfo
rde
ter
minewh
eth
erap
art
i
cul
arp
oint
isi
nsi
deo
rou
tsi
deo
fap
oly
gon_
___
_.
A.Ev
e n-
oddmetho
d
B.
Wi ndi
ngnu mbermet
hod
C.
Botha&b
D.Noneofthese
ANS WER: C

Foras eed-
fi
llmet
hod,Ifag
ive
npo
int
is(
x,y
)andwewant
toac
ces
s(x-
1,
y-1
)int
hes
amei
t
erat
i
on,
weu
sewh
ich
oft
hefo ll
owing?
A.4-c
o nnect
edmetho
d
B.5-
con nec
tedmet
hod
C.7-
connecte
dme t
hod
D.8-
conne ct
edmeth
od

ANS
WER:
D

Inagiv
entr
iangl
e,a(1
0,1
0),
B(2
0,2
0),
C(3
0,1
0),
thep
oint
P(2
8,2
0)i
s__
___
_.
A.Insi
det
hetri
angle
B.Out
si
det
hetri
angle
C.Ont
hever
tex
D.Onthee
dge
ANS WER: B
 File hosted by educationobserver.com/forum

1. Basic geometric transformation include

a. Translation

b. Rotation

c. Scaling

d. All of these

2. Some additional transformation are

a. Shear

b. Reflection

c. Both a & b

d. None of these

3. 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

e.

4. 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

5. 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

6. The selection and separation of a part of text or image for further operation are called
 File hosted by educationobserver.com/forum

a. Translation

b. Shear

c. Reflection

d. Clipping

7. The complex graphics operations are

a. Selection

b. Separation

c. Clipping

d. None of these

8. In computer graphics, a graphical object is known as

a. Point

b. Segment

c. Parameter

d. None of these

9. An object can be viewed as a collection of

a. One segment

b. Two segment

c. Several segments

d. None of these

10.Every segment has its own attributes like

a. Size, visibility

b. Start position

c. Image transformation

d. All of these

11.By using the attributes of segment , we can________ any segment

a. Change

b. Control

c. Print

d. None of these

e.
 File hosted by educationobserver.com/forum

12.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

e.

13.We assign all the attributes of segment under this

a. Segment name

b. Segment size

c. Array

d. None of these

14.The initial size of segment will be_______

a. 1

b. 0

c. 2

d. 3

15.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

16.Deletion of any segment is much________ than creation of any new segment

a. Easier

b. Difficult

c. Higher

d. None

17._______is very important in creating animated images on the screen

a. Image transformation

b. Morphing

c. Clipping
 File hosted by educationobserver.com/forum

d. None of these

18.Which attributes of image transformation change the size of an image corresponding to the x-axis and y-
axis

a. SCALE-X

b. SCALE-Y

c. Both a & b

d. None of these

19.Which attributes of image transformation change the position of image corresponding to the x-axis and y-
axis

a. TRANSLATE-X

b. TRANSLATE-Y

c. Both a & b

d. None of these

e.

20.Which attributes of image transformation rotate the image by a given angle

a. TRANSLATE-X

b. TRANSLATE-Y

c. Both a & b

d. None of these

21.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

22.The graphics method in which one object is transformed into another object are called

a. Clipping

b. Morphing

c. Reflection

d. Shear

23.Example of morphing are

 File hosted by educationobserver.com/forum

a. Oil takes the shape of a car

b. A tiger turns into a bike

c. Both a & b

d. None of these

e.

24.A many sided figure is termed as

a. Square

b. Polygon

c. Rectangle

d. None

25.The end point of polygon are called as

a. Edges

b. Vertices

c. Line

d. None of these

26.The line segment of polygon are called as

a. Edges

b. Vertices

c. Line

d. None of these

27.How many types of polygon are

a. One

b. Two

c. Three

d. Four

28.What are the types of polygon

a. Convex polygon

b. Concave polygon

c. Both a & b

d. None of these
 File hosted by educationobserver.com/forum

29.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

30.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

e.

31.In which polygon object appears only partially

a. Convex polygon

b. Concave polygon

c. Both a & b

d. None

32. 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

e.

33.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

34.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
 File hosted by educationobserver.com/forum

c. Both a & b

d. None of these

35.Two types of coordinates are

a. Positive and negative coordinates

b. Absolute and relative coordinates

c. Both a & b
d. None

36.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

e.

37.The transformation that produces a parallel mirror image of an object are called

a. Reflection

b. Shear
c. Rotation

d. Scaling

38.The transformation that disturbs the shape of an object are called

a. Reflection

b. Shear
c. Rotation

d. Scaling

39.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

40.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
 File hosted by educationobserver.com/forum

a. Reflection

b. Shearing
c. Rotation

d. Scaling

41.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

42.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

43.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

44.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

45.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

e.
 File hosted by educationobserver.com/forum

46.The process of cutting off the line which are outside the window are called
a. Shear

b. Reflection

c. Clipping

d. Clipping window

47.Some common form of clipping include

a. curve clipping

b. point clipping

c. polygon clipping

d. All of these

48.A composite transformation matrix can be made by determining the ________of matrix of the individual
transformation

a. Addition

b. Subtraction

c. Product

d. None of these

49.Each successive transformation matrix _________ the product of the preceding transformation

a. pre-multiples

b. post-multiples

c. both a & b

d. none of these

50.Forming products of transformation matrices is often referred as

a. Composition of matrix

b. Concatenation of matrix

c. Both a & b are same

d. None of these

51.The alteration of the original shape of an object, image, sound, waveform or other form of information are
called

a. Reflection

b. Distortion
 File hosted by educationobserver.com/forum

c. Rotation

d. None of these

52. Two consecutive translation transformation t1 and t2 are

a. Additive

b. Subtractive

c. Multiplicative

d. None of these

53.Two consecutive rotation transformation t1 and t2 are

a. Additive

b. Subtractive

c. Multiplicative

d. None of these

e.

54.Two consecutive scaling transformation t1 and t2 are

a.Additive
a. Subtractive

b. Multiplicative

c. None of these

1. The graphics can be

a. Drawing
b. Photograph, movies
c. Simulation
d. All of these
2. 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
3. The component of interactive computer graphics are
a. A light pen
b. Display unit
c. Bank of switches
d. All of these
4. Personal computer become powerful during the late
a. 1960
 File hosted by educationobserver.com/forum

b. 1970
c. 1980
d. 1950
5. Three dimensional computer graphics become effective In the late
a. 1960
b. 1980
c. 1970
d. 1950
6. which environment has been one of the most accepted tool for computer graphics in business and graphics
design studios
a. graphics
b. Macintosh
c. quake
d. multimedia
7. Graphics is one of the_________ major key element in design of multimedia application
a. Five
b. Three
c. Four
d. Eight
8. Three dimensional graphics become popular in games designing , multimedia and animation during the late
a. 1960
b. 1970
c. 1980
d. 1990
9. The quake , one of the first fully 3D games was released in year
a. 1996
b. 1976
c. 1986
d. 1999
10. Types of computer graphics are
a. Vector and raster
b. Scalar and raster
c. Vector and scalar
d. None of these
11. Vector graphics is composed of
a. Pixels
b. Paths
c. Palette

d. None of these
12. Raster graphics are composed of
a. Pixels
b. Paths
c. Palette
d. None of these
13. Raster images are more commonly called
a. Pix map
 File hosted by educationobserver.com/forum

b. bitmap
c. both a & b
d. none of these
14. Pixel can be arranged in a regular
a. One dimensional grid
b. Two dimensional grid
c. Three dimensional grid
d. None of these
15. The brightness of each pixel is
a. Compatible
b. Incompatible
c. Both a & b
d. None of these
16. Each pixel has ________basic color components
a. Two or three
b. One or two
c. Three or four
d. None of these
17. The quantity 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
18. Higher the number 0f pixels,_______ the image quality
a. Bad
b. Better
c. Smaller
d. None of above
19. A palette can be defined as a finite set of colors for managing the
a. Analog images
b. Digital images
c. Both a & b
d. None of these
20. Display card are
a. VGA
b. EGA
c. Both a & b
d. None of above
21. Display card is used for the purpose of
a. Sending graphics data to input unit
b. Sending graphics data to output unit
c. Receiving graphics data from output unit
d. None of these
22. Several graphics image file formats that are used by most of graphics system are
a. GIF
b. JPEG
c. TIFF
 File hosted by educationobserver.com/forum

d. All of these
23. The GIF format is much _________to be downloaded or uploaded over the www
a. Slower
b. Faster
c. Medium
d. None of these
24. Once a file is saved in JPEG format ,some data is lost
a. Temporarily
b. Permanently
c. Both a & b
d. None
25. EPS image file format is used for
a. Vector graphics
b. Bitmap
c. Both a & b
d. None of these
26. TIFF (tagged image file format )are used for
a. Vector graphics
b. Bitmap
c. Both a & b
d. None of these
27. EPS means
a. Entire post script
b. Entire post scale
c. Encapsulated post script
d. None of these
28. The additive color models use the concept of
a. Printing ink
b. Light to display color
c. Printing line
d. None of these
29. The subtractive color model use the concept of
a. Printing ink
b. Light to display color
c. Printing line
d. None of these
30. Color apparent in additive model are the result of
a. Reflected light
b. Transmission of light
c. Flow of light
d. None of these
31. 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
 File hosted by educationobserver.com/forum

32. Two dimensional color model are

a. RGB and CMKY
b. RBG and CYMK
c. RGB and CMYK
d. None
33. RGB model are used for
a. Computer display
b. Printing
c. Painting
d. None of these
34. CMYK model are used for
a. Computer display
b. Printing
c. Painting
d. None of these
35. The intersection of three primary RGB color produces
a. White color
b. Black color
c. Magenta color
d. Blue color
36. The intersection of primary CMYK color produces
a. White color
b. Black color
c. Cyan color
d. Magenta color
37. 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
38. 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
39. Each bit represent
a. One color
b. Two color
c. Three color
d. None
40. RGB true color model has _______ color depth
a. 24bit
b. 32bit
c. 64bit
d. None
41. CMYK true color model has _______ color depth
a. 24bit
 File hosted by educationobserver.com/forum

b. 32bit
c. 64bit
d. None
42. Grey scale images have a maximum color depth of
a. 8bit
b. 16bit
c. 24bit
d. 32bit
43. Graphics with limited features is known as
a. Active graphics
b. Passive graphics
c. Grayscale image
d. None of these
44. Computer of present time have much higher memory and ________ storage capacity
a. Much smaller
b. Much bigger
c. Much slower
d. None
45. CRT means
a. Common ray tube
b. Cathode ray tube
c. Common ray tube
d. None
46. Refresh CRT consist of
a. Glass wrapper
b. The phosphor viewing surface
c. The electron gun assembly
d. All of above
47. The amount of time the phosphor produce light or shine is controlled by chemical composition of the phosphor.
This is known as
a. Persistence
b. Resistance
c. Generators
d. None
48. The electron beam in a color picture tube is refreshed_______ times in a second to make video realistic
a. 15 times
b. 25 times
c. 35 times
d. 45 times
49. DUST means
a. Direct view storage tube
b. Domain view storage tube
c. Direct view store tube
d. None
50. DUST is rarely used today as part of
a. Input device
b. Output device
 File hosted by educationobserver.com/forum

c. Display systems
d. None
51. In DUST , is there refresh buffer
a. Yes
b. No
c. Both
d. None
52. The electron beam in DUST is designed to draw directly to
a. Phosphor
b. Storage mesh
c. Glass
d. None
53. The second grid in DUST is called
a. Phosphor
b. Storage mesh
c. Collector
d. None
54. To increase the energy of these slow moving electron and create a bright picture in DUST , the screen is
maintained at a
a. Low positive potential
b. High negative potential
c. High positive potential
d. None
55. A major disadvantage of DUST 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
56. Interactive graphics is useful in
a. Training pilots
b. Computer aided design
c. Process control
d. All of these
57. The origin of computer graphics was developed in
a. 1950
b. 1960
c. 1970
d. 1990
58. The term business graphics came into use in late
a. 1950
b. 1960
c. 1970
d. 1990
59. Computer graphics is used in many DTP software as
a. Photoshop
b. Paint brush
c. Both a & b
 File hosted by educationobserver.com/forum

d. None of these
60. Any CRT based display must be refreshing at least_______ times a second
a. 20
b. 30
c. 40
d. 10
61. The standardization is needed
a. To make application programs more portable
b. To increase their utility
c. To allow them to use in different application environment
d. All of these
62. GKS stands for
a. Graphics kernel system
b. Graphics kernel stands
c. Generic kernel system
d. None of these
63. GKS was developed by the
a. International standards organization
b. National standard organization
c. Both a & b
d. None of these
64. The resolution of raster scan display is
a. Low
b. High
c. Medium
d. None
65. Random scan systems are designed for
a. Line drawing application
b. Pixel drawing application
c. Color drawing application
d. None of these
66. Solid pattern in random scan display is ____ to fill
a. Difficult
b. Easy
c. Not fill
d. None of these
67. Raster scan is _______ expensive than random scan
a. More
b. Less
c. Both a & b
d. None
68. 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 above
69. In beam penetration method of color CRT, two layer of phosphor coated are
 File hosted by educationobserver.com/forum

a. Red and blue

b. Red and green
c. Blue and green
d. None of these
70. 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. None
71. A shadow mask CRT has _____ phosphor color dots at each pixel position
a. 1
b. 2
c. 3
d. None of these
72. Which color is produced with the green and red dots only
a. Blue
b. Yellow
c. Magenta
d. White
73. Which color s produced with the blue and red dots
a. Blue
b. Yellow
c. Magenta
d. White
74. Cyan color is produced when the blue and green are activated
a. Equally
b. Unequally
c. Both a & b
d. None
75. Which technique of color CRT is used for production of realistic image
a. Shadow mask method
b. Beam penetration method
c. Both a & b
d. None of these
76. In which method of CRT, convergence problem occur
a. Beam penetration method
b. Shadow mask method
c. Both a & b
d. None of these
77. Beam penetration method is used in
a. Random scan system
b. Raster scan system
c. Both a & b
d. None of these
78. Shadow mask method is used in
a. Random scan system
b. Raster scan system
 File hosted by educationobserver.com/forum

c. Both a & b
d. None of these
79. Graphics data is computed by processor in form of
a. Electrical signals
b. Analog signals
c. Digital signals
d. None of these
80. An example of impact device is
a. Electrostatic printer
b. Inkjet printer
c. Line printer
d. Laser printer
81. To generate the characters , which are required
a. Hardware
b. Software
c. Both a & b
d. None of these
82. 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
83. The hardware devices contain
a. Color printer / black white printer
b. Plotters
c. Both a & b
d. None
84. An example of black and white laser printer is
a. HP 4000
b. QMS
c. Both a & b
d. None
85. An example of color printer is
a. HP 4000
b. QMS
c. Both a & b
d. None
86. 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
87. Printers produce output by either
a. Impact method
b. Non impact method
c. Both a & b
d. None of these
 File hosted by educationobserver.com/forum

88. 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
89. 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
90. LCD means
a. Liquid crystal displays
b. Liquid crystal data
c. Liquid chrome data
d. None
91. LCD are commonly used in
a. Calculators
b. Portable
c. Laptop computers
d. All of these
92. LCD is an ______ device
a. Emissive
b. Non emissive
c. Gas discharge
d. None of these
93. Plasma panel is an __ device
a. Emissive
b. Non emissive
c. Expensive
d. None
94. Plasma device converts
a. Electrical energy into light
b. Light into electrical energy
c. Light into graphical energy
d. None of these
95. Plasma panel have_________ resolution
a. High
b. Good
c. Both a & b
d. Low
96. Plasma panel are also called
a. Liquid crystal display
b. Gas discharge display
c. Non emissive display
d. None of these
97. The basic graphical interactions are
 File hosted by educationobserver.com/forum

a. Pointing
b. Positioning
c. Both a & b
d. None
98. GUI means
a. Graphical user interface
b. Graphical user interaction
c. Graphics uniform interaction
d. None
99. Which one is the basic input device in GUI
a. Mouse
b. Graphics tablet
c. Voice system
d. Touch panel
100. Pen or inkjet plotters use the following devices
a. Drum
b. Flat bed
c. Both a & b
d. None of these

1. ______is a flexible strip that is used to produce smooth curve using a set of point

a. Sp line

b. Scan-line method

c. Depth-sorting method

d. None of these
2. The types of sp line curve are

a. Open sp line

b. Closed sp line

c. Both a & b

d. None of these

3. Cubic sp line are

a. Simple to compute

b. Provides continuity of curves

c. Both a & b

d. None of these

4. The parametric form of 3D sp line are

 File hosted by educationobserver.com/forum

a. X=f(t),y=g(t),z=h(t)

b. X=a0,y=b0,z=c0

c. F(t)=0,g(t)=0,h(t)=0

d. None of these

5. The value of t lies between

a. 1 and 2

b. 1 and 10

c. 0 and 1

d. 0and 3

6. 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. None of these
7. The problem of hidden surface are

a. Removal of hidden surface

b. Identification of hidden surface

c. Both a & b

d. None of these

8. Why we need removal of hidden surface

a. for displaying realistic view

b. for determining the closest visible surface

c. Both a & b

d. None of these

9. How many types of hidden surface algorithm are

a. 1

b. 2

c. 3

d. 4

10.The algorithm of hidden surface are

 File hosted by educationobserver.com/forum

a. Object-space method

b. image-space method

c. Both a & b

d. None of these

11.The method which is based on the principle of comparing objects and parts of objects to each other to find
which are visible and which are hidden are called

a. Object-space method

b. image-space method

c. Both a & b

d. None of these

12.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

13.The types of hidden surface removal algorithm are

a. Depth comparison, Z-buffer, back-face removal

b. Scan line algorithm, priority algorithm

c. BSP method, area subdivision method

d. All of these

14.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

15.In which year Z- buffer algorithm are described

a. 1995

b. 1974

c. 1945
 File hosted by educationobserver.com/forum

d. 1981

16.Z -buffer algorithm are

a. Simplest algorithm

b. Complex algorithm

c. Largest algorithm

d. None of these

17.Which is a tree type of data structure in which every internal node has at most four children

a. Point quad tree

b. Edge quad tree

c. Quad tree

d. None of these

18.The scan line coherence algorithm was developed by

a. Wylie

b. Evans

c. Cat mull

d. Both a & b

19.The array are used with scan line coherence algorithm are

a. For intensity value

b. For depth value

c. Both a & b

d. None of these

20.Scan lines are used to scan from

a. Top to bottom

b. Bottom to top

c. Both a & b

d. None of these

21.The painter algorithm were developed on

a. 1972 by Newell

b. 1972 by Evans

c. 1974 by Cat mull

 File hosted by educationobserver.com/forum

d. None of these

22.The painter algorithm are also called

a. Depth sort algorithm

b. Priority algorithm

c. Both a & b

d. None of these

23. The painter algorithm are based on the property of

a. Polygon

b. Frame buffer

c. Depth buffer

d. None of these

24.The dynamic effect of an image is called

a. Video

b. Animation

c. Super sampling

d. None of these

25.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
26. When sound is included in the animation, it become

a. Audio

b. Video

c. Both a & b

d. None of these

27. Many online animation tools are used to create animation in the form of

a. JPEG image

b. PDF image

c. GIF image
 File hosted by educationobserver.com/forum

d. None of these

28.An ex of online animation tools are

a. Macromedia flash

b. GIF works

c. Both a & b

d. None of these

29.To produce the motion in the image by placing the elements of the image on different location ,which
software are used

a. Macromedia flash

b. GIF works

c. Both a & b

d. None of these

30.The name of a visible surface detection algorithm are

a. Back face detection

b. Back face removal

c. Ray tracing

d. None of these

31.Which type of quad tree can be defined as an adaptation of a binary tree represented two dimensional point
data

a. Point quad tree

b. Edge quad tree

c. Curves quad tree

d. Areas quad tree

32.Which type of quad tree is specifically used to store lines rather than points

a. Point quad tree

b. Edge quad tree

c. Curves quad tree

d. Areas quad tree

33.Which quad tree defines a partition of space in two dimension by dividing the region into four equal
quadrants, sub quadrants and so on
 File hosted by educationobserver.com/forum

a. Curves quad tree

b. Areas quad tree

c. Region quad tree

d. None

34.The animation graphics can be created by

a. Hand

b. Computer assistance

c. Both a & b

d. None of these

35.The animation can be divided into

a. One part

b. Two parts

c. Three parts

d. Four parts

36.The types of animation are

a. Traditional animation

b. Computer animation

c. Both a & b

d. None of these

37.The types of computer animation are

a. 2D computer animation

b. 3D computer animation

c. Both a & b

d. None of these

38.The depth sorting method reforms surfaces sorting in________ order of depth

a. Increasing

b. Decreasing

c. Both a & b

d. None of these

39.The problem of discontinuity of lines is known as

 File hosted by educationobserver.com/forum

a. Jaggies

b. Stair-casing

c. Both a & b

d. None of these

40.A quad-tree is a data structure which is used for graphical representation of

a. 2D digital picture or object

b. 3D picture or object

c. Both a & b

d. None of these

41.A octree is a data structure which is used for alternative representation of

a. 2D digital picture or object

b. 3D picture or object

c. Both a & b

d. None of these

42.How many data elements for each region in quad-tree data structure

a. 2

b. 4

c. 6

d. 8

43.How many data elements for each region in octree data structure

a. 2

b. 4

c. 6

d. 8

44.The main property of________ is that their shape is irregular

a. Fractals

b. Quad-tree

c. Rendering

d. None of these

45.The word fractals is coined by

 File hosted by educationobserver.com/forum

a. Mandelbrot in 1975

b. Gosling in 1962

c. Mandelbrot in 1974

d. Mandelbrot in 1979

46.The fractals is used to

a. Generate image of natural object

b. Viewing of various mathematical system

c. Viewing of various physical system

d. All of these

47.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. None of these

48.For which purpose ,one needs to apply natural light effects to visible surface

a. Fractals

b. Quad-tree

c. Rendering

d. None of these

49.The basic ray tracing algorithm provides

a. Transparency

b. Visible-surface detection

c. Shadow effect, multiple light source illumination

d. All of these
50. Ray-tracing is an extension of

a. Ray calling

b. Ray casting

c. Ray sampling

d. None of these

51.A fast and simple method for rendering an object with polygon surface is
 File hosted by educationobserver.com/forum

a. Constant-intensity shading

b. Flat shading

c. Both a & b

d. None of these

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
 File hosted by educationobserver.com/forum

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
 File hosted by educationobserver.com/forum

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
 File hosted by educationobserver.com/forum

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
 File hosted by educationobserver.com/forum

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
 File hosted by educationobserver.com/forum

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

1. Interactive computer graphics uses various kind of input devices such as

a. Mouse

b. Graphic tablet

c. Joystick
 File hosted by educationobserver.com/forum

d. All of these

2. 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

3. 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

4. The interactive computer graphics involves________ way communication b/w computer and the user

a. One

b. Two

c. Three
d. four

5. Interactive computer graphics enables a user to customize the graphics in _______

a. Computer way

b. His own way

c. Both a & b

d. None of these
6. 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

7. The application area of computer graphics are

a. Political

b. Education and textbook

c. CAD and entertainment

 File hosted by educationobserver.com/forum

d. All of these

8. CAD means

a. Car aided design

b. Computer art design

c. Computer aided design

d. None of these

9. DTP means

a. Draw top publishing

b. Desk top publishing

c. Desk town publishing

d. None of these

10.PCBs can be drawn using the computer graphics

a. In very efficiently way

b. In a shorter time

c. In a larger time

d. Both a & b

11.How many components of Interactive computer graphics are

a. One

b. Two

c. Three
d. four

12.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

13.A display controller serves to pass the contents of

a. Frame buffer to monitor

b. Monitor to frame buffer

c. Both a & b
 File hosted by educationobserver.com/forum

d. None of these

14.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

15.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

16.A 16*16array of black and white pixels could be represented by________

a. 64bytes

b. 32bytes

c. 128bytes

d. 96bytes

17.The display controller converts 0s and 1s into_______

a. TV monitor

b. Video signal

c. Electronics signal

d. None of these

18.The image can be transmitted to the display point by________

a. Line

b. Segment

c. Point

d. None of these

19.Which graphics application provides a proper dialogue box to help the user

a. MS excel

b. MS Paint
 File hosted by educationobserver.com/forum

c. MS word

d. None of these

20.The area of computer that is captured by an application is called

a. Window

b. View port

c. Display

d. None of these

21.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

22.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

23.Graphics output devices are

a. Graphics tablet, mouse

b. Keyboard

c. Light pen, joystick

d. None of these

24.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

25.The center of display screen is computed as

a. X max ,y max
 File hosted by educationobserver.com/forum

b. Xmax/2,ymax/2

c. Xmax/3,ymax/3

d. None of these

26.The operation that is used for repositioned the object are called

a. Rubber band method

b. Gravity field

c. Dragging

d. None of these

27.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

28.Which are used to connect a line to already drawn line

a. Rubber band method

b. Gravity field

c. Dragging

d. None of these

29.The rubber band is also applicable to_______ objects

a. Scale

b. Scalar

c. Vector

d. None of these
30. The division displayed on screen into row and columns is known as

a. Rubber band method

b. Gravity field

c. Dragging
d. Grid

31.The function of a plotter is like a

a. Monitor
 File hosted by educationobserver.com/forum

b. Projector
c. printer

d. None of these

32.A plotter is capable of

a. Printing a map

b. Printing a similar images

c. Both a & b

d. None of these

33.______ ink is used in laser printer

a. Wet

b. Dry

c. Both a & b

d. None of these

34.The cabinet in laser printer in which the ink is filled is called

a. Cartage

b. Toner

c. Both a & b

d. None of these

35.An inkjet printer places_______ of ink onto paper to print an image

a. Small droplets

b. large droplets

c. Both a & b

d. None of these

36.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

37.The speed of printing in inkjet printer is

a. Fast
 File hosted by educationobserver.com/forum

b. Slow

c. Not fast nor slow

d. None of these

38.The inkjet printer is mostly common due to their

a. Low cost

b. Performance

c. Both a & b

d. None of these

39.LCD stands for

a. Liquid core display

b. Liquid crystal display

c. Liquid crystal diagram

d. None of these
40. The LCD projector is the output device that is connected to the

a. Monitor

b. LCD

c. CPU

d. None of these

41.The size of the projected contents in LCD projector depends on the distance between

a. Projector and CPU

b. Projector and target screen

c. Projector and target memory

d. None of these

42.An LCD projector displays the contents in ________ manner than a simple monitor

a. Less flexible

b. More flexible

c. Inflexible

d. None of these
43. How many types of LCD projector

a. 1
 File hosted by educationobserver.com/forum

b. 2

c. 3

d. 4

44.The types of LCD projector are

a. Flat panel and laser

b. Normal and roof mounted

c. Mesh model and curved

d. None of these

45.The roof mounted projector are fixed on the

a. Floor

b. Roof

c. Corner

d. None of these

46.The roof mounted projector can connect two or more computers or laptops in______

a. Serial

b. Parallel

c. Both a & b

d. None of these
47. The roof mounted projector are also enabled to take

a. Computer data

b. Printing data

c. Both a & b

d. None of these

48.The roof mounted projector takes computer data via a cable through

a. Serial port

b. Parallel port

c. Both a & b

d. None of these
49. The roof mounted projector are Bluetooth

a. Enabled
 File hosted by educationobserver.com/forum

b. Disabled

c. Both a & b

d. None of these

50.The flat panel displays are________ in appearance

a. Flat

b. Curved

c. Both a & b

d. None of these

51.A touch screen display is an

a. Input device

b. Output device

c. Both a & b
d. Neither input nor output

52.The touch screen display shows the results of

a. Computation

b. Accept command and data from user for further computation

c. Both a & b

d. None of these

53.The flat panel display is called an

a. LCD monitor

b. LED monitor

c. Both a & b

d. None of these

54.A graphics tablet works on same principal as

a. Light pen

b. Monitor

c. Projector

d. None of these

55.The voice recognition system takes the command from the user in the form of

a. Writing
 File hosted by educationobserver.com/forum

b. Voice

c. Both a& b

d. None of these

56.In the voice recognition system ,the voice is converted into

a. Machine code

b. Byte code

c. Electrical signal

d. None of these
57. A joystick is a

a. Graphics input device

b. Graphics output device

c. Both a & b

d. None of these

58.A joystick is consisting of a

a. Pen

b. Stick

c. Microphone

d. None of these

59. joystick are often used to control

a. Typing

b. Video games

c. Voice

d. None of these

60.The joystick often has _____ fire buttons to trigger some kind of action

a. One

b. More

c. Both a & b

d. None of these

61.In which year ,mostly modern joystick use a USB interface for connection to the personal computer

a. 2005
 File hosted by educationobserver.com/forum

b. 2007

c. 2006

d. 2008

62.The light pen is an

a. Graphics input device

b. Graphics output device

c. Both a & b

d. None of these

63.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
64. A wireless mouse works on

a. Infra blue radiation

b. Infra red radiation

c. Infra green radiation

d. None of these

65.A wireless mouse consists of ______parts

a. One

b. Two

c. Three

d. None of these

66.The parts of wireless mouse is

a. Cable and a mouse

b. USB and a mouse

c. CPU and a mouse

d. None of these

67.The mouse’s motion typically translates into

a. Motion of a pointer on a display

 File hosted by educationobserver.com/forum

b. Motion of a pointer on a CPU

c. Both a & b

d. None of these

68.How many types of keyboard

a. 1

b. 2

c. 3

d. 4

69.Types of keyboard are

a. Standard

b. Gaming and multimedia

c. Thumb sized

d. numeric
e. all of these

70.Which are used to achieve the predetermined orientations and alignments of the objects

a. Constraints

b. Grid

c. Gravity field

d. None of these

71.The major constraints are

a. Horizontal alignment

b. Vertical alignment

c. Both a & b

d. None of these

1. 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

 File hosted by educationobserver.com/forum

d. Anti aliasing

2. The method which perform the scan conversion by using large number of delay cells are called

a. Analogue method

b. Digital method

c. Complex method

d. None of these

3. Digital method is also known as

a. Normal method

b. Buffered method

c. Real time method

d. None of these

4. Analogue method is also known as

a. Normal method

b. Buffered method

c. Real time or memory less method

d. None of these

5. Digital method allows a picture to be stored in line or frame buffer with

a. Same speed

b. Different speed

c. Both a & b

d. None of these

6. A pixel may be defined as

a. Smallest size object

b. Larger size object

c. Medium size object

d. None of these

7. A position in plane known as

a. Line

b. Point

c. Graphics
 File hosted by educationobserver.com/forum

d. None of these

8. A line can be represented by

a. One point

b. Two points

c. Three points

d. Four points

9. The process of coloring the area of a polygon is called

a. Polygon filling

b. Polygon flow

c. Aliasing

d. None of these

10.How many types of polygon filling

a. Two

b. One

c. Three

d. Four

11. 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

12.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

13.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

 File hosted by educationobserver.com/forum

d. None of these

14.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. None of these

15.Bresanham circle algorithm uses the approach of

a. Midpoint

b. Point

c. Line

d. None of these

16.The side effect of scan conversion are

a. Aliasing

b. Anti aliasing

c. Both a & b

d. None of these

17.The process of reducing aliasing is called

a. Resolution

b. Anti aliasing

c. Sampling

d. None of these

18.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

19.The problem of aliasing are

a. Staircase

b. Unequal brightness

c. Picket fence problem

 File hosted by educationobserver.com/forum

d. All of these

20.The technique to minimizing aliasing are

a. Increased no of resolution

b. Modify pixel intensities

c. Super sampling

d. All of these

21.Lower persistence phosphorus is used in

a. Animation

b. Simple object

c. Complex object

d. All of these

22.Lower persistence phosphorus needs_________ refresh rate

a. Lower

b. Higher

c. Medium

d. None of these

23.Higher persistence phosphorus needs _________ refresh rate

a. Lower

b. Higher

c. Medium

d. None of these

24.Higher persistence phosphorus is used in

a. Animation

b. Simple object

c. Higher complex object

d. All of these

25.Phosphorus are of various types depending on

a. color

b. persistence

c. both a & b
 File hosted by educationobserver.com/forum

d. none of these
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
 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. pixel
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) 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

discrete pixels is called____.
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: A

10) Graphics devices include_____.

A. input devices
B. output devices
C. Both a and b
D. None
ANSWER: C

11) Computer graphics allows_____.

A. user interface
B. plotting of graphics and chart
C. office automation and desktop publishing
D. all of above
ANSWER: D

12) Computer graphics allows______.

A. copmuter-aided drafting and design
B. simulaion and animation
C. art and commerce
D. all of above
ANSWER: D

13) Computer graphics allows_____.

A. process control
B. cartography
C. art and commerce
D. all of above
ANSWER: D

14) 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
15) 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

16) The display devices are_____.

A. input
B. output
C. a and b
D. none of these
ANSWER: B

17) CRT stands for____.

A. Cathode Ray Tube
B. Colour Ray Tube
C. Cathode Radio Tube
D. Colour Radio Tube
ANSWER: A

18) A CRT is an evacuated _________ tube.

A. plastic
B. glass
C. steel
D. iron
ANSWER: B

19) An____________ gun at the rear of the CRT produces a beam of electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B

20) The deflection system of the CRT consists of___________ deflection plates.
A. vertical
B. horizontal
C. a and b
D. none of these
ANSWER: C

21) The technique (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
22) Vector scan technique is also called _________.
A. scalar scan
B. random scan
C. raster scan
D. beam scan
ANSWER: B

23) In vector scan display, buffer memory used is also called _________.
A. refresh memory
B. refresh buffer
C. buffer display
D. refresh circuit
ANSWER: B

24) 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

25) 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

26) 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

27) 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

28) In raster scan display, the screen image repeatedly scanned, this process is called
_______.
A. buffering of screen
B. refreshing of screen
C. rendering of screen
D. highlighting screen
ANSWER: B

29) 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

30) The cost of vector scan display is___________ cost of raster scan display.
A. equal to
B. less than
C. more than
D. none of these
ANSWER: C

31) For ____________ display , scan conversion hardware is required.

A. vector scan
B. random scan
C. raster scan
D. none of these
ANSWER: C

32) Aspect ratio is the ratio of ________ to produce 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

33) Display file can be implemented using __________ data structure.

A. array
B. linked list
C. paging
D. all of the above
ANSWER: D

34) 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
35)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

36)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

37) 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

38) Persistence 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

39) 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

40) 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

41) Frame buffer is used to store_____.

A. number if pixels in image
B. intensities of pixels
C. image definition
D. co-ordinate values of image
ANSWER: B

42) The clarity of a displayed image depends on the______.

A. resolution
B. floating point precision of system
C. associated software
D. aspect ratio
ANSWER: A

43) 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

44) 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

45) 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

46) special area of the memory is dedicated to graphics only in raster scan display
called_________ .
A. Frame buffer
B. video controller
C. display controller
D. Monitor
ANSWER: A

47) 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 intensity information of each pixel from frame buffer
D. it controls the x&y address registers
ANSWER: C

48) 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

49) 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

50) 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

51) 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

52) 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

53) 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

54) 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

55) 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

56) 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

57) 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

58) 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

59)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

60) 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

61) 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

62) 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

63) 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

64) There are two standard methods of mathematically representing a circle centred 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

65) 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

66) 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

67) 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

68) A circle, if scaled only in one direction becomes a ?

A. parabola
B. hyperbola
C. Ellipse
D. remains a circle
ANSWER: C

69) (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

70) A line can be represented by_________.

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

71) Bresanham circle algorithm uses the approach of a ______________.

A. Midpoint
B. Point
C. Line
D. None of these
ANSWER: A

72) The process of reducing aliasing is called __________.

A. Resolution
B. Anti aliasing
C. Sampling
D. None of these
ANSWER: B

73) The problem of aliasing are_____________.

A. Staircase
B. Unequal brightness
C. Picket fence problem
D. All of these
ANSWER: D

74) 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

75) 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

76) 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

77) A line segment _____________.

A. extends forward
B. extends backward
C. ends at two points
D. extends forever both forward and backward
ANSWER: C

78) 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

79) 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

80) Floating point arithmetic in DDA algorithm is__________.A. time efficient

B. time consuming
C. fast
D. slow
ANSWER: B

81) 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

82) Expansion of line DDA algorithm is______.

A. Digital difference analyzer
B. Direct differential analyzer
C. Digital differential analyzer
D. Data differential analyzer
ANSWER: C

83) 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

84) 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

85) 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

86) 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

87) _____________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

88)__________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

89) Vector display is well suited for___________.

A. Animation
B. Line drawing applications
C. Cartoons
D. All of the above
ANSWER: B
90) Beam penetration method is usually used in______________.
A. LCD
B. Raster Scan display
C. Random scan display
D. DVST
ANSWER: C

91) An RGB color system with 24 bits of storage per pixel is known as
________________.
A. Color CRT
B. True-color system
C. RGB monitor
D. Color- Depth
ANSWER: B

92) Digitizing a picture definition into a set of intensity values is known as .............A.
Digitization
B. Scan conversion
C. Refreshing
D. Scanning
ANSWER: B

93) Raster graphics are composed of ____________.

A. Pixels
B. Paths
C. Palette
D. None of these
ANSWER: A

94) Which of the following allow for 8 mirror images?

A. Parabola
B. Ellipse
C. Hyperbola
D. Circle
ANSWER: D

95) The simplest output primitive is__________.

A. Straight line
B. Straight line segment
C. Point
D. Circle
ANSWER: C

96) A bitmap is________ bit(s) per pixels.

A. 0
B. 1
C. 2
D. 4
ANSWER: B
97) 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

98) The basic geometric structures that describes a scene on display is called
__________-
A. Attributes
B. Output primitive
C. Lines
D. Curves
ANSWER: B

99) 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

100) Two types of coordinates are_________.

A. Positive and negative coordinates
B. Absolute and relative coordinates
C. Both a & b
D. None
ANSWER: 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
 UNIT-II
Polygon, Windowing and Clipping
1. A chain of connected line segments is called a ________.
A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: A

2. In computer graphics, a graphical object is known as________.

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

3. The end points of polygon are called as__________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B

4. The line segments of polygon are called as _________.

A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: A

5. What are the types of polygon___________.

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

6. A closed polyline is called a _________.

A. Polychain
B. Polygon
C. Polyclosed
D. Closed chain
ANSWER: B

7. In which polygon object appears only partially________________.

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

8. 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

9. 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

10. __________ 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

11. _________ 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

12. 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

13. 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
14. Polygon filling algorithms those fill boundary defined regions are called _________
algorithms.
 A. flood fill
B. boundary fill
C. edge line
D. A and B
ANSWER:D

15. 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

16. The getpixel function gives the ______ of specified pixel.

A. intensity
B. colour
C. Size
D. Shape
ANSWER:B

17. The putpixel function draws the pixel specified_______.

A. intensity
B. colour
C. Size
D. Shape
ANSWER:B

18. Seed fill algo for filling polygon is ________ algorithm.

A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:A

19. Scan line algorithm for filling polygon is ______ algorithm.

A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:B

20. 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
21. 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

22. 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

23. 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

24. When a picture is displayed on the display device it is measured in ________co-ordinate

system.
A. World
B. Physical device
C. Viewing
D. Normalized
ANSWER:B

25. 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

26. 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

27. 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

28. 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

29. 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

30. Cohen-Sutherland subdivision line clipping algorithm uses ________ regions with
different codes.
A. 8
B. 6
C. 4
D. 9
ANSWER: D

31. The transformation which maps the viewing co-ordinates to normalized device Co-
ordinate is called _______.
A. Viewing transformation
B. translation
C. normalization transformation
D. homogeneous transformation
ANSWER: C

32. 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

33. 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
34. 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

35. 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

36. 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
37. 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

38. 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

39. 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

40. 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
41. 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

42. 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

43. 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

44. 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

45. In Sutherland -Hodgeman polygon clipping algorithm, if the first vertex of the edge is
outside the window boundary 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 boundary
C. Second vertex, the intersection point of the polygon edge with the window boundary
D. None of these
ANSWER: C

46. 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 boundary
D. None of these
ANSWER: B
47. In Sutherland - Hodgeman polygon clipping algorithm, if the first vertex of the edge is
inside the window boundary 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 boundary
D. None of these
ANSWER: C

48. 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 boundary
D. None of these
ANSWER: D

49. A many sided figure is termed as_________.

A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B

50. The rectangle portion of the interface window that defines where the image will actually
appear is called_____________.
A. Transformation viewing
B. View port
C. Clipping window
D. Screen coordinate system
ANSWER: B

51. The rectangle space in which the world definition of region is displayed is
called_______________.
A. Screen coordinate system
B. Clipping window or world window
C. World coordinate system
D. None of these
ANSWER: B

52. 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

53. 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

54. Some common form of clipping include_________.

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

55. 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

56. 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

57. How many types of polygon filling ____________.

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

58. 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

59. The function of scan line polygon fills 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

60. 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

61. The side effect of scan conversion are__________.

A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A

62. 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

63. 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

64. The process of mapping a world window in world coordinate system to viewport is called
___________.
A. Transformation viewing
B. View Port
C. Clipping window
D. Screen coordinate system
ANSWER: A

65. 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

66. 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

67. The transformation in which the dimension of an object is changed relative to a specified
fixed point is called ____________.
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER: B

68. An object can be viewed as a collection of___________.

A. One segment
B. Two segment
C. Several segments
D. None of these
ANSWER: C

69. The graphics method in which one object is transformed into another object are
called___________.
A. Clipping
B. Morphing
C. Reflection
D. Shear
ANSWER: B
70. 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
71. Sutherland Hodgeman algorithm is used for_____________.
A. Polygon filling
B. Line clipping
C. Polygon clipping
D. Text clipping
ANSWER: C

72. 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

73. 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

74. 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

75. Which of the following is true with respect to Suther land-Hodgeman 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

76. 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

77. 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
78. Adjacent pixels are likely to have same characteristics. This property is referred
as_______.
A. Property of coherence
B. Spatial coherence
C. Spatial coherence
D. None of these
ANSWER: A

79. 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
80. 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

81. 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

82. 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
83. 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 (30, 55) and
B(70, 40) will be___________.
A. Completely visible
B. Completely invisible
C. Partially visible
D. Partially invisible
ANSWER:C

84. 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

85. 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
86. 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

87. 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

88. 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

89. 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

90. 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

91. 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

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
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 (x 1, 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.C

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) 4-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
((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
((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
((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
((Q))1_//Inside tests of polygon are useful in --------
((A)) Polygon filling
((B)) Line coloring
((C )) Shadowing
((D)) None of the above
((E)) A
((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
((Q))1_//In winding number method an ------------------ edges ------ considered
((A)) Horizontal , not
((B)) Vertical , not
((C )) Slanted , not
((D)) Horizontal , is
((E)) A
((Q))1_//Even-odd method of inside test is suitable for------
((A)) Polygons
((B)) Circles
((C )) Lines
((D)) All of above
((E)) A
((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
((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
((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
((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
((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
((Q))1_//In Boundary Fill method ____________ Data Structure is used.
((A)) Stack
((B)) Array
((C )) Heap
((D)) None of above
((E)) A
((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
((Q))1_//Boundary fill algorithm uses -------- call to the fill function.
((A)) Recursive
((B)) Static
((C )) One
((D)) None of these
((E)) A
((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
((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
((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
((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
((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
((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
((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
((Q))1_//Active edge table is used in following algorithm
((A)) Boundary fill
((B)) Region fill
((C )) Scan Line
((D)) Edge Fill
((E)) C
((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

((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
((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
((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
((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
((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
((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
((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
((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
((Q))1_//Outcode / Region Code used in Line Clipping is of size ____ bits.
((A)) 4
((B)) 3
((C )) 2
((D)) 1
((E)) A
((Q))1_//In Line Clipping algorithm, the two dimensional space is divided into ___ regions.
((A)) 6
((B)) 7
((C )) 9
((D)) 10
((E)) C
((Q))1_//Cohen – Sutherland line clipping algorithm was developed in ____
((A)) 1967
((B)) 1968
((C )) 1969
((D)) 1965
((E)) A
((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
((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
((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
((Q))1_//The region code of a point within the window is ............
((A)) 1111
((B)) 0
((C )) 1000
((D)) 1001
((E)) B
((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
((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
((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
((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
((Q))1_//Sutherland Hodgeman algorithm works well for...........
((A)) Concave polygons
((B)) Convex Polygons
((C )) Smooth Curves
((D)) Line Segments
((E)) B
((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
((Q))1_//Sutherland – Hodgman algorithm is used for _______________.
((A)) Line Clipping
((B)) Polygon Clipping
((C )) Point Clipping
((D)) Hybrid Clipping
((E)) B
((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
((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
((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
((Q))1_//Types of polygon :
((A)) Concave
((B)) Convex
((C )) Complex
((D)) All of above
((E)) D
((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
((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
((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
((Q))1_//_____ may not always be Convex .
((A)) Paralleogram
((B)) Trapizoid
((C )) Polygon
((D)) Triangle
 ((E)) C
((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
((Q))1_//___________ is not a Type of polygon
((A)) Concave
((B)) Convex
((C )) Linear
((D)) Complex
((E)) C
((Q))1_//Right angled Triangle is an example of ____ Polygon
((A)) Concave
((B)) Convex
((C )) Complex
((D)) Linear
((E)) B
((Q))1_//Square is an example of ____ Polygon
((A)) Convex
((B)) Concave
((C )) Complex
((D)) Linear
((E)) A
(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
((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
((Q))1_//A concave polygon is one which is not ___
((A)) Non-Linear
((B)) Linear
((C )) Convex
((D)) None
((E)) C
((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
((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
((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
((Q))1_//One of the representation of Polygon is using
((A)) Rectangle Primitive
((B)) Trapizoid Primitive
((C )) Circle Primitive
((D)) Square Primitive
((E)) B
((Q))1_//Polygon can be drawn as series of ______
((A)) Triangles
((B)) Rectangles
((C )) Squares
((D)) Trapizoids
((E)) D
((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
((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
((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
((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
((Q))1_//The clipping window is mapped into a
((A)) window
((B)) clipping window
((C )) world coordinates
((D)) viewport
((E)) D
((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
((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
((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
((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
((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
((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
((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
((Q))1_//In viewing transformation maintain relative size and ______ between clipping window and
viewport
((A)) window
((B)) viewport
((C )) position
((D)) none
((E)) C
((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
((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
((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
((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
((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.
((A)) horizontal
((B)) veritical
((C )) arbitrary
 ((D)) both horizontal & vertical
((E)) C
((Q))1_//Generalised clipping algorithm deals with clipping against _____ line.
((A)) only horizontal
((B)) only veritical
((C )) arbitrary
((D)) both horizontal & vertical
((E)) C
((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
((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
((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
((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
((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
((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
((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
((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
((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
((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
((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
((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
((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
((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
((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
((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

((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
((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