Mca 501-Computer Graphics-course breakup
Download as DOC, PDF•2 likes•1,575 views
The document provides a course plan for Computer Graphics (MC 501) over 15 weeks. It includes 59 lectures covering topics like input/output devices, 2D and 3D graphics, geometric transformations, projections, and algorithms for drawing lines, circles and ellipses. Students will complete 3 assignments and 4 tests. Recommended books include Computer Graphics by Hearn & Baker and Computer Graphics by Kalyani Publishers.
Mca 501-Computer Graphics-course breakup
- 1. Punjab College of Technical Education - Course Plan Subject. Name COMPUTER GRAPHICS Subject. MC 501 Code Teacher Code KP No. of Tests 4 No. of Lect. 59 No. of Assignments 3 Proposed Lect. Lecture Content Assignment Test Week No. 1 Introduction to graphics Applications of computer graphics Difference b/w Active & Passive Graphics 2 Input Devices: Keyboard, Touch 1 Panel, Light Pens 3 Input Devices: Track Ball, Data glove, Digitizer, Image Scanner 4 Input Devices: Mouse, Voice and Systems, Image Scanner 5 Hard Copy Devices: Impact and Non Impact, Line and Dot Matrix, Inkjet and electrostatic, 6 Hard Copy Devices: Flatbed and 2 Drum Plotters, Dot matrix, Electrostatic Plotters 7 Video Display Devices: Refresh Cathode ray tube 8 Video Display Devices: Raster Scan Displays, Random Scan Displays 9 Color CRT Monitors, Direct view storage tubes, Flat panel displays 10 3-D viewing devices, Graphics ASSG 3 Monitors, Workstation 11 Hidden Line Surface Algorithm: Z- BUFFER ALGORITHM
- 2. 12 Scan Line Subdivision 13 Scan Line Subdivision - II 4 14 Area Subdivision Algo 15 Painters algorithm 16 Character Generation 17 Area Filling Technique 18 Area Filling Technique contd.. 19 Shading Methods: Diffuse, Reflected, Refracted, Half toning 6 20 Modeling Line Intensities, Constant, Garaund, Phong & Fast Phong Shading 21 Scan Converting algorithm ASSG Line Drawing Algorithm - DDA 22 Bresenham’s Algorithm 23 Other Line Drawing Algo's 24 Scan Converting algorithm 7 • Circle Drawing Algorithm • Bresenham’s Algorithm 25 Mid Point circle Algorithm 26 Other Circle Drawing Algo's 8 27 Ellipse Drawing Algorithm 28 Ellipse Drawing Algorithm Contd. 29 2D graphics - Introduction 30 2D -Cartesian and Homogeneous 9 31 Geometric transformation: Translation, Scaling 32 Rotation & Reflection
- 3. 33 Numerical problems 34 Numerical problems 10 35 2D viewing Transformation 36 Numerical problems 37 Point Clipping Algo 38 Clipping: Line Clipping - Cohen Sutherland 11 39 Midpoint line clipping algo 40 • Polygon Clipping 41 Text Clipping E. ASSG 12 42 3D graphics - Introduction 43 3D -Cartesian and Homogeneous 44 Geometric transformation: Translation, Scaling 45 Rotation & Reflection 13 46 Numerical problems 47 Numerical problems 48 Shearing 14 49 3D Viewing Transformation 50 Projection 51 • Parallel Projection 15 52 • Perspective Projection 53 Full Syllabus Test BOOK COMPUTER GRAPHICS RECOMMENDED DESIGN BASIC PRINCIPLES BY NIIT
- 4. Course related Computer Graphics by Hearn & books Baker Computer Graphics Schaum Series Computer Graphics by Kalyani Publishers Signature Teacher Name KAPIL PRASHAR