Course Title: Computer Graphics

Course No. : ICT Ed 466 Nature of Course: Theoretical + Practical

Level: B.Ed. Credit Hours: 3 (2T+1P)
Semester: Teaching Hours: 80 (32T+48P)

1. Course Description
This course deals with computer graphics consisting of introduction of graphical
system, different hardware used in the graphical system, Output primitives,
implementation of two dimensional algorithms, and understanding in three dimensional
graphics and their implementation.

2. General Objectives
The general objectives of this course are as follows:
• To familiarize the students with computer graphics and its applications.
• To familiarize the students with graphical input, display and output hardware.
• To make the students competent in implementing graphical primitives: point, line and
circle.
• To enable the students to implement two – dimensional transformations.
• To make the students familiar with three – dimensional transformation.
• To make the students capable for demonstrating rendering and illusion techniques.

3. Specific Objectives and Contents

Specific Objectives Contents

• To define the computer Unit I: Introduction (10)
graphics. 1.1 History of computer graphics
• To explore the history of 1.2 Applications of computer graphics
computer graphics. 1.3 Picture representation
• To identify the application 1.4 Properties of light
areas of Computer graphics. 1.5 Color models
• To explain the process of 1.6 Graphics Standards and Graphical file formats
picture presentation in
computer system.
• To find the importance of
light in graphic element.
• To explain the different color
models.
• To identify the different
graphics standards and file
formats.
• To identify the different Unit II: Hardware Concepts (10)
graphical input devices. 2.1 Input hardware: Keyboards, Mouse, Trackball,
• To explain the working Joysticks, Data Glove, Digitizer, Scanner, Touch
principle CRT monitor. Panels, Light Pens, Voice system.

1
• To differentiate between raster 2.2 Video Display Devices: Refresh Cathode - Ray Tubes,
scan display architecture and Raster scan display architecture, Random scan display
random scan display architecture, Flat-Panel displays.
architecture in detail. 2.3 Hard-Copy Devices
• To identify the different flat-
panel display devices.
• To identify different
Hardcopy devices.
• To define the output Unit III: Output Primitives (15)
primitives. 3.1 Points and Lines
• To implement the DDA 3.2 Line Drawing Algorithms: DDA algorithm,
algorithm. Bresenham's Line algorithm.
• To implement the Bresenha's 3.3 Circle Generating Algorithm: Properties of circle,
line algorithm. Midpoint circle drawing algorithm, Bresenham's circle
• To differentiate between DDA drawing algorithm,
and Bresenham's line 3.4 Attributes: Line attributes, Curve attributes and
algorithm. Character attributes.
• To implement the Midpoint
circle algorithm.
• To implement Bresenham's
circle drawing algorithm.
• To explain the attributes of
Line, curve and characters.
• To solve the basic 2-D Unit IV: 2-D Geometric Transformations (22)
transformations problems. 4.1 Basic Transformations: Translation, Rotation, Scaling
• To explain the 2-D Composite 4.2 Composite Transformations: Translation, Scaling,
Transformations. Rotation.
• To transform the 2-D object to 4.3 Recent transform concepts and advantages
screen viewing. 4.4 Two-dimensional object to screen viewing transforms
• To explain the different line 4.5 Workstation Transformation
clipping operations. 4.6 Clipping Operations: Point Clipping, Line Clipping:
• To use line clipping Cohen-Sutherland Line Clipping, Liang-Barsky Line
algorithms. Clipping.
• To define the 3-D viewing Unit V: Three-Dimensional Graphics (22)
pipeline. 5.1 Three- dimensional viewing pipeline
• To explain the types of 5.2 Projection: Parallel Projections, Perspective
projections. Projections.
• To explain the basic 3-D 5.3 Extension of two-dimensional transforms to three
transformations. dimensions: Translation, Rotation, Scaling.
• To explore the different HSR 5.4 Methods of generating non-planar surfaces
techniques. 5.5 Hidden line and hidden surface removal techniques
• To explain the basic 5.6 Need for shading in data visualization
Illumination models. 5.7 Basic Illumination Models: ambient, diffuse and
• To Illustrate Polygon specular reflections
rendering methods.

2
 • To explore the future of 3-D 5.8 Polygon – Rendering Methods: Constant, Gouraud,
display architecture. Phong and Fast-Phong.
5.9 Specialized and future three dimensional display
architectures

Laboratory:
1. write a program to plot a pixel.
2. Write a program to draw a rectangle using line function.
3. Write a program to draw a line using DDA line drawing algorithm.
4. Write a program to draw a line using Bresenham's line drawing algorithm.
5. Write a program to draw a circle using Midpoint circle drawing algorithm.
6. Write a program to draw a circle using Bresenham's circle drawing algorithm.
7. Write a program to implement Cohen Sutherland line clipping algorithm.
8. Write a program to perform 2-D transformation on a line.

4. Instructional Techniques
Reading materials will be provided to students in each unit. Lecture preferably with the use of
multi-media projector, demonstration, practical classes, discussion, and brain storming are
used in all units.
5. Evaluation
Evaluation of students' performance is divided into parts: Internal assessment and internal
and external practical examination and theoretical examinations. The distribution of
points is given below:

Internal External Practical Semester Examination Total Points

Assessment Exam/Viva (Theoretical exam)
40 Points 20 Points 40 Points 100 Points
Note: Students must pass separately in internal assessment, external practical exam and
semester examination.

5.1 Internal Assessment (40 Points)

Internal assessment will be conducted by subject teacher based on following criteria:
1) Class Attendance 5 points
2) Learning activities and class performance 5 points
3) First assignment ( written assignment) 10 points
4) Second assignment (Case Study/project work with presentation ) 10 points
5) Terminal Examination 10 Points

Total 40 points
5.2 Semester Examination (40 Points)
Examination Division, Dean office will conduct final examination at the end of
semester.
Objective question (Multiple choice questions 10 x 1 point) 10 Points
Short answer questions (6 questions x 5 marks) 30 Points
Total 40 points

3
 5.3 Practical Exam/Viva (20 Points)
Examination Division, Dean Office will conduct final practical examination at the
end of semester. Practical record book, practical written test, demonstration of
practical activities and viva are assessment indicators.

6. Recommended Books and References

Recommended Books
1. Hearn and Baker, “Computer Graphics, C Version”, Second Edition, Prentice- Hall
of India Private Limited, 2003.
2. Computer Graphics (Principles and Practice) by Foley, van Dam, Feiner and
Hughes, Addisen Wesley (Indian Edition).