SRM University 2007 B.Tech Computer Science and Engineering for COMPUTER GRAPHICS - Question Paper

1. What is DDA line drawing ? elaborate the condition involved in DDA line algorithm ?
2. How to generate circle by using polar co-ordinates ?
3. What is polygon filling ? elaborate various techniques available to fill polygon ?
4. What is meant by seed fill algorithm ? elaborate the kinds of seed fill ?
5. Write the boundary fill algorithm with four connected region .
6. Write the boundary fill algorithm with eight connected region .
7. Write the flood fill algorithm with four connected region .
8. Write the flood fill algorithm with eight connected region .
9. What are the disadvantage of seed fill algorithm ?
10. What is the use of flood fill algorithm ?
11. What is meant by clipping ? write the kinds of primitive clipping.
12. Mention the conditions to display a point.
13. What is region code in cohen-sutherland line clipping algorithm ?
14. What are the disadvantages of cohen-sutherland line clipping algorithm ?
15. Write the condition to clip a line in NLN line clipping algorithm .
16. Explain curve clipping procedures.
17. Write the techniques used for text clipping .
18. What is meant by exterior clipping. Write their uses.
19. Write about parallelogram rule.
20. Define affine space
21. What is valuation of plan in affine space?
22. What is linearly dependent?
23. Define orthogonal basis
24. Define Eigen values and Eigen vector.
25. Write a formula for finding a root of any function using Newton Raphson method.
26. Define vector space.
27. Define linear subspace.
28. Write any 2 property of dot product.
29. Write the angle ranging from vectors V and W.
30. What is the length of the vector? obtain the normalized vector

4
3
0
PART-B

1. Explain DDA line drawing algorithm.
2. Explain Bresenham’s line drawing algorithm.
3. Explain mid point circle drawing algorithm.
4. Explain mid point ellipse algorithm.
5. What is polygon filling ? How it is done by scan method ?
6. Explain Cohen Sutherland line clipping algorithm.
7. Explain Liang-Barskey line clipping algorithm.
8. Explain NLN line clipping algorithm.
9. Draw the flow chart to clip a polygon and discuss the procedure.


UNIT III
PART A

1. What is Data Glove?
2. Classify locator devices based on their characteristics.
3. What is BITs?
4. What is position interaction task?
5. What is selection interaction task? elaborate the ways to choose the objects?
6. What is text interaction task?

Earning:   Approval pending.