COURSE FILE

FOR

Computer Graphics

B.Tech II Year I Semester R16-Regulation

COMPUTER SCIENCE AND ENGINEERING

2018-19

UNIVERSITY COLLEGE OF ENGINEERING (A), JNTUK.

Jawaharlal Nehru Technological University Kakinada.

Web: http://jntucek.ac.in

SECTION – A Class

CA1 : Details of the course with faculty mentors / sections

Name of the Faculty :

Designation :

CA2 : Copy of the calendar where the class schedule

Description From To Weeks

Commencement of class work 18-06-2018

I unit of Instruction period 18-06-2018 18-08-2018 9 Weeks

I Mid Examinations

(Syllabus first three units) 20-08-2018 23-08-2018

½ Week

II unit of Instruction period 25-08-2018 19-10-2018 8 Weeks

II Mid Examinations

(Syllabus Last three units) 20-10-2018 10-11-2018

½ Week

Preparation and practical’s 24-10-2018 10-11-2018 2 ½ Weeks

End Examinations 12-11-2018 17-11-2018 1 Week

Semester Break 19-11-2018 24-11-2018 1 Week

CA3 : Class Timetable (All sections)

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

UNIVERSITY COLLEGE OF ENGINEERING: JNTU KAKINADA

w.e.f. 18-06-18 Hall-3 Academic Year : 2018-19

II B.Tech (CSE) REG- I Sem

Day/

Period

1 2 3 4 12:20

pm -

02:00

pm

5 6 7

9:00

am -

9:50

am

9:50

am –

10:40

am

10:40

am –

11:30

am

11:30

am –

12:20

pm

2:00 pm

– 2:50

pm

2:50

pm –

3:40

pm

3:40

pm –

4:30

pm

MON

SRP

DLD

L

DS

**

TUE DS THRU C++ Lab

CG JAVA U

N

C

H

(2nd Floor Lab)

WED

MFCS

DS

SRP

**

THU JAVA Lab

( 2nd Floor Lab)

**

MFCS

**

FRI

DLD

CG

JAVA

**

Subject Faculty

1. Statistics with R Programming (SRP) : Smt M Lova Kumari

2. Mathematical Foundations of Computer Science : Smt M Aruna

(MFCS)

3. Digital Logic Design (DLD) : Sri OVSS Sudhakar (ECE)

4. Java Programming (JAVA) : Dr A Krishna Mohan

5. Data Structures thru C++(DS) : Sri S Chandra Sekhar

6. Computer Graphics (CG) : Sri B Hemanth Kumar

7. Data Structures thru C++Lab (2FL) : Sri S Chandra Sekhar /

(DS THRU C++ Lab) Sri B Hemanth Kumar

8. Java Programming Lab (JAVA Lab) (2FL) : Smt S Usha Nag/

Ms K Saraswathi

Head of the Department

CA4 : List of students /roll no’s/ M/F (Section-wise with faculty)

S.No Student Roll No Student Name (As Per SSC)

1 17021A0501 SANAPALA SOWMYA

2 17021A0504 DHATLA RAKESH VARMA

3 17021A0505 BALAKA SANTHOSH

4 17021A0507 GOWRABATHUNI SRILEKHA

5 17021A0508 MAMIDI ANIL KUMAR

6 17021A0509 MUVVALA BHARATH

7 17021A0510 REBAKA THERESA JOE

8 17021A0511 GAJARLA SOWMYA

9 17021A0512 PALAKOLLU HARI CHANDANA

10 17021A0513 PANTHAM MAHIJA

11 17021A0514 DUVVURI RAVI CHANDRA

12 17021A0515 SATTI RAMA DHARANI

13 17021A0516 MAVURI GOWTHAM VAMSI

14 17021A0517 NAMAVARAPU PRAVALLIKA

15 17021A0518 BEERAKA KRUPA KIRANMAI

16 17021A0519 CHIVATAM SRI KRISHNA CHAITANYA

17 17021A0520 SANDAKA NIKHILESWARI

18 17021A0522 KURRA MANOJ KUMAR

19 17021A0524 PIPPALLA RAVINDRA BABU

20 17021A0525 CHITTURI RAJA RAJESWARI

21 17021A0527 ATYAM LAKSHMI ANISHA

22 17021A0528 NALLAMOTHULA HARIKA

23 17021A0529 GEMBALI SAI SIREESHA

24 17021A0532 VASANTHALA SAI TEJA

25 17021A0533 MALEKA FARHEEN

26 17021A0535 NADIMPALLI JAGADEESH

27 17021A0536 GAJULA RAVI SEKHAR

28 17021A0537 BATTA RAMA DAKSHNA MURTHY

29 17021A0538 ISWARYA KASIMALLA

30 17021A0539 SIRIPARAPU SPARSHIKA

31 17021A0540 GUTTI INDU PRIYA

32 17021A0541 KOLASANI PAVANI

33 17021A0542 SHAIK SAJID ALI

34 17021A0543 MANDALA VINAY SAI REDDY

35 17021A0544 TADY BHANU VADAN

36 17021A0545 DASARI. LEELA GOVARDHAN

37 17021A0546 VINUKONDA NARESH KUMAR

38 17021A0547 ASHRAF ALI SHAIK

39 17021A0548 HARIDASU YASWANTH

40 17021A0549 KANCHARLA PREETHI CHOWDARY

41 17021A0550 NENAVATH SUNITHA

42 17021A0551 ADAPA VENKATA SAI NITESH

43 17021A0552 KANCHANAPALLI BALA NAVEEN SAI

44 17021A0553 MUMMIDI SRAVANI LAKSHMI SAI

45 17021A0554 VEMPALI SRINIVAS MOURYA

46 17021A0555 AMRUTHA LAKSHMI JONNALAGADDA

47 17021A0556 ABHAY DATTA.POTLURI

48 17021A0557 SAMHITHA SEELAM

49 17021A0558 NAGA SAI TEJA ANGALAKURTHI

50 17021A0560 SIRI DEVARAPALLI

51 17021A0561 KRISHNA CHAITANYA SUBBARAO K

52 18025A0562 PULIPATI KANAKA DURGA PRASAD

53 18025A0563 RUPPA JAGANNADHA RAO

54 18025A0564 BOMMAKANTI NAGA SATYA SAI

HARICHARAN

55 18025A0565 BURRI KALYANI

56 18025A0566 DHARMALA HEMA

57 18025A0567 THOTA DHARANI

58 18025A0568 KOKKILIGADDA SAI LAKSHMI RAJESWARI

59 18025A0569 GUNDU ASWINI KUMARI

60 18025A0570 MAMIDI RUPA NAGA PARVATHI

61 18025A0571 DAKOJU SAHITYA PRIYA

62 18025A0572 PALAKEERTHI SUNITHA

CA5 : Copy page of the curriculum and syllabus

Computer Graphics – CS216

Course objectives:

To develop, design and implement two and three dimensional graphical structures

To enable students to acquire knowledge Multimedia compression and animations

