The document outlines a computer graphics question paper for a course from April 2015, consisting of a structured set of questions that cover various topics in computer graphics. It includes mandatory and optional questions related to computer graphics applications, transformations, clipping algorithms, curves, and shading techniques. Each question carries specific marks, emphasizing practical applications and theoretical knowledge in the subject.

1. C o m p u t e r G r a p h i c s
Q u e s t i o n P a p e r ( A p r i l – 2 0 1 5 ) [ R e v i s e d C o u r s e ]
1 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Time: 3 Hours Total Marks: 100
N.B.: (1) Questions No. 1 is Compulsory.
(2) All question carry equal marks.
Q.1 Attempt Both The Question: (10 Marks)
(A) Write various applications of Computer Graphics. (5)
(B) Explain Computer Graphics Input Devices. (5)
Q.2 Attempt Any Three From The Following: (15 Marks)
(A) Explain the basic 3-D Transformations. (5)
(B) Explain: Window to Viewport Transformation. (5)
(C) Translate ∆𝐴𝐵𝐶 (𝐴(3,1), 𝐵(5,1), 𝐶(4,5)) with 1.5 units in x direction. (5)
(D) Rotate ∆𝐴𝐵𝐶 (𝐴(1,1), 𝐵(4,2), 𝐶(3,3)) in ant clockwise where 𝜃 = 90 𝑑𝑒𝑔𝑟𝑒𝑒. (5)
Q.3 Attempt Any Three From The Following: (15 Marks)
(A) Explain Line Clipping and Polygon Clipping. (5)
(B) Explain B-Spline Curve. (5)
(C) What do you mean by Parallel Projection? (5)
(D) Explain Curve Continuity. (5)
Q.4 Attempt Any Three From The Following: (15 Marks)
(A) Write down Bresenham’s Line Drawing Algorithm. (5)
(B) Explain: Cohen-Sutherland Line Clipping Algorithm. (5)
(C) Explain Fractals and its applications. (5)
(D) Explain the Convex and Concave Polygon. (5)
Q.5 Attempt Any Three From The Following: (15 Marks)
(A) Define Bezier Curve and state the property of it? (5)
(B) Explain basic concept of Painter Algorithm? (5)
(C) Write a short note on Inside/Outside Test? (5)
(D) Write down Algorithm for Midpoint Circle? (5)

2. C o m p u t e r G r a p h i c s
Q u e s t i o n P a p e r ( A p r i l – 2 0 1 5 ) [ R e v i s e d C o u r s e ]
2 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Q.6 Attempt Any Three From The Following: (15 Marks)
(A) What are the Namable and Unnamable Curve? (5)
(B) Write the procedure for Seed Fill Algorithm? (5)
(C) What is Windowing and Clipping? (5)
(D) What is mean by Device Co-Ordinate? (5)
Q.7 Attempt Any Three From The Following: (15 Marks)
(A) Write a short note on Polygon Mesh Shading? (5)
(B) What is Shading? Explain? (5)
(C) Write a short note on Ray Casting? (5)
(D) Write a short note on Morphing & its advantages? (5)