Scribd
Upload
19 views

Computer Graphics

Uploaded by

einsteinrawat499
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

Computer Graphics

Uploaded by

einsteinrawat499
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Roll No. …………………..

TCS–604
B. Tech. (CSE) (Sixth Semester)
EXAMINATION, 2022-23
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. 1 each
(a) Differentiate between concave and convex
polygon. (CO2, AN)
(b) Explain the role of pixel and frame buffer in
graphics devices. (CO1, AN)
(c) How much time is spent scanning across each
row pixels during screen refresh on a raster suite,
with resolution of 1280 × 1024 and a refresh rate
of 30 frames per second ? (CO1, EV)

P. T. O.
[2] TCS–604

(d) Define raster scan display. (CO1, RE)


(e) Discuss the drawbacks of cathode rays’ tube.
(CO1, UN)
(f) Name the five application of computer graphics.
(CO4, RE)
(g) Define the aspect ratio. (CO2, UN)
(h) Find the matrix representation for translation with
respect to origin. (CO3, UN)
(i) Illustrate the difference between geometric and
coordinate transformation. (CO3, UN)
(j) How to find the intersection of two line ?
(CO2, AP)
(k) Write the steps in creating a segment. (CO2, UN)
(l) List any five openGL functions with their use.
(CO4, RE)
Section–B
(Short Answer Type Questions)

2. Attempt all questions. 4 each

(a) Illustrate the advantages of Bresenham’s


algorithm for line drawing over the DDA
algorithm. Also draw a line with end point A
[3] TCS–604

(5,4) and B (13,9) using Bresenham’s line


drawing algorithm. (CO1, AN)
OR

Illustrate the working of Liquid crystal display


with the help of a neat and clean diagram.

(b) Find the Mirror reflection of triangle A (0, 5),


B (4, 6) and C (2, 8) about the line y = x + 2.

(CO2, AP)

OR

Prove that the two successive rotations are


additive i.e., RQ1*RQ2 = R (Q1 + Q2) .

(c) Using any of the line-clipping algorithms, obtain


the visible portion of the following line segment
P1 = (– 2, – 3) P2 = (3, 5) for the rectangle
window (Xmin, Ymin) -(0,0) an
(Xmax, Ymax) – (1, 1). (CO4, EV)

OR

Explain Window to Viewport transformation in


brief. Also evaluate the viewing transformation
matrix.

P. T. O.
[4] TCS–604

(d) Explain the sierpinski gasket problem. (CO3, UN)

OR

What is ray tracing algorithm for hidden surface


removal ? Explain mathematically how to find
which planes are visible using ray tracing
methods.

(e) Explain the Cohen-Sutherland algorithm with


example. Also write the drawbacks of it.

(CO2, AN)

OR

Explain the role of segment in computer graphics.


Also write the function and attributes for segment
table.
(f) Explain Z-buffer method of back face removal.
(CO3, UN)
OR
Explain RGB and HSV color models.
Section–C
(Long Answer Type Questions)

3. Attempt all questions. 8 each


(a) Find the mirror reflection of the unit cube with
respect to x = a plane. (CO3, EV)
[5] TCS–604

OR

The pyramid defined by the coordinates A(0,0,0) ,


B(1,0,0), C(0,1,0), D(0,0,1) is rotated 45° with
respect to Z axis, find the coordinates of rotated
object.

(b) Find the transformation Av which aligns a given


vector v with the vector k along the positive Z
axis. (CO4, AP)

OR

Find the transformation for :

(i) Cavalier with 0 = 45°

(ii) Cabinet projection with 0 = 30°

(c) Explain the Sutherland Hodgman polygon


clipping algorithm. Also find the matrix for
3-dimensional rotation about y axis. (CO1, UN)

OR

Explain the advantages of flood fill algorithms


over the boundary fill algorithm. Also write step
for scan line polygon filling algorithm.

TCS–604

P. T. O.

You might also like