University of Mumbai Syllabus For Semester 4 (SE Second Year) Computer Graphics: Knowing the Syllabus is very important for the students of Semester 4 (SE Second Year). Shaalaa has also provided a list of topics that every student needs to understand.
The University of Mumbai Semester 4 (SE Second Year) Computer Graphics syllabus for the academic year 2021-2022 is based on the Board's guidelines. Students should read the Semester 4 (SE Second Year) Computer Graphics Syllabus to learn about the subject's subjects and subtopics.
Students will discover the unit names, chapters under each unit, and subtopics under each chapter in the University of Mumbai Semester 4 (SE Second Year) Computer Graphics Syllabus pdf 2021-2022. They will also receive a complete practical syllabus for Semester 4 (SE Second Year) Computer Graphics in addition to this.
University of Mumbai Semester 4 (SE Second Year) Computer Graphics Revised Syllabus
University of Mumbai Semester 4 (SE Second Year) Computer Graphics and their Unit wise marks distribution
University of Mumbai Semester 4 (SE Second Year) Computer Graphics Course Structure 2021-2022 With Marking Scheme
| # | Unit/Topic | Weightage |
|---|---|---|
| 100 | Introduction to Computer Graphics | |
| 200 | Introduction to OpenGL | |
| 300 | Output Primitives | |
| 400 | Filled Area Primitives | |
| 500 | 2D Geometric Transformations | |
| 600 | 2D Viewing | |
| 700 | 3d Geometric Transformations and 3d Viewing 1 | |
| 800 | 3d Geometric Transformations and 3d Viewing 2 | |
| 900 | Illumination Models and Surface Rendering | |
| 1000 | Fractals | |
| Total | - |
Syllabus
- What is Computer Graphics?
- Where Computer Generated pictures are used
- Elements of Pictures created in Computer Graphics
- Graphics display devices
- Graphics input primitives and Devices
- Getting started Making pictures
- Drawing basic primitives
- Simple interaction with mouse and keyboard (For implementation use openGL programming)
1. Points and Lines, Antialiasing
2. Line Drawing algorithms
- DDA line drawing algorithm
- Bresenham’s drawing algorithm
- Parallel drawing algorithm
3. Circle and Ellipse generating algorithms
- Mid-point Circle algorithm
- Mid-point Ellipse algorithm
4. Parametric Cubic Curves
- Bezier curves
- B-Spline curves
- Scan line polygon fill algorithm
- Pattern fill algorithm
- Inside-Outside Tests
- Boundary fill algorithms
- Flood fill algorithms
- Basic transformations
- Matrix representation and Homogeneous Coordinates
- Composite transformation
- Other transformations
- Transformation between coordinated systems
1. Window to Viewport coordinate transformation
2. Clipping operations – Point clipping
3. Line clipping
- Cohen – Sutherland line clipping
- Liang – Barsky line clipping
- Midpoint subdivision
4. Polygon Clipping
- Sutherland – Hodgeman polygon clipping
- Weiler – Atherton polygon clipping
1. 3D object representation methods B-REP, sweep representations, CSG
2. Basic transformations
- Translation
- Rotation
- Scaling
3. Other transformations
- Reflection
- Rotation about an arbitrary axis
4. Composite transformations
5. Projections – Parallel and Perspective
6. 3D clipping
- Classification of Visible Surface Detection algorithm
- Back Surface detection method
- Depth Buffer method
- Scan line method
- BSP tree method
- Area Subdivision method
- Basic Illumination Models
- Halftone and Dithering techniques
- Polygon Rendering
- Constant shading , Goraud Shading , Phong Shading
- Introduction
- Fractals and self similarity
- Successive refinement of curves, Koch curve, Fractional Dimension
- String production and peano curves (For implementation use C Programming)
