Computer Graphics 2018 Question Paper — Government College of Enginee…
The 2018 Computer Graphics previous year question paper (Government College of Engineering and Technology, Jammu), with every question and its marks.
- University: Government College of Engineering and Technology, Jammu
- Subject: Computer Graphics
- Course: COMPUTER GRAPHICS
- Branch: Computer Engineering
- Year: 2018
- Paper: end-term
- Duration: 180 minutes
- Total marks: 100
Instructions
- Attempt five questions in all, selecting at least two questions from each section.
Questions
SECTION-A
- QQ1. a) Differentiate between Raster and Random scan display? b) Discuss aliasing effects of scan conversion and ways to minimize those effects. [20 marks]
- QQ2. a) Write DDA algorithm for line generation. Using DDA algorithm rasterize the line from (0, 0) to (-6, -6) b) Explain Bresenhem's Circle algorithm? Determine the various pixel locations that would be plotted in an octant if circle of radius 10 units is centered at (30, 30) using Bresenhem's algorithm? [20 marks]
- QQ3. a) A triangle is defined by the vertices A(1,1), B(5,1) and C(1,5) . Find the reflection of the triangle about a line y=2x+10 , which has been magnified to twice its size while keeping vertex A(1,1) fixed.. b) Perform a 45 degree rotation of a triangle ABC having the vertices at A(0,0) B(10,10) and C(50,20) i. About the origin ii. About an arbitrary point P(-10,-10) [20 marks]
- QQ4. a) Explain the window to viewport coordinate transformation and also derive the transformation matrix for 2D viewing transformation . b) Find 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 device screen. c) Write the boundary fill algorithm for filling a polygon using eight connected approach. [20 marks]
SECTION-B
- QQ5. a) Derive the transformation matrix for mirror reflection about an arbitrary plane specified by normal vector $N = n_1I + n_2J + n_3K$ and a reference point $P_0(x_0, y_0, z_0)$. b) Write short note on 3D shearing transformation [20 marks]
- QQ6. a) Explain the working of Cohen Sutherland algorithm for clipping line. Illustrate by taking suitable example. b) Draw the flowchart illustrating the logic of Sutherland Hodgman polygon clipping Algorithm. What are its limitations? [20 marks]
- QQ7. a) What is parallel projection? Explain the various type of parallel projection. b) Explain the concept of vanishing point in perspective projection. [20 marks]
- QQ8. a) Discuss in detail various shading models. b) Explain different anomalies which occur in perspective view. [20 marks]
Related pages
Other years
- Computer Graphics 2018 question paper — end-term
- Computer Graphics 2018 question paper — end-term
- Computer Graphics 2018 question paper — end-term