Forums
Updated on November 11, 2023

DATA MINING TUTORIAL

64 Posts

NUMBER SYSTEM

274 Posts

POLITICS

120 Posts

JAVASCRIPT INTERVIEW QUESTIONS

59 Posts

Can’t find an answer?

Can’t find an answer?

Ask us to get the answer

Ask a Question
  • This forum has 307 topics.

If we want to recolor an area that is not defined within a single color boundary is known as

(a) Boundary-fill algorithm

(b) Parallel curve algorithm

(c) Flood-fill algorithm

(d) Only b

The question was posed to me by my college professor while I was bunking the class.

This interesting question is from Line Filling Algorithms in section Graphics Primitives of Computer Graphics

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 algorithm

I 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

_______ 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 a

I had been asked this question in my homework.

The doubt is from Line Filling Algorithms in portion Graphics Primitives of Computer Graphics

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?^2

This 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

Coordinate references in the polyline function are stated as

(a) Relative coordinate values

(b) Absolute coordinate values

(c) Current position

(d) Real coordinate values

I 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

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 algorithm

This question was addressed to me in a job interview.

My enquiry is from Line Filling Algorithms topic in chapter Graphics Primitives of Computer Graphics

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 mentioned

This 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

An accurate and efficient raster line-generating algorithm is

(a) DDA algorithm

(b) Mid-point algorithm

(c) Parallel line algorithm

(d) Bresenham’s line algorithm

I have been asked this question in a job interview.

This key question is from Line Filling Algorithms in portion Graphics Primitives of Computer Graphics

In Bresenham’s line algorithm, if thedistances d1 < d2 then decision parameter Pk is______

(a) Positive

(b) Equal

(c) Negative

(d) Option a or c

I got this question in semester exam.

My query is from Line Filling Algorithms in chapter Graphics Primitives of Computer Graphics

The disadvantage of lineDDA is

(a) Time consuming

(b) Faster

(c) Neither a nor b

(d) None of the mentioned

I got this question during a job interview.

I want to ask this question from Line Filling Algorithms in chapter Graphics Primitives of Computer Graphics

Viewing 15 topics - 151 through 165 (of 307 total)

1 2 3 … 10 11 12 … 19 20 21
  • You must be logged in to create new topics.