To learn Creation, Management and Transmission of Multimedia objects.

UNIT-I:

2D Primitives

Output primitives – Line, Circle and Ellipse drawing algorithms - Attributes of output primitives

– Two dimensional Geometric transformations - Two dimensional viewing – Line, Polygon, Curve

and Text clipping algorithms

UNIT-II:

3D Concepts

Parallel and Perspective projections - Three dimensional object representation – Polygons, Curved

lines, Splines, Quadric Surfaces, and - Visualization of data sets - 3D Transformations – Viewing

-Visible surface identification.

UNIT-III:

Graphics Programming

Color Models – RGB, YIQ, CMY, HSV – Animations – General Computer Animation, Raster,

Keyframe - Graphics programming using OPENGL – Basic graphics primitives –Drawing three

dimensional objects - Drawing three dimensional scenes

UNIT- IV:

Rendering

Introduction to Shading models – Flat and Smooth shading – Adding texture to faces – Adding

shadows of objects – Building a camera in a program – Creating shaded objects– Rendering texture

– Drawing Shadows.

UNIT- V:

Fractals

Fractals and Self similarity – Peano curves – Creating image by iterated functions –Mandelbrot

sets – Julia Sets – Random Fractals

UNIT- VI:

Overview of Ray Tracing

Intersecting rays with other primitives – Adding Surface texture – Reflections and Transparency

– Boolean operations on Objects.

COURSE OUTCOMES:

CO. No Description Knowledge Level

CS216.1 Acquire the basics of computer graphics, different graphics

systems and applications of computer graphics with various

algorithms for line, circle and ellipse drawing objects for 2D

transformations

K3

CS216.2 Explain projections and visible surface detection techniques

for display of 3D scene on 2D screen

K5

CS216.3 Develop scene with basic graphic primitive algorithms using

OPENGL programming

K3

CS216.4 Know and be able to Explain selected among models for

lighting/shading: Color, ambient light; distant and light with

sources; Phong reflection model; and shading

K5

CS216.5 Illustrate able to create the general software architecture of

programs that use 3D object sets with computer graphics

K3

CS216.6 Discuss Adding texture surface with transparency Boolean

operations

K6

TEXT BOOKS:

1. Donald Hearn, Pauline Baker, Computer Graphics – C Version, second edition, Pearson

Education,2004.

2. F.S. Hill, Computer Graphics using OPENGL, Second edition, Pearson Education, 2003.

REFERENCE BOOKS:

1. James D. Foley, Andries Van Dam, Steven K. Feiner, John F. Hughes, Computer Graphics-

Principles and practice, Second Edition in C, Pearson Education, 2007.

CA6 : Faculty timetable of all

SECTION – B Course Plan, Mappings

CB1 : Course Objectives with COs -POs + PSOs mapping (Full Matrix)

Program Outcomes

PO 1 : Acquire in-depth knowledge of core discipline such as Algorithms and data structures,

databases, networking, mobile applications and security.

PO 2 : Analyze and synthesis the complex computer science engineering problems with their

sound applied knowledge and critical thinking

PO 3 : Solve and arrive at optimal solutions for societal and environmental problems with core

expertise and lateral thinking.

PO 4 : Develop higher order thinking and innovative ideas to solve unknown problems through

the application of appropriate methods, techniques and tools.

PO 5 : Learn and Work in competing open ended environment with modern engineering and IT

tools

PO 6 : Obtain knowledge in cutting edge technologies to contribute positively towards

collaborative multidisciplinary problem solving.

PO 7 : Acquire leadership skills and project management techniques to manage projects

efficiently to work in teams.

PO 8 : Present their knowledge and ideas effectively in any technical forum through the effective

design of documents and reports.

PO 9 : Engage in lifelong learning independently with commitment to acquire knowledge of

contemporary issues to meet the challenges in career.

PO 10 : Realize professional and ethical responsibility and act in accordance to social welfare.

Course Outcomes After learning the course, the student will be able:

CO. No Description Knowledge Level

CS216.1 Acquire the basics of computer graphics, different graphics

systems and applications of computer graphics with various

algorithms for line, circle and ellipse drawing objects for 2D

transformations

K3

CS216.2 Explain projections and visible surface detection techniques

for display of 3D scene on 2D screen K5

CS216.3 Develop scene with basic graphic primitive algorithms using

OPENGL programming K3

CS216.4 Know and be able to Explain selected among models for

lighting/shading: Color, ambient light; distant and light with

sources; Phong reflection model; and shading K5

CS216.5 Illustrate able to create the general software architecture of

programs that use 3D object sets with computer graphics K3

CS216.6 Discuss Adding texture surface with transparency Boolean

operations K6

Correlation Levels as :

1=LOW 2=MODERATE 3=HIGH

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10

CS216.1 3 2 1

CS216.2 3 1 2

CS216.3 3 3 1 1

CS216.4 3 2 2 1

CS216.5 3 1 2

CS216.6 2 1 2 1 1

TOTAL 8 6 6 10 2 5 2 2

Average 2.6 2 2 2.5 1 1.6 1 1

Average

Attainment 3 2 2 3 1 2 0 1 1 0

CB2 : Detailed week-by-week plan for the entire semester that shows:

Topics to be covered each week

Schedule of assessments (Assignments, Assessments, Tutorials, CIE, projects, SEE)

UNIT No,

Name & CO Topic

Knowledge

Level

No. Of Classes

(Hours

required)

Topic Level

Outcomes Pedagogy

UNIT - I :

2D Primitives

CS216.1

Dissemination of

Visions, Mission

PEO’s PO’s course

outcomes and

knowledge Levels

1 Lecture with

Presentation

Introduction to Output

primitives K1 2

Demonstrate the

basics of 2D

output

primitives

Lecture with

Presentation

Line drawing

algorithms K3 2

Discuss and

practice the

drawing

algorithms

Lecture with

Black Board

Circle drawing

algorithms K3 3

Lecture with

Black Board

Ellipse drawing

algorithms K3 2

Lecture with

Black Board.

Attributes of output

primitives – Two

dimensional Geometric

transformations

K2 2

Discuss and

practice the

Clipping

algorithms

Lecture with

Presentation.

Two dimensional

viewing–Line and

Polygon clipping

algorithm

K3 2 Lecture with

Black Board

Curve and Text

clipping algorithms K3 2

Lecture with

Black Board

UNIT - II :

3D Concepts

CS216.2

Introduction to 3D

concepts K1 2

Interpret the 3D

concepts and

projections

Lecture with

Presentation.

Parallel and

Perspective projections K3 2

Lecture with

Presentation.

Three dimensional

object representation –

Polygons

K5 2 Demonstrate the

three

dimensional

polygons,

curved lines and

spline

representation

Lecture with

Black Board

Three dimensional

Curved lines

representation

K5 2 Lecture with

Black Board

Three dimensional

Splines representation K5 2

Lecture with

Presentation.

Quadric Surfaces, -

Visualization of data

sets-3D

transformations

K5 2

Determine the

3D-

transformations

and visible

