Scribd
Upload
136 views

Computer Graphics Tutorial BIT MESRA

1) This document contains questions related to computer graphics topics like raster graphics, resolution, scan conversion, rasterization algorithms, graphics hardware components, transformations, projections, visible surface detection algorithms, shading techniques. 2) It asks to define and explain concepts like refresh cycles, interlacing, random scan displays, the role of video controllers, objectives of graphics processors. 3) It also contains questions on rasterizing lines using midpoint circle algorithms, Bresenham's line and circle algorithms, and transformations using homogeneous coordinates.

Uploaded by

Naman Mittal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
136 views

Computer Graphics Tutorial BIT MESRA

1) This document contains questions related to computer graphics topics like raster graphics, resolution, scan conversion, rasterization algorithms, graphics hardware components, transformations, projections, visible surface detection algorithms, shading techniques. 2) It asks to define and explain concepts like refresh cycles, interlacing, random scan displays, the role of video controllers, objectives of graphics processors. 3) It also contains questions on rasterizing lines using midpoint circle algorithms, Bresenham's line and circle algorithms, and transformations using homogeneous coordinates.

Uploaded by

Naman Mittal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

SEMESTER-VII CS 7103 COMPUTER GRAPHICS TUTORIAL SHEET DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING , B. I. T.

MESRA

Q1. Discuss in brief the following term? a) Raster Scan. b) Refresh cycle & flicker. c) Interlacing. ) Resolution. e) Scan !on"ersion Q#. !alculate no. of hori$ontal & "ertical %i&els re'uire to raw a s'uare bo& of () %i&els wi e? *ssume s'uare si$e +, cm - , cm). Q.. /hat is meant by Ran om01ector is%lay? !om%are Raster scan & Ran om01ector Dis%lays? Q,. /hat is the role %laye by a "i eo controller? Q2. /hat is the ob3ecti"e of using a 4ra%hics %rocessor? Q5. Discuss with algorithm the sim%le D.*.* algorithm to rasteri$e a line? Q6. 7se sim%le D.*.* algorithm to raw line from +), ))0+2, 2)? Q(. 7se sim%le D.*.* algorithm to raster the line from +),))0+0(,0,)? Q8. Discuss D.D.* & 9resenham:s algorithm for rawing a line? /hich algorithm is more effecti"e an why? Q1). Rasteri$e the line from +), ))0+2, 2) using 9resenham:s algorithm? Q11. Rasteri$e the line from +), ))0+0(,0,) using generali$e bresenhanis algorithm? Q1#. /hat are the ifferent ways to e"elo% a circle? Discuss each metho in etail? Q1.. Discuss the role of !.R.; with "arious com%onents in !.R.;? Q1,. /rite short note on<0 a) 9eam %enetration !.R.; b) Sha ow mask !.R.; Q12. Discuss the following<0 a) ;he Direct0"iew storage ;ube +D.1.S.;) b) =lasma %anel is%lay. Q15. /hat are >i'ui !rystal Dis%lays +>!D)? ?&%lain. Q16. Discuss the "arious com%onents of the interacti"e com%uter gra%hics system with the har ware iagram? Q1(. Discuss the following<0 a) Dot matri& %rinters b) Ink03et %rinters c) =oint %lotters ) ?lectrostatic %lotters e) @latbe %lotter f) Drum %lotters Q18. Discuss the following in etail<0 a) /orl coor inate system b) Aormali$e e"ice coor inate System. !) =hysical e"ice coor inate system.

