PREVIOUS YEAR SOLVED PAPERS - August 2016 Paper 3

16. A point P(2, 5) is rotated about a pivot point (1, 2) by 60°. What is the new transformed point P' ?

  • Option : B
  • Explanation :
    Transformation of an object point Q(x, y), θ° about a fixed center of rotation P(h, k)
    step 1: Translate so that the center of rotation P is at the origin
    step 2: Perform a rotation of θ° about the origin, and
    step 3: Translate P back to (h, k)
    using V = hi + kj as translation vector
    Rθ,P = T-v Rθ Tv

    θ = 60°, h = 1, k = 2, Q(x, y) = (2, 5)
    Q' = Q.R60,P



    so,
    x' = (3-5.196)/2 = -2.196/2 = -1.098 ≅ -1
    y' = (7+1.732)/2 = 8.1732/2 = 4.0866 ≅ 4
    So, option (B) i.e (-1, 4) is the answer
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


17. In perspective projection (from 3D to 2D), objects behind the centre of projection are projected upside down and backward onto the view-plane. This is known as _____.

  • Option : C
  • Explanation :
  • In perspective projection (from 3D to 2D), objects behind the centre of projection are projected upside down and backward onto the view-plane. This is known as view confusion.
  • Vanishing point: Where all parallel points appear to meet is called vanishing point.
  • Perspective foreshortening: As we move from centre of projection size of object varies inversely with distance, this is known as perspective foreshortening.
  • Topological Distortion: A line segment joining a point lying in front of the viewer to a point in back of the viewer is projected to a broken line of infinite extent.This is known as topological distortion.
  • So, option (C) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


18. The Liang-Barsky line clipping algorithm uses the parametric equation of a line from (x1, y1) to (x2, y2) along with its infinite extension which is given as :
x = x1 + ∆x.u
y = y1 + ∆y.u
Where ∆x = x2– x1, ∆y = y2– y1, and u is the parameter with 0 < u < 1. A line AB withend points A(–1, 7) and B(11, 1) is to be clipped against a rectangular window with xmin = 1, xmax = 9, ymin = 2, and ymax = 8. The lower and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :

  • Option : B
  • Explanation :
    first we will calculate ∆x and ∆y:
    i.e. ∆x = x2– x1 
    = 11 - ( - 1)
    = 11 + 1 = 12.
    ∆y = y2– y1 
    = 1 - 7 = - 6
    Now P1 = -∆x = - 12
    P2 = ∆x = 12
    P3 = -∆y = 6
    P4 = ∆y = - 6
    Q1 = x1 - xmin = - 1 - 1 = -2
    Q2 = xmax - x1 = 9 - ( - 1) = 9 + 1 = 10.
    Q3 = y1 - ymin = 7 - 2 = 5.
    Q4 = ymax - y1 = 8 -7 = 1.
    P1, P4 < 0 and P2, P3 > 0.
    Intially: t1 = 0, t2 = 1
    t1 = max(0, Q1 / P1, Q4 / P4)
    = max(0, 2 / 12, 1 / -6) = 1 / 6.
    t2 = min(1, Q1 / P1, Q4 / P4)
    = min(1, 10 / 12, 5 /6). = 5 / 6.
    i.e. u ranges between (1 / 6, 5 / 6).
    So, option (B) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


19. Match the following with reference to Functional programming history:

a. Lambda calculusi. Church, 1932
b. Lambda calculus as programming languageii. Wordsworth, 1970
c. Lazy evaluationiii. Haskel, 1990
d. Type classesiv. Mecarthy, 1960

Codes:

 abcd
(1)iviiiiii
(2)iiviiiii
(3)iiiiiivi
(4)iiiiviii

  • Option : B
  • Explanation :
  • Lambda calculus was introduced by Alonzo Church in 1932.
  • Lambda calculus as programming language applied by Mecarthy in 1960
  • Lazy evaluation was introduced by Wordsworth in 1970
  • Type classes was introduced by Haskel in 1990
  • So, option (B) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


20. Aliasing in the context of programming languages refers to:

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
August 2016 Paper 3