JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD MCA 2017 COMPUTER GRAPHICS Previous Question Paper (August - 2017 - R13)
Note: This question paper contains two parts A and B. Part A is compulsory which carries 20 marks. Answer all questions in Part A. Part B consists of 5 Units. Answer any one full question from each unit. Each question carries 8 marks and may have a, b, c as sub questions.
PART - A
Describe the working of raster scan Systems.
Answer
A raster scan system operates by scanning the electron beam across the screen one row at a time, from top to bottom. The screen is divided into a grid of discrete pixels, and the intensity of each pixel is stored in a memory buffer called the frame buffer. As the beam moves horizontally across each scan line, the system retrieves the corresponding intensity values from the frame buffer and modulates the beam intensity to illuminate the pixels, creating the final image.
Explain about the homogeneous coordinate system.
Answer
The homogeneous coordinate system represents a 2D point (x, y) as a 3D triple (x', y', w), where x = x'/w and y = y'/w. By adding this extra coordinate w, geometric transformations such as translation, rotation, and scaling can be expressed as matrix multiplications. This unifies all affine transformations into a single matrix format, allowing complex sequences of operations to be combined through matrix concatenation.
Give the properties of B-Spline curves.
Answer
Sign in to view the complete answer paper.
Briefly explain about composite transformations.
Answer
Sign in to view the complete answer paper.
What are the advantages of BSP Tree methods?
Answer
Sign in to view the complete answer paper.
PART - B
Consider a raster display system with resolution of 600 by 300. How many pixels could be accessed per second by a display controller that refreshes the screen at the rate of 80 frames per second?
Answer
Sign in to view the complete answer paper.
Describe briefly Bresenham’s circle drawing algorithm with an example. Why do we prefer incremental algorithm over DDA?
Answer
Sign in to view the complete answer paper.
Clip a line segment between points (1, 3) to (5, 17) using Cohen Sutherland clipping algorithm so that it fit into view port with left bottom at (2, 5) and right top at (5, 12).
Answer
Sign in to view the complete answer paper.
What are the steps involved in reflecting the object about an arbitrary axis using 2-D transformations?
Answer
Sign in to view the complete answer paper.
How are periodic B-spline curves different from non-periodic B-spline curves?
Answer
Sign in to view the complete answer paper.
Given control points (10,100), (50,100), (70,120) and (100,150). Calculate coordinates of any four points lying on the corresponding Beizer curve.
Answer
Sign in to view the complete answer paper.
Explain how the issues involved in rotation and reflection are different in 3-D from 2-D. Give a detailed note.
Answer
Sign in to view the complete answer paper.
Derive the transformation matrix for perspective projection.
Answer
Sign in to view the complete answer paper.
What are key frames? Write about morping.
Answer
Sign in to view the complete answer paper.
Explain in brief about advantages and disadvantages of Depth buffer algorithm.
Answer
Sign in to view the complete answer paper.