I Semester M.Tech. (I.T.) Examination, Dec. 2011 /Jan. 2012 INTERACTIVE COMPUTER GRAPHICS Time : 3 Hours Max.

Marks : 80

Instruction : Answer all questions from Part A and answer any five questions from Part B. PART A Answer all questions. Each carries two marks. (5x6=30)

1. What is full color system? What is the storage requirement of such systems? How many colors are possible with random scan CRT? 2. Discuss (i) interlacing (ii) over scanning. 3. Briefly explain rubber band technique. 4. What is reflection? Show this operation using figure. Find the transformation matrices for reflection on co-ordinate axes. 5. What are two types of projections? Draw figures to show these. 6. What is singularity? Describe singularity detection algorithm.

PART B (5X10=50) 1. 2. 3. 4. Explain the working of DVST with a diagram . What are its merits and demerits.? Discuss a circle drawing algorithm. Illustrate. Discuss Cohen Sutherland line clipping and Illustrate using two lines. Why is window to view port transformation necessary ? Explain this transformation and given an example. 5. 6. 7. Explain in detail different techniques in 3 D display. Discuss depth sorting procedure of hidden surface removal. What is shading ? Discuss different shading methods.

1 Semester M.Tech. (I.T.) Examination, December 2011/January 2012 ALGORITHM ANALYSIS AND DESIGN Time: 3 Hours Max. Marks: 80

Instruction: Answer all questions from Part A and answer any five questions from Part B. PART A (65 = 30) 1. What are linked lists? Why they are important? 2. What do you understand by the term order of growth? 3. What is back tracking? Explain with an example. 4. What is Garbage collection? Explain with an example. 5. What is binary tree? Explain. 6. What is principle of optimality?

PART B (510 = 50) 1. What do you understand by the term asymptotic notation? Explain different types of this notation. 2. Explain Analysis of Recursive Programs. 3. Explain dynamic programming with an example. 4. Explain Bubble sort with an example. 5. Explain resource allocation problem with an example. 6. Describe the characteristic of external sorting. 7. What is the difference between top down and bottom up strategy?

MT 14
I Semester M.Tech. (IT) Examination, December 2011 /January 2012 ADVANCED DBMS Time : 3 Hours Max. Marks : 80

Instruction : Answer all questions from Part A, and answer any five questions from Part B. PART A (6X5=30) 1. 2. 3. 4. 5. 6. What are the data model? Why they are needed? What are the basics of Relational Algebra? What are the views? Explain with an example. Why record modification is necessary? Write a note on multi valued dependency. What is dynamic SQL. PART B ( 5X 10 = 50) 1. 2. 3. 4. 5. 6. 7. Explain different database languages. Explain different Entity Relationship with diagram. Write a short note on i) Secondary Indexes ii) Indexes on Sequential files. Describe Keys and Foreign keys. Write a short note on DDL and DML. Explain concurrency control in distributed Database. What are deadlocks? How are they recovered?

I Semester M. Tech. (I.T.) Examination January 2009 INTERACTIVE COMPUTER GRAPHICS Time: 3 Hours Max. Marks: 80 Instruction: Answer all question from Part A, 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.

I Semester M. Tech. (IT) Examination, Dec. 2009/Jan. 2010 INTERACTIVE COMPUTER GRAPHICS Time: 3 Hours Max. Marks: 80 Note: This question pare comprise 2 parts. In Part A, All questions are Compulsory and each question carry 5 marks. In part B, Attempt Any 5 questions and each question carry 10 marks. 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 a transformation 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 with suitable 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.

I Semester M.Tech. (IT) Examination, Dec. 2010/Jan. 2011 INTERACTIVE COMUTER GRAPHICS
Time: 3 Hours Max. Marks: 80 Instruction: Answer all questions of Part A and any five questions form Part B.

PART A
1. Discuss the role of computer graphics in present day applications. 2. What is the function of election gun and deflection system? 3. Name the characteristics of any line drawing algorithm and explain any two. 4. Describe rubber band techniques. 5. Distinguish perspective and parallel projections. 6. What is solid area scan conversion?

(6x5=30)

PART B

(5x10=50)

1. What are the various graphic input devices? Explain the function of any three. 2. What are the basic transformations? Describe these using figures. Write the respective matrices. 3. Describe Sutherland Hodgeman procedure for clipping a polygon. 4. Describe in detail any two graphical input techniques. 5. Find the perspective transformation matrix. 6. Differentiate scan line and span coherence algorithms. 7. What are the advantages of OpenGL tool? Explain the importance of glut library.

I Semester M.Tech. (I.T.) Examination, Dec. 2010/Jan. 2011 ALGORITHM ANALYSIS AND DESIGN Time: 3 Hours Max. Marks: 80 Instruction: Answer all questions form Part A and answer any five questions form Part B PART A 1. Explain quick sort with an example. 2. What are the basic principles involving in recursive algorithm? 3. What is back tracking? Explain with an example. 4. Explain garbage collection with an example. 5. Explain different traversing schemes for traversing a tree. 6. Define minimum cost spanning tree and explain with an example. PART B 1. Explain the various types of linked lists. 2. Explain the Kruskals algorithm with an example. 3. Explain merge sort with an example. 4. What is greedy algorithm and how it is different from dynamic programming? 5. Explain hashing technique with an example. 6. Explain various issues in memory management. 7. What is red black tree? Explain its various properties. (10x5=50) (6x5=30)