Scribd
Upload
1K views

Course Title: Computer Graphics Marks: 70 Time: 3 Hrs. Instructions

This document outlines the instructions and questions for a 3 hour computer graphics exam worth 70 marks. It covers topics such as pixel and resolution, computer graphics applications, graphics functions, scan conversion, polygon filling, lines, 2D scaling, vector/raster scan displays, polygon filling algorithms, 2D transformations, line clipping, character generation, perspective projection, window to viewport transformation, Hilbert's curve, raster scan display, DDA line algorithm, rotation matrices, arc generation with DDA, Cohen-Sutherland line clipping, Bresenham's line algorithm, triangle transformations, Hilbert's curve program, Bresenham's circle parameter, shearing transformation, and boundary fill algorithm. Students must answer questions covering these topics.

Uploaded by

Neeraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1K views

Course Title: Computer Graphics Marks: 70 Time: 3 Hrs. Instructions

This document outlines the instructions and questions for a 3 hour computer graphics exam worth 70 marks. It covers topics such as pixel and resolution, computer graphics applications, graphics functions, scan conversion, polygon filling, lines, 2D scaling, vector/raster scan displays, polygon filling algorithms, 2D transformations, line clipping, character generation, perspective projection, window to viewport transformation, Hilbert's curve, raster scan display, DDA line algorithm, rotation matrices, arc generation with DDA, Cohen-Sutherland line clipping, Bresenham's line algorithm, triangle transformations, Hilbert's curve program, Bresenham's circle parameter, shearing transformation, and boundary fill algorithm. Students must answer questions covering these topics.

Uploaded by

Neeraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Title : Computer Graphics

Marks : 70 Time: 3 Hrs.

Instructions:
(1) All questions are compulsory.
(2) Illustrate your answers with neat sketches wherever necessary.
(3) Figures to the right indicate full marks.
(4) Assume suitable data if necessary.
(5) Preferably, write the answers in sequential order.

Attempt any FIVE of the following. 10 Marks


a) Define pixel and resolution.
b) List any four areas of applications of computer graphics.
c) State any two graphics functions with its syntax.
d) Define scan conversion.
e) List two polygon filling methods.
f) State equation of line in slope intercepts form.
g) Give the matrix representation for 2D Scaling.

Attempt any THREE of the following. 12 Marks


a) Differentiate between Vector scan display and Raster scan display.
b) Write procedure to fill polygon using Flood fill.
c) Explain 2D transformations with its basic types.
d) Write algorithm to clip line using Cohen Sutherland line clipping algorithm.

Attempt any THREE of the following. 12 Marks


a) Explain following character generation methods with example.
i) Stroke method ii) Starburst method
b) Explain perspective projection with its types.
c) Explain Window to Viewport transformation.
d) Explain Hilbert’s curve with diagram.
Attempt any THREE of the following. 12 Marks
a) Explain with diagram raster scan display technique.
b) Consider the line from (0, 0) to (4, 6).Use DDA algorithm to rasterize this line.
c) A point (4, 3) is rotated counterclockwise by an angle of 450. Find the rotation
matrix and the resultant point.
d) Explain Arc generation technique using DDA algorithm.
e) Use the Cohen Sutherland algorithm to clip two lines P1(40,15)-P2(75,45) and
P3(70,20)-P4(100,10) against a window A(50,10),B(80,10),C(80,40),D(50,40).

Attempt any TWO of the following. 12 Marks


a) Consider the line from (5, 5) to (13, 9).Use the Bresenham’s algorithm to
rasterize this line.
b) Find a transformation of triangle A(1,0),B(0,1),C(1,1) by
i. Rotating 450about the origin and then translating one unit in x and y direction.
ii. Translating one unit in x and y direction and then rotating 450about the origin.
c) Write a program in C to generate Hilbert’s curve.

Attempt any TWO of the following. 12 Marks


a) Derive the expression for decision parameter used in Bresenham’s Circle algorithm.
b) Apply the Shearing transformation to square with A(0,0),B(1,0),C(1,1) and D(0,1)
as given below :
i. Shear parameter value of 0.5 relative to the line Yref= -1;
ii. Shear parameter value of 0.5 relative to the line Xref= -1;
c) Write a program in C for boundary fill algorithm.

You might also like