Q#). Define the term win ow & "iew%ort. Deri"e the e&%ression to transfer any %oint say +Bw, Cw) from win ow to screen "iew%ort +B", C")? Q#1. ?&%lain the following transformation techni'ues w.r.t origin? *lso gi"e the mati& re%resentation for < 1) ;ranslation #) Scaling .) Rotation Q##. Deri"e a transformation which rotates a %oint through a clockwise angle Q about %oint +R&,Ry). Q#.. Dagnify the triangle with "ertices *+),)), 9+1,1) & c+2,#) to twice its si$e while kee%ing !+2,#) fi&e ? Q#,. * unit s'uare is transforme by a # & # transformation matri&, the resulting "ectors are<0 EE EE F ) ) F F # . F F ( , F FEE5 1EEF /hat was the transformation matri&? Q#2. /rite the . homogenous transformation matri& for following 1) Shift & with ).2, y with , $ with 0).# #) Scale $ to be half as large .) Rotate by &G, about the &0a&is & &G. about y a&is. ,) Rotate by about the line %assing through the %oints +),),)) & +1,),1). Q#5. Discuss the "arious ty%es of commonly use %ointing & %ositioning e"ices. Q#6. /hat is meant by gra%hical IG% techni'ues & %ositioning techni'ues? Q#(. Discuss following %ointing & selection techni'ue a) Selection b) Selection fee back c) Dulti%le selections ) Denu selection Q.8. ?&%lain the term ragging a fi&ing as in%ut functions. *lso gi"e %ro%er synta& for the same. Q.). * wi get manufacturing firm ma e the following sales<0 Donth F Han @eb Dar *%ril Day Hune 0000000F00000000000000000000000000000000000000000000000000 Sales F ())) ,))) 6))) 5))) ,))) ())) ?&%ressF 2))) 2))) ,))) .))) #))) ,))) /rite a %rogram to %lot a) * line gra%h of the months wi get sales b) * bar gra%h of the months wi get sales c) @rom a %olygon out of the wi get sales ata & lower0left & lower0 right corners of the gra%h a&is & is%lay both fille & unfille . Q.1. Define the "arious comman s un er following %erimeters with %ro%er synta&? 1) 4ra%hic oG% %rimiti"e +#) *ttribute setting .) 1iewing o%eration +,) oG% control %rimiti"e Q.#. Define a win ow. /ithin win ow<0

1) Draw s'uare with coor inates +&1,y1) & +&#,C#)I+2),2)) & +.)),.))) name this s'uare as segment+n) for is%lay file #) >ocate %oint J%J +1)),1))) name this as segment J%J .) ?rase segment +n) from the is%lay file ,) Show each ste% on the screen & its corres%on ing effect in the is%lay file? +7se sim%le gra%hic %rimiti"e.) Q... /hat is meant by is%lay file & segmente is%lay file? Kow segment naming is one. Q.,. Define the term cli%%ing & win owing. *lso co0relate them? Q.2. /rite the algorithmG%rogram for line cli%%ing gi"en by !.Sutherlan ? Q.5. ?&%lain "arious stages in the cli%%ing of a line using !.Sutherlan algorithm +mi 0%oint sub i"ision). Q.6. !li% the %olygon =1, ...... =8 in fig+*) against win ow *9!D using sutherlan Ko gman algorithm? Q.(. /hat to you un erstan by gra%hics %rimiti"es? ?&%lain each of the %rimiti"es with %ro%er synta&? /hat are the attributes? Q.8. Define the following %rimiti"es<0 +1) L%enSegment +n) +#) !loseSegeent +.) DeleteSegement +n) +,) =ostSegement +n) +2) *%%en ;oSegement +n) +5) Initgra%h +6) Setwin ow Q,). ?&%lain the following %ro3ections< +i) =arallel =ro3ection +ii) =ers%ecti"e =ro3ection Q,1. /hat are 9e$ier cur"es? /hat is its use? Q,#. 4i"e the transformation matri& for the following< a) .0D ;ransformation b) .0D rotation c) scaling Q,.. 4i"e the com%ositi"e matri& for rotating an ob3ect about an arbitrary a&is by an angle M in .0D system. Q,,. 4i"e the com%osite matri& for scaling an ob3ect arbitrarily. Q,2. ?&%lain 9ack0@ace etection metho . Q,5. ?&%lain N09uffer algorithm for "isible surface etection. Q,6. ?&%lain the *09uffer algorithm. Q,(. /rite short notes on Scan0>ink metho . Q,8. /hat is =hong S%ecular Reflection metho . Q2). ?&%lain 4ourau sha ing. Q21. ?&%lain the terms< a) Diffuse reflection b) S%ecular Reflection c) *mbient light
*********END********

You might also like