21-22 18CS62 Kjrpia1

INTERNAL ASSESSMENT TEST-I 2021-22 (EVEN Sem)
STAFF NAME:- KAVITHA J/RAJESWARI R P SEM:- VI SEC:- A/B/C

COURSE NAME:-Computer Graphics and Visualization COURSE CODE:- 18CS62
DATE:- 19/05/2022 TIME:- 2:30PM-4:00PM MAX MARKS:- 50
Note: - Answer any five question, each question carries 10 marks

Q Mar BT
QUESTIONS CO
No k L
s
Q1 (a)Distinguish between Raster Scan Display and Random Scan Display and list 5+5 L2 CO1
the applications of computer graphics.
(b) What is openGL? With the help of block diagram explain library
organization of openGL program and give the general structure of openGL
program.
OR
List and explain various openGL primitive and its attribute functions. Write an
Q2 10 L3 CO1
openGL code to create human face like structure using suitable openGL
primitive functions
Q3 (a)Define the following terms with respect to computer graphics 4+6 L2,L CO1
(i)bitmap (ii) pixmap(iii) aspect ratio (iv) frame buffer 3
(b)Digitize a line from (0,0) to (5,6 ) using DDA algorithm.

OR
Q4 Write an openGL code to draw the following geometric objects with suitable 10 L3 CO1
openGL primitives.
Q5 Explain Bresenham line drawing algorithm with suitable derivation. 10 L2 CO1

OR
Illustrate the transformation sequence from modeling coordinates to
Q6 10 L2 CO1
device coordinates for a three dimensional scene.
Explain polygon classification? Also explain the different ways of
Q7 identifying and splitting a concave polygons. 10 L2 CO1
OR
Q8 Explain openGL polygon fill primitive functions.. 10 L2 CO1
Q9 Explain the raster scan system architecture with display processor.
10 L2 CO1
OR
Given circle radius r=10,solve midpoint circle generation algorithm by
Q10 determining positions along the circle octant in the first quadrant from x=0 to L3 CO1
x=y.
Blooms Taxonomy (BTL) Course Outcome (CO) Program Outcome (PO)

RAO BAHADUR Y. MAHABALESWARAPPA ENGINEERING COLLEGE, BELLARY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Scheme of evaluation IA I
STAFF NAME:- KAVITHA J/RAJESWARI R P SEM:- VI SEC:- A/B/C
COURSE NAME:-Computer Graphics and Visualization COURSE CODE:- 18CS62
DATE:- 10/06/2021 TIME:- 6:00-7:30 MAX MARKS:- 50
Note: - Answer any five question, each question carries 10 marks

Q Mark s BT
QUESTIONS CO
No L
Q1 (a)Distinguish between Raster Scan Display and Random Scan Display and list the L2 CO1
applications of computer graphics.
Random Raster
3M
Refresh buffer store opcode and Entire image is to be stored
each
endpoint coordinates
Difficult in display filled areas Easier
Flicker when primitives are large Independent of design
Random scanning system Raster(matrix)
Smooth picture Aliasing effect
Applications-----------------------------------------------------------------------
(b) What is openGL? With the help of block diagram explain library 2M
organization of openGL program and give the general structure of openGL
program.
openGL graphics library explanation---------------------------------------- 1M
2M
1. #include<GL/glut.h>
2. Configure and open window
3. Initialize openGL state,program variables etc
Register callback,resize,display,KB,mouse etc 3M
OR
Q2 Primitives CO1
L3
4M
Attribute functions
glPointSize(),glLineWidth(),glLineStripple(),glPolygonStripple() 3M
Program to create human face like structure
3M
Q3 (a)Define the following terms with respect to computer graphics L2 CO1
(i)bitmap:balck and white system-one pixel 1M
(ii) pixmap:multiple bits/pixel each
(iii) aspect ratio: width to height
(iv) frame buffer:picture definition stored in a memory
b)Digitize a line from (0,0) to (5,6 ) using DDA algorithm. L3
1M each step
OR
Q4 Write an openGL program to draw the following geometric objects with 3+4+3 L3 CO1
suitable openGL primitives.
Explain Bresenham line drawing algorithm with suitable derivation
Q5 Algorithm: 10 L2 CO1
Step1: Start
Step2: Declare x1, y1, x2, y2.
Step3: Calculate dx = x2 - x1
Dy = y2 - y1 --------------------------------
2M
Step 4: Calculate slope, m = dy / dx.
Step5: For m < 1: Calculate initial decision variable: P = 2dy - dx.
Step6: while (x1 <= x2)
if(P < 0):
xk = xk + 1
P = P + 2dy
yk = yk
3M
else : --------------------------------------------------------------------------
xk = xk + 1
P = P + 2dy - 2dx
yk = yk + 1
Step 7: Plot ( xk , yk )
Step 8: End
Derivation ---------------------------------------------------------------------------------------------------------------- 5M
Q6 Illustrate the transformation sequence from modeling coordinates to device 2M L2

coordinates for a three dimensional scene each
Q7 Explain polygon classification? Also explain the different ways of identifying

and splitting a concave polygons. 10 L2 CO1
Concave & convex-------------------------------------------2M
different ways of identifying and splitting a concave polygons.
• Vector method-------------------------------4M
• Rotational method---------------------------4M
Q8 Explain openGL polygon fill primitive functions. 10 L2 CO1
GL_POLYGON –2M
GL_TRIANGLES –2M
GL_TRIANGLE_STRIP—2M
GL_TRIANGLE_FAN –2M
GL_QUADS—1M
GL_QUAD_STRIP—1M
Q9 Explain the raster scan system architecture with display processor.
10 L2 CO1
Fig--------3M
Explanation-----7M
OR
Given circle radius r=10,solve midpoint circle generation algorithm by determining 10
Q10 positions along the circle octant in the first quadrant from x=0 to x=y. L3 CO1
----------3M
----------------------------1M each

21-22 18CS62 Kjrpia1

Uploaded by

Copyright:

Available Formats

21-22 18CS62 Kjrpia1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

21-22 18CS62 Kjrpia1

Uploaded by

Copyright:

Available Formats

INTERNAL ASSESSMENT TEST-I 2021-22 (EVEN Sem)

STAFF NAME:- KAVITHA J/RAJESWARI R P SEM:- VI SEC:- A/B/C

Note: - Answer any five question, each question carries 10 marks

(b)Digitize a line from (0,0) to (5,6 ) using DDA algorithm.

Q5 Explain Bresenham line drawing algorithm with suitable derivation. 10 L2 CO1

Blooms Taxonomy (BTL) Course Outcome (CO) Program Outcome (PO)

Note: - Answer any five question, each question carries 10 marks

openGL graphics library explanation---------------------------------------- 1M

b)Digitize a line from (0,0) to (5,6 ) using DDA algorithm. L3

Q6 Illustrate the transformation sequence from modeling coordinates to device 2M L2

Q7 Explain polygon classification? Also explain the different ways of identifying

You might also like