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.
- Each question carries 20 marks.
Questions
Section A
- Q1 a). Explain the two techniques for producing color displays with a CRT [10 marks]
- Q1 b). Explain following:- i. Aspect ratio ii. Bitmap iii. Aliasing iv. Dithering v. Refresh rate [10 marks]
- Q2 a). Discuss and explain Bresenhams's line drawing algo and its advantages over DDA line drawing algo. [10 marks]
- Q2 b). Digitize a line from (10, 12) to (15,15) on a raster screen using Bresenham's straight line algorithm. [10 marks]
- Q3 a). Find out the coordinates of a figure bounded by (0,0),(1,5),(6,3),(-3,-4) when reflected along the line whose equation is y=2x+4 and sheared by 2 units in x direction and 2 units in y direction. [15 marks]
- Q3 b). In a 512 *512 raster on a monochrome display with an average access rate of 200 nanoseconds per pixel, what is the refresh rate [5 marks]
- Q4 a). Find the transformation which aligns vector V= I + J + K with vector N = 2I - J - K. [15 marks]
- Q4 b). Magnify the unit cube by twice. [5 marks]
Section B
- Q5 a). Differentiate between window & view port. Write the various steps for window to viewport coordinate transformation. Also derive 2D viewing transformation. [10 marks]
- Q5 b). Write pseudo code procedure to implement the flood fill algorithm using the 4-connected definition for region pixels. [10 marks]
- Q6 a). Describe Sutherland Hodgeman polygon clipping algorithm. What is its limitation? [10 marks]
- Q6 b). Use the Cohen Sutherland outcode algorithm to clip two lines P1(40,15) to P2(75,45) and P3(70,20) to P4(100, 10) against a window A(50,10), B(80,10), C(80,40), D(50,40). [10 marks]
- Q7 a). What is vanishing point. Discuss the one, two and three principle vanishing point generation. [10 marks]
- Q7 b). Explain Phong shading model .Give its merits and demerits. [10 marks]
- Q8. Derive the transformation for cavalier projection with Θ=45° and cabinet projection with Θ=30°.Draw the projection of the unit cube for each transformation. [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