Q1 - E-STUDY
@PICT 2012-2016
Q1. A pixel may be defined as
a) Smallest size object
b) Larger size object
c) Medium size object
d) None of these
Answer: a
Q2. A line can be represented by
a) One point
b) Two points
c) Three points
d) Four points
Answer: b
Q3. The function of scan line polygon fill algorithm are_________________
a) Find intersection point of the boundary of polygon and scan line
b) Find intersection point of the boundary of polygon and point
c) Both a & b
d) None of these
Answer: a
Q4. Bresanham circle algorithm uses the approach of
a) Midpoin
b) Point
c) Line
d) None of these
Answer: a
Q5. The side effect of scan conversion are
a) Aliasing
b) Anti aliasing
c) Both a & b
d) None of these
Answer: a
Q6. The process of reducing aliasing is called
a) Resolution
b) Anti aliasing
c) Sampling
d) None of these
Answer: b
Q7. Two basic technique for anti aliasing in ray tracing algorithm are
a) Pixel sampling and super sampling
b) Adaptive sampling and super sampling
c) Pixel sampling and super sampling
d) None of these
Answer: b
Q8. The problem of aliasing are
a) Staircase
b) Unequal brightness
c) Picket fence problem
d) All of these
Answer: d
Q9. The technique to minimizing aliasing are
a) Increased no of resolution
b) Modify pixel intensities
c) Super sampling
d) All of these
Answer: d
Q10. To generate the characters, which are required
a) Hardware
b) Software
c) Both a & b
d) None of these
Answer: c
Q11. The method which uses array of dots for generating a character is called
a) Stoke method
b) Bitmap method
c) Star bust method
d) None of these
Answer: b
Q12. What is name of temporary memory where the graphics data is stored to be displayed on screen
a) RAM
b) ROM
c) Frame buffer
d) None
Answer: c
Q13. The division of the computer screen into rows and columns that define the no. of pixels to display a picture is called
a) Persistence
b) Resolution
c) Encapsulated post script
d) None
Answer: b
Q14. Two types of coordinates are
a) Positive and negative coordinates
b) Absolute and relative coordinates
c) Both a & b
d) None
Answer: b
Q15. The Cartesian slope-intercept equation for a straight line is
a) y = m.x + b
b) y = b.x + m
c) y = x.x + m
d) y = b + m.m
Answer: a
Q16. On raster system, lines are plotted with
a) Lines
b) Dots
c) Pixels
d) None
Answer: c
Q17. Expansion of line DDA algorithm is
a) Digital difference analyzer
b) Direct differential analyzer
c) Digital differential analyzer
d) Data differential analyzer
Answer: c
Q18. 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 algorithm
Answer: a
Q19. The disadvantage of line DDA is
a) Time consuming
b) Faster
c) Neither a nor b
d) None
Answer: a
Q20. 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
Answer: d
Q21. In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk is______
a) Positive
b) Equal
c) Negative
d) Option a or c
Answer: c
Q22. Which is the best line algorithm to balance the processing load among the processors?
a) Parallel line algorithm
b) DDA line algorithm
c) Bresenham’s line algorithm
d) Position Bresenham’s line algorithm
Answer: a
Q23. The algorithm which uses multiple processors to calculate pixel positions is
a) Midpoint algorithm
b) Parallel line algorithm
c) Bresenham’s line algorithm
d) All the above
Answer: b
Q24. Area-sampling is also known as
a) Pre-filtering
b) Pixel phasing
c) Post-filtering
d) Anti-aliasing
Answer: a
Q25. Raster objects can also be anti-aliased by shifting the display location of pixel areas is known as
a) Super-sampling
b) Pixel shaping
c) Pixel phasing
d) Any of these
Answer: c
Q26. An array of values specifying the relative importance of sub-pixel is referred as________ of sub-pixel weights.
a) Sub-mask
b) Mask
c) Pixel phasing
d) Pixel weighting
Answer: c
Q27. The technique that is more accurate method for anti-aliasing lines is
a) Filtering
b) Area-sampling
c) Super-sampling
d) None
Answer: a
Q28. Another method for determining the percentage of pixel area within a boundary is
a) Mid-print algorithm
b) Mid-point algorithm
c) Pixel intensity
d) By using inquiry functions
Answer: b
Q29. The anti - aliasing technique which allows shift of 1/4,1/2 and 3/4 of a pixel diameter enabling a closer path of a line is ?
a) Pixel phasing
b) Filtering
c) Intensity compensation
d) Sampling technique
Answer: a
Q30. Raster scan systems display a picture from a definition in a
a) Display file program
b) Frame buffer
c) Display controller
d) None of the above
Answer: b
Q31. A line connecting the points (1, 1) and (5, 3) is to be drawn, using the DDA algorithm. Find the value of x and y increments.
a) x-increment =1 ; y-increment=1
b) x-increment =0.5 ; y-increment=1
c) x-increment =1 ; y-increment=0.5
d)none of these
Q32. For a black and-white raster system, on the other hand, a point is plotted by setting the bit value corresponding to a specified screen position within the frame buffer to ----------------.
a) 1
b) 0
c) 0.5
d) None of above
Answer: a
Q33. A computed line position of (10.48, 20.51), for example, would be converted to pixel position ________________.
a) (10, 21)
b) (11, 20)
c) (11, 21)
d) (10, 20)
Answer: a
Q34. Rounding of coordinate values to integers causes lines to be displayed with a _______________ appearance.
a) Stair-step
b) Distorted
c) Curve
d) None of above
Answer: a
Q35. Scan lines are numbered consecutively from 0, starting at the bottom of the screen; and pixel columns are numbered from 0,___________ across each scan line.
a) left to right
b) right to left
c) top to bottom
d) bottom to top
Answer: a
Q36. Scan lines are numbered consecutively from 0, starting at the_________of the screen; and pixel columns are numbered from 0, left to right across each scan line.
a) bottom
b) left
c) right
d) top
Answer: a
Q37. The Cartesian slope-intercept equation for a straight line is
a) y = m.x+b
b) y = x + b
c) y = x + m.b
d) y = x + 1
Answer: a
Q38. Given that the two endpoints of the segment are specified at positions (x1, y1) and (x2, y2), value for the slope m is calculated as:
a) [(y2-y1) / (x2-x1)]
b) [(x2-x1) / (y2-y1)]
c) [(x2-y2) / (x1-y1)]
d) None of above
Answer:
Q39. Given that the two endpoints of the segment are specified at positions (x1, y1) and (x2, y2), value for y intercept b is calculated as:
a) b = y1 – m.x1
b) b = x1 – m.y1
c) b = y1 – x1 / 2
d) None of above
Answer: a
Q40. For lines with m = 1 and Δx = Δy ; the horizontal and vertical deflections voltages are _______.
a) equal
b) unequal
c) low
d) high
Answer: a
Q41. For lines with m = 1 and ___________; the horizontal and vertical deflections voltages are equal.
a) Δx = Δy
b) Δx < Δy
c) Δx > Δy
d) None of above
Answer: a
Q42. An accurate and efficient raster line-generating algorithm, developed by Bresenham, scan converts lines using only incremental___________ calculations that can be adapted to display circles
a) fractional
b) integer
c) complex
d) none of above
Answer: b
Q43. As in Bresenham's line algorithm, the midpoint method calculates pixel positions along the circumference of a circle using__________ additions and subtractions
a) fractional
b) integer
c) complex
d) none of above
Answer: b
Q44. Scan lines are numbered consecutively from 0, starting at the bottom of the screen; and_________________ are numbered from 0, left to right across each scan line.
a) pixel columns
b) pixelrows
c) lines
d) None of above
Answer: a
Q45. . A computed line position of (20.48, 34.51), for example, would be converted to pixel position ________________.
a) (20, 34)
b) (21, 34)
c) (34, 21)
d) (20, 35)
Answer: d
46) For a thick line width of a line has value __________________
a.1
b.2
c.none
d.gerater than one
ans.d
47) For a gentle slope line m value is _____________
a)less than one
b)greater than one
c)any value
d) None of above
Ans.a
48) For a gentle slope line value of x coordinate increase by ________ where as value of y coordinate increases by ________
a. 1,m
b.m,1
c.1,1
d. None of above
Ans.a
49)For a sharp slope line value of x coordinate increase by ________ where as value of y coordinate increases by ________
a. 1/m, m
b.1/m, 1
c.1,1
d. None of above
Ans.a
50) For a sharp slope line m value is _____________
a)less than one
b)greater than one
c)any value
d) None of above
Ans.b
51) DDA stands for _____________________
a. Digital differential Arithmetic
b. Digital differential Analysis
c. Digital differential Analyser
D.all of above
Ans.b
52) ____________ is example of Incremental method
a. Midpoint circle generation
b. Bresenham’s circle generation
c. DDA
d. All of above
Ans.c
53) _____________ is decision parameter in DDA Line drawing algorithm
a.Error function
b.midpoint of two point
c.sum variable
d.slope of a line
Ans.d
54) _____________ is decision parameter in Bresenham’s Line drawing algorithm
a.Error function
b.midpoint of two point
c.sum variable
d.slope of a line
Ans.a
55) _____________ is decision parameter in Midpoint circle Generation algorithm
a. Error function
b. midpoint of two point
c. sum variable
d. slope of a line
Ans. b
56) _____________ is decision parameter in Bresenham circle generation algorithm
a.Error function
b.midpoint of two point
c.sum variable
d.slope of a line
Ans.c
57)_______________ are round off functions used in DDA
a.Ceil(),Floor()
b)rnd()
c)abs()
d)fact()
Ans.a
58) ______________ algorithm supports floating point operations
a)Bresenham’s
b) DDA
c) scan line
d) All of above
Ans.b
59) ______________ algorithm supports floating point operations
a)Bresenham’s
b) DDA
c) scan line
d) All of above
Ans. A
60) There are _________________ character generation method
a.1
b.2
c.3
d.4
Ans. _c
61) ______________ is not a character generation method
a)Stroke Method
b)Scan line
c)Bit map
d)star bust method
Ans. b
62) ______________ uses 24 bit star bust pattern
a)Stroke Method
b)Scan line
c)Bit map
d)star bust method
Ans .d
63) The process of Turning on pixels for a line segment is called ______________
a. scalar Generation
b. Vector Generation
c)Transformation
d)Scaling
Ans. b
64)Gentle slope lines are closer to ___________ l lines
a)Horizontal
b)vertical
c)parallel
d)All of above
Ans. a
65)___________ slope lines are closer to vertical lines l lines
a)Gentle
b)Sharp
c) random
d) All of above
Ans. a
66) A line with start point (0,0) and endpoint (4,6) is __________ line
a) Gentle
b) sharp
c) slope value one
d) All of above
Ans. b
67) A line with start point(0,0) and (6,4) is _______________ line
a)sharp
b)Gentle
c) slope value one
d)All of above
Ans. b
68) There are _____________ character generation methods
a) 1
b) 2
c) 3
d) 4
Ans. c
69) You can’t draw a character with rounded shape in _____________ method
a).Bitmap method
b)Stroke method
c) Starbust method
d) all of above
Ans.b
Q70) __________ is another name for Bitmap method
a) Dot marix
b) Stroke method
c) Star burst
d) None of above
Ans. a
Q71)Starbust method requires ______________ memory
a) less
b) More
c) Huge
d) Very Less
Ans.b
Q72)In starbust method each character has ____________ bit code
a)8
b) 16
c)24
d)32
Ans. c
Q73) In _____________ line appear as like a stair case
a) antialiasing
b) Aliasing
c) Sampling
d) Supersampling
Ans.b
Q74) Aliasing generally appears with _________________ resolution screen
a) High
b) Very High
c) Low
d) Moderate
Ans.c
Q75) In antialiasing we ___________________ intensities of pixel
a) adjust
b) increarse
c) Decrease
d) None of above
Ans. a
Q76) Aliasing effect can be reduced by _____________ resolution
a) decreasing
b) Multiplying
c) Increasing
d) All of above
Ans. c
Q77)Increasing resolution is
a) Cheap
b) Costly
c) Can’t say
d) Not possible
Ans.b
Q78)___________ is process of adjusting intensities of a pixel
a) Aliasing
b) Antialiasing
c) postfiltering
d) sampling
Ans.b
Q79)Process of shifting display location of pixel areas is called as _________________
a) Weighted area sampling
b) Filtering
c) Supersampling
d) Pixel Phasing
Ans. d
Q80) Circle drawing uses _____________ symmetry
a) 1-way
b) 2-way
c) $-way
d) 8-way
Ans. d
Q81) In Bresnham’s circle generation _________________ is decision variable
a)mid-point
b)sum-variable
c) slope
d)error function
Ans b
Q 82) For a Bresenham’s line drawing initial value of G is given as
a) G=0
b) G=2*dy-dx
c)g=x/y
d) g=dy/dx
Ans b
Q83)In bresenham’s line drawing if(G>0) condition is true g will be updated as
a)G=0
b)G=G+(2*dy-2*dx)
c)G=G+2*dy
d) G=G*G
Ans.b
Q84)In bresenham’s line drawing if(G>0) condition is false g will be updated as
a)G=0
b)G=G+(2*dy-2*dx)
c)G=G+2*dy
d) G=G*G
Ans.c
Q85) For a circle drawing algorithm initial values of X & Y coordinates are _________
a)0,r
b)r,0
c)r,r
d)1,1
Ans a
Q86) For a gentle slope lines value of Xinc any Yinc are _____________
a)1,m
b)m,1
c)1,1
d)m,m
Ans.a
Q87) For a sharp slope lines value of Xinc any Yinc are _____________
a)1,m
b)1/m,1
c)1,1
d)m,m
Ans.b
Q88) For line with slope value equals to one value of Xinc any Yinc are _____________
a)1,m
b)m,1
c)1,1
d)m,m
Ans.c
Q89) DDA is ____________ efficient in nature
a)Less
b)more
c) can’t say
d) None of above
Ans. a
Q90) Bresenham’s is ____________ efficient in nature
a)Less
b)more
c) can’t say
d) None of above
Ans. b
Q91) A line with start & endpoints (1,1)(5,3) respectively endpoints actual intermediate pixel positions are _____________
a)(2,0.5)(3,1.5)(4,2.5)
b)(2,1.5),(3,2)(4,2.5)
c)(2,3)(3,3)(4,3)
d)None of above
Ans b
Q92) A line with start & endpoints (1,1)(3,5)respectively endpoints actual intermediate pixel positions are _____________
a)(2,0.5)(3,1.5)(4,2.5)
b)(2,1.5),(3,2)(4,2.5)
c)((1.5,2),(2,3)(2.5,4)
d)None of above
Ans c
Q93) A line has by default width value __________________
a) 1
b) 2
c) 3
d) 0
Ans.a
Q94) In ________________ method it is possible to perform scaling operation on character
a)Starbust
b)Dotmatric
c)Stroke
d)None of above
Ans.c
Q95)________________ is traditional method of circle drawing
a)Midpoint
b)Bresenham’s
c) Trignometric method
d)All of above
Ans. c
Q96)________________ is traditional method of circle drawing
a)Polynomial
b)Bresenham’s
c) DDA
d)All of above
Ans. a
Q97)In midpoint circle generation value of initial decision parameter is given by _______
a)p=r
b)p=1-r
c)p=p+r
d)p=p*r
Ans. b
Q98)In Bresenham’s circle generation value of initial decision parameter is given by ________
a)s=s+r
b)s=s-r
c)s=3-2*r
d)s=0
Ans.c
Q99) In circle generation algorithm to move center from origin to respective location we perform __________ operation
a)Scaling
b)reflection
c)Rotation
d)Translation
Ans.d
Q100) In bresnham’s circle generation first point on circumference of circle will be ________
a)(1,r)
b)(r,0)
c)(0,r)
d)(r,r)
Ans.c
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
Related searches
- how to calculate q1 and q3
- min q1 median q3 max calculator
- how do you find q1 and q3
- q1 q2 q3 iqr calculator
- statistics calculator q1 q2 q3
- mean median q1 q3 calculator
- min q1 med q3 max calculator
- how to find q1 and q3 statistics
- q1 median q3
- q1 and q3 calculation
- how to find q1 and q3
- find q1 q2 and q3 calculator