22757 22757 22757 22757 22757 22757 22757 22757 22757

22757 Roll No.

22757 22757 22757 22757 22757 Total22757
No. of Pages
22757 : 02 22757

Total No. of Questions : 18

B.Tech.(CSE) (2011 Onwards) (Sem.–5)
22757 22757 22757 COMPUTER
22757 22757 GRAPHICS
22757 22757 22757 22757

Subject Code : BTCS-504

Paper ID : [A2100]
22757 Time : 3 Hrs.
22757 22757 22757 22757 22757 Max. Marks
22757 22757 : 60 22757

INSTRUCTION TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying T WO marks
22757 22757
each. 22757 22757 22757 22757 22757 22757 22757

2. SECTION-B contains FIVE questions carrying FIVE marks each and students
has to attempt any FOUR questions.
3. SECTION-C contains T HREE questions carrying T EN marks each and students
22757 22757 22757
has to attempt any T22757 22757
WO questions. 22757 22757 22757 22757

22757 22757 22757 22757 SECTION-A

22757

o m 22757 22757 22757 22757

.r c
Answer briefly :
22757 22757 22757 22757 22757 22757 22757 22757 22757
1.
e
What are fractals? What is their need?

p m
2.

pa
What is ray tracing? Explain.
o
.r c
22757 22757 22757 22757 22757 22757 22757 22757 22757

br
3. What are vanishing points? Explain.

22757 4.
22757 What is the
22757main difference
22757 between random
22757 and raster
p e
22757scan? 22757 22757 22757

5.
p a
What will be the change in the 3D rotation matrix if the rotation is clock-wise?
22757 22757
6.
22757 22757 22757
Why the homogeneous coordinates are used?
br 22757 22757 22757 22757

7. What is the centre of projection in perspective projection?

22757 22757 22757 22757 22757 22757 22757 22757 22757

8. What are edge and fence filling algorithms?

22757 9.
22757 Explain screen
22757 and world coordinates22757
22757 with example.22757 22757 22757 22757

10. List various region filling algorithms.

22757 22757 22757 22757 22757 22757 22757 22757 22757

22757 1 | M-70537
22757 22757 22757 22757 22757 22757 (S2)-225
22757 22757

22757 22757 22757 22757 22757 22757 22757 22757 22757

22757 22757 22757 22757 22757 22757 22757 22757 22757

SECTION-B
22757 22757 22757 22757 22757 22757 22757 22757 22757

11. Explain ellipse generating algorithm.

22757 12.
22757 Distinguish
22757between random
22757 and raster scan algorithms.
22757 22757 22757 22757 22757

13. Differentiate between Gouraud and Phong shading.

22757 22757 22757 22757 22757 22757 22757 22757 22757
14. What is the difference between boundary fill and flood-fill algorithms? Write 8- boundary
fill algorithm.

22757 22757 22757

15. Explain the steps in the22757 22757
Z-buffer algorithm. 22757 22757 22757 22757

22757 22757 22757 22757 22757 22757 22757 22757 22757

SECTION-C

16. Explain the Gouraud shading technique in detail.

22757 22757

17.
22757 22757 22757

o m 22757

Distinguish between parallel and perspective projections.

22757 22757 22757

22757 22757
18. 22757
Prove that 22757
the multiplication .r c
of three22757 22757
transformation matrices for22757
each of the 22757
following 22757

p e
sequence of operations is commutative :
m
a) Any two

pa
22757successive 22757
translations.
o
.r c
22757 22757 22757 22757 22757 22757 22757

22757 22757 22757

br
b) Any two successive scaling operations.
22757 22757

p e
22757 22757 22757 22757

p a
22757 22757 22757 22757 22757

br 22757 22757 22757 22757

22757 22757 22757 22757 22757 22757 22757 22757 22757

22757 22757 22757 22757 22757 22757 22757 22757 22757

22757 22757 22757 22757 22757 22757 22757 22757 22757

22757 2 | M-70537
22757 22757 22757 22757 22757 22757 (S2)-225
22757 22757

22757 22757 22757 22757 22757 22757 22757 22757 22757