surface

Identification

Lecture with

Presentation.

Viewing -Visible

surface identification. K4 2

Lecture with

Presentation.

UNIT - III :

Graphics

Programming

CS216.3

Raster Animation,

Keyframe K3 2

Discuss and

know about

OPENGL

Programming

Lecture with

Presentation.

Graphics programming

using OPENGL K6 2

Lecture with

Black Board

Basic graphics

primitives K2 2

Lecture with

Presentation.

Drawing three

dimensional objects K3 2

Discuss and

practice three

dimensional

objects and

scenes

Lecture with

Black Board

Drawing three

dimensional scenes K3 2 Lecture with

Black Board

UNIT - IV :

Rendering

CS216.4

Introduction to Shading

models K2 2 Demonstrate on

shading

concepts and

textures to faces

Lecture with

Presentation.

Flat and Smooth

shading K4 2

Lecture with

Presentation.

Adding texture to faces

– Adding shadows of

objects

K6 2 Lecture with

Presentation.

Building a camera in a

program – Creating

shaded objects

K6 2 Creating shaded

objects and

shadows

Lecture with

Presentation.

Rendering texture –

Drawing Shadows. K3 2

Lecture with

Presentation

UNIT - V:

Fractals

CS216.5

Fractals and Self

similarity – Peano

curves

K4 2 Inference on

fractals and

creating image

functions

Lecture with

Black Board

Creating image by

iterated functions K6 2

Lecture with

Presentation

Mandelbrot sets – Julia

Sets – Random Fractals K4 2

Interpret on

fractals and 3D

sets

Lecture with

Presentation

UNIT - VI :

Overview of

Ray Tracing

CS216.6

Intersecting rays with

other primitives K4 2

Illustrate on rays

with primitives

Lecture with

Presentation

Adding Surface texture

– Reflections, K3 2

Demonstrate on

surface texture

and reflections

Lecture with

Presentation

Transparency –

Boolean operations on

Objects.

K6 2

Discuss about

transparency on

objects

Lecture with

Black Board

Total number of classes required: 62

CB3 : Evaluation pattern (as per BoS or approval based)

S. No Component Duration Marks

1. I Mid Examination (Objective + Descriptive)

1 hr 50 minutes

30

2. II Mid Examination (Objective + Descriptive)

1 hr 50 minutes

30

3. External Examination 3 hours 70

SECTION – C Assessments and Attainments

CC1 : Assessment marks

CO’s mapping with internal and External Examinations Questions

Mid 1 Mid 2 SEE

CS216.1 Q1 Q2 + Q1.a + Q1.b

CS216.2 Q2 Q3 + Q1.c

CS216.3 Q3 Q4 + Q1.d

CS216.4 Q4 Q5 + Q1.e

CS216.5 Q5 Q6 + Q1.f

CS216.6 Q6 Q7 + Q1.g

Targets Attainment Level

50%age of students got more than 60% of

Marks 1

60%age of students got more than 60% of

Marks 2

70%age of students got more than 60% of

Marks 3

Co - attainment for Mid – I:

S.No Roll No

CS216.1

-

CS216.3

(Obj)

CS216.1

(Q1)

CS216.2

(Q2)

CS216.3

(Q3)

1 17021A0501 8 10 5 5

2 17021A0504 6 3 4 7

3 17021A0505 7 7 4 5

4 17021A0507 8 6 6 8

5 17021A0508 8 8 2 5

6 17021A0509 6 8 0 6

7 17021A0510 8 4 5 6

8 17021A0511 7 9 4 4

9 17021A0512 8 9 6 8

10 17021A0513 5 9 3 5

11 17021A0514 9 8 7 6

12 17021A0515 8 9 4 5

13 17021A0516 8 6 4 5

14 17021A0517 7 8 5 5

15 17021A0518 9 9 6 5

16 17021A0519 7 7 5 5

17 17021A0520 7 9 6 7

18 17021A0522 7 4 5 4

19 17021A0524 7 4 1 4

20 17021A0525 8 10 6 8

21 17021A0527 7 9 7 8

22 17021A0528 6 7 7 5

23 17021A0529 7 8 6 6

24 17021A0532 7 8 4 2

25 17021A0533 8 3 6 5

26 17021A0535 7 7 7 6

27 17021A0536 6 3 4 3

28 17021A0537 8 9 6 7

29 17021A0538 7 7 4 5

30 17021A0539 7 5 4 4

31 17021A0540 7 8 4 8

32 17021A0541 8 6 7 7

33 17021A0542 8 10 5 7

34 17021A0543 9 6 3 4

35 17021A0544 7 4 1 4

36 17021A0545 7 2 2 2

37 17021A0546 7 5 4 4

38 17021A0547 7 7 5 5

39 17021A0548 7 6 0 6

40 17021A0549 7 8 4 5

41 17021A0550 6 5 4 3

42 17021A0551 5 0 3 0

43 17021A0552 7 1 0 2

44 17021A0553 7 3 2 6

45 17021A0554 7 2 2 6

46 17021A0555 6 4 4 7

47 17021A0556 7 7 1 0

48 17021A0557 7 3 2 5

49 17021A0558 7 2 2 2

50 17021A0560 8 7 2 8

51 17021A0561 7 2 1 3

52 18025A0562 6 2 3 5

53 18025A0563 6 6 3 4

54 18025A0564 8 9 7 8

55 18025A0565 6 2 3 6

56 18025A0566 7 3 5 6

57 18025A0567 8 4 1 7

58 18025A0568 5 7 3 7

59 18025A0569 6 3 2 5

60 18025A0570 8 8 1 4

61 18025A0571 7 5 2 4

62 18025A0572 4 2 2 6

SUM 437 362 233 320

ASSESSMENT = 0.7 0.6 0.5 0.6

COUNT CELL 49 41 35 44

Attainment 2 2 1 3

Co - attainment for Mid – II:

S.No Roll No

CS216.4

-

CS216.6

(Obj)

CS216.4

(Q1)

CS216.5

(Q2)

CS216.6

(Q3)

1 17021A0501 7 8 7 6

2 17021A0504 7 1 8 4

3 17021A0505 4 6 5 6

4 17021A0507 7 7 8 9

5 17021A0508 7 7 8 8

6 17021A0509 6 8 9 4

7 17021A0510 5 4 5 6

8 17021A0511 5 4 8 2

9 17021A0512 7 9 9 9

10 17021A0513 6 4 9 6

11 17021A0514 9 7 7 9

12 17021A0515 8 3 6 4

13 17021A0516 6 5 4 5

14 17021A0517 6 8 7 7

15 17021A0518 6 7 7 6

16 17021A0519 7 10 10 9

17 17021A0520 7 9 6 9

18 17021A0522 6 8 3 6

19 17021A0524 6 8 5 5

20 17021A0525 8 7 6 7

21 17021A0527 6 7 7 5

22 17021A0528 8 8 4 7

23 17021A0529 4 5 5 4

24 17021A0532 8 6 6 7

25 17021A0533 9 6 5 6

