20CS8908-CG QB Updated

Course Code-Course Name Department Semester
20CS8908 & COMPUTER GRAPHICS CSE VIII
Question Bank Course

BTL Level Outcomes
List the applications of computer graphics. 1 1
Develop a line from (10,12) to (15,15) on a raster screen using Bresenham’s straight line algorithm 3 1
Differentiate between random scan system and raster scan system. 2 1

Analyze DDA line drawing algorithm with an example. 4 1
Determine how shadow mask method works with an example. 3 1
What do you mean by emissive and non-emissive displays? 1 1
Differentiate bitmap and pixmap. 2 1
Analyze how Persistence differ from Resolution with an example. 4 1
Describe the properties of ellipse. 2 1
Examine the output primitives of point and line. 4 1
What do you mean by scan conversion? 1 1
What is the difference between Bresenham’s and DDA line drawing Algorithm 2 1
Identify the nature of line primitive in graphics with line drawing algoriuthm. 4 1
Compare pixel addressing and object geometry. 3 1
Define pixel. 1 1
Construct the important factor to be considered for the filled area primitives. 3 1
Analyze and explain refresh cathode ray tube working principle with a neat diagram. 4 1
Explain in detail about the video display devices and construct the working model of the display 3 1
devices.
Compare and Examine about raster and random scan systems in detail. 4 1
Examine the primary function of a video display device in computer graphics. How does a 3 1
cathode ray tube (CRT) display work?
Describe a scenario where a raster scan system would be preferred over a random scan system for
3 1
displaying graphics, and justify your choice.
Explain the basic concept of Bresenham line drawing algorithm. Derive the decision parameter
for the algorithm and Rasterizise the following points using Bresenhams line algorithm (20,10) 3 1
and (30,18).
Summarize the Midpoint circle drawing algorithm. Draw a circle with 10 cm as the radius and co-
4 1
ordinate origin as the centre of the circle.
Apply the concepts of filled area primitives with example and Explain in detail. 3 1
Pixel addressing is a fundamental aspect of computer graphics, essential for rendering images on
displays. Explain pixel addressing in computer graphics comprehensively, covering its principles, 3 1
techniques, challenges, and applications.
Explain object geometry and filled area primitives in detail, covering their definitions, analyze the
4 1
properties, types, algorithms for rendering, and applications in various domains.
Define Geometric Transformations. 1 2
Construct the transformation equation and matrix representation for 2D translation. 3 2
Distinguish between window port & view port 2 2
Demonstrate 2D scaling transformation with an example. 3 2
Distinguish between Shearing and Reflection with an example. 2 2
Analyze the different types of viewing effects with an example. 4 2
Examine the “Shear” transformation with the parametric equations. 4 2
Write the matrix representation for Rotation. 1 2
Develope Mesh Model with an example. 3 2
Compare parallel and perspective projections with real time applications. 4 2
Sketch the significance of windowing in two-dimensional viewing functions. 3 2
Determine the viewing coordinate reference frame in computer graphics. 2 2
Define clipping and Analyze point clipping with line clipping for any example of your own. 4 2
Determine the need of homogeneous coordinates with its axis representation. 3 2
How will you clip a point? 1 2
Discuss about viewing transformation with an example. 2 2
With suitable examples,explain the following,

(i) 2D Translation Transformation 3 2
(ii) 2D Rotational Transformation
Explain 2D scaling and Reflection transformation with

example and Obtain a transformation matrix for rotating an object about a
3 2
specified pivot point.
Explain the two-dimensional viewing pipeline in detail, covering its stages, processes, algorithms,
3 2
and significance in rendering two-dimensional images.
Explain the window-to-viewport coordinate transformations.Analyze the challenges associated
4 2
with window-to-viewport transformations with an example.
Analyze the challenges associated with two-dimensional viewing functions and propose strategies
4 2
for optimizing their performance.
Explain Sutherland Hodgeman polygon clipping. 3 2
Explain with an example the Cohen-Sutherland line clipping algorithm. 3 2

Compare Cohen-Sutherland line clipping algorithm and Liang-Barsky line clipping 4 2
algorithm.
How would you analyze and implement the Cohen-Sutherland clipping algorithm to ensure that
only the visible portions of objects are displayed within the viewport? Discuss the advantages and 4 2
limitations of this algorithm in the context of architectural design.
Analyze in detail about,
(i) 2D viewing pipeline 4 2
(ii) 2D Window to viewport coordinate
Transformations
What are the various representation schemes used in three dimensional objects? 1 3
What is Polygon mesh? 1 3
Construct B-Spline curve with an example. 3 3
What are the different ways of specifying spline curve? 1 3
Give the general expression of Bezier Bernstein polynomials 1 3
Explain the important properties of Bezier Curve. 3 3
Compare interpolation spline and approximation spline and determine its parametric equations. 4 3
What is a Blobby object? Examine its properties with its significance. 4 3
Explain the following,
(i) Basic 3D transformations 3 3
(ii) Three dimensional concepts
Summarize the following ,
(i) 3D object representations 4 3
(ii) 3D scaling Transformations
Discuss in detail about the parallel and perspective Projections.
3 3
Examine in detail about,

(i) Bezier curves and surfaces
4 3
(ii) B spline curves and surfaces
Explain in detail about the Quadratic surfaces and apply the concept for any real time example. 3 3
IM/DM Level
DM L2
Marks Part
2 1
2 1
2 1
2 1
2 1
2 1
2 1
2 1
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
16 1
16 1
16 1
16 1
16 1
16 2
16 2
16 2
16 2
16 2
2 1
2 1
2 1
2 1
2 1
2 1
2 1
2 1
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
16 1
16 1
16 1
16 1
16 1
16 2
16 2
16 2
16 2
16 2
2 1
2 1
2 1
2 1
2 1
2 1
2 1
2 1
16 1
16 1
s
16 1
16 1
16 1
Department : CSE
Semester : VII
20CS7102- FOUNDATION OF DATA
Course Code-Course NSCIENCE

20CS8908-CG QB Updated

Uploaded by

Copyright:

Available Formats

20CS8908-CG QB Updated

Uploaded by

Document Information

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

20CS8908-CG QB Updated

Uploaded by

Copyright:

Available Formats

Course Code-Course Name Department Semester

20CS8908 & COMPUTER GRAPHICS CSE VIII

Question Bank Course

Differentiate between random scan system and raster scan system. 2 1

Compare pixel addressing and object geometry. 3 1

With suitable examples,explain the following,

Explain 2D scaling and Reflection transformation with

Explain with an example the Cohen-Sutherland line clipping algorithm. 3 2

Examine in detail about,

You might also like