BIT Computer Graphics

bitsemester 5

This course covers the basic concepts of Computer Graphics, various algorithms for basic graphics primitives, 2-D geometric transformations on graphical objects, various Clipping algorithms on graphical objects, 3-D geometric transformations, curve representation techniques and projections methods, object surface modeling, visible surface detection, application of illumination and rendering algorithms, virtual reality and animation technique along with basic concept of OpenGL.

Chapter Wise Notes Question Banks Syllabus Chapter Wise Questions Viva Practical

Institute of Science and Technology

2079

Bachelor in Information Technology

Computer Graphics

BIT304

Full Marks: 60

Pass Marks: 24

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"

Long Answer Questions Attempt any TWO questions.

[2 × 10 = 20]

List the major differences between DDA and Bresenham’s algorithm. Illustrate the Bresenham’s algorithm to the line with end points\((10, 6)\) and \((12, 1)\).

[3 + 7]

Draw the block diagram of vector and raster graphics display architecture and write the advantages and disadvantage of both display architecture.

[10]

How decision parameter can be used to draw circle? Calculate the points to draw a circle having radius 5 and center as \((10, 5)\).

[6 + 4]

"Section B"

Short Answer Questions Attempt any EIGHT questions.

[8 × 5 = 40]

Explain how can line method detects the visible surface with example.

[5]

Differentiate Phong Shading with Gouraud Shading method.

[5]