Internal test:

Computer Graphics:
6th semester BCA

Part – A
1. Define computer graphics.
→ Computer graphics is process of transformations, shading and animation of
the image.
2. What is aspect ratio.
→ Aspect ratio is used to determine the relative horizontal and vertical sizes of
computer graphics.
3. What is frame buffer.
→ Frame buffer is a position of random access memory containing a bitmap
that drives a video display.
4. Define ellipse.
→ Ellipse is defined as the set of point such that the sum of the distance from 2
fixed positions is the same for all points.
5. What is line cap
→Line cap are used for adjusting the shape of the line ends to give them a better
appearance.
6. what is translation
→ Translation an object is re – positioning (moving) from one place to another
place is known as translation.
7. Define sharing.
→ Sharing is the transformation of an object which changes the shape of the
object.
8. What is window.

Madhu
→ Window is a separate viewing area on a computer display screen in a system
that allow multiple viewing areas as part of graphical user interface.
9. Define projection.
→ Projection defined as mapping of a point p(x, y, z) onto its image p(x, y, z) in
the projection plane or view plane.

Part – B
10. What are different between random and raster scan display.
→
Random Scan Raster Scan
High resolution Less resolution.
Producing smooth line drawing Line produced as zigzag
Cost is high Cost is low
Image is difficult displayed realistic Image is displayed realistic
Easy animation Difficult in animation

11. Explain the function of shadow mask.

→ The shadow mask is one of the two technology used in the manufacture of
cathode ray tube televisions and computer monitors which produce clear,
focused color images. The other approach is the aperture grille, better known by
its trade name, Trinitron. All early color televisions and the majority of CRT
computer monitors used shadow mask technology.
12. What is clipping? Explain blanking.
→ Clipping is method to selectively enable or disable rendering operations
within a defined region of interest.
Blanking occurs between horizontal lines and between frames.
13. Explain the properties of line.
→ Line may short or long, thin or thick, straight or curved, direct or
meandering, zigzag or serpentine, distinct or blurred.

Madhu
 Part – C
14. Explain the application of computer graphics.
→ Computer aided design: designing of buildings, automobile, aircraft is done
with the help of computer aided drawing , this helps in providing minute details
to the drawing and producing more accurate and sharp drawings with better
specifications
Presentation graphics: for the preparation of reports or summarizing the
financial, statistical, mathematical, scientific, economic data for research
reports, managerial reports, moreover creations of bar graphs, pie charts, time
chart, can be done using the tools present in computer graphics.
Machine drawing: is very frequently used for designing, modifying and creation
of various parts of machine and the whole machine itself.
Entertainment: used for creating motion pictures, music video, television shows,
cartoon animation films.
Education and training: education models can be created through which more
interest can be generated among the students regarding the subject. Specialized
system for training like simulators can be used for training candidates in a way
that can be grasped in a short span time with better understanding.
Image processing: various kinds of photographs or images require editing in
order to be used in different places.
Visualization: can be seen in many advance technologies, data visualization
helps in finding insights of the data, to check and study the behavior of
processes.
15. Write an algorithm to a straight line using Bresenhams
technique.
→ Step1: Start
Step2: Declare variable x1, x2, y1, y2, d, i1, i2, dx, dy
Step3: Enter value of x1,y1, x2, y2 where x1, y1, are coordinate of starting
point and x2, y2 are coordinates of ending point.
Step4: Calculate dx = x2 – x1
Calculate dy = y2 – y1

Madhu
Calculate i1 = y2 * dy
Calculate i2 = 2 * (dy – dx)
Calculate d = i1 – dx
Step5: Consider (x, y) as starting point and x end as maximum possible value of
x.
If dx = 0
Then x = x2
Y = y2
X end = x1
If dx > 0
Then x = x1
Y = y1
X end = x2
Step6: Generate point at (x, y) coordinates.
Step7: Check if whole line is generated.
If x > = xend
Step8: calculate co ordinates of the next pixel
If d < 0
Then d = d + i1
If d > 0
Increment y = y + 1
Step9: increment x = x + 1
Step10: Draw a point of latest (x , y) coordinates.
Step11: Go to step7
Step12: End
16. Explain Sutherland and Hodgeman polygon clipping.
→ the Sutherland – Hodgeman algorithm is based on the fact it is easy to click a
polygon against a single clipping edge.

