BCA Semester 5 – Computer Graphics and Animation () Questions & Answers | Past TU Exam Papers

Question 1

How can you draw a circle using mid-point circle algorithm? Explain with the algorithm.

Marks: 5

Year: 2020 Final TU

Definition The Mid-Point Circle Algorithm is an efficient raster scan algorithm used in computer graphics to draw a circle by calculating pixel positions using integer arithmetic and decision paramete

Question 2

Explain the working details of DDA line drawing algorithm? Digitize the line with endpoints (2,2) and (10,5) using Bresenham's line drawing algorithm.

Marks: 10

Year: 2020 Final TU

Part A: DDA Line Drawing Algorithm Definition The Digital Differential Analyzer (DDA) algorithm is a scan conversion line drawing algorithm that generates points of a straight line between two endpo

Question 3

Write the difference between object space method and image space method. Explain Z buffer algorithm for visible surface detection.

Marks: 10

Year: 2020 Final TU

Part A: Difference between Object Space Method and Image Space Method | Basis | Object Space Method | Image Space Method | |------|--------------------|-------------------| | Working Space | Works in

Question 4

What do you mean by area filling? Explain boundary fill algorithm.

Marks: 5

Year: 2021 Final TU

Definition: Area Filling Area filling is the process of coloring the interior of a closed 2D region or polygon on a raster display. It is used to distinguish objects and make the graphics more visuall

Question 5

What is symmetric property of circle? Digitize a circle whose center is at origin and radius is 9.

Marks: 5

Year: 2021 Final TU

Definition: Symmetric Property of Circle A circle is a set of points equidistant from a center. The symmetric property states: - A circle is symmetric about its center, meaning: - 8-way symmetry: Po

Question 6

What do you mean by visible surface detection? Explain Z. buffer algorithm for visible surface detection.

Marks: 5

Year: 2021 Final TU

Definition: Visible Surface Detection Visible surface detection (VSD) is a technique used in computer graphics to determine which surfaces or parts of objects are visible to the viewer in a 3D scene a

Question 7

How can you draw line using Bradenham’s line drawing algorithm? Trace it to rasterize the line with end points P(1, 4) and Q(7, 8).

Marks: 10

Year: 2021 Final TU

Bresenham’s Line Drawing Algorithm Definition - Bresenham’s algorithm is an efficient incremental method to rasterize a line between two points. - It uses integer calculations to determine which pi

Question 8

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.

Marks: 5

Year: 2022 Final TU

Decision Parameter in Mid-Point Circle Algorithm - Decision parameter (p) helps determine whether the next pixel in the circle is directly east (E) or southeast (SE). - Formula: \[ p0 = 1 - r

Question 9

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

Marks: 5

Year: 2022 Final TU

DDA Line Drawing Algorithm Definition - Digital Differential Analyzer (DDA) algorithm generates points of a line incrementally between two endpoints. - Steps: 1. Calculate differences: \(\Delta x

Question 10

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

Marks: 5

Year: 2022 Final TU

Definition: Visible Surface Detection - Visible Surface Detection (VSD) is the process of determining which surfaces of objects in a 3D scene are visible to the viewer and which are hidden behind othe

Question 11

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

Marks: 10

Year: 2022 Final TU

1. Object Space and Image Space Methods | Method | Description | Example | |--------|-------------|---------| | Object Space Method | Operates on objects themselves to determine visibility or attribut

Question 12

How DDA works? Digitize the line segment with the endpoints (15, 25) and (21, 35) using DDA line drawing algorithm.

Marks: 5

Year: 2024 Final TU

1. DDA (Digital Differential Analyzer) Algorithm Definition - DDA algorithm is a line generation algorithm that incrementally plots points between two endpoints. - Works by calculating intermediate

Question 13

Explain how scan line algorithm can be used for hidden surface removal.

Marks: 5

Year: 2024 Final TU

1. Scan Line Algorithm for Hidden Surface Removal Definition - Scan line algorithm is an image-space method used for hidden surface detection. - Works line by line (scan line) across the screen and

Question 14

What is visible surface detection? How object space method can be used for visible surface detection? Explain depth-sorting method for visible surface detection in detail.

Marks: 10

Year: 2024 Final TU

1. Visible Surface Detection Definition - Visible surface detection (VSD) is the process of determining which surfaces of objects are visible and which are hidden from the viewer's perspective. - E

Question 15

Explain the scan line algorithm for visible surface detection.

Marks: 5

Year: 2020 Final TU

Definition The Scan Line Algorithm is a visible surface detection technique that determines visible portions of surfaces by processing the image one horizontal scan line at a time and comparing depth