University of Delhi 2009-2nd Sem M.C.A COMPUTER GRAPHICS - Question Paper
Download the papers from Attachments.
This question paper contains 2 printed pages.
Maximum Marks 50Time 2 hours
6127
Your Roll ,Vo ....
MCA / II Sem.
Paper MCA - 203 - Computer Graphics (Admissions of 2009 and onwards)
(Write your Roll No on the top immediately on receipt oj thu question paper}
Attempt all questions.
Parts of a question must be answered together.
1 Describe NICHOL - LEE - NiCHOL algorithm. 06
2 Write the steps for clapping the following concave polygon using Wei ler - Atherton algorithm 06
Starting point
\
3 Write the steps for filling a polygon using scan line seed fill algorithm 05
4 What do >ou mean by parametric and geometric connectivity Give an example to indicate the difference between them** 03
5 Den ve the General transformation matrix for oblique parallel projection of (x. \ , z) on to a 2 dimensional plane.
Hence give the trims formation matrices for cavalier and cabinet projection 06
%
6 Enumerate the v anous spatial - partitioning representations of valid solids Fxplain only one representation 06
7 Derive the formula for fractal similarity dimension 03
8 Write the Z * Buffer algorithm to detect the variable surfaces 05
9 a) Describe Phong Shading model 04
b) Draw and explain CIE chromaticity diagram 06
100
|
Attachment: |
| Earning: Approval pending. |
