You are on page 1of 11

# VALLIAMMAI ENGINEERING COLLEGE

## DEPARTMENT OF MECHANICAL ENGINEERING

I SEMESTER / I YEAR- M.E (CAD/CAM)
ED7102-COMPUTER APPLICATIONS IN DESIGN
QUESTION BANK
S.No

QUESTIONS

## UNIT-I INTRODUCTION TO COMPUTER GRAPHICS FUNDAMENTALS

PART-A (2 marks)
1.

Define persistence

BT1

2.

BT1

3.

BT1

4.

BT2

5.

BT2

6.

BT1

7.

BT5

8.

## List the line drawing algorithms used in scan conversions.

BT1

9.

Compare analog flat panel displays and digital flat panel displays.

BT4

10.

Point out how flat screen CRT varies from curved CRT.

BT3

11.

BT2

12.

## Compare DDA algorithm with Brenhams algorithm

BT4

13.

For the position vectors P1[2, 3] and P2[4, 5]determine the parametric
representation of the line segment between them

BT5

14.

## Illustrate the Scan-conversion process of a straight line in terms of pixel position

BT3

15.

Explain what happens to the picture that are too large to fit in the screen?

BT6

16.

BT1

17.

## Classify geometric transformations.

BT3

18.

Define translations.

BT6

19.

BT2

20.

BT4

## PART-B (13 marks)

1.

Describe principle and working of CRT with the aid of neat sketch.

BT1

2.

BT2

3.

## Write short notes on the analog flat panel displays

BT3

4.

Rotate the triangle ABC counterclockwise by 30, where the triangle has
coordinates A(1,1), B(3,1) and C (1,3).

5.

## Describe about the 3 D translation and 3 D rotation.

6.

Translate a triangle ABC with coordinates A (1, 1), B (5,2), C (3,3) about the
origin by 3 units in the x-direction and 2 units in the y-direction.

7.

Scale the polygon ABCD with vertices A(5,7) B(12,9) C(10,15) D(7,16) by 2
units in X direction & 3 units in Y direction by keeping the vertices D as fixed.

8.

## Explain the working of Digitizers and Image scanners

9.

Identify and describe the reasons for implementing a computer aided design
system

10.

terminal.

BT5
BT1
BT4

BT6
BT4
BT1

BT4

11.

BT3

12.

BT2

13.

BT2

14.

BT1

1.

BT1

2.

BT2

3.

## Explain the various types of mapping of the geometric models.

BT3

4.

Consider the line of coordinates (1,1) and (2,4) rotate the line about the origin

BT4

## 300. Determine the transformation of the line.

UNIT-II CURVES AND SURFACES MODELLING
PART A (2 marks)
1.

Write the parametric equation of a plane surface defined by three points P0,
P1 and P2

BT2

2.

BT2

3.

BT3

4.

BT4

5.

BT1

6.

BT2

7.

BT4

8.

## List the features of the curve manipulations.

BT4

9.

Define segmentation.

BT1

10.

BT5

11.

BT1

12.

Define patch.

BT1

13.

BT2

14.

BT3

15.

BT3

16.

BT5

17.

BT6

18.

BT6

19.

BT1

20.

BT1

1.

BT1

2.

BT1

3.

BT1

4.

## CAD/CAM systems use parametric representation for surfaces as they do for

curves. Explain how a surfaces is represented.

5.

BT4

operations:

BT3

6.

## Sketch the geometric parameters required to define a helix.

BT2

7.

Determine the equation of the plane that passes through points Po(1,2,3), P1(3,4,-

BT3

1)and P2(1,-2,2). Find the coordinates of the center point of the plane. Find the
tangent vectors and the normal vector at this point.
8.

BT1

9.

BT2

10.

BT2

11.

BT4

12.

## Derive the expression for [MH] T for a hermite cubic spline.

BT4

13.

Derive the vector parametric equations of a straight line for a line connecting
two end points.

14.

BT5

Derive the vector parametric equations of a straight line passing through a point
P1 in a direction defined by a unit vector.

BT6

## PART-C (15 marks)

1.

Find the shape of cubic spline curve if the result is (i) Po= P1,P1=Po ii) Po = P1,

BT4

P1= -Po
2.

BT3

3.

## Explain about the Bezier curves.

BT2

4.

Discuss the representations of the curve and obtain its parametric equation.

BT1

PART-A (2marks)
1.

Define NURBS.

BT1

2.

BT3

3.

Define geometry

BT1

4.

Define topology

