Question1. Write the process for thick line by using BRESENHM’s algorithm.
Question2. Write concise notes on Two Dimensional Viewing and Clipping.
Question3. Describe about Hidden Surface Algorithm.
Question4. Show why the Sutherland –Hodgman clipping algorithm will only work for convex clipping regions.
Question5. Describe Top down Programming by Using Knight tour algorithm.
Question6. Write concise note on Hill-Climbing and Working Backward?
Question7. Write the algorithm for binary search provide an example?
Question8. Describe Traveling Salesman Problem for five-city network.