January 2009INTERACTIVE COMPUTER GRAPHICS 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.

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

June/July 2010 PART A(5x6=30)

1. What is the essence of studying computer graphics? 2. What is simulation? Explain. 3. Explain DDA algorithm that draws a line between any tow points. 4. Describe generation of ellipse. 5. Explain concentration of the operations. 6. What is singularity? Describe the singularity algorithm. PART B(10x5=50) 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 Bresenhams 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. 1. 2. 3. 4. 5. 6.

Dec. 2010/Jan. 2011 PART A (6x5=30)

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

MT 12 January 2009 ADVANCED COMPUTER ARCHITECTURE 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 its a computation model for a massively parallel processing system. Also list all the parameters used in it. 2. Explain the structures and operational requirements of the instruction pipelines used 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? Compare the characteristics like communication latency, synchronization overhead, Grain Size and concurrency for the Fine Grain, Medium Grain and Coarse Grain Machines. 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 parallel Algorithm in brief. 7. Explain Flynns classification of computer Architecture in brief with diagram.

June/July 2010 PART A (6x5=30)

1. Explain relative mode of addressing and index mode of addressing. 2. Explain the difference between CISC and RISC. 3. Distinguish between segmentation and paging. 4. Explain the characteristics of cache memory. 5. How is DMA used in computer system? Explain. 6. What are interrupts? Explain their mechanism. PART B(10x5=50) 1. W hat are the different registers used in ALU? Illustrate the mechanism of devising fie point addition and subtraction unit. 2. Explain different types of reallocation mechanisms. 3. Explain microprogramming and micro instruction with examples. 4. Describe the term memory references? What is the principle behind address mapping? 5. Define associative memory. Discuss any two types of associative memory. 6. Discuss the role of DMA in data transfer. 7. Explain the difference between multiprocessing and multiprogramming.

Dec. 2010/Jan.2011 PART-A (6x5=35)

1. With an example explain fixed point multiplication. 2. Differentiate Control Flow and Data Flow. 3. Write and explain the memory hierarchy in a computer system. 4. Explain the characteristics of cache memory. 5. Explain the difference between CISC and RISC. 6. Explain different types of parallel processors in brief. PART-B (10x5=50) 1. Explain any two cache mapping functions with an example. 2. With suitable example explain different types of instruction set. 3. Explain the architecture of SIMD and MIMD computers. 4. Write a note on vector processing with pipelining 5. What are the rationales for developing the Fine-Grain-computers? Computer the characteristics like communication latency, synchronization Overhead, Grain Size and concurrency for the Fine Grain, Medium Grain and Coarse Grain. 6. Describe Flynns Classification. How it is different from Handlers classification? 7. Explain Vector ad Symbolic Processor with Block Diagram.

January 2009 ALGORITHMS ANALYSIS AND DESIGN MT 13PART A (6x5=30) 1. Briefly explain the procedure to calculate the running time of a program. 2. Write the algorithm to search element using merge sort technique and perform the analysis. 3. Explain the advantages and disadvantages of dynamic programming. 4. Explain the importance of external sorting. 5. Explain the algorithm for the compaction routine. 6. Describe abstract problem. PART-B (5x10=50) 1. With the help of Binary search algorithm explain the divide and conquer procedure also find its time and space complexity. 2. With the help of Kruskals algorithm find a minimum spanning tree and indicate the edges in the graph shown below: Indicate on the edges that are selected the order of their selection.

3. Write a quick sort algorithm. Analyze the time complexity in worst case. 4. With a suitable example explain the buddy system mechanism. 5. How is garbage collected in secondary memory? Explain. 6. Compare the Hamilton cycle method with traveling salesman problem. 7. What happens when binary number is incremented? Explain.

Dec.2009/Jan. 2010 PART A

1. What is buddy system? 2. What are the different traversing schemes for traversing the tree? 3. What is greedy algorithm and how it is different from dynamic programming? 4. What is the basic principle of Binary search? 5. What is Garbage collection? Explain with a example. 6. Example storage compaction. PART B 1. Explain in brief the different notations used in Algorithm analysis. 2. Describe the various method of solving recursion. 3. What is greedy algorithm and how it is different from dynamic programming? 4. What are Red black tree? Explain its various properties. 5. Explain the various sorting algorithm with their time complexity. 6. Give an example to show greedy algorithm, is not always optimized and algorithm not always yield a solution. 7. Write short not on: a) Vertex cover problem b) Circuit satisfiability.

