Tribhuvan University
Bachelor of Information Technology
Semester 5 · TU Board 2079
Course Title: Computer Graphics (BIT304)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
Group A
Attempt any Two questions.(2 × 10 = 20)
- 1.10
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).
- 2.10
Draw the block diagram of vector and raster graphics display architecture and write the advantages and disadvantage of both display architecture.
- 3.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).
Group B
Attempt any Eight questions(8 × 5 = 40)
- 4.5
Explain how can line method detects the visible surface with example.
- 5.5
Differentiate Phong Shading with Gouraud Shading method.
- 6.5
Explain Cohen-Sutherland line clipping Algorithm.
Answer comingAlso asked in 2080
- 7.5
What is Beizer curve? Describe its properties.
- 8.5
Discuss the use of computer graphics in different areas.
- 9.5
Describe polygon, vertex and edge table of a polygon.
- 10.5
What is boundary representation technique? Explain.
- 11.5
Explain the Phong illumination model for specular reflection.
- 12.5
Write short notes on: a. Shearing and Scaling b. Line Clipping
— The End —