This document contains 60 multiple choice questions about computer graphics topics like raster displays, coordinate systems, geometric transformations, projections, clipping, and algorithms for line and circle drawing. Key concepts covered include rasterization, scanline coherence, edge detection algorithms, clipping methods, transformations like translation, rotation, and scaling, and perspective and parallel projections.
This document contains 60 multiple choice questions about computer graphics topics like raster displays, coordinate systems, geometric transformations, projections, clipping, and algorithms for line and circle drawing. Key concepts covered include rasterization, scanline coherence, edge detection algorithms, clipping methods, transformations like translation, rotation, and scaling, and perspective and parallel projections.
This document contains 60 multiple choice questions about computer graphics topics like raster displays, coordinate systems, geometric transformations, projections, clipping, and algorithms for line and circle drawing. Key concepts covered include rasterization, scanline coherence, edge detection algorithms, clipping methods, transformations like translation, rotation, and scaling, and perspective and parallel projections.
This document contains 60 multiple choice questions about computer graphics topics like raster displays, coordinate systems, geometric transformations, projections, clipping, and algorithms for line and circle drawing. Key concepts covered include rasterization, scanline coherence, edge detection algorithms, clipping methods, transformations like translation, rotation, and scaling, and perspective and parallel projections.
1) _________ refers to the shutting off the electron beam as it returns from the bottom of the display at the end of a cycle to the upper left-hand corner to start a new cycle. (a) Horizontal retraces blanking (b) Diagonal retrace blanking (c) Vertical retrace blanking (d) None of the above
2) Cartesian coordinate system can be
(a) Left-handed (b) Right-handed (c) Both a and b (d) None of the above
3) Each bytes is composed of _________ bits
(a) 2 (b) 4 (c) 8 (d) 16
4) The majority of _______ systems assign 1 bit in the memory map to one pixel on the display. (a) Monochromatic (b) Dichromatic (c) Polychromatic (d) Tri-chromatic
5) There are _________ steps involved in converting Cartesian coordinates
(a) 1 (b) 2 (c) 3 (d) 4
6) Most display terminals provide the uses with ______ keyboard.
(a) Alphabetic (b) Numeric (c) Alphanumeric (d) All of the above
7) Two types of graphical interaction are-
(a) Partitioning and positioning (b) Partitioned and painting (c) Positioning and pointing (d) None of the above
8) CRT raster display can be considered as a matrix of __________ calls
1 9) The process of determining which pixels will provide a better approximation to the desired line is known as____. (a) Scan conversion (b) Randomization (c) Rasterization (d) Recreation
10) Rasterization combined with the process of rendering the picture scan line order is known as _________ (a) Scan conversion (b) Randomization (c) Recreation (d) None of the above
11) One technique for obtaining a raster zed straight line is to solve the governing __ equation. (a) Linear (b) Drastic (c) Integrated (d) Differentials
12) Basic methods of projection are _______ and ________ .
(a) Parallel and perspective (b) Parallel and perceptive (c) Perceptive and perspective (d) None of the above
13) In viewing / specifying any objective the first viewing parameter is _____ & next is ____ a) view reference point, view plane normal vector b) View plane normal vector, the View reference point c) Both a & b d) None of these
14) Equation for e in Brasenhams algorithm is.
(a) e = dy/dx -1/2 (b) e = 2dy –dx (c) e =dy-dx/2 (d) e = dy-2dx
15) Equation for e in integer Brasenhams algorithm is.
(a) e =dy/dx -1/2 (b) e = 2dy-dx (c) e =dy-dx/2 (d) e = dy- 2dx
2 17) Brasenhams circle algorithm, it is desirable to perform the calculation necessary to find the scan –converted points with only. (a) Integer addition (b) Subs traction (a) Multiplication (c) All of the above
18) The best approximation in Brasenhams circle algorithm of the true circle will be described by those pixels in the raster that falls the _______ distance from the true circle. (a) Least (b) Far (c) Both a and b (d) None of the above
19) Good graphics programming avoids the use of _____ operations whenever possible. (a) Multiplications (b) Division (c) Floating point (d) Integer
21) The simplest methods of felling a polygon is to examine ____ in the raster. (a) 1 pixel (b) 2 pixel (c) 5 pixel (d) Every pixel
22) The bounding box is the ________ that contains the polygon. (a) Smallest rectangle (b) Largest rectangle (c) Smallest triangle (d) Smallest square
23) Expect at boundary edges, adjacent pixels are likely to have some characteristics. This property is referred to as __________. (a) Coherence (b) Special coherence (c) Spatial coherence (d) None of the above
24) For a __________graphics device adjacent pixels on a scan line are likely to have the same characteristics. (a) Random scan (b) Raster scan (c) CRT (d) None of the above
3 25) What is scan line coherence? (a) Adjacent pixels on a scan line are likely to have different characteristics (b) Non-adjective pixels on a scan line are likely to have different characteristics (c) Adjective pixels on a scan line are likely to have the same characteristics (d) None of the above
26) The characteristics of pixels on a given scan line change only where a polygon ____ scan line (a) Intersects (b) Unions (c) Differences (d) All of the above
27) Efficient algorithms for scan –converting solid area polygons can be developed. These are called (a) Unordered edge list algorithm (b) Ordered edge list algorithm (c) A lumbered edge list algorithm (d) All of the above
28) The efficiency of the algorithm depends on the _________.
(a) Efficiency of searching (b) Efficiency of time (c) Efficiency of sorting (d) None of the above
29) The ordered edge list algorithm is _______.
(a) Powerful (b) Weak (c) Extremely weak (d) Very powerful
31) Using the half scan line convention for each edge interesting the polygon, set the leftmost pixel whose endpoint lies to the right of the interaction. This is a procedure for- (a) Fill (b) Counter (c) Contour outline (d) None of the above
32) The disadvantage of both the edge fill and fence fill algorithm is the number of pixels addressed (a) More than once (b) Not even once (c) Exactly once (d) None of the above
33) The edge fill, fence fill and edge flag algorithm are _______ to simple polygons. (a) Limited (b) Not limited (c) Both a and b (d) None of the above
4 34) The First step of edge –flag algorithm is (a) Fill (b) Sean line (c) Contour outline (d) None of the above
35) The edge flag algorithm lists each pixel ___
(a) At least once (b) Almost once (c) 1 (d) None
36) A simple seed fill algorithm for a boundary the defined region can be developed using a ______. (a) Queue (b) Linked list (c) Dequeue (d) Stack
37) In a stack values may be placed or removed _______.
(a) Sequentially (b) Randomly (c) Directly (d) None of the above
38) A push down stack is ______.
(a) FIFO (b) LILO (c) LIFD (d) None of the above
39) In simple seed fill algorithm _________ function is used for placing a pixel on the stack. (a) Seed (b) Push (c) POP (d) None of the above
40) In simple seed fill algorithm _________ function is used for removing a pixel from the stack. (a) Seed (b) Push (c) Pop (d) All of the above
41) _____ is the process of extracting a portion of the database, is fundamental to several aspects of computer graphics. (a) Projection (b) Clipping (c) Rotation (d) Translation
42) Clipping algorithm can be implemented in –
(a) Software (b) Both a and b (c) Hardware (d) None of the above
5 43) If both the and points of a line are exterior to the window then, (a) It is completely exterior to the window (b) The line is not necessarily complete exterior of the window (c) Both a and b (d) None of the above
44) If a and b are endpoints of a line, then an algorithm for identifying completely visible and most invisible lines might be: (a) Visibility algorithm (b) Simple visibility algorithm (c) Complex visibility algorithm (d) None of the above
45) Endpoint code checking can easily be implemented when _________ are available. (a) Byte manipulation (b) Megabyte manipulation (c) Bit manipulation (d) None of the above
46) Midpoint subdivision algorithm woods direct calculation by performing
(a) Sequential search (b) Direct search (c) Binary search (d) None of the above
47) In hardware division by 2 can be accomplished by shifting each bit to the –
(a) Right (b) Left (c) Up (d) Down
48) Polygon clipping operator on
(a) Vertices (b) Edges of the polygon (c) Both a and b (d) None of the above
49) The object is held stationary while the coordinate system is moved relative to the object is called (a) Geometric Transformation (b) Coordinate transformation (c) Translation (d) Rotation
50) The object is held stationary while the coordinates system is moved relation to the object is called. (a) Geometric transformation (b) Coordinate transformation (c) Translation (d) Rotation
51) The object is displaced a given distance and direction its original position is called (a) Translation (b) Rotation (c) Transformation (d) Scaling 6 52) ________ is the process of expanding or compressing the dimensions of an object. (a) Translation (b) Rotation (c) Transformation (d) Scaling
53) A scaling constant _____ indicates an expansion of length.
(a) 1 (b) <1 (c) = 1 (d) ≥ 1
54) A scaling constant ______ indicates, compression of lengthy-
(a) < 1 (b) = 1 (c) ≥ 1 (d) None of these
55) If both scaling constants have the same value S, the sealing transformation is said to be (a) Homogeneous (b) Heterogeneous (c) Both a and b (d) None of the above
56) In Perspective Projection eye of the artist is placed at the
(a) Left of projection (b) Right of projection (c) Top of projection (d) Center of projection
58) Shift Register is operated in _________ fashion i.e. similar to __________
a) FIFO, Queue b) FILO, Stack c) LIFO, Stack d) None of the above
59) In raster scan display a special area of memory is dedicated to graphics only. This memory area is called _________ & it hold the set of ________ value for all screen points. a) Frame Buffer, Intensity b) LUT, Canvas c) Canvas, Output d) None of the above
7 60) In the display controller architecture, the _________ allows the CPU to access the frame buffer directly & display controller to access the __________ & there is a separate position to avoid memory conflicts when the CPU & display controller run asynchronously. a) Memory mapping, CPU memory b) Direct Mapping, CPU memory c) Indirect mapping, main memory d) Memory mapping, a frame buffer.
61) The __________ line is straight but its __________ is not constant. a) 45°, width b) 60°, Height c) 30°, length d) None of the above
62) In DDA, the rasterized line lies to both side of actual line i.e. algo. is _________ dependent & here end. pt. accuracy is _____________ a) rasterization, 90% b) Orientation, poor c) Orientation, good d) Conversion, poor
63) The basic principle of Bresenham’s Line algorithm is to select the optimum __________ locn to represent a line i.e. increment the value of x or y by one unit depending upon ______ of line. a) raster, slope b) random, intensity c) raster, intensity d) random, slope.
64) The increase in x or y is determined by examine the distance between locn & nearest pixel. This distance is called __________ or _____________ a) Decision variable, error gradient b) e, error c) Proposition to d1...d2 d) All of the above
65) The Bresenham’s circle drawing algorithm consider _________ way symmetry of the circle to generate it. It plots 1/8th part of the circle i.e. from 90 to ______ a) eight, 45° b) eight, 180° c) 16, 45° d) four, 45°
66) _________ polygon is a polygon in which the line segment joining any two points within the polygon lines completely inside the polygon & its opposite is __________ polygon. a) Concave, convex b) Convex, concave
67) Algorithm that fill interior defines region are called __________ algorithm, Those that fill boundary defined region are called __________ algorithm. a) Flood fill, boundary fill b) Flood fill, edge fill c) Boundary fill, edge fill d) Both a & b
8 68) Two basic approaches used to fill the polygon are _____________ & _____________. a) Seed point, the scan line b) Rasterizaion, scan conversion c) Seed point, bucket file d) None of the above
69) _______ give the color of specified pixel & _________ draws the pixel with specified color. a) get pixel(), put pixel() b) put pixel(), get pixel() c) Both a & b d) None of the above
70) Filling an area with a rectangular pattern is called ___________ & relating the area of pattern with the area of primitive is known as ___________. a) Filing, anchoring b) filing, viewing c) clipping, viewing d) anchor, cryptography
71) Horizontal & vertical lines have different thickness then line at an angle. If the thickness of horizontal /vertical line is t then line drawn at 45° has an average thickness of _____ & unequal line thickness results in unequal _______________ a) t/√3, replication b) t/2 , replication c) t/√2 brightness d) t/√3, brightness
72) In ______________ method the thickness of the primitive varies with the angle of primitive & varies in opposite way then in pixel _____________ method. a) Moving pen, replication b) replication, moving pen c) pattern filling, moving pen d) all of the above
73) The process of selecting & viewing the picture with different views is called ____________ & a process which divides each element of the picture into its visible & invisible position is called ______________. a) Windowing, clipping b) anchoring, filling c) anchoring, cartography d) all of the above
74) The region against which an object is to be clipped is called ___________ or__________. a) Boundary, edges b) Clip window, clipping window c) view port, window d) Both a & b
75) The oldest & most popular line clipping algorithm is ____ & was developed by ____ to speed up processing a) Cohen subdivision algorithm, Ivan Sutherland b) Sutherland line clipping algorithm, Den Cohen c) Both a & b d) None of the above
9 76) 4-bit code are called ______________ or ______________ a) region code, out code b) UDLR code, LRTB code c) Both a & b d) None of the above
77) ____________ is a generalized line clipping algorithm and is applicable to an arbitrary __________ region. a) Cyrus Beck, Convex b) Cohen Sutherland, concave c) Cyrus Beck, Concave d) Cohen Sutherland, convex
78) ___________ algorithm is not applicable for non-rectangular clipping window. SO we introduced _________ equation of line segment to find the intersection points of a line with the clipping edge. a) Cohen Sutherland, parametric b) Cyrus Beck, coordinate c) Cohen Sutherland, trigonometric d) Cyrus beck, elliptical
79) Transaction is a process of changing _________ of object & scaling is process of changing __________ a) position, shape b) position, direction c) size, shape d) axis, shape
80) Consider line (5,5) to (13,9) Use Bresenhen & give the value of full term : a) ∆x=8, ∆y=4, e=0, m=2 b) ∆x=7, ∆y=3, e=7, m=3 c) ∆x=6, ∆y=4, e=1, m=4 d) None of these
