top of page

Courses
Blog
Search
Ask & Answer
Forum

All Posts
Basics of Linux
Algorithms
Past Year Papers
Ask & Answer
DPPs
RCs
Delhi University - Past Year Papers

Search

Prove that X-OR is complement of X-NOR with the help of a truth table

Mar 111 min read

A two-word instruction to perform the load operation is stored in memory at an address 200 as represented in the memory map given below. The address field of the instruction is stored at address 20...

A two-word instruction to perform the load operation is stored in memory at an address 200 as represented in the memory map given below. The address field of the instruction is stored at address 20...

A two-word instruction to perform the load operation is stored in memory at an address 200 as represented in the memory map given below. The address field of the instruction is stored at address 20...

Mar 112 min read

What is DMA? Briefly explain following with respect to DMA:

Mar 113 min read

What is cache memory? Mention its advantages and disadvantages.

Mar 112 min read

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...

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...

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...

May 31, 20241 min read

Differentiate between cabinet and cavalier parallel projections.

Differentiate between cabinet and cavalier parallel projections.

Differentiate between cabinet and cavalier parallel projections.

May 30, 20241 min read

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

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

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

May 30, 20241 min read

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...

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...

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...

May 30, 20241 min read

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...

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...

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...

May 30, 20241 min read

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.

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.

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.

May 30, 20241 min read

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

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

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

May 30, 20242 min read

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

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

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

May 30, 20241 min read

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?

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?

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?

May 30, 20241 min read

Differentiate between orthographic and oblique projections.

Differentiate between orthographic and oblique projections.

Differentiate between orthographic and oblique projections.

May 30, 20242 min read

Define horizontal and vertical retracing.

Define horizontal and vertical retracing.

Define horizontal and vertical retracing.

May 30, 20241 min read

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.

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.

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.

May 30, 20241 min read

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.

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.

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.

May 30, 20242 min read

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.

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.

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.

May 29, 20242 min read

What are the properties of unweighted area sampling technique of anti-aliasing?

May 29, 20241 min read

Consider a line from (0,0) to (5,5). Rasterize the line using Bresenham line drawing algorithm.

Consider a line from (0,0) to (5,5). Rasterize the line using Bresenham line drawing algorithm.

Consider a line from (0,0) to (5,5). Rasterize the line using Bresenham line drawing algorithm.

May 29, 20241 min read

Crookshanks Academy is an online learning platform with free netflix styled courses.

Privacy Policy →
Ads Policy →
Contact Us →
FAQs →
Careers →

Crookshanks Academy 2023 ©️ All Rights Reserved

This content is protected from right clicks.

bottom of page