Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
qn papers

qn papers

Ratings: (0)|Views: 28 |Likes:
Published by Raghu K Nagaraj

More info:

Published by: Raghu K Nagaraj on Feb 06, 2012
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less





Max. Marks: 80
: Answer 
question from Part 
and answer 
any five
Questions from Part B.
PART –A (5x6=30)1. How are pictures actually stored and displayed? Explain.2. With a neat diagram explain the working principle of a CRT.3. Write DDA algorithm and explain.4. What is the necessity of Clipping and windowing? Explain.5. What is rubber band technique? Explain.6. What is singularity? Describe the singularity algorithm.PART-B (10x5=50)1. With a neat diagram explain the working of DVST.2. How do you generate an ellipse? Explain in detail.3. Explain the procedure to rotate an object on arbitrary point.4. With suitable sketches and algorithm explain sutherlan-hodgeman algorithm.5. Explain the different types of techniques used in 3 dimensional imaging.6. a) Explain the applications of multimedia and simulation through computer graphics. b) Explain the priority algorithm.7. Describe any one method for clipping polygons.
Dec. 2009/Jan. 2010
PART – A (6x5=30)
1. Differentiate Random and Raster scan displays.2. Explain Octree method for hidden surface removal.3. Explain the Rubber Band Technique in Brief for graphical Input.4. A triangle ABC is located at A (10, 10). B (30, 10), C (20, 40). Work out atransformation matrix to rotate the triangle by anticlockwise about the point A.5. Explain the midpoint sub-division method in brief.6. Explain any positioning technique required for Graphical Input.
PART – B (5x10=50)
1. With suitable diagram explain shadow mask CRT and DVST.2. With neat diagrams, explain the two basic techniques used for producing color displays with a CRT.3. What is clipping? Explain Cohen and Sutherland line clipping technique withsuitable figures.4. Explain the parallel and perspective projections and the transformation matrix for each of them.5. What is shading? Discuss the different shading methods available.6. Describe Depth-Buffer algorithm. Give its advantages and disadvantages.7. What are intensity cues? Explain the stereoscope effect and Kinetic depth effect in brief.
June/July 2010
PART – A(5x6=30)1.
What is the essence of studying computer graphics?
What is simulation? Explain.
Explain DDA algorithm that draws a line between any tow points.
Describe generation of ellipse.
Explain concentration of the operations.
What is singularity? Describe the singularity algorithm.
PART – B(10x5=50)1.
With a neat diagram explain the working of DVST.
What are the techniques for 3-Dimensional displaying?
Explain three dimensional transformations.
With suitable sketches, explain Bresenham’s circle drawing algorithm.
Explain the different types of techniques used in 3 dimensional imaging
Writ short notes on:1.Depth- Buffer Algorithm.2.Notion of Effects reduction.7. Discuss on graphical input techniques.
Dec. 2010/Jan. 2011 PART – A
Discuss the role of computer graphics in present day applications.
What is the function of election gun and deflection system?
 Name the characteristics of any line drawing algorithm and explain any two.
Describe rubber band techniques.
Distinguish perspective and parallel projections.
What is solid area scan conversion?
What are the various graphic input devices? Explain the function of any three.
What are the basic transformations? Describe these using figures. Write therespective matrices.
Describe Sutherland Hodgeman procedure for clipping a polygon.
Describe in detail any two graphical input techniques.
Find the perspective transformation matrix.
Differentiate scan line and span coherence algorithms.
What are the advantages of OpenGL tool? Explain the importance of glut library.
PART –A (6x5=30)1. With an example explain fixed point multiplication.2. Explain the difference between CISC and RISC.3. Write and explain the memory hierarchy in a computer system.4. Explain the characteristics of cache memory.5. How is DMA used in computer system? Explain.6. Explain different types of dependencies.PART-B (10x5=50)1. With suitable example explain different types of instruction set.2. Explain different types of reallocation mechanism.3. Explain any two cache mapping functions with an example.4. Describe the pipelined implementation of instruction execution.5. Explain the architecture of SIMD and MIMD computers.6. a) Explain different types vector processing with pipelining. b) Write and explain SIMD algorithm.7. a) Explain the difference between multiprocessing and multiprogramming. b) Explain the working of address bus and control bus.
Dec. 2009/Jan. 2010
PART – A (6x5=30)
1. What are the instruction formats and data formats? List and describe.2. Explain the different types of Vector Instruction.3. Discuss the pipeline support in the architecture.4. Explain different types of parallel processors in brief.5. What is meant by inclusion coherence and locality in a memory hierarchy?Explain through a diagram and an example.6. Differentiate Control flow and Data flow.
PART – B (5x10=50)
1. Draw a diagram and explain multi-threaded architecture and it’s a computationmodel for a massively parallel processing system. Also list all the parameters usedin it.2. Explain the structures and operational requirements of the instruction pipelinesused in scalar RISC superscalar RISC and VLIW processors. What are the cycles per instruction expected from these processor architectures?3. Describe all the addressing modes through an example of each.4. What are the rationales for developing the Fine-Grain multi-computers? Comparethe characteristics like communication latency, synchronization overhead, GrainSize and concurrency for the Fine Grain, Medium Grain and Coarse GrainMachines.5. Differentiate the following:a) PRAM Vs. VLSI Models. b) Shared variable Model Vs. Message passing parallel Programming model.6. Describe SIMD architecture for parallelism. Explain any one SIMD parallelAlgorithm in brief.7. Explain Flynn’s classification of computer Architecture in brief with diagram.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->