Dhruv BadayaMay 311 minAnswer the following for 5-fold cross validation on a training data set of 45 tuples:(i) How many rounds of learning will be performed?(ii) State the size of the training and testing set for eac...

Dhruv BadayaMay 301 minDraw a 3 × 3 pixel grid pattern to display 10 intensities on a bi-level system display. Show patterns for all the intensity values.

Dhruv BadayaMay 301 minA cubic Bezier curve segment is described by control points P0(2,2), P1(4,8), P2(8,8) and P3(9,5). Another curve segment is described by Q0(a,b), Q1(c,2), Q2(15,2) and Q3(18,2). Find the values of...

Dhruv BadayaMay 301 minConsider a line segment AB parallel to the Z axis with end points A[3 2 2 1] and B[3 2 4 1]. Overall scale to double the size of line AB followed by two point perspective projection with COP along...

Dhruv BadayaMay 301 minGiven two keyframes for an object transformation. First keyframe contains triangle and the second keyframe contains quadrilateral. Convert triangle into quadrilateral by equalizing vertex counts.

Dhruv BadayaMay 302 minWrite steps to shade an object using Phong shading method of polygon rendering? How does it overcome the drawback of Gouraud shading method?

Dhruv BadayaMay 301 minWrite the 4×4 3-D transformation matrices for each of the following transformations respectively : (a) Uniform scaling to double the size of an object. (b) Translate an object 2 units in x direction

Dhruv BadayaMay 301 minWhat is the condition to switch from region 1 to region 2 of the first quadrant of an ellipse in mid point ellipse drawing algorithm?

Dhruv BadayaMay 301 minReflect the polygon whose vertices are A(-1,0), B(0, -2), C(1,0) and D(0,2) about the line x =2 using homogeneous co-ordinates.

Dhruv BadayaMay 302 minClip the polygon ABCD with the vertices A(7,0), B(5,12), C(7,7) and D(6,2) against the window P (2,0), Q(10,0), R(10,10) and S(2,10) using the Sutherland-Hodgeman Polygon Clipping algorithm.

Dhruv BadayaMay 292 minConsider a polygon with vertices ABCD with coordinates A(1,2), B(6,6), C(8,3) and D(5,10). Trace the contents of the Active Edge Table according to scan line fill algorithm.

Dhruv BadayaMay 291 minWhat are the properties of unweighted area sampling technique of anti-aliasing?

Dhruv BadayaMay 291 minConsider a line from (0,0) to (5,5). Rasterize the line using Bresenham line drawing algorithm.

Dhruv BadayaMay 291 minWhy is depth-sort algorithm for visible surface determination called painter’s algorithm?