Acharya Nagarjuna University (ANU) 2005 B.Tech Computer Science and Engineering CS 321 Computer Graphics - Question Paper
III/IV B.Tech Degree exam
October 2005
Computer Graphics
CS 321
(CS 321)
III/IV B.Tech. DEGREE EXAMINATION,
OCTOBER 2005.
Second Semester
COMPUTER GRAPHICS
7T!
Time : Three hours Maximum ; 70 marks
All questions carry equal marks.
Answer Question No. 1 compulsory.
(1 x 14 = 14) Answer ONE question from each Unit.
(4 x 14 56)
1, (a) =Deflne the term pixel and frame buffer.
(b) Display file format standards.
(e) What are screen coordinates and world coordinates?
(d) Mention any two graphical input devices.
': life
(e) What is meant by normalized device coordinates?..
(f) Explain the term visibility.
(g) Differentiate transformation and inverse transformation.
(h) Graphics primitives,
(l) Difference between window and Viewport*
y) Define Homogeneous coordinates.
(k) What ia the advantages of DDA algorithm over Bresenham's live drawing algorithm?
S-4*
(1) What is rotation transformation?
(m) What is polygon clipping?
(n) Polygon filling,
UNIT I
2. (ft) Explain basie incremental algorithm to draw lines'-
(b) Describe hgw characters are generated;
Or
(c)t Write algorithms for various operations on display file,
(d) What sire different attributes of text primitive? Hqtv text primitive lb displayed using display file?
UNIT n
3. {a) Explain DDA algorithm to generate lines,
(b) Describe an algorithm for generating an ellipse, 1
(i) Flat panel display,
(ii) Interent memory devices.
{V
UNIT III
4. (a) Discuss inside test of a point on a polygon.
(b) Explain the scan line polygon fill algorithm.
Or
{c} What is segment? Explain the operations on segment.
(d) Give tha algorithms for deleting and renaming segments and explain their features.
UNIT IV
5. (a) Explain about 3-basic transformations in detail. ,.
(b) Find the matrix transformation for rotating the triangle with vertices (7, 2), (3, 2) and (3, 9) with 90 degr&&6 keeping the./vertexjfS, 9) fixed.
Or ,
(c) Write sKqrt notes cm windowing,
<d) Describes the Cohen-Butherland algorithm for line clipping, '
|
Attachment: |
| Earning: Approval pending. |