26 17021A0535 7 7 5 5

27 17021A0536 7 7 6 4

28 17021A0537 8 7 8 5

29 17021A0538 5 8 5 3

30 17021A0539 4 4 3 2

31 17021A0540 8 9 6 8

32 17021A0541 8 7 8 7

33 17021A0542 8 10 7 7

34 17021A0543 8 5 3 6

35 17021A0544 8 4 2 0

36 17021A0545 5 8 6 0

37 17021A0546 5 3 2 3

38 17021A0547 6 2 6 3

39 17021A0548 7 6 4 6

40 17021A0549 5 3 4 1

41 17021A0550 6 8 4 5

42 17021A0551 8 6 0 0

43 17021A0552 6 3 2 3

44 17021A0553 7 5 4 0

45 17021A0554 7 7 4 7

46 17021A0555 7 4 4 4

47 17021A0556 4 5 4 4

48 17021A0557 6 5 5 7

49 17021A0558 7 4 6 2

50 17021A0560 6 6 6 8

51 17021A0561 6 3 1 4

52 18025A0562 6 8 8 8

53 18025A0563 9 8 7 7

54 18025A0564 9 10 8 10

55 18025A0565 6 7 5 5

56 18025A0566 5 9 8 7

57 18025A0567 8 7 5 5

58 18025A0568 7 4 5 8

59 18025A0569 7 5 5 3

60 18025A0570 6 7 4 5

61 18025A0571 7 4 5 5

62 18025A0572 3 3 2 3

SUM 407 380 341 326

ASSESSMENT = 0.65 0.61 0.55 0.6

COUNT CELL 35 48 43 40

Attainment 1 3 2 2

CO Attainment for Mid – Examination:

CO

Mid Exam

Objective (10) Descriptive (20) Average

Assessment

Average

Attainment Assessment Attainment Assessment Attainment

CS216.1 70 2 60 2 65 2

CS216.2 70 2 50 1 60 2

CS216.3 70 2 60 3 65 2

CS216.4 65 1 61 3 63 2

CS216.5 65 1 55 2 60 2

CS216.6 65 1 60 2 63 2

Co - attainment for Semester End Examination (SEE):

S.No Roll No

CS216.1

-

CS216.6

(Q1)

Att CS

216.1

(Q2) Att

CS

216.2

(Q3) Att

CS

216.3

(Q4) Att

CS

216.4

(Q5) Att

CS

216.5

(Q6) Att

CS

216.6

(Q7) Att

1 17021A0501 10 3 11 3 CH 9 3 CH 11 3 9 3

2 17021A0504 7 2 CH 6 1 12 3 CH 4 1 9 3

3 17021A0505 5 1 7 2 CH 14 3 10 3 8 3 CH

4 17021A0507 14 3 14 3 14 3 11 3 CH 10 3 CH

5 17021A0508 6 1 9 3 CH 10 3 CH 9 3 11 3

6 17021A0509 8 3 11 3 11 3 12 3 7 2 CH CH

7 17021A0510 6 1 7 2 5 1 6 2 4 1 CH CH

8 17021A0511 3 1 9 3 CH 8 3 CH 10 3 13 3

9 17021A0512 14 3 13 3 CH 13 3 CH 13 3 13 3

10 17021A0513 0 1 13 3 6 1 CH CH 8 3 8 3

11 17021A0514 12 3 5 1 CH 12 3 9 3 CH 13 3

12 17021A0515 10 3 13 3 8 3 CH CH 6 1 14 3

13 17021A0516 6 1 14 3 CH 12 3 13 3 6 1 CH

14 17021A0517 11 3 13 3 CH 13 3 CH 11 3 10 3

15 17021A0518 10 3 12 3 8 3 10 3 CH 12 3 CH

16 17021A0519 13 3 12 3 CH 12 3 CH 10 3 12 3

17 17021A0520 14 3 13 3 9 3 11 3 CH CH 12 3

18 17021A0522 5 1 10 3 CH 6 1 CH 5 1 7 2

19 17021A0524 2 1 13 3 CH 10 3 CH 5 1 5 1

20 17021A0525 13 3 14 3 CH 13 3 CH 12 3 13 3

21 17021A0527 13 3 CH CH 13 3 13 3 13 3 12 3

22 17021A0528 9 3 11 3 5 1 12 3 CH 5 1 CH

23 17021A0529 14 3 13 3 CH 14 3 11 3 12 3 CH

24 17021A0532 9 3 12 3 CH 10 3 CH 7 2 8 3

25 17021A0533 8 3 CH 7 2 11 3 CH 12 3 10 3

26 17021A0535 8 3 13 3 CH 6 1 CH 11 3 13 3

27 17021A0536 9 3 7 2 CH 6 1 CH 6 1 11 3

28 17021A0537 9 3 14 3 CH 11 3 CH 10 3 11 3

29 17021A0538 10 3 9 3 CH 13 3 CH 7 2 13 3

30 17021A0539 6 1 CH 4 1 9 3 12 3 5 1 CH

31 17021A0540 13 3 13 3 14 3 13 3 CH CH 14 3

32 17021A0541 9 3 11 3 CH 14 3 CH 13 3 12 3

33 17021A0542 13 3 13 3 CH 13 3 13 3 CH 14 3

34 17021A0543 9 3 9 3 CH 10 3 CH 1 1 7 2

35 17021A0544 12 3 14 3 14 3 13 3 CH CH 13 3

36 17021A0545 8 3 12 3 CH 11 3 CH 7 2 7 2

37 17021A0546 7 2 11 3 10 3 12 3 CH CH 7 2

38 17021A0547 2 1 8 3 12 3 13 3 CH CH 10 3

39 17021A0548 10 3 13 3 5 1 13 3 CH CH 7 2

40 17021A0549 8 3 11 3 6 1 9 3 CH CH 5 1

41 17021A0550 10 3 10 3 7 2 10 3 CH 4 1 CH

42 17021A0551 7 2 4 1 CH 6 1 5 1 CH 12 3

43 17021A0552 2 1 CH 3 1 2 1 CH CH 1 1

44 17021A0553 3 1 CH 2 1 CH 2 1 CH 4 1

45 17021A0554 8 3 CH CH 5 1 6 1 11 3 4 1

46 17021A0555 13 3 CH CH 11 3 9 3 7 2 8 3

47 17021A0556 11 3 13 3 CH 9 3 CH 8 3 3 1

48 17021A0557 3 1 CH 3 1 3 1 CH 3 1 4 1

49 17021A0558 7 2 CH 11 3 6 1 8 3 6 1 CH

50 17021A0560 9 3 CH 11 3 CH 6 1 4 1 7 2

51 17021A0561 0 1 2 1 0 1 5 1 CH 3 1 CH

52 18025A0562 7 2 10 3 7 2 11 3 CH 12 3 CH

53 18025A0563 9 3 9 3 CH 8 3 CH 8 3 7 2

54 18025A0564 12 3 CH 12 3 13 3 CH 11 3 13 3

