Skip to content

Computer Graphics

CSE · Quiz · Spring 26

Paper 5 of 5Section 64-KSwitch

Section 64-K

Paper 5 of 5

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Faculty of Science & Information Technology Department of Computer Science & Engineering 64-K, CT-03, Spring 2026 Course Code: CSE411, Course Title: Computer Graphics Time: 45 Minutes Marks: 15 Answer ALL Questions [Optional] [The figures in the right margin indicate the full marks and corresponding course outcomes. All portions of each question must be answered sequentially.] 1. [Figure: A 10x12 matrix of numbers representing a grayscale image: row 1: 10 10 10 10 10 10 10 12 12 12 12 15 15; row 2: 10 10 10 10 10 10 10 12 12 12 12 15 15; row 3: 10 10 10 10 10 10 10 12 12 12 12 15 15; row 4: 10 10 10 10 10 10 10 12 12 12 12 15 15; row 5: 20 20 20 20 20 20 20 25 25 25 25 30 30; row 6: 20 20 20 20 20 20 20 25 25 25 25 30 30; row 7: 35 35 35 35 35 35 35 40 40 40 40 45 50; row 8: 35 35 35 35 35 35 35 40 40 40 40 45 50; row 9: 35 35 35 35 35 35 35 40 40 40 40 45 50; row 10: 35 35 35 35 35 35 35 40 40 40 40 45 50] Given a 10 x 12 grayscale image. Each pixel is represented using a 14-bit image. a. Build the Huffman Tree step by step (show intermediate merging) and assign Huffman codes to each pixel value. [6] [CO2] b. Compute the following: [3] [CO2] i) Original size ii) Compressed size iii) Compression Ratio iv) Average bits per pixel v) Relative Redundancy and vi) Savings 2. After applying DCT on an image block, the coefficients are: [64,20,10,5,2,1,0,0] and Quantization values are: [8,5,10,10,5,5,10,10] a. Perform quantization on the given coefficients. [3] [CO3] b. Which step in JPEG is lossy and why? [2] [CO3] c. Why is Huffman coding considered lossless? [1] [CO1]