Syllabus: B. Sc.

Engineering in CSE – Autumn 2022

Marks Distribution:

Course Assessment Pattern (Theory courses):

SEE (50
CIE (50 marks)
marks)
Cognitive Affective Attendance Assignment/ Mid- Written
learning learning Marks (10) Class Test term Exam (50)
(10) (30)
Remember
Understand
Apply
Analyze
Evaluation
Create
Responding 10 10 30 50
Total allocated marks 10 10 30 50

Grading Policy: As per IIUC grading policy

Learning Materials:

Text Books:
1. Behrouz A Forouzan. Data Communications and Networking. 4th Edition Alan R. Apt
2007 ISBN-13 978-0-07-296775-3, ISBN-to 0-07-296775-7
2. "Andrew S. Tanenbaum David J. Wetherall." Computer Networks 5th Edition Pearson
1944 ISBN-13: 978-0-13-212695-3, ISBN-10: 0-13-212695-8
Reference Books:
1. Willium Stallings "Data and Computer Communication” 10thEdition. Pearson India
2014 ISBN-13: 978-0-13-350648-8 ISBN-10: 0-13-350648-7
2. F. Halsall Data Communication Computer Network and open systems 4th Edition Harlow: Addison-
Wesley 1997 ISBN-13: 978-0201422931 ISBN-10: 020142293X

7th Semester
ISCED Code Course Code Course Title
0613 CSE-4741 Computer Graphics
Credit Hours: 3 Contact Hours: 3 Type: Core, Engineering
Prerequisite: Math-2307 (Mathematics III)
Co-requisite: CSE-4742 (Computer Graphics Lab)

Course CIE: Attendance 10 Marks

Assessments Continuous Internal Class test/ Assignment/ 10 Marks
Evaluation Quizzes
Mid-term 30 Marks
SEE: Semester End Examination 50 Marks
Total 100 Marks

Department of Computer Science and Engineering (CSE) Page 332

Syllabus: B. Sc. Engineering in CSE – Autumn 2022

Course Rationale:

The purpose of this course is to provide an introduction to the theory and practice of
computer graphics.

Objectives:

1. This course is designed to provide a comprehensive introduction to computer

graphics leading to the ability to understand contemporary terminology, progress,
issues, and trends.
2. A thorough introduction to computer graphics techniques will be discussed
focusing on 3D modeling, image synthesis, and rendering.
3. The topics covered in this course are: geometric transformations, geometric
algorithms, software systems (OpenGL, shaders), 3D object models (surface,
volume and implicit), visible surface algorithms, image synthesis, shading and
mapping, ray tracing, radiosity, global illumination, photon mapping, and anti-
aliasing.

Course Learning Outcomes (CLOs):

Upon successful completion of this course, students will be able to:

# CLO Description Weightage

(%)
1. Understand the core concepts of computer graphics, including 35 %
viewing, projection, perspective, modeling and transformation in two
and three
dimensions.
2. Demonstrate the concepts of color models, lighting and shading 40 %
models, textures, ray tracing, hidden surface elimination, anti-aliasing,
and rendering.
3. Analyze and Apply the mathematical concepts and algorithms for 2 %
modeling and rendering graphical data.

Mapping of CLO-PLO-DL-KP-EP-EA:
Teaching Assessment
Learning Strategy
# CLOs PLOs DL KP EP EA
Strategy (AS)
(TLS)
CLO1 Understand the PLO1 - - Lecture, Exam, Quiz,
core concepts of Class Assignment
computer discussion,
graphics, Note
including
viewing,
projection,
perspective,
Department of Computer Science and Engineering (CSE) Page 333
Syllabus: B. Sc. Engineering in CSE – Autumn 2022

modeling and
transformation in
two and three
dimensions.
CLO2 Demonstrate the PLO1 - - Discussion, Assignment,
concepts of color Assignment Quiz, Exam
models, lighting
and shading
models, textures,
ray tracing,
hidden surface
elimination, anti-
aliasing, and
rendering.
CLO3 Analyze and PLO2 - - Lecture, CT,
Apply the Assignment, Assignment
mathematical Quiz
concepts and
algorithms for
modeling and
rendering
graphical data.
Note: DL: Domain/level of learning taxonomy, KP: Knowledge Profile, EP: Attribute
of Complex Engineering Problems, EA: Attribute of Complex Engineering Activities,
Learning Domains (C: Cognitive, A: Affective, P: Psychomotor)

