The course will enable the students to
1. Understanding computer graphics concepts using various concepts.
2. Implement various algorithms to scan, convert the basic geometrical primitives, transformations, Area filling, clipping.
Course Outcome (at course level) | Learning and teaching strategies | Assessment Strategies |
---|---|---|
The students will: CO213. Write programs using graphics library to implement basics of scan conversion of a point. CO214. Implement various Line drawing algorithm and circle drawing algorithm. CO215. Design graphics with different fill algorithm. CO216. Create basic 2D transformation graphic design. CO217. Write programs to extract scenes with different clipping algorithms |
Interactive Lectures, Discussion, Tutorials, Reading assignments, Demonstrations, Team teaching, Teaching using advanced IT audio- video tools, G-suite. |
Class test, Semester end examinations, Quiz, Solving problems in tutorials, Assignments, Presentation, Individual and group projects and peer review. |
· Introduction to basic graphics of ‘C’ Language
· Implementation of DDA Line Drawing Algorithm.
· Implementation of Bresenham’s Line Algorithm.
· Implementation of Midpoint Circle Algorithm.
· Implementation of Boundary Fill Algorithm
· Implementation of Flood Fill Algorithm
· Implementation of Basic 2-D Transformation
E-RESOURCES:
1. https://www.slideshare.net/
2. https://spoken-tutorial.org/??/
3. www.virtuallab.com
JOURNALS:
1. Journal of the Brazilian Computer Society, SpringerOpen
2. Journal of Internet Services and Applications, SpringerOpen