Apply | Karma Play

Karmaplay Aptitude Test

Welcome to the Karma Play Academy Aptitude Test for aspiring game programmers. Please note the following:

This test is not a traditional Pass/Fail test. It is designed to test your basic maths, physics and game engine knowledge so that our tutors can help you during the course
The Final Game Project during the last six months of the Diploma in Game Programming requires you to work as part of a team of three to four other students. This Aptitude Test will help our tutors identify other suitable team members

So, take a deep breath, chill out and get started!

1 / 30

Z-buffer is used for:

Increase details of picture

Remove invisible pixels

Remove invisible triangles

Store alpha channel

None of above

2 / 30

Which is the correct formula to calculate Vector Length?

Vector{x, y,z};

VecLength = x*x + y*y + z*z;

VecLength = sqrt(x*x + y*y + z*z)

VecLength = sqrt(x + y + z);

VecLength = (x + y + z);

VecLength = sqrt(xy + yz + zx);

3 / 30

How do you derminate if a point lies in the plane?

Point (xp, yp, zp); Plane (a, b, c, d)

a * xp + b * yp + c * zp + d = -1

a * xp + b * yp + c * zp + d = 1

a * xp + b * yp + c * zp + d = 0

a * xp + b * yp + c * zp = 0

a * xp + b * yp + c * zp + d = a

4 / 30

Select the INCORRECT statement regarding anti-aliasing.

Used to decrease aliasing of picture

Increase quality of picture

Can be replaced or supplemented with bilinear or trilinear filtering

Way to remove Z-Fighting

Algorithm which add halftone pixels on edges

5 / 30

What geometric figure is the crossing of 2 planes?

Circle

Plane;

Line

Point

Sphere.

6 / 30

What do we mean by multi-texturing?

When an object has only one texture

When an object has no textures

When an object has only two textures

When an object has only five textures

When an object has more than one texture

7 / 30

Which is the formula for a Plane?

ax + by + c = 0;

ax + by + cz = 0;

ax + b + cz = 0;

d) ax + by + cz + d = 0;

ax + byz + z = 0;

8 / 30

Select the correct answer about Euler angles and Quaternions.

Only quaternions can be used for rotate object

Quaternion can provide more smooth motion

Euler angles with quaternion defines position and rotation of object in 3D space

Euler angles provide fast and smooth motion

Euler angles can’t be transformed to quaternion

9 / 30

What is the function that defines a point into a BoundBox?

BOOL is_pos_in_box(boundbox *pout_box, point3d *pin_point){ if((pout_box->bmin[0] > pin_point->x) & (pout_box->bmax[0] x)){ return FALSE; } if((pout_box->bmin[1] > pin_point->y) & (pout_box->bmax[1] y)){ return FALSE; } if((pout_box->bmin[2] > pin_point->z) & (pout_box->bmax[2] z)){ return FALSE; } return TRUE;

BOOL is_pos_in_box(boundbox *pout_box, point3d *pin_point){ if((pout_box->bmin[0] > pin_point->x) | (pout_box->bmax[0] x)){ return FALSE; } if((pout_box->bmin[1] > pin_point->y) | (pout_box->bmax[1] y)){ return FALSE; } if((pout_box->bmin[2] > pin_point->z) | (pout_box->bmax[2] z)){ return FALSE; } return TRUE; } c) BOOL is_pos_in_box(boundbox *pout_box, point3d *pin_point){ if((pout_box->bmin[0] > pin_point->x) || (pout_box->bmax[0] x)){ return FALSE; } if((pout_box->bmin[1] > pin_point->y) || (pout_box->bmax[1] y)){ return FALSE; } if((pout_box->bmin[2] > pin_point->z) || (pout_box->bmax[2] z)){ return FALSE; } return FALSE; }

BOOL is_pos_in_box(boundbox *pout_box, point3d *pin_point){ if((pout_box->bmin[0] > pin_point->x) || (pout_box->bmax[0] x)){ return FALSE; } if((pout_box->bmin[1] > pin_point->y) || (pout_box->bmax[1] y)){ return FALSE; } if((pout_box->bmin[2] > pin_point->z) || (pout_box->bmax[2] z)){ return FALSE; } return TRUE; }