55 18025A0565 4 2 9 3 CH 7 2 CH 8 3 9 3

56 18025A0566 12 3 7 2 8 3 11 3 CH CH 11 3

57 18025A0567 9 3 10 3 CH 8 3 10 3 10 3 CH

58 18025A0568 14 3 7 2 CH 11 3 10 3 11 3 CH

59 18025A0569 0 1 CH 5 1 9 3 CH 2 1 CH

60 18025A0570 9 3 CH CH 6 1 8 3 7 2 7 2

61 18025A0571 11 3 CH 11 3 6 1 CH 6 1 12 3

62 18025A0572 7 2 CH CH 13 3 11 3 13 3 11 3

SUM 522 149 488 127 224 60 580 150 167 46 383 104 436 116 AVERAGE 2.4 2.76 2.06 2.58 2.42 2.21 2.52

Assessment

= 0.601 0.857 0.67 0.814 0.72 0.68 0.777

Count CELL 52 43

(46) 21

(29) 51

(58) 16

(19) 36

(47) 40

(46)

Attainment 3 3 2 3 2 2 3

CO Attainment of a course

No. of students Attained Distribution %

Course

Outcomes

Grading Avg

on Scale 3 3 2 1 3 2 1

CS216.1 2.76 38 5 3 82.6 10.8 6.5

CS216.2 2.06 14 3 12 48.2 10.3 41.3

CS216.3 2.58 45 2 11 77.5 3.4 18.9

CS216.4 2.42 13 1 5 68.4 5.2 26.3

CS216.5 2.21 26 5 16 55.3 10.6 34.0

CS216.6 2.52 31 8 7 67.3 17.3 15.2

*Note: Distribution = % (No. of students Attained / Total No. of students)

No. of students achieved more than 60%

Course

Outcomes

% Students

achieved CO CO Result

CS216.1 82.6 YES

CS216.2 48.2 NO

CS216.3 77.5 YES

CS216.4 68.4 YES

CS216.5 55.3 NO

CS216.6 67.3 YES

0

10

20

30

40

50

60

70

80

90

CS216.1 CS216.2 CS216.3 CS216.4 CS216.5 CS216.6

% STUDENTS ACHIEVED CO

% Students achieved CO

CC2 : CO Attainment Chart – Direct Method

CO

Mid Exam Sem. End Exam

Direct Assessment 30 70

Assessment Attainment Assessment Attainment

CS216.1 65 2 85.7 3 = 2 x 0.3 + 3 x 0.7 = 2.7

CS216.2 60 2 67 2 = 2 x 0.3 + 2 x 0.7 = 2.0

CS216.3 65 2 81.4 3 = 2 x 0.3 + 3 x 0.7 = 2.7

CS216.4 63 2 72 2 = 2 x 0.3 + 2 x 0.7 = 2.0

CS216.5 60 2 68 2 = 2 x 0.3 + 2 x 0.7 = 2.0

CS216.6 63 2 77.7 3 = 2 x 0.3 + 3 x 0.7 = 2.7

CC3 : Indirect Feedback details and compilation (All)

Course Exit Survey for Computer Graphics (Scale 1-5)

S.No Roll No CS216.1 CS216.2 CS216.3 CS216.4 CS216.5 CS216.6

1 17021A0501 5 3 5 3 3 4

2 17021A0504 5 3 5 4 3 4

3 17021A0505 5 2 5 4 1 4

4 17021A0507 5 3 5 4 3 3

5 17021A0508 5 3 5 4 3 4

6 17021A0509 5 3 3 4 3 4

7 17021A0510 5 3 5 4 3 2

8 17021A0511 5 3 5 4 2 4

9 17021A0512 5 3 5 4 3 4

10 17021A0513 5 2 5 4 3 4

11 17021A0514 5 3 5 4 3 4

12 17021A0515 5 3 5 4 3 4

13 17021A0516 5 3 5 4 3 4

14 17021A0517 1 3 5 4 3 4

15 17021A0518 5 3 4 4 3 3

16 17021A0519 5 2 5 2 3 4

17 17021A0520 5 3 5 4 1 4

18 17021A0522 5 3 5 4 3 4

19 17021A0524 1 1 5 4 3 2

20 17021A0525 5 3 5 4 3 4

21 17021A0527 5 3 5 4 1 4

22 17021A0528 5 2 5 4 3 4

23 17021A0529 5 3 2 4 3 4

24 17021A0532 5 3 5 3 3 4

25 17021A0533 5 4 5 4 3 4

26 17021A0535 5 3 5 4 3 3

27 17021A0536 5 3 3 4 2 4

28 17021A0537 5 2 5 4 3 4

29 17021A0538 5 3 5 4 3 4

30 17021A0539 5 3 5 4 3 4

31 17021A0540 5 3 5 4 3 4

32 17021A0541 5 3 5 4 3 1

33 17021A0542 5 2 5 4 3 4

34 17021A0543 5 3 5 4 3 4

35 17021A0544 2 3 5 4 3 4

36 17021A0545 5 3 5 1 3 4

37 17021A0546 5 3 5 4 2 4

38 17021A0547 5 3 5 4 3 4

39 17021A0548 2 3 5 4 3 4

40 17021A0549 5 3 5 4 3 4

41 17021A0550 5 3 5 4 3 3

42 17021A0551 5 3 5 4 3 4

43 17021A0552 5 3 5 4 3 4

44 17021A0553 5 3 5 4 3 4

45 17021A0554 5 1 5 2 3 4

46 17021A0555 5 2 4 4 1 4

47 17021A0556 3 3 5 4 3 4

48 17021A0557 5 4 5 4 3 4

49 17021A0558 5 3 5 4 3 4

50 17021A0560 5 1 4 1 2 3

51 17021A0561 4 3 5 4 3 4

52 18025A0562 5 1 5 4 3 4

53 18025A0563 5 3 2 1 3 4

54 18025A0564 5 3 5 4 3 4

55 18025A0565 2 2 5 4 3 4

56 18025A0566 5 3 5 4 1 4

57 18025A0567 5 3 5 3 3 4

58 18025A0568 5 3 3 4 3 4

59 18025A0569 5 3 5 4 3 4

60 18025A0570 5 2 5 4 3 4

61 18025A0571 5 3 5 2 3 4

62 18025A0572 5 3 3 3 3 4

Average 4.67742 2.75806 4.72581 3.69355 2.77419 3.80645

CC4 : CO Attainment chart – Indirect Method

Indirect Assessment CO Attainment Target

Attained or

Not

CO Course Exit Survey Attainment 80% of DA+20% of IDA

CS216.1 5 3 = 3 x 0.8 + 3 x 0.2 = 3.0 3 YES

CS216.2 3 1 = 2 x 0.8 + 1 x 0.2 = 1.8 3 NO

CS216.3 5 3 = 3 x 0.8 + 3 x 0.2 = 3.0 3 YES

CS216.4 4 2 = 2 x 0.8 + 2 x 0.2 = 2.0 3 NO

