Scribd
Upload
105 views2 pages

Bca 33

This document contains an exam for a Computer Graphics course divided into three parts: Part A contains short answer and multiple choice questions about computer graphics topics like intensity cues, areas of computer graphics, windowing, projections, scan conversion, line drawing algorithms, and clipping algorithms. Part B contains longer answer questions requiring explanations about displaying pictures, CRT working, 2D transformations, mid-point subdivision, 3D displaying techniques, solid area scan conversion, and singularity algorithms. Part C asks students to explain 'C' graphics functions, Bresenham's line drawing algorithm with an algorithm, Sutherland-Hodgeman polygon clipping algorithm, positioning techniques and constraints, and briefly explain 3D transformations

Uploaded by

vigvelu
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
105 views2 pages

Bca 33

This document contains an exam for a Computer Graphics course divided into three parts: Part A contains short answer and multiple choice questions about computer graphics topics like intensity cues, areas of computer graphics, windowing, projections, scan conversion, line drawing algorithms, and clipping algorithms. Part B contains longer answer questions requiring explanations about displaying pictures, CRT working, 2D transformations, mid-point subdivision, 3D displaying techniques, solid area scan conversion, and singularity algorithms. Part C asks students to explain 'C' graphics functions, Bresenham's line drawing algorithm with an algorithm, Sutherland-Hodgeman polygon clipping algorithm, positioning techniques and constraints, and briefly explain 3D transformations

Uploaded by

vigvelu
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

*BCA13* BCA 33

III Semester B.C.A. Examination, May 2012


COMPUTER GRAPHICS
Time : 3 Hours Max. Marks : 80
Instructions : 1) Answer all questions in Part A, 6 out of 8 questions in
Part B and 3 out of 5 questions in Part C.
2) Part A : Questions from 1 to 8 carry 1 mark each and
9 to 14 carry 2 marks each.
3) Part B : Each question carries 5 marks.
4) Part C : Each question carries 10 marks.
PART A
1. What are intensity cues ?
2. Mention the areas of computer graphics.
3. Define windowing.
4. Which projection gives the most realistic view of the object ?
5. What is scan conversion ?
6. Why (y x) algorithm called so ?
7. What is the main difficulty of the scan line algorithm ?
8. State one method of improving the recursive efficiency of the Warnocks
algorithm.
9. List the qualities of good line drawing algorithms.
10. What are parametric equations ?
11. Give the equation that transforms co-ordinates to screen co-ordinates.
12. Give the concept of Kinetic depth effect.
13. Explain the concept of 4 bit assignment for clipping algorithm.
14. State Painters algorithm.
P.T.O.
BCA 33 *BCA13*
PART B
1. Explain the difficulties for displaying pictures.
2. Explain the working of CRT.
3. Write a program to demonstrate rectangles using put pixel and line.
4. Explain rotation and scaling in 2D transformations.
5. Give the algorithm for mid-point sub division method.
6. Explain the techniques for 3D displaying.
7. Explain the concept of solid area scan conversion.
8. Explain the algorithm for singularity.
PART C
1. Explain the C graphics functions.
2. With an algorithm, explain Bresenhams line drawing algorithm.
3. Explain Sutherland-Hodgeman polygon clipping algorithm.
4. Explain positioning techniques and positional constraints.
5. Briefly explain 3D transformations.
_______________

You might also like