0% found this document useful (0 votes)
63 views2 pages

Computer Graphics: B.E. (Computer Science Engineering) Fifth Semester (C.B.S.)

This document contains a sample exam for a Computer Graphics course, consisting of 12 multiple choice or short answer questions. The questions cover topics like computer graphics applications, raster vs random scan systems, DDA and Bresenham's line algorithms, polygon filling algorithms, transformations, clipping, and curves. Students are instructed to answer 6 of the 12 questions by solving parts a) and b) of selected questions.

Uploaded by

Akash Raut
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
63 views2 pages

Computer Graphics: B.E. (Computer Science Engineering) Fifth Semester (C.B.S.)

This document contains a sample exam for a Computer Graphics course, consisting of 12 multiple choice or short answer questions. The questions cover topics like computer graphics applications, raster vs random scan systems, DDA and Bresenham's line algorithms, polygon filling algorithms, transformations, clipping, and curves. Students are instructed to answer 6 of the 12 questions by solving parts a) and b) of selected questions.

Uploaded by

Akash Raut
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

http://www.rtmnuonline.

com
B.E. (Computer Science Engineering) Fifth Semester (C.B.S.)
Computer Graphics

P. Pages : 2 NJR/KS/18/4491
Time : Three Hours *0214* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions carry marks as indicated.
2. Solve Question 1 OR Questions No. 2.
3. Solve Question 3 OR Questions No. 4.
4. Solve Question 5 OR Questions No. 6.
5. Solve Question 7 OR Questions No. 8.
6. Solve Question 9 OR Questions No. 10.
7. Solve Question 11 OR Questions No. 12.
8. Due credit will be given to neatness and adequate dimensions.
9. Use Graph Paper.

1. a) Give various applications of computer graphics. 6

b) Differentiate between Raster scan & Random scan system. 7

OR
2. a) Define computer graphics? Explain working of video controller system? 6

b) Explain areas of computer graphics? 3

c) Write a short note on DVST? 4

3. a) What is DDA Algorithm? What are disadvantages of DDA algorithm? What are 7
advantages of DDA algorithm?

b) Draw & generate algorithm for first quadrant with center as (h, k) with radius R in 4
anticlockwise direction.

c) Explain Bresenham's line drawing algorithm along with advantages? 3


OR
4. a) Rasterize a line from (0, 0) to (-8, -4) using DDA algorithm. 7

b) Rasterize a line from (1, 1) to (4, 5) using Bresenham's line generation algorithm. 7

5. a) Fill the polygon defined by vertices A (1,1) B (7,1) C (7,6) D (5,4) E (3,4) F (1,6) using 7
fence fill algorithm.

b) Explain levels of abstraction in opengl? 4

c) Explain features of opengl in details? 3

OR
6. a) A Polygon is defined by vertices A (1,2) B (4,5) C (7,2) D (7,5) E (4,8) F (1,5) fill it using 7
i) Edge fill algorithm.

NJR/KS/18/4491 1 P.T.O
b) Draw and explain operation of opengl? 7

7. a) A triangle is defined as A (12,5) B (15,5) C (13,8) find a reflection of it about x = 5. 6

b) A polygon is defined by vertices A (5,3) B (8,6), C (5,9) and D (2, 6) respectively clip a 7
line from P1 (2,3) & P2 (9,7) about a window using Cyrus beck algorithm.

OR
8. a) Explain Sutherland when line clipping algorithm? Explain visibility test of line. 6

b) A triangle is defined by P1 (0,0) P2 (2,0) P3 (3,2) is enlarged twice in x direction & thrice in 7
y direction. The vertex P3 of enlarged triangle is rotated 30º clockwise. Find resultant
triangle?

9. a) A clipping window ABCD is defined as A (0,0), B (40,0), C (40,40), D (0,40) clip a line 7
from P (-10,20) & Q (50,10) using midpoint subdivision algorithm.

b) Explain viewing transformation also, give transformation matrix. 6

OR
10. a) Write a short note on Normalized device coordinate system. 4

b) Explain & generate Z buffer algorithm. 5

c) Explain operation of 3D transformation with matrix. 4

11. a) Find normalization transformation N with rectangular window having 4 corner coordinate 7
A (2,0) B (6,4) C (4,6) D (0,3) & view port having equal distance of 0.25 in each direction
from center of standard normal device coordinate system.

b) Write a short note on – 6

a) Warnock's algorithm

b) Painter's algorithm.

OR
12. a) Explain basic Ray tracing Algorithm. 3

b) Give features of Bezier curves in details. 2

c) Generate the Bezier curve for 5 control points, & state advantages of Bezier curve? 8

*********

NJR/KS/18/4491 2

You might also like