Scribd
Upload
9 views2 pages

Question Bank

Uploaded by

Princy
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
9 views2 pages

Question Bank

Uploaded by

Princy
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/ 2

QUESTION BANK

1. Describe the construction and working of liquid crystal display with proper diagram along
with its advantages and disadvantages.
2. Explain Plasma Display Device.
3. What do you mean by “Windowing” and “Clipping.”
4. Write a program to draw a rectangle using open GL.
5. Differentiate between Random Scan display and Raster Scan display.
6. If a line is drawn from (2,3) to (6,15) with use of DDA. How many points will needed to
generate such line?
7. Explain the Boundary fill Algorithm with suitable example.
8. Explain in detail the Cohen-Sutherland line clipping algorithm with an example.
9. Write Bresenham’s line drawing algorithm and use it to draw a line from (1,1) to (8, 7).
10. What is OpenGL and what are its primary applications in the field of computer graphics?
11. What is the purpose of clipping in computer graphics?
12. Calculate the value of pixels, which is scan converted by DDA algorithm and end point of line
is (4, – 4) and (– 3, 1).
13. Write a short note on Plotter.
14. Explain Line clipping algorithm with example.
15. Explain Mid-point circle drawing algorithm.
16. Explain the Flood-Fill Algorithm with suitable example.
17. Explain Bresenham line draw algorithm. Plot a line by using Bresenham line generating
algorithm from (1, 1) to (5, 3).
18. Explain DDA line drawing algorithm. What are the advantages of Bresenham’s algorithm
over DDA line generating algorithm?
19. Define Computer graphics and discuss its application.
20. Reflect the diamond shape polygon whose vertices are A (– 1, 0), B (0, – 2), C (1, 0) and D (0,
2) about:
(i) horizontal line Y = 2 (ii) Vertical line X = 2
21. Differentiate between Raster scan system and Random scan system.
22. Explain the principle of working of CRT.
23. What do you mean by clipping? Explain inside test.
24. Differentiate between the working of plasma display and LCD.
25. Differentiate between Boundary fill algorithm and Flood fill algorithm.
26. Write in brief about scan line fill algorithm. Explain with example.
27. Define vector representation.
28. Write a program to draw a rectangle using open GL.
29. Define point clipping.
30. Write a program to draw a line using DDA algorithm.
31. Draw a circle using Mid-point circle drawing algorithm with a radius of 10 and centre of circle
at (0, 0).
32. Explain the Floodfill Algorithm with suitable example.
33. Use Cohen-Sutherland algorithm to clip two lines P1(40, 15) – P2(75, 45) and P3(70, 20) –
P4(100, 10) against a window A (50, 10), B (80, 10) , C (80, 40) and D (50, 40).
34. Explain the role of Computer Graphics in today’s life.
35. Demonstrate plasma display in detail.
36. Explain down the 2 disadvantages of DDA Line Drawing Algorithm over the Bresenham’s.
37. Differentiate Inkjet printer and Laser Printer.
38. Input the coordinate of starting and ending point of a line as (200, 250) and (300, 450) and create a
line using Bresenham Line Drawing Algorithm in between them using C Programming.
39. Design a program to fill a polygon using Flood filling algorithm.
40. Distinguish between seed filling and scan line-filling algorithm. Apply any of these algorithms to
fill the polygon defined by (1, 1), (1, 5) and
(5, 2).

You might also like