SPPU · Second Year Computer Engineering · 2024 Pattern (Revised)
Object Oriented Programming and Computer Graphics
PCC-202-COM · Semester III · 3 credits · CCE 40 + end-semester 60
Units 1–3 are object-oriented programming in Java; Units 4–5 are computer graphics.
Unit 1: Introduction to OOP Concepts and Control Structure
9 hoursProgramming paradigms; OOP fundamentals; Java program structure, the JVM, data types, operators and expressions, class libraries; selection and iteration statements.
Marks: 12 in the end-semester exam · CCE: Unit test (15 marks, Units 1 & 2)
- Programming paradigms
- Object-oriented concepts
- Java program structure and the JVM
- Java data types, operators and expressions
- Control statements in Java
Unit 2: Introduction to Classes and Objects and Arrays
9 hoursClasses, fields and methods, objects, argument passing, constructors, this, static methods, overloading, Java API packages; arrays, variable-length and command-line arguments; console I/O with streams and PrintWriter.
Marks: 12 in the end-semester exam · CCE: Unit test (15 marks, Units 1 & 2)
Unit 3: Inheritance and Polymorphism, Exception Handling and Multithreading
9 hoursSuperclasses and subclasses, types of inheritance, the Object class; abstract classes, final, dynamic binding, interfaces; try-catch, throw, throws, finally; the Java thread model and creating threads.
Marks: 12 in the end-semester exam · CCE: Assignments or case study (15 marks, Units 3 & 4)
Unit 4: Graphics Primitives, Scan Conversion, Windowing and Clipping
9 hoursPixels, resolution, frame buffer, display devices; DDA and Bresenham lines; DDA, Bresenham and midpoint circles; polygons, inside test, flood, seed and scan-line fill; viewing transformation, Cohen–Sutherland and Sutherland–Hodgeman clipping.
Marks: 12 in the end-semester exam · CCE: Assignments or case study (15 marks, Units 3 & 4)
- Graphics primitives and display devices
- Line drawing: DDA and Bresenham's algorithms
- Circle drawing: DDA, Bresenham and midpoint algorithms
- Polygons and the inside test
- Polygon filling: flood fill, seed fill and scan-line fill
- Windowing and the viewing transformation
- Line clipping: Cohen–Sutherland algorithm
- Polygon clipping: Sutherland–Hodgeman algorithm
Unit 5: 2D, 3D Transformations and Projections
9 hours2D and 3D translation, scaling, rotation and shear, rotation about an arbitrary point or axis; parallel (oblique and orthographic) and perspective projections, vanishing points.
Marks: 12 in the end-semester exam · CCE: Seminar, open-book test or quiz (10 marks, Unit 5)
Unit contents are summarised from the official SPPU syllabus . AiCanCode.org is not affiliated with Savitribai Phule Pune University.