CS216.5 3 1 = 2 x 0.8 + 1 x 0.2 = 1.8 2 YES

CS216.6 4 2 = 3 x 0.8 + 2 x 0.2 = 3.0 2 YES

PO Attainment of w.r.t. Particular subject

CO-PO Mapped table

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10

CS216.1 3 2 1

CS216.2 3 1 2

CS216.3 3 3 1 1

CS216.4 3 2 2 1

CS216.5 3 1 2

CS216.6 2 1 2 1 1

CO CO

Attainment PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10

CS216.1 3.0 3 2 1

CS216.2 1.8 1.8 0.6 1.2

CS216.3 3.0 2.6 3 1 1

CS216.4 2.0 2 1.33 1.33 0.66

CS216.5 1.8 1.8 0.733 1.2

CS216.6 3.0 2 1 2 1 1

PO

Attainment 2.33 1.6 1.64 2.0 0.69 1.02 1 1

*PO Attainment = (PO Mapped Leve/3)*CO Attainment

CC5 : Final Course Committee minutes / Action taken report and feedback

It is observed that CS216.1, CS216.3, and CS216.4 are attained with high level attainment,

CS216.2 and CS216.5 with low level attainment and CS216.6 with moderate attainment in direct

assessment.

As per indirect assessment CS216.2 and CS216.4 have not attained the target level.

Report of Action to be taken:

To attain CS216.2 a different teaching pedagogy will be adopted that includes tutorials,

problem solving exercises and practical sessions on the concept of projections.

To attain CS216.4 programs are implemented for the better demonstration of shading and

building the camera

SECTION – D Course Documents

CD1 : Work Register & Attendance status (signed copy)

Hard copies enclosed

CD2 : Question papers with Key with break

Important Questions Unit Wise

UNIT – I

PART – A

1. Define Computer graphics.

2. Define refresh buffer/frame buffer.

3. What is pixel?

4. Define aspect ratio.

5. What is Output Primitive?

6. What is DDA?

7. What are the disadvantages of DDA algorithm?

8. Digitize a line from (10,12) to (15,15) on a raster screen using Bresenham’s straight line

Algorithm.

9. What are the basic lines attributes?

10. Define Translation.

11. Define Rotation.

12. Define Scaling.

13. Define Reflection.

14. Define Shear.

15. Define view port.

16. What is viewing transformation?

17. Define Clipping.

18. What are the types of Clipping?

19. What is the purpose of presentation graphics?

20. What is frame buffer?

PART-B

1. Explain DDA line drawing algorithm with Example.

2. Explain about Bresenham’s circle generating algorithm.

3. Write down and explain the midpoint circle drawing algorithm. Assume 10 cm as the

radius and co-ordinate as the centre of the circle.

4. Explain about Bresenham’s ellipse generating algorithm.

5. Write down and explain the Bresenham’s line drawing algorithm with an example.

6. Write short notes on attributes of output primitives.

7. Explain in detail the Sutherland-Hodgeman clipping algorithm with an example.

8. Write about Cohen-Sutherland line clipping algorithm with an example.

9. Explain about two dimensional geometric transformations.

10. Write short notes on clipping operations.

11. Calculate the pixel location approximating the first octant of a circle having centre at

(4,5) and radius 4 units using Bresenham’s algorithm.

12. Discuss in brief Antialiasing techniques.

UNIT - II

PART–A

1. Differentiate parallel projection from perspective projection.

2. What is shear transformation

3. What are spline curves?

4. Define quadric surfaces.

5. Categorize the 3D object representations?

6. What is a B-reps?

7. What is space-partitioning representation?

8. What is Transformation?

9. What are the types of transformations?

10. What is projection? What are the types of projection?

11. Write the matrix for 3D z-axis rotation.

12. Write the matrix for 3D translation.

13. What are the steps in 3D rotation?

14. What is scaling?

15. What is shearing?

16. What is reflection?

17. Distinguish between window port & view port?

18. What is the need of homogeneous coordinates?

19. What is fixed point scaling?

PART-B

1. With suitable examples explain all 3D transformations.

2. Differentiate parallel and perspective projections and derive their projection matrices.

3. Explain about 3D object representation.

4. Write short notes on polygon surfaces and quadric surfaces.

5. Write short notes on Bezier curve and spline.

6. Write short notes on visible surface detection methods.

UNIT - III

PART – A

1. How will you convert from YIQ to RGB color model?

2. What are subtractive colors?

3. What is RGB color model? How RGB model represented?

4. How RGB is converted to CMY?

5. How CMY is converted to RGB?

6. What is HSV color model? Draw HSV hexcone.

7. What is HLS color model?

8. What is animation? List different types of animation.

9. Define keyframe.

10. Define morphing.

11. What is Frame-by-Frame animation?

12. What does story board define?

13. What is OPENGL?

14. Give the format OpenGL vertex command?

15. What is the use of glPointSize()?

16. What is the Model view Matrix?

17. What is the Viewport Matrix?

PART-B

1. Explain about various color models?

2. Explain in detail the CMY color model.

3. Compare and contrast between RGB and CMY color models.

4. Write notes o RGB and HSV color models.

5. Write notes on raster animation.

6. Discuss the methods to draw 3D objects and 3D scenes?

7. What is OpenGL? Discuss the basic operations of OpenGL.

UNIT - IV

PART - A

1. What is a shading model?

2. Define shading.

3. Differentiate flat and smooth shading

4. How are shadow areas displayed

5. What is texture?

6. What are the two types of smooth shading?

7. What is Phong shading?

8. What is texture mapping/ pattern mapping?

9. What is environment mapping/ reflection mapping?

10. Write down the function of texture(s,t)?

11. What is the visible intensity?

12. What is the use of glTexCoord2f() function?

13. Write down the OpenGL command to define a quadrilateral face.

14. Give the basic idea of reflection Mapping.

15. What is called a shadow buffer?

16. What does sliding means?

PART-B

1. Explain the following a) Adding texture to faces b) creating shaded objects.

2. Explain the following a) Adding shadows to objects b) drawing shadows.

3. How do you create shaded objects and draw shadows explain?

4. Explain about shading models?

5. Write down and explain the details to build a camera in a program.

6. Explain in detail about Flat and Smooth shading?

UNIT - V

PART – A

1. Define Fractals. Give examples.

2. List out some properties of fractal.

3. What are three types of self-similarity found in fractals?

4. What is Koch Curve?

5. Give the general procedure to construct Koch curve.

6. What is known as L-Systems?

7. What are the instructions to be followed in L-systems?

8. What is Julia sets?

9. Differentiate Mandelbrot and Julia sets.

10. What is String Production Rules?

11. What is Iterated Function System (IFS)?

12. Give the rules for Dragon Curves?

13. Give the parameter to represent each curves based on String production.

14. What is space-filling curve?

15. What is the state of a turtle?

16. What is the functionality of hit() methods?

17. What is Constructive solid geometry?

18. What is CSG Objects?

PART-B

1. Write notes on the following

a) Peano curves

b) Julia sets

