Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2079
Course Title: Computer Graphics (CSC214)
Full Marks: 60Pass Marks: 24Time: 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.
Group A
Attempt any two questions.(2 × 10 = 20)
- 1.10
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.10
Differentiate between object space and image space methods of hidden surface removal. Describe the Z-buffer hidden surface removal algorithm.
- 3.10
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.
Group B
Attempt any eight questions.(8 × 5 = 40)
- 4.5
Reflect a line segment having endpoints (9,3) and (12,10) about a line Y=7. Draw initial and final result graph as well.
Answer comingAlso asked in 2080
- 5.5
Differentiate between raster and vector graphics method.
Answer comingAlso asked in 2077
- 6.5
Explain about parametric curve. Describe the properties of Bezier curve.
- 7.5
What are blobby objects? How it is represented? Explain the wireframe representation of 3D objects.
- 8.5
Calculate the total memory required to store a 8 minute video in a SVGA system with 24 bit true color and 25 fps.
Answer comingAlso asked in 2080
- 9.5
Find the composite transformation matrix for reflection about a line y=mx+c.
- 10.5
What is polygon table? Explain the use of this method in 3D object representation.
- 11.5
Define the term 'rendering' in computer graphics. Explain Phong Shading Method with its advantage and disadvantage.
- 12.5
Write short notes on (any two)
a) BSP Tree
b) Virtual Reality
c) Intensity Attenuation
— The End —