0 ratings 0% found this document useful (0 votes) 66 views 6 pages CGR
The document outlines the course structure for 'Computer Graphics' (Course Code: 313001) offered in the third semester of various computer-related programs. It details the rationale, expected outcomes, learning objectives, teaching methods, assessment schemes, and suggested learning materials. The course focuses on key concepts such as object design, transformations, and graphical algorithms, aiming to equip students with practical programming skills in graphics using C.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here .
Available Formats
Download as PDF or read online on Scribd
Go to previous items Go to next items
‘516/25, 1:28 AM '219001-COMPUTER GRAPHICS
R GRAPHICS ‘Course Code : 313001
: Computer Technology/ Computer Engincering/ Computer Science & Engincering/
Programme Name/s Computer Hardware & Maintenance
Computer Science
Programme Code : CM/ CO/ CW/HA/ SE
Semester : Third
Course Title : COMPUTER GRAPHICS
Course Code 2313001
I. RATIONALE
Computer Graphics is the discipline of generating images with the aid of computers. This course provides an
introduction to the principles of Computer Graphics. In particular, the course will consider methods for Object
Design, Transformation, Scan Conversion, Visualization and Modelling of real world and enables student to create
impressive graphics easily and efficiently.
Il. INDUSTRY / EMPLOYER EXPECTED OUTCOME
The aim of this course is to attain following Industry Identified Competency through various Teaching Learning
Experiences:
Develop programs using Graphics concepts.
II, COURSE LEVEL LEARNING OUTCOMES (COS)
Students will be able to achieve & demonstrate the following COs on completion of course based learning
+ CO1 - Manipulate Visual and Geometric information of Images.
CO2 - Develop programs in C applying standard graphics algorithms.
CO3 - Perform and Demonstrate basic and composite graphical transformations on given object.
C04 - Implement various Clipping algorithms.
COS - Develop programs to create Curves.
IV. TEACHING-LEARNING & ASSESSMENT SCHEME
T [Learning Scheme Assessment Scheme
‘Actual
Contact tm Bare om LE 8 aed ol
couse! Couyse-rne por] Course [Hes /Week La cory : net
Coss] Comte Te Arc stperid ous wf Paper rea
F/B
cura] FIBA ont sla
aa a a a aa a an
[json COMPOTER : sTiol a
13001 EMPTTER lege] ose fr [lat] | 2 | — |-]-1-|- [asf] -|- [2s] f so
MSBTE Approval Dt. 02/07/2024 Semester - 3, K Scheme‘516/25, 1:28 AM '219001-COMPUTER GRAPHICS
COMPUTER GRAPHICS Course Code : 313001
Total IKS Hrs for Sem. : 0 Hrs
Abbreviations: CL- ClassRoom Learning , TL- Tutorial Learning, LL-Laboratory Learning, SLH-Self Learning
Hours, NLH-Notional Learning Hours, FA - Formative Assessment, SA -Summative assessment, IKS - Indian
Knowledge System, SLA - Self Leaming Assessment
Legends: @ Internal Assessment, # External Assessment, *# On Line
Examination
Note :
éxamination , @S Internal Online
1, FA-TH represents average of two class tests of 30 marks each conducted during the semester.
2. If candidate is not securing minimum passing marks in FA-PR of any course then the candidate shall be
declared as "Detained" in that semester.
If candidate is not securing minimum passing marks in SLA of any course then the candidate shall be
declared as fail and will have to repeat and resubmit SLA work.
Notional Learning hours for the semester are (CL+LL+TL+SL)hrs.* 15 Weeks
| credit is equivalent to 30 Notional hrs.
* Self learning hours shall not be reflected in the Time Table
* Self learning includes micro project / assignment / other activities.
V. THEORY LEARNING OUTCOMES AND ALIGNED COURSE CONTENT
[suo] Theory Learning Outcomes Learning content mapped with Theory [Suggested Learning
i (TLO's)aligned to CO's. Learning Outcomes (TLO's) and CO's. Pedagogies,
Unit - I Basies of Computer Graphics
TLO 1.1 Describe coordinate | 1.1 Coordinate system
system. 1.2 Graphics file formats: Basics, advantages, | Lecture Using
1 | TLO 1.2 Select and use various | disadvantages ~ BMP= GIF — JPEG - TIFF | Chalk-Board
graphics file formats. PCX Demonstration
TLO 1.3 Use different graphies | 1.3 Graphics functions & standards: Text mode, | Hands-on
functions and standards. Graphic mode, Shapes, Colors, Graphics
standards.
Unit - 11 Raster Scan Graphics
TLO 2.1 Apply Line Drawing | 2.1 Line Drawing Algorithms : Digital
algorithms to generate Line, Differential Analyzer algorithm, Bresenham’s | Lecture Using
| TLO22 Apply Circle Drawing | algorithm. Chalk-Board
algorithms to generate Circle. | 2.2 Circle Generation- Symmetry of Circle, Demonstration
TLO 2.3 Apply Polygon Filling | Bresenham’s algorithm Hands-on
algorithms to Fill Polygon 2.3 Polygon Filling : Seed Fill algorithms Flood
Fill algorithm, Boundary Fill algorithm,
Unit - III Overview of 2D And 3D
TLO 3.1 Perform various Transformations
transformations on given 3.1 Basie Transformations: Translation, Sealing, | sseure Using
graphics object. Rotation, iar ota
3. | TLO 3.2 Use composite 3.2 Matrix representations & homogeneous Be
transformations coordinates. a
TLO 3.3 Write need of 3.3 Composite transformations. eae
homogeneous coordinates. 3.4 Three-dimensional transformation.
3.5 Other transformations: Reflection, Shear.
MSBTE Approval Dt. 02/07/2024 ‘Semester - 3, K Scheme‘516/25, 1:28 AM
COMPUTER GRAPHICS
'219001-COMPUTER GRAPHICS
Course Code : 313001
‘Theory Learning Outcomes
[SNe] (1LO's)aligned to CO's.
Learning content mapped with Theory
Learning Outcomes (TLO's) and CO's.
‘Suggested Learning
Pedagogies.
TLO 4.1 Define: Windowing and
4 | Clipping,
TLO 4.2 Apply Clipping
algorithms for Line and Polygon.
Unit - IV Windowing and Clipping Techniques
4.1 Windowing concepts.
4.2 Line Clipping: Cohen Sutherland Line
Clipping algorithm, Mid-Point Subdivision Line
clipping algorithm.
4.3 Polygon Clipping: Sutherland Hodgeman
Polygon clipping algorithm.
Lecture Using
d
alk-Board
Demonstration
Hands-on
TLO 5.1 Draw various Curves
using Curve generation
5_ | algorithms.
TLO 5,2 Identify different types
of Projections.
Unit - V Introduction to Curves and
Projections
5.1 Bezier and B-Spline Curves.
5.2 Projections: Perspective and Parallel
Projection and its types.
Lecture Using
Chalk-Board
Demonstration
Hands-on
VI. LABORATORY LEARNING OUTCOME AND ALIGNED PRACTICAL / TUTORIAL EXPERIENCE:
Practical /Tutorial Laboratory |Sr] Laboratory Experiment / Practical Titles/_] Number | Relevant
Learning Outcome (LLO) [No Tutorial Titles ofhrs. | COs
: : *Write a C program to draw various graphies
ee) 1-1 Mmplemeny 2 C progrem 1 | objects (Pixel, Circle, Line, Ellipse, Rectangle, 2 cot
using different graphics functions. Triangle, Polygon) using graphics functions,
TLO2.1 Implement aC program to | . | *Write a C program fo draw line using DDA 3 cor
draw line using DDA algorithm, algorithm 3
TLO3.1 Implement a C program to ;
draw line using Bresenham’s 3a ld? fe program io drapgline using 2 co2
d Bresenham’s algorithm.
algorithm,
LLO4.1 Implementa Cprogramto] fay F
draw circle using Bresennham's | 4 | “Write a C program to draw circle using 2 co2
Bresenham’s algorithm.
algorithm
TLO 5.1 Implementa © program Tor] , | “Write a C program for Flood filalgoritim of | con
Flood fill algorithm. polygon filling ey
LLO 6.1 Implement aC program for] , | Write a C program for Boundary fill algorithm ,
"i 6 9 2 co2
Boundary fill algorithm, of polygon filling
TLO71 Implement aC program for] 7 | *Write a C program for 2D Translation and
7 4 co3
2D Translation and Scaling Scaling.
soe ement aC Program fOr § | Write a C program for 2D Rotation. 2 co3
cae tmens C Program 10") 9 ) sWrite a C program for 2D Reflection and Shear] 4 C03
TLO 10.1 Implement a C program |, | *Wite a C program for3D Translation a ss
for 3 Translation and Scaling. and Sealing . 3
LLO 11.1 Implement a C program o
Sap Rate Prog 11] Write a C program for 3D Rotation. 2 co3
LLO 12.1 Implement a € program : ee ,
for Line Clipping using Cohen- | 12 | “Write @ C program for Line Clipping using 2 co4
Cohen-Sutherland algorithm,
Sutherland algorithm,
LO 13.1 Implement a € program :
for Line Clipping using Midpoint _| 13 | , Wt @ C program for Line Clipping using 2 co4
Subdivision algorithm.
Midpoint Subdivision algorithm.
MSBTE Approval Dt. 02/07/2024
Semester - 3, K Scheme‘516/25, 1:28 AM '219001-COMPUTER GRAPHICS
COMPUTER GRAPHICS Course Code : 313001
Practical / Tutorial / Laboratory |Sr| Laboratory Experiment / Practical Titles / | Number | Relevant
Learning Outcome (LLO) No Tutorial Titles of hrs. COs
LLO 14.1 Implement C program for _ ,
Sutherland Hedgeman Polygon m ens a Gren for Sutherland Hodgeman 2 non
sii olyeon Cig
LO 18.1 Tmpementa Crema | 15 | wns a @ progam fer Beer Curve 2 | cos
Note : Out of above suggestive LLOs -
‘+ '* Marked Practicals (LLOs) Are mandatory.
‘+ Minimum 80% of above list of lab experiment are to be performed.
‘+ Judicial mix of LLOs are to be performed to achieve desired outcomes.
VII. SUGGESTED MICRO PROJECT / ASSIGNMENT/ ACTIVITIES FOR SPECIFIC LEARNING /
SKILLS DEVELOPMENT (SELF LEARNING)
Micro project
+ Implement Snake Game
+ Design Smile Face
+ Design Digital Clock
+ Any other micro projects suggested by subject teacher.
+ Develop program for moving Car
Self learning
+ Develop € language code for relevant topics suggested by the teacher
+ Any computer graphics course suggested by teacher (NPTEL, MOOCSs courses etc.)
Note:
+ Above is just a suggestive list of microprojects and assignments; faculty must prepare their own bank of
microprojects, assignments, and activities in a similar way.
+ The faculty must allocate judicial mix of tasks, considering the weaknesses and / strengths of the student in
acquiring the desired skills
+ Ifa microproject is assigned, itis expected to be completed as a group activity.
+ SLA marks shall be awarded as per the continuous assessment record.
‘+ For courses with no SLA component the list of suggestive microprojects / assignments/ activities
optional, faculty may encourage students to perform these tasks for enhanced learning experiences.
* Ifthe course does not have associated SLA component, above suggestive listings is applicable to Tutorials
and maybe considered for FA-PR evaluations.
re
Vill. LABORATORY EQUIPM!
\T / INSTRUMENTS / TOOLS / SOFTWARE REQUIRED
‘Sr.No ‘Equipment Name with Broad Specifications Relevant LLO Number
1 __| Computer System with basic configuration. All
2_[°C Compiler All
IX. SUGGESTED WEIGHTAGE TO LEARNING EFFORTS & ASSESSMENT PURPOSE (Specification
Table)
MSBTE Approval Dt. 02/07/2024 ‘Semester - 3, K Scheme‘516/25, 1:28 AM '219001-COMPUTER GRAPHICS
COMPUTER GRAPHICS
ni it Ti ‘Aligned | Learning | R- ] U- | A- | Total
[Sr NolUni Unit Title Cos Hours —_| Level | Level | Level | Marks
1_|1 | Basics of Computer Graphics Col 2 Ita 0 0
2_[ A | Raster Scan Graphics COR 4 0 [0 0 0
verview of 3
3 |r| Overvigwof 2D Ase cos 4 0 | o 0 0
Transformations
4 [ry | Nindowing and Clipping ar 0 Wad 8 0
Techniques
Tntroduction to Curves and
5 | ¥ | projections cos 2 0 | 0 0 0
Grand Total 15 o [eo 0 0
X, ASSESSMENT METHODOLOGIES/TOOLS
Formative assessment (Assessment for Learning)
+ Continuous Assessment based on Process and Product related performance indicators. Each practical will be
assessed considering
60% weightage to Process
40% weightage to Product
Summative Assessment (Assessment of Learning)
XI. SUGGESTED COS - POS MATRIX FORM.
Programme
Programme Outcomes (POs) Spgpifc
CTO NEY Outcomes*
(S08)
Course POS
loutcomes|PO-1 Basic Engineering
. Po-3 x PO-7
(COs) | and FO-2. | Aisien’ PO-4 | Practices for po Project] Life |PSO-PSO-PSO-|
Discipline Problemy [Engineering] Society,
, ™Ipevelopment| Management| Long | 1 | 2 | 3
Specific [Analysis n Tools | t
of Solutions Learning|
Knowledge
Col 2 2 2 2 1 1 I
co2 2 2 2 2 5 i 1
co3 2 2 z 2 Fi H 1
Cos 2 2 z as : 1 1
Cos 2 2 2 2 E H 1
Legends :- High:03, Medium:02,Low:01, No Mapping: -
*PS0s are to be formulated at institute level
XI. SUGGESTED LEARNING MATERIALS / BOOKS
[BrNo] ‘Author Title Publisher with ISBN Number
MSBTE Approval Dt. 02/07/2024 ‘Semester -3, K Scheme‘516/25, 1:28 AM
'219001-COMPUTER GRAPHICS
COMPUTER GRAPHICS Course Cod 13001
[Sr.No| Author Title Publisher with ISBN Number
1 Donald Hearn , M Pauline c Graphi Prentice-Hall + ISBN-10 : 0131615300 + ISBN-|
Baker omputer Graphics 13 : 978-0131615304
William M, Newman | Principles of Interactive es
2 Robert F. Sproul Computer Graphies McGraw-Hill + ISBN: 978-0-07-046338-7
Zhigang Xiang, Roy ‘Schaum O Series » ISBN: 9789389538847 =
3 | Plastock Cees ISBN: 938953884X
“Atul P. Godse, Dr. Deepali “Technical Publications ISBN 933322338X,
4 | A. Godse Computer Graphics 9789333223386
‘XIII. LEARNING WEBSITES & PORTALS
SeNo Link /Portal Description
|_| itips:7hwww.javatpoint.com/computer-graphies-programs Basic graphics programs
2\ | tttps://warstutorinlspoln leon oamipiter irephics index Be ay or
3_[ htips:/www.educba,com/line-drawing-algorithm/ Line drawing algorithm
4_[ hutps:/www.javatpoint.com/computer-graphies-clipping Clipping Algorithms
5 _| bitps:/www.tutorialspoint.com/computer_graphics/computer_gr Curves in computer
aphies_curves.htm graphics
| tps: eww ttorialspoint com/computer_graphics/2a_tansfor ey
mation.htm
7 | htts:/infyspringboard.onwingspan.com/web/en/apprtoe/iex_au Project on Computer
th_01384200894190387210361_shared/overview Graphics
Note:
+ Teachers are requested to check the creative common license status/financial implications of the suggested
online educational resources before use by the students
MSBTE Approval Dt. 02/07/2024
‘Semester - 3, K Scheme