Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2081
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
Derive the expression for Bresenham's Line Drawing algorithm. Trace the points in the line path with starting point (6, 12) and end point (10, 5) using Bresenham's line drawing algorithm.
Answer comingAlso asked in 2075
- 2.10
What is the major drawback of Sutherland Hodgeman Polygon Clipping Algorithm? Illustrate with a suitable example. Explain B-spline curve and its properties.
- 3.10
Explain RGB color model. Differentiate between virtual reality and augmented reality with examples. Explain Binary Space Partitioning (BSP) trees with a suitable example.
Group B
Attempt any EIGHT questions.(8 × 5 = 40)
- 4.5
What do you mean by the refresh rate of a display device? Explain vector scan display with a suitable diagram.
- 5.5
Plot the first octant of a circle centered at (-2, -2), having a radius of 5 units using the mid-point circle algorithm.
Answer comingAlso asked in 2078
- 6.5
Given a triangle with vertices A(2,3), B(5,5), C(4,3) by rotating 90 degrees about the origin and then translating two units in each direction. Use the homogeneous transformation matrix to find the new vertices of the triangle.
- 7.5
Construct the Bezier curve with the following polygon vertices (control points): A(1,1), B(2,3), C(4,3), and D(6,4).
- 8.5
Compare the Scanline Method for Visible Surface Detection with the Depth Buffer Method.
- 9.5
Explain any two functions in OpenGL. Write the basic commands to draw the pixel and polygon in OpenGL.
Answer comingAlso asked in 2075
- 10.5
Differentiate between parallel projection and perspective projections.
Answer comingAlso asked in 2077
- 11.5
Describe any two basic illumination models.
- 12.5
Write short notes on:
a) Sweep Representation
b) Intensity Attenuation
— The End —