Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2080
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
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.
- 2.10
Differentiate between parallel and perspective projection with suitable diagram. Illustrate the window to viewport transformation with example.
- 3.10
Why Liang Barsky Line Clipping Algorithm is efficient than Cohen Sutherland Algorithm? Explain the clipping procedure of Liang Barsky algorithm with suitable example.
Group B
Attempt any eight questions(8 × 5 = 40)
- 4.5
Write down algorithm steps of mid-point ellipse drawing algorithm.
Answer comingAlso asked in 2075
- 5.5
Explain the importance of filling algorithms in graphics applications. Differentiate between boundary and flood fill algorithm with algorithm.
- 6.5
What is virtual reality? Explain some form of virtual reality.
- 7.5
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.
Answer comingAlso asked in 2079
- 8.5
Explain polygon surface representation using Polygon table and polygon meshes.
- 9.5
Calculate the total memory required to store a 5 minute video in SVGA system with 24 bit true color and 30 fps.
Answer comingAlso asked in 2079
- 10.5
What do you understand by solid modeling? Explain binary space partition method.
- 11.5
How a realistic image can be generated in computer graphics? Explain fast phong shading.
- 12.5
Write short notes on
a) OpenGL
b) Flynn's Classification
— The End —