Computer Graphics (1)
Computer Graphics (1)
Section -A (qrg-3)
Objective Questions -g TTT)
1. Answer allthe following questions. 5x3 =15
Instructions:
Thequestion paper consists of three sections namely A, B, andC. Allsections
are compulsory.
Section A-Each question willcarries 01mark. Allquestions are compulsory.
Section B- Answer any 5 out of 6in the given questions withmaximum
fifty(50) words. Each question will carries 2 marks.
Scction C- Answer any 1 out of 2in the given questions in maximum
onchundred fifty (150) words. Each question willcarries 5 marks.
Section-A
Objective Questions
5x1=05
1. Answer allthe following questions
Which of the following define computer graphics?
(a) It refersto designing plans b) It refers to designing images
(c) It means designing computets (d) it refers to designing programs
GUIstands for
(a) Graphicaluser interaction (b) Graphical user interface
(c) Graphics uniform interaction (d) Nonc of the above
a collection
III. Incomputer graphics, pictures or graphics objects are presented as
of discrete picture elements called
(a) Pixel (b) dots
(c) Points (d) coordinates
IV. The disadvantage of DDA is
(a) Time consuming (b) Fastcr
(c) no disadvantage (d) none of these
V. GraphicS can be one of the major key element in design of the
multimedia application
(a) 5 (b) 6 (c) 4 (d) 8
Mons:
The questia
Section-B 2
Questions
Short Answer TYpe
5x2=10
questions in maximum 50words.
following
Answer any five of the
2.
for raster system and vector system.
1. List the operative
characteristic
content and organization of the refresh buffer
Identify the
II. What is refresh buffer?
vector display
for the case of raster and
III. Define pixel and pixel values Plasma panel display
(i) Flat panel Display (ii)
IV. Write ashort note on scan.
between random and raster
V. Write the difference
by VGA and SVGA monitors?
VI. What doyou understand
Section -C
(Descriptive Questions)
ix5=05
maximum 150 words.
3. Answer any one question in
graphics
Discuss different image formats used in computer
resolutions 640X480,1280 X 1024, and
I!. Consider three different raster systems with
each of these systems to store 12
2560X 2048 what sie of frame buffer is needed for
bits per pixels ?
(ourse Name:-B.Tech(CS) Semester:-5
Paper Name:-Computer graphics Paper Code:- TCS-504
Time - 2 Hrs + 20minutes per hour extra time for V.l. &examinees with writer. Max Marks-70
afachtH sjcp-70
Instructions:
The question paper consists of three sections namely A, B, C. All sections are compulsory.
Section A- Each question carries 04 marks. All questions are compulsory.
Section B- Answer any 2 out of 4 given questions in maximum hundred (150) words. Each
question carries 10 marks.
Section C- Answer any 2out of 3given questions in maximum five hundred (250) words. Each
question carries 15 marks.
Section -A(aug 3)
Objective Questions(Tg-8 VA)
1. Answer all the following questions. 5x4=20
i) Which of the following is the purpose for using clipping in computer graphics?
a) Copying
b) Zooming
c) Adding graphics
d) Removing object and lines
ii) Bitmap is a collection of that describes an image.
a) Pixels
b) algorithm
c) Bits
d) Colors
ii) Which of the following is a correct abbreviation of DDA algorithm?
a) Data differential analyzer
b) Direct differential analyzer
c) Digital difference analyzer
d) Digital differential analyzer
iv) Cohen-Sutherland clipping is an example of
a) polygon clipping
b) text clipping
c) line clipping
d) curve clipping
V) The rotation axis that is perpendicular to the xy plane and passes through the pivot point is
5
a) Rotation
b) Translation
c) Scaling
d) Shearing
Section -B(qug-)
Short Answer Questions(ygaIÊN VI)
10×2=20
2. Answer anytwo of the following questions in maximum 150 words.
i) Define computer graphics. Differentiate between Raster scan and Random scarn.
ii) Define convex hull. Briefly explain Jarvis March algorithm.
ii) Discuss DDA algorithm with its advantages and disadvantages.
iv) Write short notes on a) Voronoi diagram b) Hidden surface problem
Section-C(gug-H)
Descriptive Questions (taarureH# TA)
2x15=30
3. Answer any two of the following question in maximum 250 words.
i) Explain the Sutherland Hodgeman algorithm for polygon clipping with an example
ii) Write the properties of Bspline curves. Also write advantages of B-spline curve over Bezier
CUrveS.