Tribhuvan University

Institute of Science and Technology

2079

Bachelor Level / third-semester / Science

Computer Science and Information Technology( CSC214 )

Computer Graphics

Full Marks: 60 + 20 + 20

Pass Marks: 24 + 8 + 8

Time: 3 Hours

Candidates are required to give their answers in their own words as far as practicable.

The figures in the margin indicate full marks.

Section A

Attempt any two questions.

1

Explain the working details of Mid-point circle algorithm? Trace the points along the line path having two end points (6,9) and (2,3) using Bresenham’s line drawing algorithm.

2

Differentiate between object space and image space methods of hidden surface removal. Describe the Z-buffer hidden surface removal algorithm.

3

Write the algorithm for Cohen-Sutherland Line clipping. Clip the polygon A(100,150), B(200,250) and C(300,200) with the clipping window defined by the coordinates (100,300), (300,300) and (200,100) using Sutherland Hodgeman Polygon Clipping algorithm.

Section B

Attempt any eight questions.

4

Reflect a line segment having endpoints (9,3) and (12,10) about a line Y=7. Draw initial and final result graph as well.

5

Differentiate between raster and vector graphics method.

6

Explain about parametric curve. Describe the properties of Bezier curve.

7

What are blobby objects? How it is represented? Explain the wireframe representation of 3D objects.

8

Calculate the total memory required to store a 8 minute video in a SVGA system with 24 bit true color and 25 fps.

9

Find the composite transformation matrix for reflection about a line y=mx+c.

10

What is polygon table? Explain the use of this method in 3D object representation.

11

Define the term ‘rendering’ in computer graphics. Explain Phong Shading Method with its advantage and disadvantage.

12

Write short notes on (any two)

a. BSP Tree

b. Virtual Reality

c. Intensity Attenuation