Course Content:

# Content Duration CLOs

Mid-Term (30 Marks)

1 Introduction and objectives of this course. Brief history, 2 weeks CLO1

applications, hardware and software and the fundamental ideas
behind modern computer graphics, Characteristics of display
devices. Image representation: RGB and CMY Color
models,Direct Coding,Lookup table. Display monitor, Printer,
Image files. Scan Conversion: point, Line Direct use of line
equation. Digital Differential Algorithm. Bresenham's Line
Drawing Algorithm.

2 Scan converting a circle: Bresenham's circle algorithm. 2 weeks CLO1

Midpoint circle algorithm,midpoint ellipse algorithm. Region
Filling: Boundary Fill, Flood Fill, Scan line algorithm. Anti
aliasing,C curve and Koch curve.

3 2-D transformation: Geometric Transformation: Translation, 2 weeks CLO1

Rotation, Scaling, Reflection, Shearing. Coordinate
Department of Computer Science and Engineering (CSE) Page 334
Syllabus: B. Sc. Engineering in CSE – Autumn 2022

transformation Composite transformations, Instance

transformation.
Review Class
Class test

Final Exam: 50 Marks

Group-A (20 Marks)

4 Two Dimensional Viewing and Clipping: Two dimensional 2 weeks CLO1

viewing. Line clipping Polygon clipping ,2D graphics pipeline.

5 Three Dimensional Objects: Three dimensional 2 weeks CLO1

transformations, translation, rotation scaling, mirror reflection.
Coordinate transformation

Group-B (30 Marks)

6 Composite and instance transformation, Projection: Taxonomy 2 weeks CLO1

of projection, Perspective projection, Parallel projection. 3-D
viewing and clipping: 3-D Viewing, 3-D Clipping, Viewing
transformation, 3-D graphics pipeline Geometric
transformation: Curved surface design, The problem of
interpolation and approximation

7 Hidden surface: Hidden Surface, hidden-surface algorithms. z- 1 week CLO3

buffer algorithm Color and shading models Subdivision
algorithm.

8 Ray Tracing & Modeling: Ray Tracing, Future trends in 2 weeks CLO2
computer graphics. Modeling of 3D Objects, polygonal net
model, wire-frame model.
Review class
Class Test

Marks Distribution:

Course Assessment Pattern (Theory courses):

SEE (50
CIE (50 marks)
marks)
Cognitive Affective Attendance Assignment/ Mid- Written
learning learning Marks (10) Class Test term Exam (50)
(10) (30)
Remember
Understand 5 5
Apply 5 10 15
Analyze
Evaluation 5 15 30

Department of Computer Science and Engineering (CSE) Page 335

Syllabus: B. Sc. Engineering in CSE – Autumn 2022

Create
Responding 10
Total allocated marks 10 10 30 50

Grading Policy: As per IIUC grading policy

Learning Materials:

Text Books:
1. Roy Plastock and Zhigang Xiang, Computer Graphics, 2nd ed., McGraw-Hill Education,
2000, ISBN-13: 978-0071357814.

Reference Books:
1. Foley, Hughes, Computer Graphics Principles and Practice, 3rd ed., Addison-Wesley
Professional, 2013, ISBN-13: 978-0321399526.
2. William M. Newman, Principles of Interactive Computer Graphics, McGraw-Hill, 1973,
ISBN-10: 0070463379.
3. F.S. Hill, S.M. Kelley, Computer Graphics Using OpenGL, 3rd ed., Pearson, 2006, ISBN-
13: 978-0131496705.
4. Alan Watt, 3D Computer Graphics, 3rd ed., Addison-Wesley, 1999, ISBN-13: 978-
0201398557.
5. Steven Harrington, Computer Graphics and Programming Approaches, McGraw-Hill,
1987, ISBN-13: 978-0071004725.
6. The Red Book, OpenGL Programming Guide, 8th ed., Addison-Wesley Professional,
2013, ISBN-13: 978-0321773036.