BOOL is_pos_in_box(boundbox *pout_box, point3d *pin_point){ if((pout_box->bmin[0] > pin_point->x) && (pout_box->bmax[0] x)){ return FALSE; } if((pout_box->bmin[1] > pin_point->y) && (pout_box->bmax[1] y)){ return FALSE; } if((pout_box->bmin[2] > pin_point->z) && (pout_box->bmax[2] z)){ return FALSE; } return TRUE; }

10 / 30

. How do you scale a vector?

Vec(x, y, z); fScale – Scale Factor

ScaledVector(xs, ys, zs)

xs = x / fScale; ys = y / fScale; zs = z / fScale

xs = x * fScale; ys = y * fScale; zs = z * fScale

xs = 1 / x * fScale; ys = 1 / y * fScale; zs = 1 / z *fScale

xs = fScale / x; ys = fScale / y; zs = fScale / z

xs = fScale; ys = fScale; zs = fScale

11 / 30

What figure is the crossing of a line and a plane?

Line

Circle

Plane

Point

Nothing

12 / 30

How do you find the normal to a plane?

(a, b, d)

(a, b, c)

(b, c, d)

(a, c, d)

(a, a, a)

13 / 30

If 2 vectors are opposite, what is required to define it?

Cross Product;

Dot Product;

Normalize;

Cross Product of 2 Normalized vectors;

Multiply like x1*x2 + y1*y2 + z1 * z2;

14 / 30

Which is the correct formula for a Cross Product?

Vector1 = {x1, y1, z1};

Vector2 = {x2, y2, z2};

Result – Result vector{x, y, z}.

x = y1* z2 – z1 * y2; y = z1* x2 – x1 * z2; z = x1* y2 – y1 * x2;

x = y2* z2 – z2 * y2; y = z1* x2 – x1 * z2; z = x1* y1 – y1 * x1;

x = y1* z1 – z2 * y2; y = z1* x2 – x1 * z2; z = x1* y2 – y1 * x2

x = y2* z2 – z1 * y2; y = z1* x2 – x1 * z2; z = x2* y2 – y1 * x2;

x = y2* z1 – z1 * y2; y = z2* x1 – x2 * z1; z = x1* y2 – y1 * x2;

15 / 30

How do you determine the square between 2 vectors?

DotProduct

CrossProduct

Vector Length of Cross Product

Vector Length of Dot Product

Dot Product of 2 Normalised Vectors

16 / 30

What does 'back-face culling' mean?

Drop all faces whose normals are opposite with screen view vector

Drop all faces whose normals are opposite with center of object vector

Drop all faces that invisible

Drop all faces that visible

Drop all faces

17 / 30

What is the minimum required to define a plane?

2 Points;

3 Points;

2 Vectors;

1 Vector and 2 Points;

3 Vectors;

18 / 30

Z fighting is…

Visual trembling because of near Z coordinates of overlapped polygons

Overlap polygons over Z axis

Bug in GPU

Visual trembling because of overlapped triangles that have near values in Z buffer

19 / 30

Which is the function that defines a BoundBox into a BoundBox:

BOOL is_box_in_box(boundbox *pout_box, boundbox *pin_box){ for(int ix = 1; ix bmin[ix] > pin_box->bmin[ix]){ return FALSE; } if(pout_box->bmax[ix] bmax[ix]){ return FALSE; } } return TRUE; }

BOOL is_box_in_box(boundbox *pout_box, boundbox *pin_box){ for(int ix = 0; ix bmin[ix] > pin_box->bmin[ix]){ return TRUE; } if(pout_box->bmax[ix] bmax[ix]){ return TRUE; } } return FALSE; }

BOOL is_box_in_box(boundbox *pout_box, boundbox *pin_box){ for(int ix = 0; ix bmin[ix] > pin_box->bmin[ix]){ return FALSE; } if(pout_box->bmax[ix] bmax[ix]){ return FALSE; } } return TRUE; }

