IT-601 Computer Graphics and Multimedia - Jun 2025 Question Paper

Under each question, How to answer lists the points an answer should cover, outlined by CampusPrep from the syllabus. Check the details against your textbook.

1. 7 Marks
   aExplain briefly about Bresenham's circle drawing algorithm with example.
   How to answer

   • Define Bresenham's circle decision parameter and 8-way symmetry
   • Steps for initial parameter and iterative update
   • Example plotting pixels for given radius
   • Advantages - integer arithmetic
2. 7 Marks
   bWrite short notes on random scan systems.
   How to answer

   • Define random scan / vector display
   • Working - electron beam directed to endpoints
   • Components - refresh display file
   • Applications and limitations
3. 7 Marks
   aCompare and contrast Boundary-fill and Flood-fill polygon fill algorithms.
   How to answer

   • Define boundary-fill - fill until boundary color
   • Define flood-fill - fill from seed replacing interior color
   • Comparison on seed, boundary condition, 4/8-connected
   • Example pseudocode for each
4. 7 Marks
   bGiven a clipping window $P(0,0)$, $Q(340,0)$, $R(340,340)$ and $S(0,340)$, find the visible portion of the lines $AB[(-170,595),(170,255)]$ and $CD[(425,85),(595,595)]$ against the given window, using Cohen-Sutherland algorithm.
   How to answer

   • Define clipping window and Cohen-Sutherland outcodes
   • Compute outcodes for AB and CD endpoints
   • Apply trivial accept/reject and intersection calculation
   • State final visible portion coordinates
5. 7 Marks
   aWhat is the principle of Cyrus-Beck algorithm for clipping a polygon? Explain it.
   How to answer

   • State parametric line and convex polygon concept
   • Principle using normal vector and dot product $N \cdot (P-P_E)$
   • t_enter / t_leave calculation for clipping
   • Steps of Cyrus-Beck algorithm
6. 7 Marks
   bExplain the various approaches followed in different line-clipping algorithms.
   How to answer

   • Categorize clipping - Cohen-Sutherland, Liang-Barsky, Cyrus-Beck, Nicholl-Lee-Nicholl
   • Outcode vs parametric vs midpoint subdivision approaches
   • Comparison of efficiency and window type
   • Summary of when each is used
7. 7 Marks
   aWrite short notes on Back face detection algorithm.
   How to answer

   • Define back face and plane equation $Ax+By+Cz+D=0$
   • Test using normal vector and view vector dot product
   • Steps to cull $C>0$ faces
   • Limitations for concave objects
8. 7 Marks
   bDifferentiate between parallel and perspective projections.
   How to answer

   • Define parallel projection - center at infinity
   • Define perspective projection - center finite
   • Comparison on foreshortening, vanishing points, preservation
   • Table of differences with applications
9. 7 Marks
   aCompare and contrast Diffuse reflection and Specular reflection.
   How to answer

   • Define diffuse - Lambert's law, matte scattering
   • Define specular - mirror-like, Phong model
   • Compare direction, shininess, viewpoint dependence
   • Formulas for $I_d$ and $I_s$
10. 7 Marks
    bExplain in detail about the multimedia system architecture.
    How to answer

    • Define multimedia system and components
    • Architecture layers - media, OS, network, application
    • Data flow and synchronization
    • Diagram of architecture
11. 7 Marks
    aWrite short notes on the multimedia databases.
    How to answer

    • Define multimedia database and media types
    • Characteristics - temporal, spatial, large volume
    • Data models and indexing
    • Applications
12. 7 Marks
    bWhat are the evolving technologies available for multimedia? Explain them.
    How to answer

    • List evolving tech - VR/AR, streaming, AI, 5G, cloud
    • Explain each technology role in multimedia
    • Examples of applications
    • Future trends
13. 7 Marks
    aExplain in detail about different compression techniques.
    How to answer

    • Classify lossless vs lossy compression
    • Explain Huffman, run-length, LZW, JPEG, MPEG
    • Comparison on ratio and application
    • Diagram of encoder-decoder
14. 7 Marks
    bDefine Animation. Write the principles of animation.
    How to answer

    • Define animation and its use
    • List 12 principles - squash, anticipation, staging etc.
    • Brief explanation of each principle
    • Example application
15. 14 Marks
    Write short notes on any two of the following:

    1. i)High dimension data
    2. ii)Applications of Visualization
    3. iii)Painter's algorithm
    4. iv)Viewing Transformation
    How to answer

    • Select any two topics from four options
    • Define each with key points and example
    • Diagram/formula where applicable
    • Applications