CACS305 Computer Graphics And Animation

Computer Graphics And Animation TU Board 2022 question paper

10 questionsSit this paper (timed)

Tribhuvan University

Bachelor of Computer Application

Semester 5 · TU Board 2022

Course Title: Computer Graphics And Animation (CACS305)

Full Marks: 60Pass Marks: 24Time: 3 hours

Candidates are required to answer the question in their own words as far as possible.

Group B

Attempt any SIX question.(6 × 5 = 30)

  1. 2.

    Define horizontal and vertical retrace of electron beam. Explain architecture of random scan display system.

    5
  2. 3.

    How does decision parameter can be used to draw circle? Calculate the points to draw a circle having radius 5 and center has (10, 5) using mid-point circle algorithm.

    5
  3. 4.

    What do you mean by window to viewport transformation? Explain 2D viewing pipeline.

    5
  4. 5.

    Generate the points between the end points of a line viz. (2, 2) and (9, 6) by using DDA line drawing algorithm.

    5
  5. 6.

    Define visible surface detection. Outline the Z-buffer algorithm along with its advantages and disadvantages.

    5
  6. 7.

    What do you mean by Virtual Reality? Explain the types of Virtual Reality.

    5
  7. 8.

    Define reflection transformation and derive the 2D reflection matrix along x-axis and y-axis in homogeneous coordinate.

    5

Group C

Attempt any TWO questions(2 × 10 = 20)

  1. 9.

    What is the need of homogeneous coordinate system in geometric transformation system? Find the new co-ordinate of rectangle ABCD whose center is at (4, 2) is reduced to half of its size and center will remain same. The co-ordinate of ABCD are A(0, 0), B(0, 4), C(8, 4) and D(8, 0).

    10
  2. 10.

    Explain Sutherland-Hodgeman Polygon Clipping algorithm and trace it to clip a polygon with end points P(10, 30), Q(25, 35), R(35, 50), S(60, 30), T(45, 28), U(40, 15) against a window whose lower left corner is at (15, 25) and upper right corner is at (50, 40).

    10
  3. 11.

    What do you understand by object space and image space method? Explain Flood Filled algorithm with its applicability and concept.

    10

— The End —