University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination: Nov - 2011 Subject Code: PK6B Semester: IV Year: Second Year Time: Three hours Maximum: 100 Marks Part - A (10 * 3 = 30 Marks)
Answer any TEN questions All questions carry equal marks. Each answer should not exceed 50 words 1. Define: Aspect Ratio.
2. Write a note on: Joysticks. 3. What are character attributes? 4. Define: Inquiry functions. 5. Write a note on: Paint Clipping. 6. What are stroke devices? 7. Define Dragging. 8. Define Perspective Projection. 9. Write short note on: Depth Cueing. 10. What is 3D scaling? 11. What is z-buffer method? 12. What are image-space methods? Part - B (5 * 6 = 30 Marks) .
Answer any FIVE questions All questions carry equal marks . Each answer should not exceed 200 words 13. Discuss briefly about Hard Copy Devices.
14. Write short notes on: DDA Line Drawing Algorithm. 15. Discuss about various Line Attributes. 16. Write about 2D Basic Transformation. 17. Discuss about Logical classification of Input Devices. 18. Write short notes on: Parallel projection. 19. Discuss briefly about viewing pipeline. Part - C (4 * 10 = 40 Marks). Answer any FOUR questions All questions carry equal marks. Each answer should not exceed 500 words 20. Explain about Raster Scan Systems.
21. Discuss in detail, Midpoint Circle Generation Algorithm. 22. Explain about 2D composite transformation. 23. Discuss about interactive picture construction methods. 24. Describe in details, 3D transformation. 25. Explain about scan-line method for visible-surface detection University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination: Nov - 2011 Subject Code: SAZ4C Semester: IV Year: Second Year Time: Three hours Maximum: 100 Marks Section - A (10 * 2 = 20 Marks).
Answer any TEN questions All questions carry equal marks . Each answer should not exceed 50 words 1.List out the video display devices.
2.Write down the any four application area of computer graphics. 3.Define DDA. 4.What are line attributes? 5.What are inquiry functions? 6.What is translation? 7.Give the additional transformation available in 2D. 8.What is composite transformation? 9.What is parallel projection? 10.What is Polygon? 11.What is 3D? 12.What are methods used for hidden surface and hidden line elimination? Section - B (5 * 5 = 25 Marks).
Answer any FIVE questions All questions carry equal marks . Each answer should not exceed 200 words 13. Write about notes on computer graphics.
14. What are hard copy devices? Explain any one. 15. What is circle generating algorithm? Explain any one. 16. What are all the character attributes? Describe. 17. Explain the logical classification of input devices. 18. Explain depth cueing. 19. Discuss between object and image space method. Section - C (3 * 10 = 30 Marks) .
Answer any THREE questions All questions carry equal marks . Each answer should not exceed 500 words 20. Describe about random scan display system.
21. Explain the basic 2D transformation with matrix representation. 22. Explain Sutherland Hodgeman polygon clipping with its algorithm. 23. Explain scaling and translation with respect to 3D objects. 24. Describe in detail about the depth buffer method to detect visible surfaces. University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination: April - 2009 Subject Code: PK6B Semester: IV Year: Third Year Time: Three hours Maximum: 100 Marks Part - A (10 * 3 = 30 Marks) .
Answer any TEN questions All questions carry equal marks Each answer should not exceed 50 words 1. Write short notes on: Frame Buffer.
2. What are impact printers? 3.Write a note on: polyline() function. 4. What are Color Tables? 5. Define: Translation. 6. What is meant by Reflection. 7. Distinguish between a window and a viewport. 8. Write a note on: Point Clipping. 9. What are Locator Devices? 10. Define: Parallel Projection. 11. What is meant by center of projection? 12. What are object-space methods? Part - B (5 * 6 = 30 Marks) .
Answer any FIVE questions All questions carry equal marks Each answer should not exceed 200 words 13. Write short notes on: Random-Scan systems.
14. Discuss briefly about Hard-Copy Devices. 15. Write about Line Attributes. 16. Discuss the following Two-Dimensional Transformations (a) Rotation (b) Scaling 17. Write short notes on: Text Clipping. 18. Discuss briefly about perspective projection. 19. Write the steps of a Depth-buffer Algorithm. Part - C (4 * 10 = 40 Marks) .
Answer any FOUR questions All questions carry equal marks . Each answer should not exceed 500 words 20. Explain about Video Display Devices.
21. Discuss in detail, Bresenham's Line-Drawing Algorithm. 22. Describe about Various Character Attributes. 23.Explain about Interactive Picture-Construction Techniques 24. Explain any two three dimensional transformations. 25.Describe in detail, scan-line method for Hidden Surface Removal. University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination:Nov-2009 Subject Code: PK6B Semester: VI Year: Third Year Time: Three hours Maximum: 100 Marks Part - A (10 * 3 = 30 Marks) .
Answer any TEN questions All questions carry equal marks . Each answer should not exceed 50 words 1. List the advantages and dis-advantages of DVST.
2. Discuss about coordinates representation. 3.What are line attributes? Give examples. 4. What is Grayscals? 5. What is shear in 2D graphics? 6. Explain the concept of flood-fill algorithm. 7. Explain the transformation principles. 8. Explain the purpose of Dragging. 9. What is the use of stroke devices? Explain. 10. What is perspective projection? 11. Distinguish between object space and image space. 12. What is depth queuing? How is it done? Part - B (5 * 6 = 30 Marks) .
Answer any FIVE questions All questions carry equal marks . Each answer should not exceed 200 words 13. Describe the working of any one interactive input device.
14. Explain CRT with neat diagram. 15. Explain any three character attribute functions. 16. Discuss about window-to-view port coordinate transformation. 17. Explain the rubber band techniques. 18. Discuss about reflections and shears transformations in 3D graphics. 19. Explain the depth-buffer method. Part - C (4 * 10 = 40 Marks) .
Answer any FOUR questions All questions carry equal marks. Each answer should not exceed 500 words. 20. Explain about Raster-Scan display device with neat diagram.
21. Explain the Breshenham's line-drawing Algorithm. 22. Discuss about Pattern Fill in and Soft Fill. 23. Explain Cohan-Sutherland line clipping algorithm. 24. Explain any one method of rotations possible on a three dimensional object. 25. Describe the back-face remove method in detail. University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination: April 2008 Subject Code: PK6B Semester: VI Year: Second Year Time: Three hours Maximum: 100 Marks Part - A (10 * 3 = 30 Marks) . Answer any TEN questions All questions carry equal marks . Each answer should not exceed 50 words 1. Define frame buffer, pixel, and bitmap.
2. Differentiate the two categories of flat-panel displays. 3. What is the logic behind the dot-matrix print head? 4. What is Grayscale? 5. Write any three character-attributes with an example. 6. State the purpose of inquiry functions. 7. Distinguish between window and viewport. 8. List the six types of logical classification of input devices. 9. What is surface rendering? 10. What is depth queuing? 11. Distinguish between object space and image space. 12. State the basic functions of the painter's algorithm. Part - B (5 * 6 = 30 Marks) .
Answer any FIVE questions All questions carry equal marks . Each answer should not exceed 200 words 13. Explain the two basic techniques for producing color displays with a CRT.
14. Write the Midpoint circle algorithm. 15. Explain the basic 2D transformations. 16. Explain the rubber band techniques. 17. How reflection and shearing transformations in 3D graphics are achieved? 18. Explain three-dimensional and stereosocpic views. 19. Explain the depth-buffer method. Part - C (4 * 10 = 40 Marks) .
Answer any FOUR questions All questions carry equal marks . Each answer should not exceed 500 words 20. Discuss about five graphics applications.
21. Explain the organization of a simple Raster-scan system with neat diagram. 22. Discuss about area-fill attributes. 23. Describe the Sutherland-Hodgman polygon clipping algorithm. 24..Explain the basic 3D transformations with their matrix representation. 25. Discuss about parallel and perspective projection. University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics Month & Year of Examination: 2007
Subject Code: PK6B Semester: IV Year: Third Year Time: Three hours Maximum: 100 Marks SECTION A (15 X 2 = 30).
ANSWER ALL THE QUESTIONS 1. What is DVST?
2. What is meant by Scan Conversion?. 3. What is Boundary fill? 4. List the line attributes. 5. What is pixel phasing? 6. What is shearing? 7. What is a view port?. 8. Where can be exterior clipping applied? 9. Define depth cueing. 10. Define cabinet projection. 11. Define perspective projection. 12. Define isometric projection. 13. What do you mean by octree method? 14. Give the visibility detection functions. 15. Define chromaticity. SECTION B (6 X 5 = 30).
ANSWER ANY SIX QUESTIONS 16. What is a touch panel? Explain the working of a touch panel.
17. Explain the processing of a CRT. 18. Explain pixel phasing and filtering techniques. 19. Describe scaling and its type. 20. What is line clipping? Give the Liang-Barsky Line clipping algorithm. 21. Describe 3D scaling. 22. Explain Rotations with Quaternion. 23. Explain BSP – tree method. 24. Explain goal directed systems. SECTION C (4 X 10 = 40). ANSWER ANY FOUR QUESTIONS 25. Explain in detail DDA line drawing algorithm.
26. Discuss in detail the various techniques used for Antialiasing. 27. Give the C program to perform a two-dimensional translation. 28. How will you clip a polygon using Sutherland – Hodgeman polygon clipping algorithm? 29. Explain 3-Dimensional rotation in detail. 30. Explain the scan line method. University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination: 2006 Subject Code: Semester: Year: Time: Three hours Maximum: 100 Marks Section - A (10 * 2 = 20 Marks) . Answer ALL questions All questions carry equal marks 1. Write the equation of line segment with the end points (x1,y1) and (x2,y2)
2. Define aspect ratio of video monitor. 3. What are homogeneous coordinates? 4. What are the attributes of a segment? 5. What is meant by clipping? 6. What is a region code in clipping? 7. Compare parallel projection and perspective projection. 8. Represent perspective transformation in matrix form use 3D homogeneous coordinate 9. Differentiate point source and distributed light source. 10. In RGB color model, define colors blue, magenta, white and yellow. Section - B (5 * 7 = 35 Marks) . Answer ALL questions All questions carry equal marks 11. (a) Write equations to define polygon planes and to identify inside and outside points.
(Or) (b) With an example, explain the representation of polygon using polygon table. 12. (a) Explain the transformations translation and scaling. Write the transformed coordinates and give a suitable diagram for illustration. (Or) (b) What are segment files? Explain its organisation for a random scan system. 13. (a) Explain point clipping with an example. (Or) (b) Explain mapping of a point in a window to a viewport. 14. (a) Represent the following 3D object by vertex, edge and polygon surface tables. Explain the representation. -- DIAGRAM-- (Or) (b) Explain 3D clipping. 15. (a) What is phong shading? Explain. (Or) (b) Explain HLS color model. Section - C (3 * 15 = 45 Marks) .
Answer any THREE questions All questions carry equal marks 16. Write Bresenham's algorithm. Illustrate drawing a circle. How do you extend it to draw ellipses?
17. Explain how the square shown in fig. (i) can be transformed to shapes in figure (ii), (iii) and (iv). Write the transformation matrix in each case. -- DIAGRAM-- 18. Illustrate line clipping using Cohen and Sutherland algorithm. 19. Explain how (a) translation (b) scaling (c) rotation can be performed on 3D objects. Write their transformation matrix. 20. Explain how halftoning method can be used to furnish intensity variations in a scene. How can this method used to accomplish dithering? University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination: April - 2011 Subject Code: SAZ4C Semester: IV Year: Second Year Time: Three hours Maximum: 100 Marks Section - A (10 * 2 = 20 Marks) .
Answer any TEN questions All questions carry equal marks . Each answer should not exceed 50 words 1. Draw the diagram of CRT.
2. Write the classification of Graphics software. 3. What are character attributes? 4. Define Inquiry functions. 5. Define a window. 6. Define the term modeling. 7. Write about any one logical input device. 8. Define Grid. 9. What is B-reps. 10. What are 3D transformations? List out. 11. Write the name of any two image space method. 12. Explain the need for removing hidden surface. Section - B (5 * 5 = 25 Marks) .
Answer any FIVE questions All questions carry equal marks . Each answer should not exceed 200 words 13. Explain about Random scan display systems.
14. Describe about midpoint circle algorithm. 15. Write short notes on Gray scale levels. 16. What is composite transformation? Explain. 17. What is clipping. Explain any one type of clipping. 18. Explain the three dimensional Graphics packages. 19. How to view a 3D object? Section - C (3 * 10 = 30 Marks) .
Answer any THREE questions All questions carry equal marks . Each answer should not exceed 500 words 20. Explain any four input devices.
21. How to perform flood fill using the algorithm? Explain. 22. Explain shear and reflection transformations. 23. What are polygon surfaces? Explain with its polygon table. 24. Discuss on depth buffer algorithm. University of Madras
Chepauk, Chennai - 600 005. Bachelor of Computer Application Subject Name: Computer Graphics
Month & Year of Examination: 2006 Subject Code: Semester: Year: Time: Three hours Maximum: 100 Marks PART A - (10 x 3 = 30 marks).
Answer any TEN questions. All question carry equal marks. Each answer should not exceed 50 words. 1. List any three video display devices.
2. Describe the role of keyboard on a graphics system. 3.Write about PRIGS. 4. Discuss line types available as line attributes. 5. List out any three character attributes. 6. Define the transformation scaling in 2 dimensions. 7. Write a note on : 2 dimensional viewing pipeline. 8. Define clipping. Give an example. 9. Give the logical classification of input devices. 10. What is meant by parallel projection? 11. Define: 3 dimensional translation. 12. Write a note on: the back-face detection method. PART B - (5 x 6 = 30 marks). Answer any FIVE questions. All questions carry equal marks. Each answer should not exceed 200 words. 13. Write a note on hard copy devices.
14. Write and explain DDA line drawing algorithm. 15. List and explain area-fill attributes. 16. Obtain the matrix corresponding to two dimensional rotation. 17. Explain the benefit of interactive picture construction techniques by giving one such method. 18. Explain the transformation from world to viewing coordinates. 19. Explain 3 dimensional reflection through an example. Part - C (4 * 10 = 40 Marks) .
Answer any FOUR questions All questions carry equal marks . Each answer should not exceed 500 words 20. Write and explain midpoint circle generating algorithm. Give an example.
21. Write a detailed note on colour and grayscale levels. 22. Explain the concept of composite transformation for representing any given transformation as composite of standard transformation. 23. Write and explain Cohen - Sutherland line clipping algorithm. 24. Write a detailed note on three-dimensional display methods. 25. Write and explain the depth-buffer method for hidden surface detection. |
- Home
-
C Language
- C++
- Java
-
B.C.A
- Subject Details
- COBOL
- Digital Logic Fundamentals
- Fundamental of Digital Computers
- Microprocessor and its applications
- Programming in C
- Computer Graphics
- Operating System
- Programming in C++ and Data Structures
- DBMS
- Programming in Java
- Data Communication and Networking
- Software Engineering
- Software Testing
- Web Technology
- Elective - I >
- Elective - II >
- Elective - III >
- Maths Questions >
- English
-
B.Sc
- B.Sc (Cs) Subject Details
- Computer Architecture and Organization
- Digital Electronics and Microprocessor
- Data Structure Using C++
- Microprocessor and Its Applications
- Programming in C
- Programming in C++ and Data Structures
- Programming in Java
- Visual Programming
- Operating System
- DBMS
- Software Engineering
- Data Communication and Networking
- Software Testing
- Web Technology
- Computer Networks
- OOAD
- Multimedia Systems
- M.C.A
- M.Sc (CS)
- M.Sc (IT)
- Conduct Us
- Programming Language
- Programming Logic
- Computer Terms
- Job Selection Process
- Learn English Using Tamil
- Spoken English in Tamil
- Conversational Tamil
- English
- Interview