MCQ Graphics
MCQ Graphics
SEARCH
Home
Contact Us
DBMS MCQ 1
A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: 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
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: A
A Polygoan in which the line segment joining any two points within the
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B
A. even-odd method
C. A and B
D. None of theseANSWER:
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
A. flood, boundry
B. even, odd
C. edge, flood
D. boundry, scan
ANSWER:
_______ 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:
A. 2,4
B. 4,8
C. 8,16
D. 8,6
ANSWER:
B. colour
C. Size
D. Shape
ANSWER:
A. intensity
B. colour
C. Size
D. Shape
ANSWER:
B
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
ANSWER:
The process of selecting and viewing the picture with diffrerent views is
called_______.
A. Clipping
B. WindowingC. Segmenting
D. all of above
ANSWER:
A Process which divides each segment of the picture into its visible and
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
ANSWER:
________co-ordinate system.
A. World
B. Physical device
C. Viewing
D. Normalized
ANSWER:
called__________.
A. translation
B. homogeneous transformation
C. co-ordinate conversion
D. Viewing transformation
ANSWER: D
A. Window
B. Segment
C. Clip
D. ViewportANSWER: A
__________.
A. Window
B. Segment
C. Clip
D. Viewport
ANSWER: D
A. Clip Window
B. Segment
C. Clip
D. Viewport
ANSWER: A
A. any line
B. one end
C. both end
D. any two
ANSWER: C
A. 8
B. 6
C. 4
D. 9
ANSWER: D
A. Viewing transformation
B. translation
C. normalization transformation
D. homogeneous transformation
ANSWER: C
B. viewing transformation
C. normalization transformation
D. homogeneous transformation
ANSWER: A
D. None of these
ANSWER: B
D. None of these
ANSWER: C
window,________.
D. None of these
ANSWER: C
window,________.
D. None of these
ANSWER: C
window,________.
D. none of these
ANSWER: C
is set if _____.
ANSWER: A
is set if _____.
ANSWER: B
is set if _____.
ANSWER: C
is set if _____.
ANSWER: D
D. None of theseANSWER: A
In cohen- sutherland subdivision line clipping algorithm,any line that has one
ANSWER: B
and the second vertex of the edge is inside then _____ and ____ are added to
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
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: B
and the second vertex of the edge is outside then _____ and ____ are added
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of theseANSWER: C
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
ANSWER:
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:
A. Selection
B. Separation
C. Clipping
D. None of these
ANSWER: C
A. Point
B. Segment
C. Parameter
D. None of these
ANSWER: B
B. Polygon
C. Rectangle
D. None
ANSWER: B
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B
B. Vertices
C. Line
D. None of these
ANSWER: A
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
D. None of these
ANSWER: B
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None
ANSWER: B
called_____________.
A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D
The rectangle portion of the interface window that defines where the image
called_____________.
A. Transformation viewing
B. View port
C. Clipping window
ANSWER: B
The rectangle space in which the world definition of region is displayed are
called_______________.
D. None of these
ANSWER: B
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
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
A. Scan conversion
B. Polygon filling
C. Two dimensional graphics
D. Anti aliasing
ANSWER: A
A. Polygon filling
B. Polygon flow
C. Aliasing
D. None of these
ANSWER: A
A. Two
B. One
C. Three
D. Four
called____________.
ANSWER: A
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___________.
D. None of these
ANSWER: B
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
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
C. Both a & b
D. None of these
ANSWER: C
B. View Port
C. Clipping window
ANSWER: A
B. Clipping window
D. None of these
ANSWER: A
A. Curve clipping
B. Point clipping
C. Polygon clipping
D. All of these
ANSWER: D
E. A and B
ANSWER: E
called________.
A. TranslationB. Scaling
C. Rotation
D. Reflection
ANSWER: A
called____________.
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER: B
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
D. Only a
ANSWER: D
A. Polyline
B. Polysegment
C. Polygon
.D. Polychain
ANSWER: A
A ploygon in which the line segment joining any two points within the
polygon, is called___________polygon .
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B
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___________.
D. None of these
ANSWER: A
A. Polygon filling
B. Line clipping
C. Polygon clipping
D. Text clipping
ANSWER: C
D. All of these
A. Visible
B. Partially Visible
C. Completely Exterior
ANSWER:
A. 0010
B. 1000
C. 0100
D. 0110
ANSWER: A
D. None of these
ANSWER: C
A. First vertex
B. The intersection point of the polygon edge with the window boundary
C. Second vertex
D. None of these
ANSWER: B
(40,15) and (75,45). What will be the end points of clipped line? Use Cohen –
Sutherland Outcode Algorithm.
D. None of Above
ANSWER:
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
upper right corner at ( 12,8). What will be the end points of clipped line? Use
Algorithm.
ANSWER:
direction.
D. None of these
ANSWER:
the?
A. Viewing window
B. Shift vector
ANSWER:
(3,5) to a view point with lower left corner at (0,0) and upper right corner
Sy =___.
C. 4 & 8
D. 0.5 & 1
ANSWER:
AIn the Cohen-Sutherland outcode algorithm, given the clipping window co-
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:
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:
Xmax= 50 , Ymax = 70, the line PQ with end-points P(0, 60) and Q(40, 50),
ANSWER:
Xmax= 50 , Ymax = 70, the line PQ with end-points P(30, 55) and Q(70, 40)
A. 0
B. 1
C. 2
D. 3
ANSWER:
In the Cohen Sutherland Outcode Algorithm, the four bits in the outcode are
ANSWER:
In the Cohen Sutherland Outcode Algorithm, if both the end-points of the line
A. Left
B. Right
C. Top
D. Bottom
ANSWER:
ANSWER:
D. None of these
ANSWER: A
If the pixel is already filled with desired color then leaves it otherwise fills it.
this is called
D. None of these
ANSWER: B
B. Photograph, movies
C. Simulation
D. All of theseANSWER: D
encountered is called
B. Boundary-fill algorithm
C. Flood-fill algorithm
ANSWER: B
A. Boundary-fill algorithm
C. Flood-fill algorithm
D. Only b
ANSWER: C
There are 2 types of polygons. They are?
ANSWER: A
A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B
D. None of these
ANSWER: A
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_______.
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
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
A. Negatively oriented
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
A. No of sides of polygon
B. Vertices points
C. Both a & b
D. None of these
ANSWER: C
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
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,
of the following?
A. 4-connected method
B. 5-connected method
C. 7-connected method
D. 8-connected methodANSWER: D
In a given triangle, a(10, 10), B(20, 20), C(30, 10), the point P(28, 20)
is______.
C. On the vertex
D. On the edge
ANSWER: B
Subject:-Computer Graphics
element called______.
A. dots
B. pixels
C. co-ordinates
D. points
ANSWER: B
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
A. intensity
B. size
C. shape
D. None
ANSWER: A
A. colour
B. size
C. shape
D. None
ANSWER: A
6) Each pixel on the graphics display represents______.
B. 2 mathematical point
C. 4 mathematical point
ANSWER: D
A. (4,3)
B. (3,4)
C. (5,4)
D. (4,4)
as___
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: B
9) The process representing continuous picture or graphics objects as a
called____.
A. scan conversion
B. rasterization
C. scanning
D. graphical representation
ANSWER: A
A. rotation
B. translation
D. All of above
ANSWER: D
A. input devices
B. output devices
C. a and b
D. None
ANSWER: C
A. user interface
D. all of above
ANSWER: D
D. all of above
ANSWER: D
A. process control
B. cartography
D. all of above
ANSWER: D
15) The software components of conceptual framework for interactive
graphics is/are_____.
C. graphics system
D. all of above
ANSWER: D
graphics is/are________.
A. input devices
B. output devices
C. a and b
D. none of these
ANSWER: C
A. input
B. output
C. a and b
D. none of these
ANSWER: B
18) CRT stands for____.
ANSWER: A
A. plastic
B. glass
C. steel
D. iron
ANSWER: B
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
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
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C
electrons.
A. electronic
B. electron
C. element
D. emergency
ANSWER: B
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
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
D. refresh circuit
ANSWER: B
flicker.
A. 10
B. 20
C. 30
D. 40
ANSWER: C
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 _______
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
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 theseANSWER: C
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
ANSWER: A
A. array
B. linked list
C. paging
ANSWER: D
A. animation
B. sampling
C. rasterization
D. scan-conversion
ANSWER: D
A. resolution only
D. computer byte
ANSWER: C
memory.
A. 1 bit
B. 2 bits
C. 1 nibble
D. 1 byte
ANSWER: C
44)The resolution of an image is __________.
D. none of these
ANSWER: A
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
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
ANSWER: A
B. intencities of pixels
C. image definition
ANSWER: B
A. resolution
C. associated software
D. aspect ratio
ANSWER: A
C. calligraphic displays
ANSWER: A
A. Motion dynamics
B. Update dynamics
C. A & B
D. None of these
ANSWER: B
D. all of theseANSWER: 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
ANSWER: C
A. It require large number of frame buffer memory cycles needed for video
scan out
D. All of these
ANSWER: D
To store black and white images ,black pixels are represented by________ in
pixels by_______.
C. Both a & b
D. None of these
ANSWER: B
A. Line
B. Segment
C. Point
D. None of these
ANSWER: C
A. X max ,y max
B. Xmax/2,ymax/2
C. Xmax/3,ymax/3
D. None of these
ANSWER: B
B. Incremental
ANSWER: B
ANSWER: A
ANSWER: A
C. XOR Operation
ANSWER: B
A. d=2dy-dx
B. d=2dx-dy
C. d=4dy-dx
D. d=4dx-dy
ANSWER: A
A. Semi-circle symmetry
B. Quarter symmetry
C. Eight-way symmetry
ANSWER: C
ANSWER: A
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
A. 2Δy – Δx
B. 2Δy – 2Δx
C. Δx – Δy
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
ANSWER: B
________________.
A. y = m(a+b+c)
B. y = m.x + b
C. y = 2∆x-m
The DDA algorithm is a faster method for calculating pixel positions than the
A. TRUE
B. FALSE
ANSWER: A
parameter is p0 = 5/4 – r.
A. TRUE
B. FALSE
ANSWER: A
ANSWER: C
There are two standard methods of mathematically representing a circle
ANSWER: D
D. All octants
ANSWER: A
A. Linear search
B. Binary Search
C. Heap sort
D. Bubble Sort
ANSWER: B
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
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
A. Midpoint
B. Point
C. Line
D. None of these
ANSWER: A
A. Aliasing
B. Anti aliasing
C. Both a & b
D. None of these
ANSWER: A
B. Anti aliasing
ANSWER: B
A. Staircase
B. Unequal brightness
D. All of these
ANSWER: D
D. both a and b
ANSWER: A
A line connecting the points (1,1) and (5,3) is to be drawn, using DDA
increments?
A. x-increments = 1; y-increments =1
D. None of above
ANSWER: C
Line produced by moving pen is __ at the end points than the line produced
A. Thin
B. Straight
C. Thicker
D. both A and B
ANSWER: C
A. extends forward
B. extends backward
ANSWER: C
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
B. time consuming
C. fast
D. slow
ANSWER: B
mx + b.
A. slower than
B. faster than
D. none of these
ANSWER: B
ANSWER: C
C. Mid-point 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
C. Both A or B
D. A or B
ANSWER: A
A. Linear search
B. Binary search
C. Heap sort
D. Bubble sort
ANSWER: B
A. Picture element
B. Point
ANSWER: A
CRT
A. Aspect Ratio
B. Resolution
C. Brightness
D. Pixel
ANSWER: B
A. Resolution
B. Pixel
C. Persistence
D. Dot Pitch
ANSWER: B
_____________is the number of points per centimeter that can be plotted
A. Aspect Ratio
B. Pixel Depth
C. Resolution
D. Dot Pitch
ANSWER: C
A. Dot Pitch
B. Resolution
C. Aspect Ratio
D. Height-Width Ratio
ANSWER: C
A. Animation
C. Cartoons
D. All of the above
ANSWER: B
A. LCD
D. DVST
ANSWER: C
as________________.
A. Color CRT
B. True-color system
C. RGB monitor
D. Color- Depth
ANSWER: B
.............A. Digitization
B. Scan conversion
C. Refreshing
D. Scanning
ANSWER: B
A. Pixels
B. Paths
C. Palette
D. None of these
ANSWER: A
A. Parabola
B. Ellipse
C. Hyperbola
D. Circle
ANSWER: D
A. Straight line
C. Point
D. Circle
ANSWER: C
A. 0
B. 1
C. 2
D. 4
ANSWER: B
D. None
ANSWER: A
called__________-.
A. Attributes
B. Output primitive
C. Lines
D. Curves
ANSWER: B
A. DDA algorithm
B. Mid-point algorithm
parameter Pk is______.
A. Positive
B. Equal
C. Negative
D. Option a or c
ANSWER: C
Subject:-Computer Graphics
A. Polyline
B. Polysegments
C. Polygon
D. Polychain
ANSWER: 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
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: A
A Polygoan in which the line segment joining any two points within the
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B
A. even-odd method
C. A and B
D. None of these
ANSWER:
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:
_______ 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:
__________ connected.
A. 2,4
B. 4,8
C. 8,16
D. 8,6
ANSWER:
A. intensity
B. colourC. Size
D. Shape
ANSWER:
B. colour
C. Size
D. Shape
ANSWER:
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
A. recursive
B. non-recursive
C. A and B
D. None of these
ANSWER:
B
D. all of above
ANSWER:
The process of selecting and viewing the picture with diffrerent views is
called_______.
A. Clipping
B. Windowing
C. Segmenting
D. all of above
ANSWER:
BA Process which divides each segment of the picture into its visible and
be discarded is called__________.
A. Clipping
B. Windowing
C. Segmenting
D. all of above
ANSWER:
ANSWER:
________co-ordinate system.
A. World
B. Physical device
C. Viewing
D. Normalized
ANSWER:
called__________.
A. translation
B. homogeneous transformation
C. co-ordinate conversion
D. Viewing transformation
ANSWER: D
A. Window
B. Segment
C. Clip
D. Viewport
ANSWER: A
__________.
A. Window
B. SegmentC. Clip
D. Viewport
ANSWER: D
A. Clip Window
B. Segment
C. Clip
D. Viewport
ANSWER: A
A. any line
B. one end
C. both end
D. any two
ANSWER: C
A. 8
B. 6
C. 4
D. 9
ANSWER: D
A. Viewing transformation
B. translation
C. normalization transformation
D. homogeneous transformation
ANSWER: C
A. Workstation transformation
B. viewing transformation
C. normalization transformation
D. homogeneous transformation
ANSWER: AIf both end points of a line are exterior to the clipping
window,__________.
A. the line is interior to the clipping window
D. None of these
ANSWER: B
window,________.
D. None of these
ANSWER: C
window,________.
D. None of these
ANSWER: C
If both end points of a line are completely to the above of clipping
window,________.
D. None of these
ANSWER: C
window,________.
D. none of these
ANSWER: C
is set if _____.
B. end point of line is to the right of the windowC. end point of line is to the
ANSWER: A
is set if _____.
ANSWER: B
is set if _____.
ANSWER: C
is set if _____.
ANSWER: D
D. None of these
ANSWER: A
In cohen- sutherland subdivision line clipping algorithm,any line that has one
ANSWER: B
second vertex of the edge is inside then _____ and ____ are added to the
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
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: B
second vertex of the edge is outside then _____ and ____ are added to the
A. first vertex
B. Second vertex
C. the intersection point of the polygon edge with the window boundry
D. None of these
ANSWER: C
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
B. Midpoint algorithm
ANSWER:
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
A. Selection
B. Separation
C. Clipping
D. None of these
ANSWER: C
A. Point
B. Segment
C. Parameter
D. None of these
ANSWER: B
A. Square
B. Polygon
C. Rectangle
D. None
ANSWER: B
The end point of polygon are called as__________.
A. Edges
B. Vertices
ANSWER: B
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: A
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
A. Convex polygon
B. Concave polygon
C. Both a & b
D. None
ANSWER: B
called_____________.A. Translation
B. Shear
C. Reflection
D. Clipping
ANSWER: D
The rectangle portion of the interface window that defines where the image
called_____________.
A. Transformation viewing
B. View port
C. Clipping window
ANSWER: B
The rectangle space in which the world definition of region is displayed are
called_______________.
ANSWER: B
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
A. curve clipping
B. point clipping
A technique by which the vertical and /or horizontal scan frequency of video
A. Scan conversion
B. Polygon filling
D. Anti aliasing
ANSWER: A
A. Polygon filling
B. Polygon flow
C. Aliasing
D. None of these
ANSWER: A
A. Two
B. One
C. Three
D. Four
ANSWER: C
called____________.
D. None of these
ANSWER: A
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,
ANSWER: B
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
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
D. None of these
ANSWER: C
A. Transformation viewing
B. View Port
C. Clipping window
ANSWER: A
B. Clipping window
ANSWER: A
A. Curve clipping
B. Point clipping
C. Polygon clipping
D. All of these
ANSWER: D
E. A and B
ANSWER: E
called________.
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER: A
called____________.
A. Translation
B. Scaling
C. Rotation
D. Reflection
ANSWER: B
A. One segment
B. Two segment
C. Several segments
D. None of theseANSWER: 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____________.
C. Center coordinates
D. Only a
ANSWER: D
A. Polyline
B. Polysegment
C. Polygon
D. Polychain
ANSWER: A
A ploygon in which the line segment joining any two points within the
polygon, is called___________polygon .
A. Convex
B. Concave
C. Closed
D. Complete
ANSWER: B
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 polygonB. Ymax to ymin of the longest edge
of the polygon
D. None of these
ANSWER: A
A. Polygon filling
B. Line clipping
C. Polygon clipping
D. Text clipping
ANSWER: C
D. All of these
ANSWER: C
A. Visible
B. Partially Visible
C. Completely Exterior
ANSWER:
A. 0010
B. 1000
C. 0100
D. 0110
ANSWER: A
ANSWER: C
A. First vertex
B. The intersection point of the polygon edge with the window boundary
C. Second vertex
D. None of these
ANSWER: B
(40,15) and (75,45). What will be the end points of clipped line? Use Cohen –
D. None of Above
ANSWER:
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
ANSWER:
direction.
D. None of theseANSWER:
the?
A. Viewing window
B. Shift vector
ANSWER:
to a view point with lower left corner at (0,0) and upper right corner
C. 4 & 8
D. 0.5 & 1
ANSWER:
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:
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:
50 , Ymax = 70, the line PQ with end-points P(30, 55) and Q(70, 40) will
A. 0
B. 1
C. 2
D. 3
ANSWER:
B
In the Cohen Sutherland Outcode Algorithm, the four bits in the outcode are
ANSWER:
In the Cohen Sutherland Outcode Algorithm, if both the end-points of the line
A. Left
B. Right
C. Top
D. Bottom
ANSWER:
ANSWER:
D. None of these
ANSWER: AIf the pixel is already filled with desired color then leaves it
D. None of these
ANSWER: B
A. Drawing
B. Photograph, movies
C. Simulation
D. All of these
ANSWER: D
encountered is called
B. Boundary-fill algorithm
C. Flood-fill algorithm
ANSWER: B
A. Boundary-fill algorithm
D. Only b
ANSWER: C
ANSWER: A
A. Square
B. PolygonC. Rectangle
D. None
ANSWER: B
A. Edges
B. Vertices
C. Line
D. None of these
ANSWER: B
called____________.
D. None of these
ANSWER: A
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_______.
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
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
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
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
A. No of sides of polygon
B. Vertices points
C. Both a & b
D. None of these
ANSWER: C
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
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,
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
C. On the vertex
D. On the edge
ANSWER: B
SHARE
SHARE
Comments
1.
UnknownSeptember 24, 2020 at 4:38 AM
I want MCQ on Computer Graphics A programming approach Steven Harrington Second Edition
REPLY
2.
NikhilDecember 16, 2020 at 9:00 PM
REPLY
1.
UnknownJanuary 11, 2021 at 12:28 AM
Post a Comment
Popular posts from this blog
PPL 1
NEW Unit III STRUCTURING OF PROGRAM MULTIPLE CHOICE
QUESTIONS 1. Which of the following is the functionality of ‘Data
Abstraction’? (a) Reduce Complexity (b) Binds together code and data (c)
Parallelism (d) None of the mentioned Answer : a Explanation : An essential
element of Object Oriented Programming is ‘Data Abstraction’ which means
hiding things. Complexity is managed through abstraction. 2. Which of the
following mechanisms is/are provided by Object Oriented Language to
implement Object Oriented Model? (a) Encapsulation (b) Inheritance (c)
Polymorphism (d) All of the mentioned Answer : d Explanation : None. 3.
Which of these is the functionality of ‘Encapsulation’? (a) Binds together
code and data (b) Using single interface for general class of actions. (c)
Reduce Complexity (d) All of the mentioned Answer : a Explanation :
‘Encapsulation’ acts as protective wrapper that prevents code and data from
being accessed by other code defined outside the
SHARE
POST A COMMENT
READ MORE
EEE
EEE Unit-1 DC Machines MCQ's MULTIPLE CHOICE QUESTIONS ON
UNIT 1: DC MACHINES Edit 1.The sole purpose of a Commutator in a dc
generator is to------- ((A))increase output voltage ((B)) reduce sparking at
brushes ((C)) provide smoother output ((D)) convert the induced ac into dc
Hide ! Answer : D 2.In a dc generator, the generated emf is directly
proportional to the------ ((A)) field current ((B)) pole flux ((C)) number of
armature parallel paths ((D)) number of dummy coils Hide ! Answer:B 3.An
ideal dc generator has .......... voltage regulation. ((A))low ((B))zero
((C))positive ((D))negative Hide ! Answer:B 4.Which generator may have
poorest voltage regulation? ((A))series ((B))shunt((C))compound ((D))high
Hide ! Answer:A 5.Voltage equation of a dc motor is----- ((A)) V = Eb +
IaRa ((B)) Eb = V + IaRa ((C))V = Eb /IaRa ((D))V = Eb + Ia2Ra Hide !
Answer: A 6.Which of the following motor has the constant speed?
((A))Series motor ((B))Shunt motor ((C))Cumulatively compound motor ((D)
SHARE
1 COMMENT
READ MORE
POST A COMMENT
READ MORE
About Me
Coder
VISIT PROFILE
Archive
Report Abuse
Recent Posts
3/recentposts
[recent]
Comments
3/recentcomments
Powered by Blogger