CG -NOVEMBER/DECEMBER 2011 question

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.

Seventh Semester

Computer Science and Engineering

CS 2401 — COMPUTER GRAPHICS

(Common to Information Technology)

(Regulation 2008)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 × 2 = 20 marks)

1. Write down any two line attributes.

2. Differentiate window and viewport.

3. What are spline curves?

4. Define quadric surfaces.

5. What is animation?

6. Define keyframes.

7. What do you mean by shading of objects?

8. What is texture?

9. Define fractals.

10. Differentiate Mandelbrot and Julia sets.

PART B — (5 × 16 = 80 marks)

11. (a) Write down and explain the midpoint circle drawing algorithm. Assume 10 cm as the radius and co-ordinate origin as the centre of the circle.

Or

(b) Explain in detail the Cohen-Sutherland line clipping algorithm with an example.

12. (a) Differentiate parallel and perspective projections and derive their projection matrices.

Or

(b) With suitable examples, explain all 3D transformations.

13. (a) Write notes on RGB and HSV color models.

Or

(b) Discuss the following:

(i) Methods to draw 3D objects. (8)

(ii) Basic OPENGL operations. (8)

14. (a) Explain the following:

(i) Adding texture to faces. (8)

(ii) Adding shadows of objects. (8)

Or

(b) Write down and explain the details to build a camera in a program.

15. (a) Write notes on Peano curves.

Or

(b) Write about random fractals in detail.

CS2401 COMPUTER GRAPHICS SYLLABUS

CS2401 COMPUTER GRAPHICS SYLLABUS

 UNIT I 2D PRIMITIVES
output primitives – Line, Circle and Ellipse drawing algorithms - Attributes of output
primitives – Two dimensional Geometric transformation - 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,- 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 – Overview of Ray Tracing –
Intersecting rays with other primitives – Adding Surface texture – Reflections and
Transparency – Boolean operations on Objects.

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:
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.

Notes

ACA syllabus

CS2354 ADVANCED COMPUTER ARCHITECTURE             L T P C 3 0 0 3

UNIT I INSTRUCTION LEVEL PARALLELISM 9

ILP – Concepts and challenges – Hardware and software approaches – Dynamic scheduling – Speculation - Compiler techniques for exposing ILP – Branch prediction.

UNIT II MULTIPLE ISSUE PROCESSORS 9

VLIW & EPIC – Advanced compiler support – Hardware support for exposing parallelism – Hardware versus software speculation mechanisms – IA 64 and Itanium processors – Limits on ILP.

UNIT III MULTIPROCESSORS AND THREAD LEVEL PARALLELISM 9

Symmetric and distributed shared memory architectures – Performance issues – Synchronization – Models of memory consistency – Introduction to Multithreading.

UNIT IV MEMORY AND I/O 9

Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main memory and performance – Memory technology. Types of storage devices –Buses – RAID – Reliability, availability and dependability – I/O performance measures –Designing an I/O system.

UNIT V MULTI-CORE ARCHITECTURES 9

Software and hardware multithreading – SMT and CMP architectures – Design issues – Case studies – Intel Multi-core architecture – SUN CMP architecture - heterogenousmulti-core processors – case study: IBM Cell Processor.

TOTAL : 45 PERIODS 56

TEXT BOOK:
1. John L. Hennessey and David A. Patterson, “ Computer architecture – A quantitative approach”, Morgan Kaufmann / Elsevier Publishers, 4th. edition, 2007.
REFERENCES:
1. David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture : A hardware/software approach” , Morgan Kaufmann /Elsevier Publishers, 1999.
2. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill, New Delhi, 2003.

ACA Internal II QP

NEHRU INSTITUTE OF ENGINEERING AND TECHNOLOGY

DEPARMENT OF COMPUTER SCIENCE AND ENGINEERING

INTERNAL EXAM II

 Subject :Advanced Computer Architecture                                                         DATE:

Subject code: CS2354                                                                                        Total Marks : 50 marks

PART A

ANSWER ALL THE QUESTION     

1.       Difference between fine grained and coarse grained multithreading?

2.       What is VLIW processor?

3.       What is sequential consistency?

4.       Disadvantages of symmetric shared memory?

5.       What is cache coherence problem?

PART B

ANSWER ALL QUESTIONS                                                                                                                 (2*12=24)

6 .Explain Distributed shared memory architecture?

Or

Explain Symmetric shared memory Architecture?

7. a. Explain synchronization? (6)

   b. Explain IA 64 architecture?(6)

Or

a.       Explain various memory consistency models(6)

b.      Explain multithreading(6)

                         PART C                                                                        

ANSWER ALL QUESTIONS                                                                                                              (1*16=16)

8. Explain Advanced compiler techniques for exposing ILP(16)

Or

1. Explain IA 64 Architecture(10)
2. Explain storage devices(6)