How To Exam?

a knowledge trading engine...


Anna University Chennai 2005 B.E Computer Science COMPUTER GRAPHICS - Question Paper

Monday, 25 February 2013 02:25Web

Code: C-15 Subject: COMPUTER GRAPHICS
Time: three Hours Max. Marks: 100
NOTE: There are 11 ques. in all.
ques. one is compulsory and carries 16 marks. ans to Q. 1. must be written in the space given for it in the ans book supplied and nowhere else.
ans any 3 ques. every from Part I and Part II. every of these ques. carries 14 marks.
Any needed data not explicitly given, may be suitably presumed and said
Q.1 Choose the accurate or best option in the following: (2x8)

a. Interlacing refers to
(A) mixing different shades on the graphics screen.
(B) displaying alternate rows on the screen.
(C) displaying pixels 1 at a time.
(D) refreshing the screen periodically.

b. Identify the accurate statement :
(A) The shape of a picture can be changed under translation.
(B) Parallel lines appear to meet in perspective projection.
(C) Light pens may provide false readings due to background lighting in a room
(D) For away objects look smaller under orthographic projections.

c. Under a parallel projection the point (2, 3, -1) has been viewed at (3, 3, 0). Then the direction of projection should be the vector
(A) i + k. (B) i - k.
(C) i - j. (D) j +k.
e. For the line segment specified by the end points (3, 5) to (-2, -7) the parametric formula for x and y with parameter u will be
(A) ( three + 5u, five - 12u). (B) (3 - 5u, 5-12u).
(C) (3 - 5u,5 + 12u). (D) (3 + 5u, five + 12u).

Where u lies in the interval [0, 1].

f. The maximum number of control points for drawing a B-spline curve is
(A) 3. (B) 4.
(C) 5. (D) could be anything.

g. Choose the accurate statement
(A) The effect of obtaining a bright white spot on a shiny object can be modelled using diffused light.
(B) At every iteration the length of the Koch curve is increased by (4/3) times of the previous curve length.
(C) Phong shading is an intensity interpolation scheme.
(D) Floating horizon technique is used in graphics for area filling.

h. Seed fill algorithms
(A) can not work for a figure with holes.
(B) can not work for curved figures
(C) can work for a figure with holes.
(D) can work only for convex figures.
PART I
ans any 3 ques.. every ques. carries 14 marks.



( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Anna University Chennai 2005 B.E Computer Science COMPUTER GRAPHICS - Question Paper