BOOL is_box_in_box(boundbox *pout_box, boundbox *pin_box){ for(int ix = 0; ix bmin[ix] bmin[ix]){ return FALSE; } if(pout_box->bmax[ix] > pin_box->bmax[ix]){ return FALSE; } } return TRUE; }

BOOL is_box_in_box(boundbox *pout_box, boundbox *pin_box){ for(int ix = 0; ix bmin[ix] > pin_box->bmin[ix]){ return TRUE; } if(pout_box->bmax[ix] bmax[ix]){ return TRUE; } } return FALSE; }

20 / 30

Which is the correct formula for a Dot Product?

Vector1 = {x1, y1, z1};

Vector2 = {x2, y2, z2};

x1*x2 + y1*y2 + z1*z2;

x1*x1 + y2*y2 + z2*z2;

x1*y1*z1 + x2*y2*z2;

x1*x2 – y1*y2 + z1*z2;

x1*x1 + y1*y2 + z1*z1;

21 / 30

Select the answer which describes the proper characteristics of mip-mapping?

Increase visual quality of 3D

Decrease texture memory requirements

Increase texture memory requirements

a + b

a + c

22 / 30

How do you determine the angle between vectors?

Cross Product

Cross Product of Normalizing vectors

DotProduct

ArcCos of DotProduct

ArcSin of DotProfuct

23 / 30

How do you normalize a vector??

Vector1{x, y, z} Normalised{xn, yn, zn}

xn = x * VecLength(Vector1); yn = y * VecLength(Vector1); zn = z * VecLength(Vector1);

xn = x / VecLength(Vector1); yn = y / VecLength(Vector1); zn = z / VecLength(Vector1);

xn = x * x; yn = y * y; zn = z * z;

xn = x / x; yn = y / y; zn = z / z;

xn = VecLength(Vector1) / x; yn = VecLength(Vector1) / y; zn = VecLength(Vector1) / z;

24 / 30

Which is the fastest way to check if a point (P) is inside a Sphere?

Calculate dot product of P and sphere center vector and compare it with radius

Compare square root of distance between sphere center and P with sphere radius

Compare distance between sphere center and P with squared sphere radius

Compare distance between sphere center and P with sphere radius

Compare square root of distance between sphere center and P with doubled sphere radius

25 / 30

How do you translate the matrix?

void translate_matrix(matrix *m, double xtrans, double ytrans, double ztrans){ m->m[0][3] = (float) xtrans; m->m[1][3] = (float) ytrans; m->m[2][3] = (float) ztrans; }

void translate_matrix(matrix *m, double xtrans, double ytrans, double ztrans){ m->m[3][2] = (float) xtrans; m->m[3][1] = (float) ytrans; m->m[3][0] = (float) ztrans; }

void translate_matrix(matrix *m, double xtrans, double ytrans, double ztrans){ m->m[2][2] = (float) xtrans; m->m[1][1] = (float) ytrans; m->m[0][0] = (float) ztrans; }

void translate_matrix(matrix *m, double xtrans, double ytrans, double ztrans){ m->m[0][2] = (float) xtrans; m->m[0][1] = (float) ytrans; m->m[0][0] = (float) ztrans; }

void translate_matrix(matrix *m, double xtrans, double ytrans, double ztrans){ m->m[2][1] = (float) xtrans; m->m[1][2] = (float) ytrans; m->m[0][3] = (float) ztrans; }

26 / 30

How do you determine if a point is in the triangle?

Square from this point to 3 points of triangle should be less to triangle’s square

Square from this point to 3 points of triangle should be greater to triangle’s square

Square from this point to 3 points of triangle should be equal to triangle’s square

Square from this point to 3 points of triangle should be zero

Square from this point to 3 points of triangle should be 1

27 / 30

Which abbreviation doesn’t describe color spaces?

HSB

RGB

YUV

RYL

CMYK

