Q1: Rotating a point requires:
(A) The coordinates for the point
(B) The rotation angles
(C) Both of above – Page #175
(D) None of above
Answer: (C) Both of above
Q2: In Trimetric, the direction of projection makes unequal angle with the three principal axes
(A) True – Page #192
(B) False
Answer: (A) True
Q3: We can draw the circle using
(A) Pentane
(B) Hexanes
(C) Trident
(D) Octants – Page #61
Answer: (D) Octants
Q4: _______ transformation produces shape distortions as if objects were composed of layers sliding over each other
(A) Rotation
(B) Translation
(C) Reflection
(D) Shear – Page #124
Answer: (D) Shear
Q5: _______ is the process of describing an object or scene so that we can construct an image of it
(A) Rendering
(B) Modeling – Page #159
(C) Meshing
(D) None of above
Answer: (B) Modeling
Q6: Boundary Filling Algorithm can work for complex polygons
(A) True
(B) False – Not sure
Answer: (A) True
Q7: Concave polygons are superset of ______ polygons, having fewer restrictions than ______ polygons
(A) Hybrid, Complex
(B) Concave, Complex
(C) Convex, Convex – Page #79
(D) Complex, Complex
Answer: (C) Convex, Convex
Q9: A unit vector has zero magnitude
(A) True
(B) False – Page #169
Answer: (B) False
Q10: Each hyperbola consists of two ______
(A) Vertices
(B) Nodes
(C) Branches – Page #70
(D) Points
Answer: (C) Branches
Q1: Parity is a concept used to determine which ______ lie within a polygon
(A) Edge
(B) Vertices
(C) Pixels – Page #80
(D) Points
Answer: (C) Pixels
Q2: Various curve functions are useful in ______
(A) Object modeling
(B) Graphics applications
(C) Animation path specifications
(D) All of the given – Page #69
Answer: (D) All of the given
Q3: Polygons that may self-intersect are
(A) Complex – Page #79
(B) Hybrid
(C) Convex
(D) Convex and Hybrid
Answer: (A) Complex
Q4: Concave polygons are superset of ______ polygons, fewer restrictions than ______ polygons
(A) Hybrid, Complex
(B) Concave, Complex
(C) Convex, Convex – Page #79
(D) Complex, Complex
Answer: (C) Convex, Convex
Q5: Number of basic types of polygon
(A) 2
(B) 3 – Page #81
(C) 4
(D) 5
Answer: (B) 3
Q5 (duplicate): Boundary/Flood filling algorithms compared to scan line filling
(A) Better – Not sure
(B) Worse
(C) Almost same
(D) Good
Answer: (B) Worse
Q5 (another): Draw eight points corresponding to (x, y) in ______ drawing algorithm
(A) Sutherland
(B) Mid Clipping
(C) Midpoint Circle – Page #61
(D) Sutherland Clipping
Answer: (C) Midpoint Circle
Q6: The horizontal refresh ______
(A) Is no longer used in any system
(B) Distracting / eye fatigue
(C) Fools eye into thinking refresh rate faster
Answer: (C) Fools the eye into thinking refresh rate is faster
Q7: Computer graphics helpful in producing graphical representations for scientific visualization
(A) True – Page #9
(B) False
Answer: (A) True
Q8: Video text memory, ______ used to display a character
(A) 2 bytes – Page #43
(B) 4 bytes
(C) 8 bytes
(D) 16 bytes
Answer: (A) 2 bytes
Q3: Twice the radius of a circle is called
(A) Area
(B) Diameter – Page #59
(C) 2*Pi Radian
(D) Circumference
Answer: (B) Diameter
Q5: Both Boundary Filling and Flood filling are non-recursive
(A) True
(B) False
Answer: (B) False
Q7: We can take transpose of any matrix
(A) True
(B) False
Answer: (A) True
Q9: Set of points equidistant from origin
(A) Line
(B) Parabola
(C) Circle
(D) Ellipse
Answer: (C) Circle
Q1: Locations can be translated from one coordinate system to another
(A) True – Page #158
(B) False
Answer: (A) True
Q2: Vectors can be multiplied as
(A) Dot product
(B) Cross product
(C) Both of above
(D) None
Answer: (C) Both of above
Q3: Process of moving points in space
(A) Rendering
(B) Modeling
(C) Meshing
(D) Transformation – Page #173
Answer: (D) Transformation
Q4: Sutherland-Hodgeman algorithm clips any polygon against concave clip polygon
(A) True
(B) False – Page #243
Answer: (B) False
Q5: Trivial acceptance/reject test, Bit 4 represents
(A) X < Xmin – Page #138
(B) X > Xmax
(C) Y < Ymin
(D) Y > Ymax
Answer: (A) X < Xmin
Q6: Trivial acceptance/reject test, Bit 1 represents
(A) X < Xmin – Page #138
(B) X > Xmax
(C) Y < Ymin
(D) Y > Ymax
Answer: (A) X < Xmin
Q7: Trivial acceptance/reject test, Bit 2 represents
(A) X < Xmin
(B) X > Xmax
(C) Y < Ymin – Page #138
(D) Y > Ymax
Answer: (C) Y < Ymin
Q8: Trivial acceptance/reject test, Bit 3 represents
(A) X < Xmin
(B) X > Xmax – Page #138
(C) Y < Ymin
(D) Y > Ymax
Answer: (B) X > Xmax
Q9: Subdivision of an entity into non-overlapping primitives
(A) Rendering
(B) Modeling
(C) Meshing – Page #162
(D) None
Answer: (C) Meshing
Q10: Shortcoming of Sutherland-Hodgeman: concave polygons may display with extensor lines
(A) True – Page #150
(B) False
Answer: (A) True
Q11: A * B = |A| * |B| * cos(?)
(A) Cross Product
(B) Dot Product – Page #171
Answer: (B) Dot Product
Q12: Move a point or set of points linearly in space
(A) Transformation
(B) Translation – Page #173
(C) Scaling
(D) None
Answer: (B) Translation
Q13: Save a line with both endpoints inside all clipping boundaries
(A) Trivial Accept – Page #137
(B) Total inside
(C) Trivial Reject
(D) Total outside
Answer: (A) Trivial Accept
Q14: Uses divide and conquer strategy
(A) Sutherland-Hodgeman – Page #244
(B) Pipeline clipping
(C) Weiler-Atherton
(D) None
Answer: (A) Sutherland-Hodgeman
Q1: Each number in a matrix is called an ________
(A) Element – Page #101
(B) Variable
(C) Value
(D) Component
Answer: (A) Element