Scribd
Upload
99 views2 pages

MCQ 22318 Computer Graphics

This document provides a 3-part marking scheme of R-Remember, U-Understand, A-Apply to different units covering topics related to computer graphics. It then lists multiple choice questions with options for each topic, along with the correct answer.

Uploaded by

Ajinkya Sambare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
99 views2 pages

MCQ 22318 Computer Graphics

This document provides a 3-part marking scheme of R-Remember, U-Understand, A-Apply to different units covering topics related to computer graphics. It then lists multiple choice questions with options for each topic, along with the correct answer.

Uploaded by

Ajinkya Sambare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 2

R - Remember

U - Understand Marking Scheme


A - Apply Remarks (if any)
(R/U/A)
Unit Number DifficultyLevel Question Answer
1 R
The graphics can be D
Computer graphics was first used b A
Which environment has been one of B
Types of computer graphics are A
Vector graphics is composed of B
Raster graphics are composed of A
Raster images are more commonly B
Each pixel has ________basic colo C
Higher the number of pixels,______ B
Display card are C
Each screen point is referred to as ...... B
Smallest size object that can be displa A
The distance from one pixel to the nex A
DVST stands for .......................... C
Write an example for non-emissive B
In computer, LCD monitor screen s A
In information technology, LCD sta A
Rays emitted by cathode ray tube A
In computer terminology, CRT stan A
Video graphics array standard is A

2 The basic attributes of a straight l D


The Cartesian slope-intercept equati A
On raster system, lines are plotted C
Expansion of line DDA algorithm is A
Which algorithm is a faster method D
The disadvantage of lineDDA is A
An accurate and efficient raster lin D
In Bresenham’s line algorithm, if t C
If we want to recolor an area that C
If the boundary is specified in a si B
In Bresenham's algorithm, while gene C
In bresenhan's algorithm error term A
OptionA OptionB OptionC OptionD OptionE OptionF

Drawing Photograph, Simulation All of these


William fetteJames fetter James goslingJohn Taylor in 1980
Graphics Macintosh Quake Multimedia
Vector and raScalar and raVector and scNone of these
Pixels Paths Palette None of these
Pixels Paths Palette None of these
Pix map bitmap both a & b None of these
Two or threeOne or two Three or fourNone of these
Bad Better Smaller None of above
VGA EGA Both a & b None of above
Resolution Pixel Persistence Dot Pitch
Picture elem Point Dot Pitch aspect ratio
Resolution Dot Pitch Pixmap ppi
Digital View Direct Visual Direct View Digital View Storage Tube
LED LCD Gas DischargPlasma Panel
flat oval cylinder cone
Liquid CrystaLow Cost Dis Local CurrentLiquid Cathode Display
light radiations signals electrons
Cathode Ray Computer ReCombat ResulComputerized regular Thermography
640 x 480 pix670 x 580 pix1280 x 1024 p800 x 600 pixels

Type Width Color All of these


y = m.x + b y = b.x + m y = x.x + m y = b + m.m
Lines Dots Pixels None of the mentioned
Digital diffe Direct differeDigital differ Data differential analyzer
Bresenham’sParallel line Mid-point al DDA line algorithm
Time consumFaster Neither a norNone of the mentioned
DDA algorithMid-point al Parallel line Bresenham’s line algorithm
Positive Equal Negative Option a or c
Boundary-fillParallel curv Flood-fill alg Only b
Scan-line fill Boundary-fillFlood-fill alg Parallel curve algorithm
One octant fiOne octant fiOne octant fiAll octants
0 1 -0.5 None of above

You might also like