problem1. prepare the process for thick line by using BRESENHM’s algorithm.
problem2. prepare concise notes on Two Dimensional Viewing and Clipping.
problem3. Describe about Hidden Surface Algorithm.
problem4. Show why the Sutherland –Hodgman clipping algorithm will only work for convex clipping regions.
problem5. Describe Top down Programming by Using Knight tour algorithm.
problem6. prepare concise note on Hill-Climbing and Working Backward?
problem7. prepare the algorithm for binary search provide an ex?
problem8. Describe Traveling Salesman Problem for five-city network.