Question Bank – Computer Graphics
Unit 1
Basics of Computer Graphics
1. Define computer graphics.
2. Define terms: Image, Object, Pixel, Resolution.
3. List and explain applications of computer graphics.
Display Devices
1. Explain CRT with neat diagram.
2. Explain Raster Scan display
3. Explain Random Scan Display
4. Differentiate between Random scan and Raster Scan.
5. Describe working principal of flat panel display.
6. Describe the working principal of LED display.
7. Describe working principal of LCD display.
8. Describe working principal of plasma display.
9. Describe the working of LCD.
Graphics functions and standards
1. List three basic primitive functions and explain any one of it.
2. Explain text mode graphics function used to display the string 'Hello' at some specified location
in specific color with its syntax.
3. How to initialize graphics mode of your display system?
4. Write a C code to display a single pixel on screen.
5. Write a C program to draw rectangle and circle on screen.
6. Write a C program to draw a triangle using line commands on screen.
7. Describe the command used to color a given shape with its syntax.
8. Write a C code to draw a polygon and then fill it with yellow color.
9. What is the need of closegraph() function in graphics program?
10. Explain any three graphics standards.
11. What is the need for coordinate systems? Describe various coordinate systems
12. Write a short note on Cartesian coordinate systems.
13. Write a short note on Polar coordinate systems
14. Describe various graphics functions.
Advanced Topic
1. Discuss virtual reality system.
2. Describe various components of virtual reality
3. List and describe the types of VR systems.
4. List and discuss the types of Augmented Reality systems
5. Describe applications of virtual reality and augmented reality.
Unit 2
Basic Concepts in Line Drawing
1. Define the following terms: Point, Rasterization.
2. How to draw a line using slope-intercept formula?
3. State the characteristics of an ideal line.
4. Enlist three methods of line representation.
5. What do you mean by scan conversion of line?
Digital Differential Analyzer (DDA) Line Drawing Algorithm
1. Explain DDA line drawing algorithm.
2. Enlist merits and demerits of DDA line drawing algorithm.
3. Mention the steps to draw line with |m| > 1 using DDA line drawing algorithm.
4. Write an algorithm for DDA line drawing algorithm.
5. Calculate the pixel coordinates of line AB using DDA algorithm, where A = (0,0) and B = (6,8).
6. Draw a line from A(2,3) to B(7,9) using DDA line drawing algorithm.
7. Write C code to scan convert the line using DDA algorithm.
Bresenham’s Line Drawing Algorithm
1. Explain Bresenham’s line drawing algorithm. Derive decision parameters.
2. Mention the steps to draw line using Bresenham’s method.
3. State advantages and disadvantages of Bresenham’s line drawing approach.
4. Write a function Bresenham Line(x1, y1, x2, y2, type) so it draws a line with specified type. If
type = 0, solid line; type = 1, dashed line; and type = 2, dotted line.
5. Calculate the pixel coordinates of line PQ using Bresenham’s algorithm where P = (20,20) and Q
= (10,12).
6. Write an algorithm for Bresenham’s line drawing algorithm.
7. Differentiate DDA vs. Bresenham’s line drawing algorithm.
8. Write C code to scan convert the line using Bresenham’s algorithm.
Circle Generation Algorithms
1. Derive equations of decision parameter for Bresenham’s circle drawing algorithm.
2. Write the steps for Bresenham’s circle generation algorithm.
3. Write an algorithm for Bresenham’s circle drawing algorithm.
4. Plot a circle using Bresenham’s algorithm for r = 5 and center at (0,0).
5. Write a program to scan convert the circle using incremental approach.
6. Write a program to scan convert the circle using Bresenham’s circle generation algorithm.
7. Write the steps for Mid Point circle generation algorithm.
8. Plot a circle using Mid Point algorithm for r = 10 and center at (0,0).
Polygon Filling Algorithms
1. What is polygon? Explain various types of polygon.
2. Explain inside-outside test to check the membership of pixel with respect to given polygon.
3. Describe odd-even method with suitable example.
4. Explain winding number rule method.
5. Explain boundary fill Algorithm
6. Write a C code for boundary fill Algorithm
7. Explain flood fill Algorithm.
8. Write a C code for flood fill Algorithm.
9. Write an algorithm for flood fill.
10. State the advantages and disadvantages of seed fill algorithms.
11. Explain scan line polygon filling algorithm
12. Differentiate Seed fill and scan line algorithm