7th Semester
ISCED Code Course Code Course Title
0613 CSE-4742 Computer Graphics Lab
Credit Hours: 1 Contact Hours: 2 Type: Core, Engineering
Prerequisite: CSE-2422 (Computer Algorithm Lab)
Co-requisite: CSE-4741 (Computer Graphics)

Course CIE: Attendance 10 Marks

Assessments Continuous Internal Assignment and Project 30 Marks
Evaluation Mid-term 20 Marks
SEE: Semester End Examination 40 Marks
Total 100 Marks

Course Rationale:

To introduce the necessary background, the basic algorithms, and the applications
of computer graphics.

Objectives:

Department of Computer Science and Engineering (CSE) Page 336

Syllabus: B. Sc. Engineering in CSE – Autumn 2022

1. To introduce the components of a graphics system and become familiar with the
building approach of graphics system components and algorithms related to
them.
2. To learn the basic principles of 3-dimensional computer graphics.
3. Provide an understanding of how to scan convert the basic geometrical
primitives, how to transform the shapes to fit them as per the scene definition.
4. Provide an understanding of mapping from a world coordinates to device
coordinates, clipping, and projections.
5. To introduce the application of computer graphics concepts in the development
of computer games, information visualization, and business applications.
6. To comprehend and analyze the fundamentals of animation.

Course Learning Outcomes (CLOs):

Upon successful completion of this course, students will be able to:

# CLO Description Weightage

(%)
1. Employ the key ideas of computer graphics algorithms. 30 %
2. Apply the basic algorithms to render 2D and 3D objects. 40 %
3. Create interactive computer graphics programs. 30 %

Mapping of CLO-PLO-DL-KP-EP-EA:
Teaching Assessment
Learning Strategy
# CLOs PLOs DL KP EP EA
Strategy (AS)
(TLS)
CLO1 Employ the key PLO2 C3 K2 - - Lecture, Exam, Quiz,
ideas of computer Class Assignment,
graphics discussion, Competitive
Assignment, Problem
algorithms.
Lab work. Solving
CLO2 Apply the basic PLO2 C5 K3 - - Lecture, Exam, Quiz,
algorithms to Class Assignment,
render 2D and 3D discussion, Competitive
objects. Assignment, Problem
Lab work Solving
CLO3 Create PLO5 C6 K6 - - Lecture, Exam, Quiz,
interactive Class Assignment,
computer discussion, Competitive
graphics Assignment, Problem
programs. Lab work, Solving
Competitive

Department of Computer Science and Engineering (CSE) Page 337

Syllabus: B. Sc. Engineering in CSE – Autumn 2022

Problem
Solving
Note: DL: Domain/level of learning taxonomy, KP: Knowledge Profile, EP: Attribute
of Complex Engineering Problems, EA: Attribute of Complex Engineering Activities,
Learning Domains (C: Cognitive, A: Affective, P: Psychomotor)

Course Content:

# Content Duration CLOs

1 Implementation of polynomial line algorithm, Implementation of 1 week CLO1

DDA algorithm, Implementation of Bresenham’s Line algorithm.

2 Implementation of Midpoint Circle Algorithm, Implementation 1 week CLO1

of Polynomial circle algorithm, Implementation of
Trigonometric circle algorithm, Implementation of
Bresenham’s circle algorithm

3 Draw an Ellipse using Polynomial algorithm, Trigonometric 1 week CLO1

algorithm.

4 Draw an Arc and a sector. 1 week CLO2

5 Scan conversion of various characters: using Bitmap method 1 week CLO2

and Outline method

6 Rotate a Line, Triangle and Rectangle about a point. 1 week CLO2

7 Magnifying a circle, a triangle and a rectangle about a point. 2 weeks CLO2

8 Rotate a 3D cube using OpenGL. 1 week CLO2

9 Projection of 3D cube 1 week CLO2

10 Line & polygon clipping problems 2 weeks CLO2

11 Project using OpenGL. 2 weeks CLO3

12 Perform other experiments relevant to this course. 1 week CLO3

Lab Test

Marks Distribution:

Course Assessment Pattern (Lab courses):

Department of Computer Science and Engineering (CSE) Page 338