Professional Documents
Culture Documents
Hyderabad Campus
First Semester 2014-2015
Comprehensive Exam PART-A
Course No: IS F311 Course Title: Computer Graphics
Type: Closed Total Time: 3 hrs Total Marks: 30
Date: 2/12/14
ID: Name:
1. The normal of a triangle P = (1, 0, 0), Q = (1, 1, 1) and R = (2, −1, 3) given in this order
(PQR) is . [1]
2. The main difference between Phong shading model and Gouraud shading model in terms of
computation is
. [1]
3. reflections are constant over each surface in a scene,
independent of the viewing direction. [1]
4. In Warnock’s area subdivision algorithm, if there is a surrounding polygon of the area of inter-
est, recursive area subdivision may be required if
.[1]
5. Amongst the three paradigms of HSR algorithms, namely Object precision, Image precision,
and List priority based algorithm, BSP tree belongs to the paradigm of
. [ 12 ]
6. Consider a BSP tree where left subtree denotes inside faces and right subtree denotes outside
faces. Given an eye position, the drawing algorithm using BSP tree will draw recursively the
subtree first, if the eye is on inside of a node face F .[1]
7. The A-buffer algorithm was developed by . [ 12 ]
8. The genus of a single component solid model with 24 vertices, 36 edges, 15 faces, and 3 holes
in the faces is . [1]
9. Consider polyhedra (genus zero) with every face having h edges, k edges emanating from
each vertex and each edge sharing exactly 2 faces. Then the relationship between E, V , and
F is aF = E = bV where a = , and b = .[2]
10. Consider a Bezier curve parameterized by t, designed from the control points P0 (5, 0),
P1 (3, 8), P2 (8, 7), P3 (5, 2), and P4 (12, 5). The derivative of the curve at t = 0 is ( , )
and at t = 1 is ( , ).[2]
1
11. In a non-uniform nonrational B-spline curve with 7 control points and degree of the basis
function being 2, the number of curve segments it will have is . [1]
12. In a Hermite surface whose x component is given as x(s, t) = S.M.Gx .M T .T T , the last row
of Gx matrix is , , , . [2]
13. and are two common kinds of oblique
parallel projections. [1]
14. Given the projection plane at z = 0 and the center of projection at distance z = −d, the
perspective projection matrix is given by the matrix: [2]
1 0 0 0
0 1 0 0
T = 0 0
0 0
15. If two bits are zeros and two bits are one in a outcode of a subregion in Cohen-Sutherland
line clipping algorithm the sub region is [1]
a) corner region (b) middle region
(c) central region (d) none of these.
16. Consider a parametric line P (t) between the points P1 and P2 . Let ni be the inner normal to
ith clip window edge. Let fi is any other point on this ith clip window edge and P (t) is any
point on the paramteric line. Then ni · [P (t) − fi ] is for a point interior
to the region.[1]
17. In Sutherland Hodgman polygon clipping algorithm if first input vertex of an edge is outside,
and second is inside the clip window edge, then output the
.[1]
π
18. After rotating the point P (5, 2) about the point A(4, 1) by an angle 2
the new coordinate is
( , ).[2]
19. Scaling is said to be if Sx = Sy = Sz otherwise it is called .[1]
20. The normalization transformation that maps a window whose lower left corner is at (1, 1)
and upper right corner is at (3, 5) onto a viewport that is the entire normalized screen [lower
left corner is at (0, 0) and upper right corner is at (1, 1) ] is given by matrix: [2]
T =
END OF PART-A
SUBMIT BEFORE COLLECTING PART-B