Skip to content

Computer Graphics

CSE · Quiz · Spring 26

Paper 4 of 5By Abir Mia -231 (3)Switch

Paper 4 of 5

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Faculty of Science & Information Technology Department of Computer Science & Engineering 64-K, CT-02, Spring 2026 Course Code: CSE411, Course Title: Computer Graphics Time: 1 Hour | Marks: 15 Answer ALL Questions [Optional] [The figures in the right margin indicate the full marks and corresponding course outcomes. All portions of each question must be answered sequentially.] 1. [Figure: A line segment from A(3, -2) to B(7, 0) partially intersecting a rectangular clipping window where xmin = -2, xmax = 5, ymin = -1, ymax = 3, and the window contains a horizontal color gradient from black on the left to white on the right.] Given a clipping window with xmin = -2, xmax = 5, ymin = -1, ymax = 3 and a line segment joining A(3, -2) and B(7, 0) a. Determine the category of the line. If the line is a clipping candidate, perform the clipping with proper mathematical steps. | [3] | CO2 b. Explain the technology used to generate the color in the clipping window shown above. | [2] | CO1 2. [Figure: A polygon with vertices V1, V2, V3, V4, V5, V6 overlapping with a rectangular clipping window ABCD.] a. Perform clipping of the above polygon using the Sutherland-Hodgeman algorithm. | [4] | CO2 b. Perform clipping of the same polygon using the Weiler-Atherton algorithm. | [4] | CO2 c. State which algorithm is more suitable in this case and justify your answer. | [2] | CO3