BT1

5.

BT6

6.

BT3

7.

BT4

8.

BT1

9.

BT2

10.

BT2

11.

BT1

12.

BT5

13.

BT3

14.

BT2

15.

BT1

16.

BT2

17.

BT5

18.

BT6

19.

BT4

20.

BT4

1

## Summarize the steps involved to NURBS equation of a curve.

Explain the following polyhedral object using B-rep elements and verify the

BT2

## Euler equation for the same

(i) Simple Polyhedra.
(ii) Polyhedral object a face may have loops.
(iii) Objects with holes that do not go through the entire object.
(iv) Objects have holes that go through entire objects
3

BT5

## Sketch the following feature operations using CSG.

(i) Extruded
(ii) Revolved feature
(iii) Chamber
(iv) Loft feature
(v) Pocket
(vi) Shell
(vii) Fillet
(viii) Draft
(ix) Rib and
(x) Dimple.

BT6

List the differences and the similarities between nonlinear sweeps and lofts

BT2

BT1

BT2

BT4

BT1

BT4

10

BT3
11

## Check the validity of 3D solids.

BT3
12

Verify the Euler equation for the following solids and check the validity of 3D
solids

BT4
13

BT1

14

BT1

1.

BT1

Geometry
2.

BT2

3.

BT3

4.

BT4

PART-A (2marks)
1.

BT1

2.

BT1

3.

BT2

4.

BT1

5.

BT3

6.

BT2

7.

BT1

8.

## Define Silhouette edges.

BT1

9.

List the types of coherence identified in object space and image space.

BT6

10.

BT6

11.

## How does edge coherence help to reduce computational effort?

BT4

12.

Infer how does the basic scan line method determine which surfaces are hidden?

BT4

13.

BT2

14.

BT5

15.

## Explain why is it easier to locate hidden surfaces when parallel projection is

needed?

BT4

16.

Define Coherence.

BT1

17.

BT5

18.

BT3

19.

BT3

20.

BT2

## PART-B (13 marks)

1.

Explain the method of back face removal. Give its advantages and limitations
with reference to hidden line removal.

2.

3.

## Write short notes on a.) minimax test

b.) containment test

BT2
BT2
BT1

4.

BT4

5.

## Summarize the steps involved in the priority algorithm.

BT2

6.

Describe the procedures followed in area oriented algorithm for hidden line
removal.

7.

Explain the methods or the algorithms that are deployed for the hidden solid
removal.

BT5

BT3

8.

BT3

9.

BT4

10.

BT1

11.

## Write short notes on a.) surface test

b.) computing silhouettes.

12.

How will you formulate and implement a technique for the hidden line removal.

13.

## Describe about a.) Z-buffer algorithm

b.) Warnocks algorithm.

14.

BT1
BT6
BT1
BT4

## PART-C (15 marks)

1.

Explain briefly with sketches any six tests used for hidden line identification.

BT1

2.

Discuss the various steps involved in hidden line removal algorithms with neat

BT2

sketches.
3.

BT3

4.

BT4

PART-A (2marks)
1.

BT1

2.

BT1

3.

## List the various mating conditions.

BT1

4.

Mention the difference between the tangent and coincident mating condition.

BT4

5.

BT4

6.

BT5

7.

BT1

8.

BT5

9.

BT3

10.

BT6

11.

BT6

12.

BT3

13.

Define datum.

BT1

14.

BT4

15.

BT2

16.

BT2

17.

BT2

18.

BT3

19.

BT1

20.

BT2

1.

BT1

2.

## Discuss the worst case statistical method for tolerance analysis.

BT1

3.

Discuss how the surface area and first moment of inertia is calculated using

BT2

4.

BT1

5.

BT3

6.

BT2

7.

## Enumerate the concept of product data exchange using STEP in detail

BT2

8.

Use the bottom-up approach to create the model of the universal joint shown in
Figure

BT5

9.

The figure below shows a pin and a block with their MCSs. The pin and the
instances to be assembled into the hole in the block. Use WCS and write the
transformationmatrices to merge the three instances of B into A.

BT6

10.

Write short notes on assembly planning and mention the issues arising during
assembly.

BT3

11.

BT4

12.

BT4

13.

BT1

14.

BT4

## PART-C (15 marks)

1.

Explain with the help of an example the concept of interferences of positions and

BT2

2.

BT3

3.

## Derive the expression for any 4 parameters of the mass properties.

BT4

4.

Describe the architecture, file format of the various product data exchange
standards.

BT1