0% found this document useful (0 votes)
8 views4 pages

Review Questions

Uploaded by

Ahmed Gamal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
8 views4 pages

Review Questions

Uploaded by

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

1- The inverse scaling matrix is defined as:

𝑠𝑥 0 1⁄𝑠𝑥 1 1⁄𝑠𝑥 0 1 −𝑠𝑥


A) B) C) D)
0 𝑠𝑦 1 1/𝑠𝑦 0 1⁄𝑠𝑦 1 −𝑠𝑦
2- The inverse of rotation matrix is defined as:
𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃
A) B) C) D)
−𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃
3- The inverse of transformation matrix is defined as:
𝑡𝑥 0 𝑡𝑥 −1 𝑡𝑥 −𝑡𝑥
A) 𝑡𝑦 B) C) D) −𝑡𝑦
−𝑡𝑦 0 𝑡𝑦 −1
4- The rotation matrix P’= R(θ). P is defined as
𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃
A) B) C) D)
−𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃

Consider we have a square O(0, 0), B(4, 0), C(4, 4), D(0, 4) on which we first apply T1(scaling
transformation) given scaling factor is Sx=Sy=0.6 and then we apply T2(rotation
transformation in clockwise direction) it by 60*(angle), in last we perform T3(reflection
transformation about origin), move the object (2) in x direction and (3) in y direction

5- The scaling matrix is defined as


−0.6 0 0 1 −1 0 0.6 0
A) B) C) D)
0 0.6 −1 0 0 −1 0 0.6
6- The rotation matrix is defined as
0.5 −0.866 0.5 1 −0.6 0 0.866 −0.5
A) B) C) D)
0.866 0.5 −1 0.5 0.6 0 0.5 0.866
7- The reflection matrix is
0.5 0 −1 0 −1 0 0 −0.5
A) B) C) D)
0 0.5 0 −1 0 −1 0.5 0
8- The translation matrix for each vertex is:
−1 2 0 2 2 −2
A) B) C) D)
3 −1 −3 0 3 −3

9- The composite matrix of (scaling, rotation and reflection) is


