Roll No. …………………..
TCS–604
B. Tech. (CSE) (Sixth Semester)
EXAMINATION, 2021-22
COMPUTER GRAPHICS
Time : Three Hours
Maximum Marks : 60
Note : Question paper has three Sections. Read carefully
instructions for each Section.
Section—A
(Very Short Answer Type Questions)
1. Attempt all questions. Each question carries 1 mark.
(a) Define Computer Graphics. (CO1, RE)
(b) Show and explain what is scan line while
scanning . (CO2, RE)
(c) Outline the role of pixel and frame buffer in
graphics devices. (CO2, UN)
(d) Illustrate, what are the video display devices .
(CO1, UN)
(e) Define aspect ratio. (CO1, RE)
(f) Rephrase Aliasing and Antialiasing effect.
(CO2, UN)
P. T. O.
[2] TCS–604
(g) Infer, what is fractured segment. (CO3, UN)
(h) Determine the matrix representation for 2D
Scaling. (CO3, EV)
(i) What are the drawbacks of digital differential
analyser ? (CO1, RE)
(j) What are the drawbacks of depth buffer ?
(CO4, UN)
(k) Distinguish between convex and concave
polygons with example. (CO3, AN)
(l) Estimate how long would it take to load a
640 × 480 frame buffer with 12 bit per pixel, if
105 bits can be transferred per second. (CO1, EV)
Section—B
(Short Answer Type Questions)
2. Attempt all questions. Each question carries
4 marks.
(a) Distinguish between Raster and Vector Graphics
methods. (CO1, AP)
OR
Summarize the concept of Display File Structure.
(CO1, AP)
(b) List out the merits and demerits of Plasma panel
display. (CO2, UN)
OR
What do you mean by emissive and non-emissive
displays ? (CO2, UN)
[3] TCS–604
(c) Illustrate the character generation algorithms.
(CO3, AN)
OR
Analyse and conclude the Pixel Addressing with
the help of a suitable example. (CO3, AN)
(d) Contrast the Cohen-Sutherland line clipping
algorithm with suitable example. (CO3, AN)
OR
Write the boundary-fill algorithm for filling
polygons and explain it with a suitable example.
(CO3, AN)
(e) Distinguish between window port and viewport in
2D clipping. How lines are grouped into visible,
invisible and partially visible categories ?
(CO4, AP)
OR
Give a 3 x 3 homogeneous matrix to rotate the
image clockwise by 90 degree , then shift the
image to the right by 10 units and finally scale the
image by twice as large. All these transformation
are to be done one after another in sequence.
(CO4, AP)
(f) Explain the Sierpinski Gasket in computer
graphics. (CO4, RE)
OR
Write notes on RGB and HSV color models.
(CO4, RE)
P. T. O.
[4] TCS–604
Section—C
(Long Answer Type Questions)
3. Attempt all questions. Each question carries 8 marks.
(a) Plot a circle with centre at origin (0, 0) and
radius = 8 using Bresenham’s circle drawing
algorithm. (CO1, EV)
OR
Plot a circle with centre at origin (0, 0) and
radius = 5 using Midpoint Circle Drawing
algorithm. (CO1, EV)
(b) Consider a line from (0, 0) to (4, 6). Use DDA
line drawing algorithm to rasterize the line.
(CO2, EV)
OR
Rasterize a line from (1, 1) to (5, 3) using
Bresenham’s line drawing algorithm. (CO2, EV)
(c) Find the new coordinate of unit cube by rotating
90 degrees about an axis define by its end points
A (2, 1,0) and B (3, 3, 1). (CO4, EV)
OR
Find the reflection of a point p (5, 4, 3) about the
plane x = 7. (CO4, EV)
TCS–604 110
