Thankyou for sending your question. Our experts are working on a solution.
Answer 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...
Differentiate between cabinet and cavalier parallel projections.
Draw a 3 × 3 pixel grid pattern to display 10 intensities on a bi-level system display. Show patterns for all the intensity values.
A 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...
Consider 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...
Given two keyframes for an object transformation. First keyframe contains triangle and the second keyframe contains quadrilateral. Convert triangle into quadrilateral by equalizing vertex counts.
Write steps to shade an object using Phong shading method of polygon rendering? How does it overcome the drawback of Gouraud shading method?
Write 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
What is the condition to switch from region 1 to region 2 of the first quadrant of an ellipse in mid point ellipse drawing algorithm?
Differentiate between orthographic and oblique projections.
Define horizontal and vertical retracing.
Reflect 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.
Clip 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.
Consider 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.
What are the properties of unweighted area sampling technique of anti-aliasing?
Consider a line from (0,0) to (5,5). Rasterize the line using Bresenham line drawing algorithm.
Explain depth sort algorithm for visible surface determination.
Explain Hue, Saturation and Value in HSV color model.
Why is depth-sort algorithm for visible surface determination called painter’s algorithm?
How to convert RGB color model to CMY color model?
What is a Polygon Mesh and its representations?
Rotate a triangle with coordinates A(0,0), B(1,1), C(5,2) by 45° about coordinate C in clockwise direction.
Prove that parallel lines remain parallel under 2-D Transformations.
Create a script for shopping in a supermarket.
Create a frame network for terrestrial motor vehicles (cars, trucks, motorcycles) and give one complete frame in detail for cars which includes the slots for the main component parts, their attributes
Prove that if A and B are independent events, P(A|B) = P(A). (Note that A and B are independent if and only if P(A & B) = P(A)P(B))
Determine whether the following sentence is satisfiable, contradictory or valid: P → Q → ~P
Transform the following sentence into Disjunctive Normal Form.(~P∨~Q) & R→S
Find the meaning of the statement:(~P ∨ Q) & R → S ∨ (~R & Q) for the interpretation: P is true, Q is false, R is true, S is true.
Write the conceptual graph and FOPL representation for the following sentence: "Every motorbike has a handle"
Express the following sentence as conceptual dependency structure: "Sohan gave Tina a box of chocolate"
Find whether the following set is unifiable or not. If unifiable, find the most general unifier(m.g.u.).w = {PARENTS(x, FATHER(x), MOTHER(bill)), PARENTS(bill, FATHER(bill)...
In the following two-ply game tree, the terminal nodes show the utility values computed by the utility function. Use the Minimax algorithm to compute the utility values for other nodes in the given...
Write a context-free grammar that can accept the sentence: "Ram hit the ball".
Given an array A of n integers, you need to find the maximum sum of any contiguous subarray. For instance, the maximum sum of any contiguous subarray in the array -1, 2, 3, -2, 5, -6, 7, -8 is 9...
Suppose we perform a sequence of stack operations on a stack whose size never exceeds k. After every k operations, we make a copy of the entire stack for backup purposes. Show that the cost of n st...
What is the minimum number of leaves in the decision tree for a comparison sort? Use this observation to derive a lower bound on the number of comparisons performed by a comparison sort in the wors...
What is the smallest possible depth of a leaf in a decision tree for a comparison sort? Name a sorting technique to which this smallest depth would correspond.
Let G = (V,E) be a directed unweighted graph. Given two vertices s and t in V, what is the time required to determine if there exists at least one s-t path in G? Can we use the DFS algorithm to fin...
A student was asked to sort a list of n numbers in decreasing order. The student writes an algorithm that works iteratively as follows. In every iteration, the following two steps are done...
For each of the following sorting algorithms, merge sort and insertion sort, discuss whether or not it is (i) stable and (ii) in-place
Consider the scheduling problem wherein you are given a single resource and a set of requests having deadlines. A request is said to be late be late if it misses the deadline. Your goal is to minim...
Show that in any subtree of a max-heap, the root of the subtree contains the largest value occurring anywhere in that subtree.
We are given a weighted graph G in which edge weights are not necessarily distinct. Can graph G have more than one minimum spanning tree (MST)? If yes, give an example, else justify.
Why is the worst-case running time for bucket sort θ(n²)? What changes would you make to the algorithm so that its worst-case running time becomes O(nlgn)?
Specify whether the above graph is bipartite or not. If yes, give the partition, else justify.
Let G be a tree graph. Further, let A and B be the trees produced by performing BFS and DFS respectively on G. Can A and B be different trees? Why or why not?
How many topological orderings does the following graph have? Specify all of them.
Can dynamic programming be applied to all optimization problems? Why or why not?
Will the greedy strategy with the greedy parameter being value per unit weight of the items yield an optimal solution for the 0-1 knapsack problem? Justify.
![Consider 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...](https://static.wixstatic.com/media/738fdb_a5074763955742c6b8546e34fd95f0ff~mv2.png/v1/fill/w_284,h_280,fp_0.50_0.50,q_95,enc_auto/738fdb_a5074763955742c6b8546e34fd95f0ff~mv2.png)