Madhu
The algorithm operates on the vertices of polygon, when each pair of vertices is
passed to a window boundary clipper.
There are four possible techniques:
Left clipper:
Top clipper:
Right clipper:
Bottom clipper:
17. Write a note on octree.
→ Octree is a tree data structure in which each internal node can have at most 8
children. Like binary tree which divides the space two segments, octree divides
the space into at most eight – part which is called 3 – D point which takes a
large amount space.
If all the octree contains exactly 8 children, then it is called full octree. It is also
useful for high – resolution graphics like 3D computer graphics.

Part – D
18. (a) Write a program draw a circle using DDA tech.
(b) Explain color model.
→ (a) #include<stdio.h>
#include<conio.h>
#include<graphics.h>
#include<math.h>
Void main()
{
Float x1, x2, y1, y2, startx, starty, epsilon;
Int gd = DETECT,gm,I,val;
Int r;
Initgraph(&gd,&gm, “ c;\\tc\\bgi”);
Printf(“\n enter the radius of the circle:”);

Madhu
Scanf(%fd”,&r);
X1 = r * cos(0);
Y1 = r * sin(0);
Startx = x1;
Starty = y1;
I = 0;
Do
{
Val = pow(2, i);
I++;
}
While(val < r);
Epsilon = 1 / pow(2,i-1);
Do
{
X2 = x1 + y1 * epsilon;
Y2 = y1 – epsilon * x2;
Putpixel(200+x2,200+y2,15);
X1 = x2;
Y1= y2;
Delay(10);
}
While((y1-starty)<epsilon||(startx-x1)>epsilon);
Getch();
Closegraph();
}
Or