28 / 30

How do you find the orthogonal vector for 2 vectors?

Dot Product

Cross Product

Dot Product of 2 Normalized vectors

X = X1*x2; y = y1*y2; z = z1*z2

X = X1-x2; y = y1-y2; z = z1-z2

29 / 30

Which statement is INCORRECT for portal-based rendering?

We use portals for optimising indoor rendering

Any room can be visible only through the portal polygon

We can’t use any other techniques (for example occluders), when using portals

We must draw current room and all rooms visible through portals

We must clip drawing using portal bounding box

30 / 30

Identify the Matrix

void ident_matrix(matrix *mat) { mat->m[0][0] = 1.0f; mat->m[0][1] = 1.0f; mat->m[0][2] = 0.0f; mat->m[0][3] = 0.0f; mat->m[1][0] = 1.0f; mat->m[1][1] = 1.0f; mat->m[1][2] = 0.0f; mat->m[1][3] = 0.0f; mat->m[2][0] = 1.0f; mat->m[2][1] = 0.0f; mat->m[2][2] = 1.0f; mat->m[2][3] = 0.0f; mat->m[3][0] = 1.0f; mat->m[3][1] = 0.0f; mat->m[3][2] = 0.0f; mat->m[3][3] = 1.0f; }

void ident_matrix(matrix *mat) { mat->m[0][0] = -1.0f; mat->m[0][1] = 0.0f; mat->m[0][2] = 0.0f; mat->m[0][3] = 0.0f; mat->m[1][0] = 0.0f; mat->m[1][1] = -1.0f; mat->m[1][2] = 0.0f; mat->m[1][3] = 0.0f; mat->m[2][0] = 0.0f; mat->m[2][1] = 0.0f; mat->m[2][2] = -1.0f; mat->m[2][3] = 0.0f; mat->m[3][0] = 0.0f; mat->m[3][1] = 0.0f;

void ident_matrix(matrix *mat) { mat->m[0][0] = 0.0f; mat->m[0][1] = 0.0f; mat->m[0][2] = 0.0f; mat->m[0][3] = 0.0f; mat->m[1][0] = 0.0f; mat->m[1][1] = 0.0f; mat->m[1][2] = 0.0f; mat->m[1][3] = 0.0f; mat->m[2][0] = 0.0f; mat->m[2][1] = 0.0f; mat->m[2][2] = 0.0f; mat->m[2][3] = 0.0f; mat->m[3][0] = 0.0f; mat->m[3][1] = 0.0f; mat->m[3][2] = 0.0f; mat->m[3][3] = 0.0f; }

{ mat->m[0][0] = 1.0f; mat->m[0][1] = 1.0f; mat->m[0][2] = 1.0f; mat->m[0][3] = 0.0f; mat->m[1][0] = 1.0f; mat->m[1][1] = 1.0f; mat->m[1][2] = 1.0f; mat->m[1][3] = 0.0f; mat->m[2][0] = 1.0f; mat->m[2][1] = 1.0f; mat->m[2][2] = 1.0f; mat->m[2][3] = 0.0f; mat->m[3][0] = 1.0f; mat->m[3][1] = 1.0f; mat->m[3][2] = 1.0f; mat->m[3][3] = 1.0f; }

void ident_matrix(matrix *mat) { mat->m[0][0] = 1.0f; mat->m[0][1] = 0.0f; mat->m[0][2] = 0.0f; mat->m[0][3] = 0.0f; mat->m[1][0] = 0.0f; mat->m[1][1] = 1.0f; mat->m[1][2] = 0.0f; mat->m[1][3] = 0.0f; mat->m[2][0] = 0.0f; mat->m[2][1] = 0.0f; mat->m[2][2] = 1.0f; mat->m[2][3] = 0.0f; mat->m[3][0] = 0.0f; mat->m[3][1] = 0.0f; mat->m[3][2] = 0.0f; mat->m[3][3] = 1.0f; }

Your score is

Welcome to the Karma Play Academy

Sign Up For Newsletter