Exam Details
Subject | computer graphics | |
Paper | ||
Exam / Course | b.c.a./b.c.a. (lateral) | |
Department | ||
Organization | Alagappa University Distance Education | |
Position | ||
Exam Date | May, 2018 | |
City, State | tamil nadu, karaikudi |
Question Paper
DISTANCE EDUCATION
B.C.A./B.C.A. (Lateral) DEGREE EXAMINATION, MAY 2018.
COMPUTER GRAPHICS
(2003 Onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
x 20 100)
1. With neat diagram, explain the working principle of a
cathode ray tube.
2. Write about simple DDA algorithm that is used for
line generation.
Explain the procedure of generating a circle with
circle generation algorithm.
3. What is concatenation? Illustrate and explain with
matrix representations.
Discuss on two dimensional rotational
transformation in detail.
4. Narrate the procedure of window-to-view port
transformation principle.
Elucidate the Sutherland-Hodgeman polygon
clipping algorithm.
Sub. Code
25
DE-3583
2
sp3
5. Explain the Cohen-Sutherland line clipping technique
with program segment.
6. Write notes on the following three dimensional
transformations principles.
Translation
Rotation
Mirror reflection.
7. Discuss the following mechanisms
Z-buffer algorithm.
Hidden surface elimination algorithm.
8. Summarize the following user interface design concepts
User's model.
Command language.
Information display.
B.C.A./B.C.A. (Lateral) DEGREE EXAMINATION, MAY 2018.
COMPUTER GRAPHICS
(2003 Onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
x 20 100)
1. With neat diagram, explain the working principle of a
cathode ray tube.
2. Write about simple DDA algorithm that is used for
line generation.
Explain the procedure of generating a circle with
circle generation algorithm.
3. What is concatenation? Illustrate and explain with
matrix representations.
Discuss on two dimensional rotational
transformation in detail.
4. Narrate the procedure of window-to-view port
transformation principle.
Elucidate the Sutherland-Hodgeman polygon
clipping algorithm.
Sub. Code
25
DE-3583
2
sp3
5. Explain the Cohen-Sutherland line clipping technique
with program segment.
6. Write notes on the following three dimensional
transformations principles.
Translation
Rotation
Mirror reflection.
7. Discuss the following mechanisms
Z-buffer algorithm.
Hidden surface elimination algorithm.
8. Summarize the following user interface design concepts
User's model.
Command language.
Information display.
Other Question Papers
Subjects
- business communication
- computer graphics
- internet and java programming
- lab ii – (c++ and ms office)
- lab iii — oracle and visual basic
- management principles and techniques
- micro processors and personal computers
- object oriented programming and c++
- office automation
- rdbms
- systems analysis and design
- windows and visual basic