MCA 211 Computer Graphics Notes from Unnati Educations cover all 4 units of the GGSIPU MCA Semester 3 paper in one 86-page book: 21 solved numericals, 57 figures, 65 short-answer questions with answers and 32 long-answer writing guides. They follow the MCA syllabus in force from academic session 2025-26.
Written by Prateek Talwar, Founder, Unnati Educations · Reviewed by Ritik Rawat, B.Tech, Senior Full Stack Developer · Checked against the MCA Scheme of Examination and Detailed Syllabus (A.S. 2025-26 onwards, approved 1 August 2025) · Updated 13 October 2026 · Editorial policy
Scheme: MCA, A.S. 2025-26 onwards | Applies to: academic year 2025-26 onwards | Verified against: MCA Scheme and Syllabus, USIC&T, 1 August 2025
MCA 211 Computer Graphics at a glance: GGSIPU MCA Sem 3 credits, units and exam pattern
| Code and title | MCA-211 Computer Graphics |
|---|---|
| Course and semester | MCA, Semester 3 |
| Category and credits | Core Elective-II · 3 credits · L 3, T/P 0 |
| Teaching hours | 45: Unit 1 (12), Unit 2 (11), Unit 3 (12), Unit 4 (10) |
| Marks | End-term paper of 60; passing is 40 out of 100 for every paper. The internal share is not printed separately. |
| End-term pattern | Compulsory Question 1 on the whole syllabus (12 marks), then one of two questions from each unit, 12 marks each (12 + 48 = 60 marks) |
| Units | 4 |
| Paired lab | MCA-265 Lab based on Core Elective-II (Computer Graphics Lab): P 2, 1 credit |
MCA 211 is one of eleven Core Elective-II choices. Compare it with the other GGSIPU MCA Semester 3 papers before you pick.
MCA 211 Computer Graphics Notes unit-wise: 21 solved numericals and 57 figures across 4 units
The official PDF numbers the units but prints no unit titles, so the headings below use the titles printed in the notes. Notes for every other MCA paper are on the GGSIPU MCA notes page; one page per unit is in the sample PDF above.
MCA 211 Unit 1: Introduction, Scan Conversion and Transformations
Unit 1 (pages 4 to 25) covers display hardware (CRT, raster and random scan), then scan conversion of lines (DDA, Bresenham), circles (mid-point, Bresenham) and the mid-point ellipse, then 2D and 3D transformation matrices, pivot rotation, reflection about y = mx + c and affine maps. It has 16 sections, 8 solved numericals, 14 short and 8 long questions, and 14 figures.
| Basis | DDA | Bresenham |
|---|---|---|
| Arithmetic | Floating point | Integer only |
| Rounding | round() every step | None |
| Accuracy | Error builds on long lines | No drift |
| Speed | Slower | Faster, suits hardware |
Quick look: DDA vs Bresenham line drawing (from page 13)
- Basis
- Arithmetic
- DDA
- Floating point
- Bresenham
- Integer only
- Basis
- Rounding
- DDA
- round() every step
- Bresenham
- None
- Basis
- Accuracy
- DDA
- Error builds on long lines
- Bresenham
- No drift
- Basis
- Speed
- DDA
- Slower
- Bresenham
- Faster, suits hardware
MCA 211 Unit 2: Viewing, Clipping, Projections and Solid Modeling
Unit 2 (pages 26 to 44) covers window-to-viewport mapping, clipping of lines (Cohen–Sutherland, Cyrus–Beck) and polygons (Sutherland–Hodgman), parallel and perspective projections with vanishing points and anomalies, and solid modelling from sweeps and octrees to B-Rep, CSG and Koch-curve fractals. It has 22 sections, 6 solved numericals, 15 short and 8 long questions, and 15 figures.
Quick look: window (20, 40)–(80, 80) to viewport (0.2, 0.4)–(0.6, 0.8) (from page 28)
- sx = 0.4 / 60 = 0.00667 and sy = 0.4 / 40 = 0.01.
- xv = 0.2 + (30 − 20) × 0.00667 = 0.267.
- yv = 0.4 + (60 − 40) × 0.01 = 0.6.
- (30, 60) lands at (0.267, 0.6); since sx ≠ sy, the picture squeezes slightly along x.
MCA 211 Unit 3: Curves and Surfaces, Animation and OpenGL
Unit 3 (pages 45 to 65) covers Bézier curves from Bernstein polynomials, continuity, B-splines through Cox–de Boor and knot vectors, Beta and rational splines, NURBS and patches; then the 12 animation principles and methods; then OpenGL up to GLUT callbacks. It has 23 sections, 3 solved numericals, 18 short and 8 long questions, and 13 figures.
Quick look: the timer callback behind a rotating square (from page 61)
void timer(int v) {
angle += 2.0; if (angle > 360) angle -= 360;
glutPostRedisplay();
glutTimerFunc(16, timer, 0);
}Adds 2 degrees, redraws, repeats every 16 ms (about 60 fps).
MCA 211 Unit 4: Hidden Surface Removal, Illumination, Shading and Colour Models
Unit 4 (pages 66 to 86) covers object-space vs image-space methods, the back-face test, the two buffer methods, painter's depth sorting, BSP trees, scan-line and Warnock subdivision; then ambient, diffuse and specular light, ray tracing and three shading models; then RGB, CMY(K), HSV and HSL conversions. It has 18 sections, 4 solved numericals, 18 short and 8 long questions, and 15 figures.
| Basis | Flat | Gouraud | Phong |
|---|---|---|---|
| Interpolates | Nothing | Intensity | Normals |
| Lighting at | Polygon | Vertices | Every pixel |
| Highlights | Poor | Can be missed | Accurate |
| Speed | Fastest | Fast | Slowest |
Quick look: flat vs Gouraud vs Phong shading (from page 79)
- Basis
- Interpolates
- Flat
- Nothing
- Gouraud
- Intensity
- Phong
- Normals
- Basis
- Lighting at
- Flat
- Polygon
- Gouraud
- Vertices
- Phong
- Every pixel
- Basis
- Highlights
- Flat
- Poor
- Gouraud
- Can be missed
- Phong
- Accurate
- Basis
- Speed
- Flat
- Fastest
- Gouraud
- Fast
- Phong
- Slowest
Z-buffer depth testing in hidden surface removal: excerpt from page 69 of the MCA 211 notes
Excerpt from page 69
What the Z-buffer method does
The Z-buffer, or depth-buffer, method was proposed by Catmull in 1974. It is an image-space method: instead of comparing whole objects, it compares the depth (z) of every surface at each pixel and shows the surface that is closest to the viewer at that pixel.
It needs two buffers the size of the screen. The depth buffer stores a depth value for every pixel position (x, y). The refresh (frame) buffer stores the colour or intensity for the same pixel.
Algorithm
- Initialise every pixel: depth(x, y) is set to the maximum depth (for example 1.0, or infinity) and frame(x, y) to the background colour.
- Take each polygon in the scene, in any order. For each pixel (x, y) inside its projection, compute the surface depth z(x, y).
- If z is smaller than depth(x, y), the surface is closer: set depth(x, y) = z and frame(x, y) to the surface colour at that pixel.
- When every polygon has been processed, the frame buffer holds the visible image.
Incremental depth calculation
Computing z from scratch at every pixel would be slow, so the method uses the plane equation Ax + By + Cz + D = 0, which gives z = (−Ax − By − D) / C. Moving one pixel along a scan line (x to x + 1) changes depth by a constant, so the new depth is z′ = z − A/C: one subtraction per pixel. Moving down one scan line along a left edge with slope m gives z′ = z + (A/m + B) / C.
Worked check
Take the plane 2x + 3y + 4z − 24 = 0. At pixel (1, 2), z = (24 − 2 − 6) / 4 = 16 / 4 = 4. At the next pixel on the same scan line, (2, 2), z = 4 − 2/4 = 3.5. The second value comes from a single subtraction rather than a full recalculation, which is why the method is cheap enough to run inside graphics hardware for every pixel of every frame.
Do the MCA 211 notes cover the full GGSIPU syllabus?
Yes. Every topic in the four official units of MCA-211 has its own section in the notes; the unit check found no gaps.
| Official unit | Official topics | Where in the notes | Status |
|---|---|---|---|
| Unit I | Introduction, Graphics Systems; Scan Conversion (DDA, Bresenham, Mid-Point circle and ellipse); 2D and 3D Transformations, Affine Transformations | Sections 1 to 16, pages 5 to 22 | Covered |
| Unit II | Window to Viewport; Cohen Sutherland, Cyrus-Beck, Sutherland Hodgeman Clipping; Parallel and Perspective Projections; Solid Modeling, FRACTALS | Sections 1 to 22, pages 27 to 41 | Covered |
| Unit III | Bezier Curves, B-Splines, Knot Vectors, NURBS, Surfaces; Animation Principles, Methods, Tools; Open GL and GLUT Event-Handling | Sections 1 to 23, pages 46 to 62 | Covered |
| Unit IV | Hidden Surface Removal methods; Ambient, Diffuse, Specular, Ray Tracing; Flat, Gouraud, Phong Shading; RGB, CMY, HSV, HSL | Sections 1 to 18, pages 67 to 82 | Covered |
MCA 211 official topics mapped to the notes
- Official unit
- Unit I
- Official topics
- Introduction, Graphics Systems; Scan Conversion (DDA, Bresenham, Mid-Point circle and ellipse); 2D and 3D Transformations, Affine Transformations
- Where in the notes
- Sections 1 to 16, pages 5 to 22
- Status
- Covered
- Official unit
- Unit II
- Official topics
- Window to Viewport; Cohen Sutherland, Cyrus-Beck, Sutherland Hodgeman Clipping; Parallel and Perspective Projections; Solid Modeling, FRACTALS
- Where in the notes
- Sections 1 to 22, pages 27 to 41
- Status
- Covered
- Official unit
- Unit III
- Official topics
- Bezier Curves, B-Splines, Knot Vectors, NURBS, Surfaces; Animation Principles, Methods, Tools; Open GL and GLUT Event-Handling
- Where in the notes
- Sections 1 to 23, pages 46 to 62
- Status
- Covered
- Official unit
- Unit IV
- Official topics
- Hidden Surface Removal methods; Ambient, Diffuse, Specular, Ray Tracing; Flat, Gouraud, Phong Shading; RGB, CMY, HSV, HSL
- Where in the notes
- Sections 1 to 18, pages 67 to 82
- Status
- Covered
Source: MCA Scheme of Examination and Detailed Syllabus, A.S. 2025-26 onwards.
Even small items such as perspective anomalies get their own section. Every course in GGSIPU notes is mapped to its official PDF this way.
How to write MCA 211 answers: algorithm derivations, pixel tables and clipping walkthroughs
Most long questions ask you to derive an algorithm, then run it on numbers. The writing guides follow one order: definition, figure, derivation, steps or C code, worked table, comparison table. For Bresenham's line: the d1 and d2 figure, p(k) = Δx(d1 − d2), p₀ = 2Δy − Δx, the table for (20, 10) to (30, 18), then DDA vs Bresenham.
For numericals, write the formula, substitute once and tabulate repeated steps. Add a check where one exists, such as Cyrus–Beck agreeing with Cohen–Sutherland on the same line. The revision sheets warn that the first transformation applied is the rightmost matrix.
Worked example: trivial rejection in Cohen–Sutherland (page 30)
- Window (10, 10) to (50, 40), line E(0, 0) to F(5, 60).
- E is left and below, code 0101; F is left and above, code 1001.
- The AND is 0001, not 0000, so the line is rejected with no intersection maths.
- Write both codes and the AND in your answer.
The notes label long answers 12.5 marks, but the current paper sets 12 per unit question, so plan for 12. Practise this format on GGSIPU MCA important questions.
MCA 211 exam corner: 65 short answers and 32 long-answer writing guides by unit
| Unit | Short answers (2.5 marks label) | Long-answer guides (12.5 marks label) | Solved numericals |
|---|---|---|---|
| Unit 1 | 14 | 8 | 8 |
| Unit 2 | 15 | 8 | 6 |
| Unit 3 | 18 | 8 | 3 |
| Unit 4 | 18 | 8 | 4 |
| Total | 65 | 32 | 21 |
MCA 211 exam corner counts by unit (as printed in the notes)
- Unit
- Unit 1
- Short answers (2.5 marks label)
- 14
- Long-answer guides (12.5 marks label)
- 8
- Solved numericals
- 8
- Unit
- Unit 2
- Short answers (2.5 marks label)
- 15
- Long-answer guides (12.5 marks label)
- 8
- Solved numericals
- 6
- Unit
- Unit 3
- Short answers (2.5 marks label)
- 18
- Long-answer guides (12.5 marks label)
- 8
- Solved numericals
- 3
- Unit
- Unit 4
- Short answers (2.5 marks label)
- 18
- Long-answer guides (12.5 marks label)
- 8
- Solved numericals
- 4
- Unit
- Total
- Short answers (2.5 marks label)
- 65
- Long-answer guides (12.5 marks label)
- 32
- Solved numericals
- 21
The MCA 211 notes answer 65 short-answer questions and give 32 long-answer writing guides across 4 units, plus 21 solved numericals.
Four exam-style questions from the notes:
- What is 8-way symmetry of a circle? (Unit 1, page 22) Pointer: if (x, y) is on a circle at the origin, so are (±x, ±y) and (±y, ±x); compute one octant and mirror it.
- What is a vanishing point? (Unit 2, page 42) Pointer: where parallel lines not parallel to the view plane appear to meet in perspective; one, two or three principal ones.
- Why is OpenGL called a state machine? (Unit 3, page 63) Pointer: settings such as the current colour stay in force until changed, as with
glColor3f. - Convert RGB (0.2, 0.4, 0.6) to CMY. (Unit 4, page 84) Pointer: subtract each from 1: C = 0.8, M = 0.6, Y = 0.4.
More practice sits in the MCA 211 important questions.
Who writes and checks the MCA 211 graphics notes?
- Prateek Talwar, author: writes and edits the notes. Founder, Unnati Educations; Associate Company Secretary (ACS), ICSI, membership no. 58704, since 15 May 2019; B.Com, University of Delhi (School of Open Learning), 2012. Author bio
- Ritik Rawat, subject reviewer: checks the algorithms, matrices and OpenGL code. B.Tech; Senior Full Stack Developer, Unnati Educations.
The 2026-27 edition of these GGSIPU MCA Sem 3 Computer Graphics notes maps to the MCA syllabus approved on 1 August 2025 for academic year 2025-26 onwards: 86 pages, 79 numbered sections. Last updated 13 October 2026. See our editorial policy.
The reviewer re-runs every worked table in these MCA 211 Computer Graphics IPU notes before each edition. The same team prepares GGSIPU important questions for every course.
MCA 211 and the GGSIPU MCA Sem 3 papers it connects to
Codes and credits for the whole programme are on the GGSIPU MCA syllabus page.
Paired lab: MCA-265, run as Computer Graphics Lab for students who pick MCA 211 (1 credit). Its syllabus lists outcomes, not a fixed practical list, and this book is not a lab record.
- Units 1 and 2 (scan conversion, clipping) feed the lab's clipping outcome.
- Units 2 and 4 (projections, hidden surfaces) feed its projections outcome.
- Units 3 and 4 (GLUT animation, shading) feed its interactive outcomes.
Other Semester 3 papers: MCA-201 Design and Analysis of Algorithms, MCA-203 Artificial Intelligence and Machine Learning, labs MCA-261, 263 and 267, MCA-269 Minor Project-III, and NUES papers MCA-271 and 273. In Core Elective-III, MCA-233 Multimedia Technologies and MCA-241 Digital Image Processing build on this paper.
MCA 211 graphics notes FAQs
How do I get the full MCA 211 notes?
Message 9899436384 on WhatsApp with the code MCA 211. The full notes come only as a printed book, not as a PDF, and delivery takes 5 to 7 days at most depending on your location. The book covers all four units in 86 pages. The View Sample PDF button at the top shows seven watermarked pages first.
What is the passing mark for MCA 211 Computer Graphics?
MCA 211 is marked out of 100, and its end-term paper carries 60 marks: 12 for Question 1 plus 48 from four unit questions. The MCA scheme of examination states pass marks as 40 out of 100 for every paper, which is 40%. Rules on end-term minimums and re-appearing are in the university's Ordinance 11.
Which MCA 211 unit has the most solved numericals?
Unit 1, with 8 of the 21: frame buffer size, DDA from (2, 3) to (10, 8), Bresenham from (20, 10) to (30, 18), the mid-point circle for r = 10, Bresenham's circle for r = 8, the ellipse for rx = 8 and ry = 6, a pivot rotation and a line reflection. Unit 2 follows with 6.
Does the MCA 211 book include OpenGL code?
Yes, in Unit 3: immediate mode drawing one coloured triangle, a display list in retained mode, state calls such as glEnable and glPushAttrib, a rotating square animated with double buffering, and keyboard and mouse callbacks with a table of GLUT callback functions. The listings support theory answers and are not a lab file for MCA-265.
Is MCA 211 compulsory in MCA Semester 3?
No. MCA 211 is one of eleven Core Elective-II options and each student picks one, worth 3 credits with three lecture hours a week. The scheme runs classes for an elective only with at least 20 students; otherwise the course is done on a MOOC platform with approval, while the institute still conducts the examinations for the credits.
Do the MCA 211 notes match the 2025-26 MCA syllabus?
Yes. The four units, their order and every listed topic match the MCA syllabus in force from academic year 2025-26. One difference: the exam corners still carry 2.5-mark and 12.5-mark labels, while the current paper sets Question 1 and each unit question at 12 marks. The answers themselves are unaffected, so the book still fits the current paper pattern.
Get the full MCA 211 Computer Graphics Notes on WhatsApp
What is in the full MCA 211 printed book
- Part
- Cover and index
- Pages
- 1 to 3 (3)
- Solved numericals
- -
- Short / long questions
- -
- Part
- Unit 1
- Pages
- 4 to 25 (22)
- Solved numericals
- 8
- Short / long questions
- 14 / 8
- Part
- Unit 2
- Pages
- 26 to 44 (19)
- Solved numericals
- 6
- Short / long questions
- 15 / 8
- Part
- Unit 3
- Pages
- 45 to 65 (21)
- Solved numericals
- 3
- Short / long questions
- 18 / 8
- Part
- Unit 4
- Pages
- 66 to 86 (21)
- Solved numericals
- 4
- Short / long questions
- 18 / 8
Format: these are Computer Graphics notes in English, sold as a printed book; the full notes are not available as a PDF. Each unit ends with a formula revision sheet. Delivery: within 5 to 7 days at most; the exact time may vary with your location.
Get the full MCA 211 Computer Graphics Notes book on WhatsApp (4 units, 86 pages)
Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.
Ready for the full notes?
Discuss coverage and delivery with our team.