Madhu
#include<graphics.h>
Int main()
{
Int gd = detect, gm;
Initgraph(&gd, &gm, “ “);
Circle(250, 200, 50);
Getch();
Closegraph();
Return 0;
(b) Color model is a 3D color coordinate system to produce all range of color
through primary color set.” There are millions of colors used in computer
graphics. The light displays the color, a color model is a hierarchical system in
which we can create every color by using RGB (Red, Green, Blue) and CMYK
(Cyan, Magenta, Yellow, Black) models we can use different colors for various
purpose. It is an orderly system for creating a whole range of color from a small
set of primary colors. There are two types of color models, Subtractive and
Additive.
19. Explain 2D transformations.
→ 2D transformation is a process of modifying and re – posting the existing
graphics.
Transformation are helpful in changing the position, size, orientation, shape of
the object.
2D translation is a process of moving an object from one position to another in a
two dimensional plane.
There are various types of transformation such as translation, scaling up or
down, rotation shearing etc.

Apr / mar 2019

Part – A

Madhu
1. What is refresh CRT.
→ Cathode Ray Tube
2. Define ellipse.
→ Ellipse is set of points such that the sum of the distance from two fixed
positions is the same for all points.
3. What is blanking.
→ Blanking is occurs between horizontal lines and between frames.
4. What is a viewpoint.
→ Viewpoint is a region of the screen used to display a point of the total image
to be shown.
5. Define reflection
→ Reflection is a transformation which produce a mirror image of an object.
6. What is composite transformation.
→ A number of transformation or sequence of transformations can be combined
to single one called composite transformation.
Or
It is two or more transformations performed one after the other.
7. What do you mean by device coordinate system.
→ Device coordinate system is encompasses a cube where the x, y, and z
components range from -1 to 1.
8. What is parallel projection.
→ Parallel projection involves generating a view of a solid object by projecting
points on the object surface along parallel lines onto the display plane.
9. What is the use of control points.
→ Control point is used to determine the shape of a spline curve or higher
dimensional object.
10. What is intensity cueing.
→ Intensity cueing is a kind of visual cueing which is applied in computer
graphics produce atmospheric haze effect to display distant objects.

Madhu
11. What is constraints.
→ Constraints is a rule for altering input coordinates value to produce a
specified orientation or alignment of the displayed coordinates.
12. Mention the combinational keys of keyboard
→ SHIFT+DELETE, CTRL+INSERT, SHIFT+INSERT, SHIFT+TAB,
CTRL+Q+F.

Part – B
13. What are the difference between random and raster displays?
→
Random Scan Raster Scan
High resolution Less resolution.
Producing smooth line drawing Line produced as zigzag
Cost is high Cost is low
Image is difficult displayed realistic Image is displayed realistic
Easy animation Difficult in animation

14. Write a program to draw a circle using DDA tech.

→

15. Explain point clipping.

→ Point clipping: is done by comparing each point with the boundary of the
rectangle window. i.e point clipping against a window specification is done by
testing the coordinate values to determine whether they are within the boundries
(or) not.

Madhu
 P4 clipped
P2 clipped
YWmin
P5 P1
P7
P6

YWmin
Clipped P3

XWmin XWmin

Points P1 P5 P6 within the window are not clipped.

16. Explain homogenous transformation.
→ Homogenous transformation are used to two dimensional coordinate
positions (x, y) are represented by triple coordinate.
It is generally used in design and construction application. Here we perform
translation, rotations, scaling to fit the picture into proper position.
17. Explain uniform scaling transformation with an example.
→ Uniform scaling transformation is type of scaling, everything that is scaled is
scaled by the same amount. This is the most common form of scaling when
making models of something, with this type of scaling you’ll get a perfect
miniature of real world object. The difference you’ll see is a size difference
18. Explain the properties of curves.
→
19. Explain basic functions of segments.

Madhu
→

Part – C
20. Briefly explain color model.
→
21. Write an algorithm to draw a straight line using Bresenham’s
technique and trace with 2 end point (20,10) and (30,18).
→
22. Briefly explain character attributes.
23. Explain Cohen and Sutherland line clipping algorithm
24. (a) Write a note on shear transformation
(b) Explain fixed point scaling transformation.
25. Explain 3D rotational transformation.
26. Write a note on polygon table.
27. (a) Explain rubber band method.
(b) Explain light pen.
Part – D
28. Explain ellipse generating algorithm
29. (a) Write a program to perform scaling transformation. Explain
with suitable example.
(b) Explain properties of line
30. Explain Sutherland and Hodgeman polygon clipping.
31. (a) Explain window to viewport transformation carried out.
(b) Write a program to draw a bar chart/
32. (a) Write a note on projections.
(b) Explain Octree.

Madhu
33. Explain Z buffer algorithm for hidden surface removal.
34. (a) Explain scan line method.
(b) Write a program to animate man walk umbrella.
Sep / oct 2021
Part – A
1. Define computer graphics.
2. What is a volatile image.
3. Expand TIFF
4. Define frame buffer.
5. What is skewing?
6. Define rotation?
7. Define clipping.
8. What is viewpoint?
9. Define segments.
10. What is oblique projection?
11. What is grid?
12. Mention the use of drawstring ().
Part – B
13. Write the applications of computer graphics.
14. Explain composite transformation.
15. With a diagram, give the concept of point clipping.
16. Explain backface removal algorithm
17. Explain window and viewport.
18. Write a note on Bezier curves.
19. Explain basic functions of segments

Madhu
Part – C
20. Explain the architecture of raster Scan display.
21. Explain shadow mask method.
22. Explain DDA line algorithm.
23. Briefly explain character attributes.
24. Write a note on polygon table.
25. What is sweep representation and explain its types.
26. Explain shear transformation in 2D and 3D transformation.
27. Explain parallel and perspective projection technique.
Part – D
28. Explain ellipse generating algorithm
29. (a) Write a program to perform scaling transformation. Explain
with a suitable example.
(b) Explain properties of line.
30. Explain Sutherland and Hodgeman polygon clipping.
31. Explain 3D transformations for
(a) Translation.
(b) Rotation.
32. (a) Explain Octree.
(b) Explain scan – line algorithm
33. Write a short note on:
(a) Joysticks
(b) Graphic tablet.
34. Write a program to draw a circle using Bresenham’s technique.

Madhu