Explore topic-wise InterviewSolutions in .

This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.

101.

If the boundary is specified in a single color, and if the algorithm proceeds pixel by pixel until the boundary color is encountered is called(a) Scan-line fill algorithm(b) Boundary-fill algorithm(c) Flood-fill algorithm(d) Parallel curve algorithmI got this question by my college professor while I was bunking the class.This intriguing question originated from Line Filling Algorithms in portion Graphics Primitives of Computer Graphics

Answer»

Right choice is (b) Boundary-fill ALGORITHM

For EXPLANATION I would SAY: This algorithm proceeds outward PIXEL by pixel until the boundary color is encountered.
Discussion
102.

_______ is defined as set of points such that the sum of the distances is same for all points.(a) Ellipses(b) Lines(c) Circles(d) Only aI had been asked this question in my homework.The doubt is from Line Filling Algorithms in portion Graphics Primitives of Computer Graphics

Answer» RIGHT option is (d) Only a

For explanation: Ellipses is DEFINED as SET of points.
Discussion
103.

To apply the midpoint method, we define(a) ?circle(x, y)= x ^2+ y ^2-? r?^2(b) ?circle(x, y)= x+ y ^2-? r?^2(c) ?circle(x, y)= x ^2– y ^2-? r?^2(d) ?circle(x, y)= x^2+ y ^2-? z?^2This question was addressed to me in an interview for job.My question comes from Line Filling Algorithms topic in chapter Graphics Primitives of Computer Graphics

Answer»

Correct OPTION is (a) ?circle(x, y)= x ^2+ y ^2-? r?^2

To ELABORATE: None.
Discussion
104.

Coordinate references in the polyline function are stated as(a) Relative coordinate values(b) Absolute coordinate values(c) Current position(d) Real coordinate valuesI have been asked this question during an interview for a job.My enquiry is from Line Filling Algorithms in portion Graphics Primitives of Computer Graphics

Answer»

Correct choice is (b) ABSOLUTE coordinate VALUES

To EXPLAIN: Coordinate references in the polyline function are stated as absolute coordinate values.
Discussion
105.

Which is the best line algorithm to balance the processing load among the processers?(a) Parallel line algorithm(b) DDA line algorithm(c) Bresenham’s line algorithm(d) Position Bresenham’s line algorithmThis question was addressed to me in a job interview.My enquiry is from Line Filling Algorithms topic in chapter Graphics Primitives of Computer Graphics

Answer»

The correct OPTION is (a) Parallel line algorithm

The explanation: If there are ‘n’ processes then this algorithm divides it into NUMBER of partitions and GENERATES line segments.
Discussion
106.

The algorithm which uses multiple processors to calculatepixel positions is(a) Midpoint algorithm(b) Parallel line algorithm(c) Bresenham’s line algorithm(d) All of the mentionedThis question was posed to me during an interview for a job.My question is from Line Filling Algorithms topic in section Graphics Primitives of Computer Graphics

Answer»

Right answer is (b) PARALLEL line ALGORITHM

The explanation: In Parallel line algorithm each PROCESSORS calculates PIXEL positions.
Discussion
107.

An accurate and efficient raster line-generating algorithm is(a) DDA algorithm(b) Mid-point algorithm(c) Parallel line algorithm(d) Bresenham’s line algorithmI have been asked this question in a job interview.This key question is from Line Filling Algorithms in portion Graphics Primitives of Computer Graphics

Answer»

Correct OPTION is (d) Bresenham’s LINE ALGORITHM

For explanation I would say: Bresenham’s line algorithm is a very EFFICIENT and accurate algorithm.
Discussion
108.

In Bresenham’s line algorithm, if thedistances d1 < d2 then decision parameter Pk is______(a) Positive(b) Equal(c) Negative(d) Option a or cI got this question in semester exam.My query is from Line Filling Algorithms in chapter Graphics Primitives of Computer Graphics

Answer»

Right option is (C) Negative

Easiest EXPLANATION: If d1 < d2 then the decision VARIABLE is always negative.
Discussion
109.

The disadvantage of lineDDA is(a) Time consuming(b) Faster(c) Neither a nor b(d) None of the mentionedI got this question during a job interview.I want to ask this question from Line Filling Algorithms in chapter Graphics Primitives of Computer Graphics

Answer»

Correct choice is (a) Time consuming

To explain I WOULD SAY: The DDA ALGORITHM TAKES more time than other algorithm.
Discussion
110.

Which algorithm is a faster method for calculating pixel positions?(a) Bresenham’s line algorithm(b) Parallel line algorithm(c) Mid-point algorithm(d) DDA line algorithmThis question was posed to me in quiz.Origin of the question is Line Filling Algorithms topic in chapter Graphics Primitives of Computer Graphics

Answer»

Correct choice is (d) DDA LINE algorithm

To EXPLAIN I would say: The DDA is a faster method for calculating pixel POSITIONS.
Discussion
111.

Expansion ofline DDA algorithm is(a) Digital difference analyzer(b) Direct differential analyzer(c) Digitaldifferential analyzer(d) Data differential analyzerI had been asked this question in examination.My question is from Line Filling Algorithms in chapter Graphics Primitives of Computer Graphics

Answer» RIGHT option is (C) Digitaldifferential ANALYZER

To explain I would say: DDA stands for digital DIFFERENTIAL analyzer.
Discussion
112.

On raster system, lines are plotted with(a) Lines(b) Dots(c) Pixels(d) Noneof the mentionedI have been asked this question in an internship interview.The origin of the question is Line Filling Algorithms in section Graphics Primitives of Computer Graphics

Answer» CORRECT answer is (c) PIXELS

Easiest explanation: USING pixels LINES can be PLOTTED.
Discussion
113.

For lines with slope magnitude |m|

Answer»

Right ANSWER is (b) A SET proportional to a small horizontal deflection voltage

For explanation I would SAY: ?x can be a set proportional to a small horizontal deflection voltage only if slope magnitude |m| < 1.
Discussion