c) Mandelbrot sets

d) Random fractals.

2. Write about random fractals in detail.

3. Define Koch curve? How do you construct the Koch curve?

4. Explain about Mandelbrot sets?

5. Explain about Julia sets?

UNIT-VI

PART – A

1. What is known as Surface texture?

2. What is total internal reflection?

3. What is Ray Tracing?

PART - B

1. Discuss the following

a) Reflection and transparency

2. Explain about Intersecting rays with other primitives?

3. Explain about Boolean operation on objects?

MID – I Examination Question Papers

University College of Engineering: Autonomous: JNTUK

Department of Computer Science and Engineering

II B Tech I Sem I mid Examinations: AUG 2018

Subject: Computer Graphics PART-A Paper Setter: B. Hemanth kumar

Date: 23-08-2018 Max. Marks: 10 Time: 20mins

1. The basic attributes of a straight line segment are [ D ]

a) Type c) Color

b) Width d) All of these

2. In an application program, to set line-type attributes the following statement is used.

[ B ]

a) SetLinetype(lt) c) SETLINETYPE(lt)

b) setLinetype(lt) d) SETLINE()

3. Thick line drawn with [ D ]

a) Butt caps c) Projecting square caps

b) Round caps d) All of the above

4. In 2D-translation, a point (x, y) can move to the new position (x’, y’) by using the equation

[ D ]

a) x’=x+dx and y’=y+dx c) X’=x+dy and Y’=y+dx

b) x’=x+dx and y’=y+dy d) X’=x-dx and y’=y-dy

5. To generate a rotation , we must specify [ A ]

a) Rotation angle ϴ c) Rotation distance

b) Distances dx and dy d) All of the mentioned

6. _____ is the rigid body transformation that moves object without deformation. [ C ]

a) Translation c) Rotation

b) Scaling d) Shearing

7. If the scaling factors values sx and sy are assigned to unequal values then [ C ]

a) Uniform rotation is produced c) Differential scaling is produced

b) Uniform scaling is produced d) Scaling cannot be done

8. _______is very important in creating animated images on the screen [ A ]

a) Image transformation c) Clipping

b) Morphing d) All of these

9. The graphics method in which one object is transformed into another object are called

[ B ]

a) Clipping c) Reflection

b) Morphing d) Shear

10. The transformation that disturbs the shape of an object are called [ C ]

a) Reflection c) Shear

b) Rotation d) Scaling

11. In perspective projection, all lines of sight start at a ________point. [ D ]

a) double c) multiple

b) triple d) single

12. The problem of hidden surface are [ C ]

a) Removal of hidden surface c) Both a & b

b) Identification of hidden surface d) None of these

13. The painter algorithm are based on the property of [ B ]

a) Polygon c) Depth buffer

b) Frame buffer d) None of these

14. The animation can be defined as a collection of images played in [ B ]

a) Not sequence c) Both a & b

b) Defined sequence d) None of these

15. The depth sorting method reforms surfaces sorting in________ order of depth [ B ]

a) Increasing c) Both a & b

b) Decreasing d) None of these

16. In color raster system, the number of color choices available depends on [ B ]

a) colors in frame buffer c) RGB color

b) Amount of storage provided per pixel in frame buffer d) Neither a nor b

17. With the display intensity corresponding to a given color index ci calculated as[ D ]

a) Intensity=0.5[max(r, g, b)+ max(r, g, b)]

b) Intensity=0.5[min(r, g, b)+ min(r, g, b)]

c) Intensity=0.5[max(r, g, b)- max(r, g, b)]

d) Intensity=0.5[min(r, g, b)+ max(r, g, b)]

18. The graphics can be [ D ]

a) Drawing c) Simulation

b) Photograph, movies d) All the above

19. The quantity of an image depend on [ A ]

a) No. of pixel used by image c) No. of resolution used by image

b) No. of line used by image d) None

20. Two dimensional color model are [ C ]

a) RGB and CMKY c) RGB and CMYK

b) RBG and CYMK d) None

University College of Engineering: Autonomous: JNTUK

Department of Computer Science and Engineering

II B Tech I Sem I mid Examinations: AUG 2018

Subject: Computer Graphics PART-B Paper Setter: B. Hemanth kumar

Date: 23-08-2018 Max. Marks: 30 Time: 1hr 30min

Q.NO Questions Marks CO’s PO’s BL

1 a) Explain Bresenhams line drawing algorithm and

find the interval points between

(35, 40) and (43, 45)

6 CO1 PO2 L2

1 b) Write a short notes on 2D Transformations 4 CO2 PO1 L1

2 a) What are the difference between Parallel and

Perspective projections?

5 CO2 PO2 L1

2 b) Elucidate polygon clipping algorithm with example 5 CO1 PO1 L3

3 a) What are the color Models and Explain in brief. 6 CO3 PO3 L1

3 b) Explicate Visible surface identification 4 CO2 PO4 L2

MID – II Examination Question Papers

University College of Engineering: Autonomous: JNTUK

Department of Computer Science and Engineering

II B Tech I Sem II mid Examinations: OCT 2018

Subject: Computer Graphics PART-A Paper Setter: B. Hemanth kumar

Date: 27-10-2018 Max. Marks: 10 Time: 20mins

1. Ray-tracing is an extension of [ B ]

a) Ray calling c) Ray sampling

b) Ray casting d) Ray coherence

2. A process with the help of which images can be produced in a more realistic way is called

[ C ]

a) Fractals c) Rendering

b) Quad-tree d) Texture Mapping

3. The main property of ________ is that their shape is irregular [ A ]

a) Fractals c) Quad-tree

b) Rendering d) Shadows

4. Which of the following is used to calculate the intensity of the light that we should see at a

given point on the surface of the object [ B ]

a) Rendering c) Ambient light

b) Illumination model d) Texture mapping

5. Surface that are rough or grainy tend to scatter the reflected light in all directions. This

scattered light is called ___________________ [ A ]

a) Diffuse reflection c) Ambient light b) Specular reflection d) None of these

6. Which of the following is not a camera function__________ [ D ]

a) cam.set() c) cam.yaw()

b) cam.roll() d) cam.shade()

7. Which of the following routine need is called after each change is made to camera position

[ A ]

a) setModelViewMatrix() c) cam.set()

b) glMatrixMode() d) cam.slide()

8. Which of the following is not a reflection mapping type? [ C ]

a) Chrome mapping c) bump mapping

b) Environment mapping d) none of these

9. ____ Shading is used to de-emphasize the edges between faces by computing colors at more

point on each face. [ B ]

a) flat shading c) Phong shading

b) Gouraud shading d) Both B and C

10. Which of the following is not an example of fractals? [ D ]

a) Peano curves c) snow flake curves

b) Julia sets d) B-Spline curves

11. Which of the following function is used to produce Julia and Madelbrot sets? [ A ]

a) f(z)= 𝑍2+c c) f(z)= (𝑍 + 𝐶)2

b) f(z)= 𝐶2+z d) (𝑥 + 𝑦𝑖)2

