0% found this document useful (0 votes)
13 views

CGR CHAPTERWISE QUESTION BANK[1]

Uploaded by

chowhanaayan1
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)
13 views

CGR CHAPTERWISE QUESTION BANK[1]

Uploaded by

chowhanaayan1
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/ 4

Marathwada Mitra

COMPUTER Mandal’s
GRAPHICS- CGR(22318) Polytechnic
CHAPTER WISE QUESTION BANK
Sr. No. 4/17, Thergaon, Pune-411033
(Approved by AICTE, DTE, MSBTE Mumbai)

Unit 1: Basics of Computer Graphics


1. Define pixel , resolution
2. Explain text mode and graphics mode
3. Explain basic graphics pipeline
4. Explain bitmap and vector based graphics
5. State applications of computer graphics
6. List different display devices
7. Explain raster scan display
8. Explain random scan display
9. Differentiate between random scan display and raster scan display
10. Explain LED and LCD display
11. Explain plasma and touch screen display
12. Explain different output primitives
13. Explain different graphics functions and standards
14. Explain latest trends in computer graphics
15. Explain virtual reality
16. Explain augmented reality

KAZI Course Co-ordinator: Mrs. Kshirsagar S.R.


A S M-9765645688
Marathwada Mitra
COMPUTER Mandal’s Polytechnic
GRAPHICS-CGR(22318)
CHAPTERWISE QUESTION
Sr. No. 4/17, Thergaon, BANK
Pune-411033
(Approved by AICTE, DTE, MSBTE Mumbai)

Unit 2: Raster Scan Graphics


1. Explain basic concepts in line drawing
2. Explain DDA line drawing algorithm
3. Explain Bresenham’s line drawing algorithm
4. Draw a line using DDA line drawing algorithm having starting point as(5,5)
and end point as (10,8)
5. Draw a line using Bresenham’s line drawing algorithm having starting point
as(1,1) and end point as (6,5)
6. Explain symmetry of circle
7. Explain Bresenham’s circle drawing algorithm
8. Explain midpoint circle drawing algorithm
9. Define polygon and explain types of polygon
10. Explain inside and outside test for polygon
11. What are different polygon filling methods
12. Explain algorithm for flood fill algorithm
13. Explain algorithm for boundary fill algorithm
14. Explain algorithm for scan line
15. Explain scan conversion
16. Explain frame buffers
17. Explain character generation methods

KAZI A S M-9765645688

Course Co-ordinator: Mrs. Kshirsagar S.R.


Marathwada Mitra
COMPUTER Mandal’s Polytechnic
GRAPHICS-CGR(22318)
CHAPTERWISE QUESTION
Sr. No. 4/17, Thergaon, BANK
Pune-411033
(Approved by AICTE, DTE, MSBTE Mumbai)

Unit 3: Overview of Transformation


1. Explain 2 –D transformation translation with example
2. Explain 2 –D transformation scaling with example
3. Explain 2 –D transformation rotation with example
4. Explain 2 –D transformation shearing with example
5. Explain 2 –D transformation reflection with example
6. Explain matrix representation and homogeneous coordinates for translation
7. Explain matrix representation and homogeneous coordinates for rotation
8. Explain matrix representation and homogeneous coordinates for scaling
9. Explain matrix representation and homogeneous coordinates for shearing
10. Explain matrix representation and homogeneous coordinates for reflection
11. Explain rotation about an arbitrary point
12. Explain 3 –D transformation for translation , rotation and scaling
13. Explain projection and state types of projection
14. Explain perspective projection
15. Explain parallel projection

KAZI A S M-9765645688
Course Co-ordinator: Mrs. Kshirsagar S.R.
Marathwada Mitra Mandal’s Polytechnic
COMPUTER GRAPHICS-CGR(22318)
CHAPTERWISE QUESTION BANK
Sr. No. 4/17, Thergaon, Pune-411033
(Approved by AICTE, DTE, MSBTE Mumbai)

Unit 4: Windowing and Clipping


1. What is windowing
2. What is clipping
3. Explain window to viewport transformation
4. What is line clipping
5. Explain Cohen Sutherland line clipping algorithm
6. Explain Cyrusberk ,- Liang – Barsky line clipping algorithm
7. Explain midpoint subdivision algorithm
8. What is polygon clipping
9. Explain Sutherland – Hodgeman polygon clipping algorithm
10. Explain text clipping in detail

Unit 5: Introduction to Curves


1. Explain arc generation using DDA algorithm
2. Explain Interpolation
3. What are different types of curves
4. Explain Hilbert’s Curve
5. Explain Koch curve
6. Explain B-Spline
7. Explain Bezier curve
8. Differentiate between Bezier curve and B-Spline
9. List properties of Bezier’s curve
10. List limitations of Bezier curve

KAZI A S M-9765645688

Course Co-ordinator: Mrs. Kshirsagar S.R.

You might also like