June/July 2010 PART A

1. 2. 3. 4. 5. 6. Explain various types of linked list Explain worst, best and average case of an algorithm. What are the advantages and disadvantages of divide and conquer algorithms? What is buddy system? Explain different type of binary trees. Discuss the importance of external sorting.

PART B 1. Explain the analysis of recursive programs with an example. 2. Explain different approaches of dynamic programming. 3. Explain Dijkstars algorithm with an example. 4. Devise an algorithm to search an element using binary search and comment on its time complexity. Illustrate. 5. What is Garbage collection? Explain with an example 6. Explain various issues in memory management. 7. Write a short note on: 1 The Hamiltonian cycle problem. 2 The Traveling salesman problem.

Dec. 2010/Jan. 2011 PART A(6x5=30)

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 (10x5=50) 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.

January 2009ALGORITHM ANALYSIS AND DESIGN MT-14 PART A (6x5=30) 1. What do you mean by a database system? Elaborate the three schema architecture of a database system. 2. Why is multi tier architecture preferred? Explain. 3. Write the similarities and dissimilarities between BCNF and 3rd normal form and why BCNF is called stronger than 3rd normal form ? 4. Write the insert rules. 5. How do you cope with system failures? Explain with respect to data base. 6. Explain conflict serializability. PART-B (5x10=50) 1. Explain in detail the design principles. 2. With suitable example explain relational calculus and tuple relational calculus. 3. With suitable table and data explain different types of joins. 4. With the help of an example explain hierarchical and network model. 5. Explain two pass algorithm based on hashing technique. 6. a) Explain buffer management. b) Write the basic algorithm for executing query operation. 7. Explain concurrency control in distributed databases. Dec. 2009/Jan. 2010 PART A (6x5=30) 1. What is E-R modeling? Explain the functions and components of an E-R model. 2. Write the similarities and dissimilarities between BCNF and 4rd normal form. 3. Write a note on logical and structural address. 4. Since relations are defined as sets we know that there are no duplicate tuples. Why then can we not use the entire set of attributes of a relation as the primary key of the relation? Justify. 5. Write a note on multivalued dependency. 6. Explain domain calculus. PART B (5x10=50) 1. Explain 2 pass algorithms based on sorting and hashing. 2. How do you enforce serializability by locks? Explain. 3. a) Explain insertion and deletion rules. b) Explain secondary index. 4. Explain semantics of tuple relation calculus queries and domain relational calculus. 5. With suitable example explain the importance of candidate key, primary key and Secondary key. 6. With a .neat diagram explain transaction servers. 7. a) Write the characteristics of a distributed database. b) Write a note on data servers.

June/July 2010 PART A Answer all the questions :

(10x2+5x1=25)

4.

1. Comment on the three tier architecture of Database system. 2. Discuss the different to process a query in any DBMS. 3. Explain Extended ER model with a suitable example. Define relation. Discuss any four basic operations proposed in relational model to retrieve the information from relational database. 5. Write a note on multi-valued dependency. 6. Explain buffer management. PART B (5x10=50) 1. What are the advantages of having DBMS when compared to file management system? 2. Explain different database languages. 3. Define Functional dependency. What is its significance in building the good relational schema? 4. Explain 3NF and BCNF with an example. 5. Define transaction. Explain the life cycle of a transaction. 6. Discuss the different reasons for failure of transactions. 7. Explain any two concurrency control methods. Dec. 2010/Jan. 2011 PART A(6x5=30) 1. What are the benefits of good RDBMS? 2. Explain in brief the multi-tier architecture of DMBS. 3. Define data integrity. Explain any two integrity constraints. 4. Explain with an example. Indexing on sequential files. 5. Write a note on multivalued dependency. 6. Explain concurrency control by validation. PART B (5x10=50) 1. Explain the importance of buffer and storage management in DBMS. 2. Explain loss less join decomposition algorithm. Give an example. 3. Explain how cursors are implemented in SQL. Give an example. 4. Describe the procedure of cost estimation of any query. 5. Describe the architecture of lock scheduler. 6. Describe the procedure of normalization with an example. 7. Explain the concurrency control mechanism in distributed databases.