0.5 0 0 1 −1 0 −0.3 0.519
A) B) C) D)
0 0.5 −1 0 0 −1 −0.519 −0.3
10- The final value of vertex C(4,4) is
2.878 2 −2.878 −2
A) B) C) D)
−0.2784 −2 −0.2784 2
11- The final value of vertex D(0,4) is
−4.078 0 4.078 −4
A) B) C) D)
−1.8 −4 1.8 0
12- The final value of vertex B(4,0) is
0.8 0.8 0.912 0
A) B) C) D)
0 0.912 0.8 4
13- Is the following code is correct for a point →glVertex2i (50, 100);
A) True B) False
14- Apply (DDA) Algorithm to compute the second pixel (k=1) coordinates to represent the line from (0,0)
to (4,6)
A) (0,0) B) (0,1) C) (1,0) D) (1,1)
15- Apply Bresenham’s Line algorithm to compute the third pixel (k=2) coordinates to represent the line
from (20, 10) and (30, 18)
A) (23,12) B) (23,11) C) (22,12) D) (22,11)
16- According to the figure, which point isn’t corresponding to (18,2) at any quadrant at
the circle
A) (-18,2) B) (18, -2) C) (18,18) D) (-18, -2)
17- Apply midpoint circle algorithm for a circle has r=10 to compute the fifth pixel
(k=4)
A) (5,8) B) (5,9) C) (4,8) D) (4,9)
18- Apply Midpoint Ellipse Drawing algorithm as rx=8 and ry=6, the start point at region 1 is
A) (1,6) B (0,6) C) (1,8) D) (0,8)
19- if the last point in region 1 is (7,3), then the first point in region 2 is
A) (3,7) B) (7,3) C) (2,8) D) (8,2)
20- ________are used to construct a scene or to give the hierarchical description of a complex object that
is composed of several parts.
A) Rotation Matrix B) Scaling Matrix C) Modeling transformations D) Geometric transformations
1) The number of pixels stored in the frame buffer of a graphics system is known as
A. Resolution B. Depth C. Points D. length
2) Which of the following statements define Computer Graphics?
A. It refers to designing plans B. It means designing computers
C. It refers to designing images D. None of the mentioned
3) Which of the following plane is used for 2D transformations?
A. Three-dimensional plane B. Two-dimensional plane
C. One-dimensional plane D. Four-dimensional Plane
4) Which of the following is a primary output device of a graphics system?
A. Printer B. Scanner C. Video monitor D. Neither Scanner nor Video
monitor
5) Which of the following algorithms is a faster method for calculating pixel
positions?
A. Parallel line algorithm B. Mid-point algorithm
C. DDA line algorithm D. Bresenham’s line algorithm
6) How many axes do 3D graphics consist of?
A. Two axes B. Three axes C. Five axes D.
One axis
7) 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
8) The most used input device is.
A. Mouse B. Keyboard C. Scanner D. Printer
9) The quality of a picture obtained from a device depends on
A. Dot size B. Number of dots per inch
C. Number of lines per inch D. All of the mentioned
10) The Cartesian slope-intercept equation for a straight line is
A. y = m.x + b B. y = b.x + m C. y = x.x + m D. y = b + m.m
11) CRT means………..
A. Common ray tube B. Cathode ray tube C. Communication ray tube D.
None
12) LCD means ……..
A. Liquid crystal data B. Liquid chrome data
C. Liquid crystal displays D. None
13) Plasma panel is an …………… device
A. Emissive B. Non emissive C. Expensive D.
None
14) GUI means ……..
A. Graphical uniform interaction B. Graphical user interaction
C. Graphical user interface D. Graphical user internet
15) A line can be represented by ……..
A. One point B. Two points C. Three points D.Four points
16) Bresanham circle algorithm uses the approach of
A. Midpoint B. Point C. Line D. Vertex
17) _____describing the geometry of objects are typically referred to as geometric
primitives.
A. Input primitives B. Midpoint Algorithm
C. Bresanham Algorithm D. Output primitives
18) ___________ draws a single point within one pixel
A. GlVertix*() B. Glvert*() C. glVertex*() D. GL_Vertex*()
19) ___________ Connects every two consecutive points only.
A. glBegin (GL_LINES); B. glBegin (GL_LINES_STRIP);
C. glBegin (GL_LINES_LOOP); D. glBegin (GL_LINES_circle);
20) ________Connect each point to the next point after without closing the shape
A. glBegin (GL_LINES); B. glBegin (GL_LINES_STRIP);
C. glBegin (GL_LINES_LOOP); D. glBegin (GL_LINES_circle);
21) ________Connect each point to the next point after with closing the shape
A. glBegin (GL_LINES); B. glBegin (GL_LINES_STRIP);
C. glBegin (GL_LINES_LOOP); D. glBegin (GL_LINES_circle);
22) ______is OpenGl Utility library and provides routines for setting up viewing and
projection
A. GLUT B. GLU C. GL_POLYGON D. GL_2D
23) _________OpenGL Utility toolkit library
A. GLUT B. GLU C. GL_POLYGON D. GL_2D
24) For instance, with Microsoft Windows, the header file that accesses the WGL
routines is
A. office.h B. microsoft.h C. windows.h D.
visual_studio.h
25) The disadvantage of lineDDA is
A. Time consuming B. Faster C. Neither a nor b D. All the
mentioned
26) ___________ is defined as set of points such that the sum of the distances is same for all
points.
A.Circles B.Lines C. Ellipses D.Points
27) __________ allows screen positions to be selected with the touch of a finger.
A. Mouse B.Image scanner C.Light pen D. Touch
panels
28) In midpoint ellipse algorithm, if the initial value of the decision parameter in
region 1 is less than 0, the next pint is
𝐴. (𝑥𝑘 , 𝑦𝑘 ) B. (𝑥𝑘 − 1, 𝑦𝑘 ) C. (𝑥𝑘 + 1, 𝑦𝑘 ) D. (𝑥𝑘 +
1, 𝑦𝑘 − 1)
29) In midpoint ellipse algorithm, if the initial value of the decision parameter in
region 1 is greater than 0, the next pint is
𝐴. (𝑥𝑘 , 𝑦𝑘 ) B. (𝑥𝑘 − 1, 𝑦𝑘 ) C. (𝑥𝑘 + 1, 𝑦𝑘 ) D. (𝑥𝑘 +
1, 𝑦𝑘 − 1)
30) If 𝟐𝒓𝟐𝒚 𝒙 ≥ 𝟐𝒓𝟐𝒙 𝒚, this mean, we are
A. Still in region 1 B. Region 2 is started
C. This is end of ellipse D. Finished the first quarter of the ellipse

You might also like