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?
Dhruv BadayaMay 291 minRotate a triangle with coordinates A(0,0), B(1,1), C(5,2) by 45° about coordinate C in clockwise direction.
Dhruv BadayaMay 271 minCreate 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
Dhruv BadayaMay 271 minProve 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))
Dhruv BadayaMay 271 minDetermine whether the following sentence is satisfiable, contradictory or valid: P → Q → ~P
Dhruv BadayaMay 261 minFind 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.
Dhruv BadayaMay 261 minWrite the conceptual graph and FOPL representation for the following sentence: "Every motorbike has a handle"
Dhruv BadayaMay 261 minExpress the following sentence as conceptual dependency structure: "Sohan gave Tina a box of chocolate"
Dhruv BadayaMay 261 minFind 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)...