Tribhuvan University

Institute of Science and Technology


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.


What is a Digital Differential Analyzer (DDA)? How can you draw the line using this algorithm? Trace the points on the line path between A (1,3) and B (6,7) using Bresenham’s line drawing algorithm.


Differentiate between parallel and perspective projection with suitable diagram. Illustrate the window to viewport transformation with example.


Why Liang Barsky Line Clipping Algorithm is efficient than Cohen Sutherland Algorithm? Explain the clipping procedure of Liang Barsky algorithm with suitable example.

Section B

Attempt any eight questions


Write down algorithm steps of mid-point ellipse drawing algorithm.


Explain the importance of filling algorithms in graphics applications. Differentiate between boundary and flood fill algorithm with algorithm.


What is virtual reality? Explain some form of virtual reality.


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


Explain polygon surface representation using Polygon table and polygon meshes.


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


What do you understand by solid modeling? Explain binary space partition method.


How a realistic image can be generated in computer graphics? Explain fast phong shading.


Write short notes on

a. OpenGL

b. Flynn’s Classification