12. Fractals deals with curves that are __________________ [ B ]

a) irregularly regular c) irregularly irregular

b) regularly irregular d) regularly regular

13. After each iteration the number of side of the Koch snowflake curve is increased by a factor

of _______ [ C ]

a) 3 b) 5 c) 4 d) 1

14. A ray tracing method to combine simple shapes to more complex shapes is called[ A ]

a) Constructive solid geometry c) ray casting

b) structured solid geometry d) rendering

15. Which of the following is used to calculate the angel of refracted light? [ C ]

a) IFS c) Snell’s law

b) ray tracing method d) Both IFS and Snell’s law

16. ______ is used to model anisotropic surfaces? [ A ]

a) frame mapping c) texture mapping

b) Bump mapping d) image mapping

17. Surface detail can be added to objects using _______________ [ D ]

a) polygon facets c) bump mapping

b) texture mapping d) All of the above

18. In ____ shading model, shading for the entire polygon is constant across the surface of the

polygon? [ A ]

a) flat shading c) Pong shading

b) gouraud shading d) fast phong shading

19. Video monitor displays use the ____ model, while hard copy devices produce color output

using the___ model. [ B ]

a) CMY,RGB c) YIQ,HSV

b) RGB,CMY d) HSV,HLS

20. Which of the following mapping you will prefer to generate an image of road containing

sudden breakers? [ A ]

a) Bump mapping c) texture mapping

b) Frame mapping d) None of these

University College of Engineering: Autonomous: JNTUK

Department of Computer Science and Engineering

II B Tech I Sem II mid Examinations: OCT 2018

Subject: Computer Graphics PART-B Paper Setter: B. Hemanth kumar

Date: 27-10-2018 Max. Marks: 30 Time: 1hr 30min

Q.NO Questions Marks CO’s PO’s BL

1 a) Explain flat shading and smooth shading in detail. 6 CO5 PO1 L2

1 b) Write a short notes on shading the graphics pipeline

model.

4 CO5 PO2 L1

2 a) What is the Successive Refinement of Koch curves

and snowflakes?

5 CO6 PO4 L1

2 b) Differentiate between Mandelbrot sets and Julia Sets 5 CO6 PO1 L4

3 a) What is adding surface texture and explain methods. 6 CO4 PO3 L1

3 b) Explicate reflection and transparency 4 CO5 PO4 L2

Roll. Number

University College of Engineering (Autonomous), Kakinada Jawaharlal Nehru Technological University Kakinada

II B. Tech I Semester (R16) Regular/Supple End Examinations, OCT/NOV-2018

COMPUTER GRAPHICS Time: 3 hrs. Max Marks: 70

Question Paper Consists of Part-A and Part-B

Answering the question in Part-A is Compulsory,

Four Questions should be answered from Part-B

Note: All parts of the question must be answered at one place.

**** PART –A 7*2=14M

1. a) Define line type.

b) Describe bundled line attributes.

c) Define depth cueing. d) What is morphing?

e) What is diffuse reflection coefficient? f) What is Julia set? g) What is CSG?

PART -B

2. a) Explain about Nicholl-Lee-Nicholl Line clipping. (7M)

b) Discuss in detail about midpoint circle algorithm. (7M)

3. a) Describe view volumes and general projection transformation. (7M)

b) Explain about cubic spline interpolation methods. (7M)

4. a) Discuss about 3D transformation in OpenGL with sample program. (7M)

b) Explain in detail about CMY color model. (7M)

5. a) What does the texture modulate? Explain. (7M)

b) Explain about using light sources in OpenGL. (7M)

6. a) Discuss in detail about drawing the Mandelbrot set. (7M)

b) Explain in detail about the Chaos game. (7M)

7. Explain the following:

a) Dealing with Refraction in shade( ) (7M)

b) Intersecting with a Cube (or any Convex Polyhedron) (7M)

CD3 : Sample answer scripts (Exceeds Expectation, Meets Expectation and Below

Expectation)

Hard copies enclosed

CD4 : Course Committee minutes

Hard copies enclosed

CD5 : Full mark list and results with analysis chart

S.No Roll No Mid Marks

(30)

SEE Marks

(70)

Final Marks

(100)

1 17021A0501 22 50 72

2 17021A0504 19 38 57

3 17021A0505 19 44 63

4 17021A0507 24 63 87

5 17021A0508 23 45 68

6 17021A0509 20 49 69

7 17021A0510 20 28 48

8 17021A0511 20 43 63

9 17021A0512 25 66 91

10 17021A0513 20 35 55

11 17021A0514 25 51 76

12 17021A0515 21 51 72

13 17021A0516 20 51 71

14 17021A0517 22 58 80

15 17021A0518 23 52 75

16 17021A0519 25 59 84

17 17021A0520 23 59 82

18 17021A0522 20 33 53

19 17021A0524 19 35 54

20 17021A0525 24 65 89

21 17021A0527 23 64 87

22 17021A0528 22 42 64

23 17021A0529 21 64 85

24 17021A0532 22 46 68

25 17021A0533 21 48 69

26 17021A0535 21 51 72

27 17021A0536 20 39 59

28 17021A0537 24 55 79

29 17021A0538 20 52 72

30 17021A0539 18 36 54

31 17021A0540 24 67 91

32 17021A0541 24 59 83

33 17021A0542 25 66 91

34 17021A0543 21 36 57

35 17021A0544 17 66 83

36 17021A0545 17 45 62

37 17021A0546 18 47 65

38 17021A0547 20 45 65

39 17021A0548 20 48 68

40 17021A0549 19 39 58

41 17021A0550 19 41 60

42 17021A0551 15 34 49

43 17021A0552 15 8 23

44 17021A0553 18 11 29

45 17021A0554 21 34 55

46 17021A0555 18 48 66

47 17021A0556 16 44 60

48 17021A0557 19 16 35

49 17021A0558 17 38 55

50 17021A0560 21 37 58

51 17021A0561 15 10 25

52 18025A0562 21 47 68

53 18025A0563 24 41 65

54 18025A0564 27 61 88

55 18025A0565 19 37 56

56 18025A0566 21 49 70

57 18025A0567 21 47 68

58 18025A0568 19 53 72

59 18025A0569 17 16 33

60 18025A0570 20 37 57

61 18025A0571 19 46 65

62 18025A0572 14 55 69

No. of students achieved more than 80%, 70%, 60% and 50% marks

No. of Students Pass %

PASS FAIL 95

57 5

No. of students

<50% 50% - 60% 60 % - 70% 70% - 80% >80%

7 13 18 10 14

CD6 : Course Feedback by students (Middle of the semester and End of Semester`)

Hard Copies enclosed

CD7 : Instructional materials & Innovations including in TLP

Hard Copies enclosed

<50%

50% - 60%

60 % - 70%

70% - 80%

>80%

SEMESTER MARKS DISTRIBUTION FOR COMPUTER

GRAPHICS

<50%

50% - 60%

60 % - 70%

70% - 80%

>80%