Exam Details
| Subject | computer graphics | |
| Paper | ||
| Exam / Course | b.sc. (cs)/b.sc. (cs) (lateral) | |
| Department | ||
| Organization | Alagappa University Distance Education | |
| Position | ||
| Exam Date | May, 2018 | |
| City, State | tamil nadu, karaikudi |
Question Paper
DISTANCE EDUCATION
B.Sc. B.Sc. (Computer Science) (Lateral) DEGREE
EXAMINATION, MAY 2018.
COMPUTER GRAPHICS
(2007 Onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
1. Write in detail about I/O devices used in graphics
with neat diagram.
Explain Bresenham's line drawing algorithm in
detail.
2. Discuss different region filling techniques in detail.
Write in detail about circle drawing algorithm.
3. Describe 2D basic transformations in detail.
Explain Sutherland Hodgeman polygon clipping in
detail.
4. Write window to viewport transformation in detail.
Explain 3D rotation and 3D reflection in detail.
Sub. Code
31
DE-3617
2
sp3
5. Discuss in detail about 3D Cohen Sutherland line
clipping algorithm.
Describe depth buffer algorithm and its limitations
in detail.
6. Explain 3D viewing in detail.
Write in detail about depth comparisons.
7. Explain the components of user interface in detail.
Describe user's model with an example.
8. Write short notes on the following
Aspect ratio.
Composite transformation.
Clipping against a finite view volume.
B.Sc. B.Sc. (Computer Science) (Lateral) DEGREE
EXAMINATION, MAY 2018.
COMPUTER GRAPHICS
(2007 Onwards)
Time Three hours Maximum 100 marks
Answer any FIVE questions.
All questions carry equal marks.
1. Write in detail about I/O devices used in graphics
with neat diagram.
Explain Bresenham's line drawing algorithm in
detail.
2. Discuss different region filling techniques in detail.
Write in detail about circle drawing algorithm.
3. Describe 2D basic transformations in detail.
Explain Sutherland Hodgeman polygon clipping in
detail.
4. Write window to viewport transformation in detail.
Explain 3D rotation and 3D reflection in detail.
Sub. Code
31
DE-3617
2
sp3
5. Discuss in detail about 3D Cohen Sutherland line
clipping algorithm.
Describe depth buffer algorithm and its limitations
in detail.
6. Explain 3D viewing in detail.
Write in detail about depth comparisons.
7. Explain the components of user interface in detail.
Describe user's model with an example.
8. Write short notes on the following
Aspect ratio.
Composite transformation.
Clipping against a finite view volume.
Other Question Papers
Subjects
- application programs
- computer graphics
- internet programming
- lab ii — (c++ programming)
- lab iii — application programs
- lab iv (visual basic and oracle)
- lab v — java programming
- object oriented programming and c++
- operating systems
- rdbms
- visual programming