## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Set No.1

IV B.Tech. I Semester Supplementary Examinations, February -2007 COMPUTER AIDED ANALYSIS & DESIGN (Civil Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. Explain concepts of engineering analysis in computer aided system. 2. Explain various features of computer modelling. 3. Explain software conﬁguration of a graphic system.

[16] [16] [16]

4. A point in two dimensions is located at (3, 4). It is desired to relocate the point by means of rotation and scaling transformations only (no translation) to a new position deﬁned by (0, 8). (a) Describe the sequence of transformations required to accomplish the movement of line as speciﬁed. (b) Write transformation matrix for each step in the sequence. (c) Write concatenation transformation matrix for the sequence. [8+4+4]

5. Explain fundamental concepts in Finite diﬀerence method and explain how it can solve complicated engineering problems. [16] 6. Generate the stiﬀness matrix for the rigid frame shown in Figure 1. EI is constant for all the members. [16]

Figure 1: 7. (a) Deﬁne the following terms. i. Convex polyhedron ii. Feasible solution iii. Basic solution

1 of 2

Code No: RR410101

Set No.1

(b) A Person running a warehouse purchases and sells identical items. The warehouse can accommodate 1000 such items. Each month, the person can sell any quantity he has in stock. Each month, he can buy as much as he likes to have in stock for delivery at the end of the month, subject to a maximum of 1000 items. The forecast of purchase and sale prices for the next 6 months is given below. Month Pruchase price (Rs.) Sale price (Rs) 1 2 3 12 14 17 13 15 16 4 5 6 19 20 21 20 21 23 [6+10]

If at present he has a stock of 200 items, what should be his policy?

8. Solve the following simple linear programming problem by Revised simplex method. Maximize z = 2x1 + x2 Subject to 3x1 + 4x2 ≤ 6 6x1 + x2 ≤ 3, x1 , x2 ≥0. [16]

2 of 2

Code No: RR410101

Set No.2

IV B.Tech. I Semester Supplementary Examinations, February -2007 COMPUTER AIDED ANALYSIS & DESIGN (Civil Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. Explain concepts of engineering analysis in computer aided system.

[16]

2. What are the various hardware features of Computer Aided Design system? [16] 3. List out various transformations used in Computer Aided Design graphics. [16]

4. A triangle is deﬁned in a two-dimensional system by vertices A(0,2) and B(0,3) and C(1,2). Perform the following transformations on this triangle. (a) Scale the triangle by a factor 1.5 about vertex A. (b) Scale the original triangle by a factor 1.5 in x- direction and 2.0 in the y direction about the vertex B. (c) Rotate the original triangle by 45 degrees about the origin. [6+6+4]

5. Explain backward, central and forward diﬀerence in Finite diﬀerence concepts. [16] 6. Analyse the frame shown in ﬁgure 2 by stiﬀness method for the member forces and displacements. Consider only ﬂexural deformation. EI is constant.

Figure 2: 7. A ﬁrm manufactures two products A & B on which the proﬁts earned per unit are Rs 3/- and Rs 4/- respectively. Each product is processed on two machines M1 and M2 . Product A requires one minute of processing time on M1 and two minutes on M2 , while B requires one minute on M1 and one minute on M2 . Machine M1 is available for not more than 7 hours 30 minutes, while machine M2 is available for 10 hours during any working day. Find the number of units of products A and B to be manufactured to get maximum proﬁt. Formulate linear programming model and solve the problem graphically. [16] 1 of 2

Code No: RR410101 8. Solve by the revised simplex method. Maximize z = 6x1 − 2x2 + 3x3 Subject to 2x1 − x2 + 2x3 ≤ 2 x1 + 4x3 ≤ 4,

Set No.2

x1 , x2 , x3 ≤ 0.

[16]

2 of 2

Code No: RR410101

Set No.3

IV B.Tech. I Semester Supplementary Examinations, February -2007 COMPUTER AIDED ANALYSIS & DESIGN (Civil Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. Describe various design related tasks, which are performed by a modern Computer Aided Design system. [16] 2. Explain typical conﬁguration of hardware components in stand alone Computer Aided Design system. [16] 3. A line is deﬁned by its end points A(0, 0) and B(2, 3) in a two dimensional graphics system. Express the line in matrix notation and perform the following transformations with A as the reference notation. (a) Scale the line by a factor 2.0. (b) Scale the original line by a factor 3.0 in x direction and 2.0 in the y direction. (c) Translate the original line by 2.0 units in the x direction and 2.0 units in the y direction. [5+6+5] 4. Distinguish between wire frame modeling and solid modeling. [16]

5. Derive expressions for ﬁrst order, second order, third order and fourth order diﬀerentiation expressions using concepts of ﬁnite diﬀerence method. [16] 6. (a) Derive the stiﬀness matrix for the cantilever beam shown in ﬁgure 3. Assume EI as constant.

Figure 3: (b) Discuss about the element stiﬀness matrix and structure stiﬀness matrix. [10+6] 7. Old hens can be bought at Rs 2/- each and young ones at Rs 5/- each. The old hens lay 3 eggs per week and the young ones lay 5 eggs per week, each egg being worth 30 paise. A hen costs Re 1/- per week to feed. I have only Rs 80/- to spend for hens, how many of each kind should I buy to give a proﬁt of more than Rs 6/per week, assuming that I cannot house more than 20 hens. Formulate the L.P. problem and solve this graphically. [16] 1 of 2

Code No: RR410101

Set No.3

8. (a) Prove the following theorem. If both primal and dual problems have feasible solutions, then both have optimal solutions and minimum f = maximum v. (b) Construct the dual of the primal problem Maximize z = 2x1 + x2 + x3 Subject to x1 + x2 + x3 ≥ 6 3x1 − 2x2 + 3x3 = 3 −4x1 + 3x2 − 6x3 = 1 x1 , x2 , x3 ≥ 0.

[8+8]

2 of 2

Code No: RR410101

Set No.4

1. Describe automated drafting in Computer Aided system.

[16]

2. Explain various types of graphic terminals used in Computer Aided Design. [16] 3. A line is deﬁned by its end points (0, 0) and (2, 3) in a two dimensional graphics system. It is desired to move this line by means of series of transformation so that its end points will be at (0, 1) and (0, 5). (a) Describe the sequence of transformations required to accomplish the movement of line as speciﬁed. (b) Write transformation matrix for each step in the sequence. (c) Write concatenation transformation matrix for the sequence. 4. Explain two basic approaches to problems of solid modeling. [8+6+2] [16]

5. Derive expressions for diﬀerentiation expressions connecting deﬂection, slope, bending moments shear force and load using concepts of forward diﬀerence terms in ﬁnite diﬀerence method. [16] 6. Analyse the frame shown in ﬁgure 4 by stiﬀness method for the member forces and displacements. Consider only ﬂexural deformation. EI is constant. [16]

Figure 4: 7. A manufacturer of a line of patent medicines is preparing a production plan on medicines A and B. There are suﬃcient ingradients available to make 20,000 bottles of A and 40,000 bottles of B but there are only 45,000 bottles into which either of the medicines can be put. It takes 3 hours to prepare enough material to ﬁll 1000 bottles of A, it takes 1 hour to prepare enough material to ﬁll 1000 bottles of B, 1 of 2

Code No: RR410101

Set No.4

and there are 66 hours available for this operation. The proﬁt is Rs 8/- per bottle for A and Rs 7/- per bottle for B. (a) Formulate this problem as LPP. (b) How should the manufacturer schedule the production in order to maximize his proﬁt. [16] 8. (a) What are the advantages of Revised simplex method over the Standard simplex method. (b) Apply the principle of duality to solve the L.P. problem. Maximize z = 3x1 − 2x2 Subject to the constraints , x1 + x2 ≤ 5, x1 ≤ 4 1 ≤ x2 ≤ 6, x1 , x2 ≥ 0

[6+10]

2 of 2

- The Wyndor Glass Couploaded byabhinanduprakash
- lec15uploaded byandresromero80
- Solution Manual Business Intelligence and Analytics Systems for Decision Support 10th Edition Shardauploaded byanswer
- l1magicuploaded byausynin9525
- Simplexuploaded byLéo Ayol
- 10.1.1.36.3885 (1)uploaded byropasci
- Lp Matemathicauploaded byzhushazang
- L30_Integer Linear Programming - Branch and Bound Algorithmuploaded byAryaman Mandhana
- Linear Programminguploaded byVia
- LP Graphical Methoduploaded byInigo De La Torre
- [Barrientos O.] a Branch and Bound Method for Solv(BookFi.org)uploaded byM Najib Singgih
- Lp.formulationuploaded byMazhar Ilyas Ahmed
- Linear Programminguploaded byKristienalyn De Asis
- stevenson9e_ch6suploaded bySagar Murty
- alternative assessment assignmentuploaded byapi-301893188
- primal and dual relationshipuploaded byMadhu Sudan Ks Reddy
- Linear Programming 5uploaded byBiju
- delft _ ex.pdfuploaded byRishiMetawala
- 15 Investigation UG Production Planninguploaded byDiego Sarmiento
- OPERATION AND SUPPLY CHAIN MANAGEMENT.docxuploaded byjigna
- Operational Research Assignmentuploaded byRahul Sinha
- Operations Researchuploaded byZheejae Lao-aten
- MOO_LEEuploaded byBarath
- Thermal Effects on a Bridge Modeluploaded byRick Milton Delgadillo Ayala
- (NATO ASI Series 51) Ellis L. Johnson (Auth.), Stein W. Wallace (Eds.)-Algorithms and Model Formulations in Mathematical Programming-Springer-Verlag Berlin Heidelberg (1989)uploaded byanant_nimkar9243
- Linear Proguploaded byLista Novi Ester Sipahutar
- lec11uploaded bykhalidscribd1
- phdthesisuploaded bydisopt
- Ejercicios Programacion Lineal 2uploaded byMiguel Reyes
- Syllabus UGCuploaded bysukanyas111

- r05320403 Microwave Engineeringuploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- r6 42 Mca Advanced Java Programming Set1uploaded bySrinivasa Rao G
- 42 Mca Nr Programming in Javauploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- 41 Mca or Software Engineeringuploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- 41 Mca Nr Software Engineeringuploaded bySrinivasa Rao G
- r5 402 Mba Management of Technology Set1uploaded bySrinivasa Rao G
- r05320205 Switchgear and Protectionuploaded bySrinivasa Rao G
- r05320305 Design of Machine Members IIuploaded bySrinivasa Rao G
- 43-Mca-Or-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- Rr322305 Immunologyuploaded bySrinivasa Rao G
- r5 401 Mba Strategic Management Set1uploaded bySrinivasa Rao G
- r6 34 Mca Management Information Systems Set1uploaded bySrinivasa Rao G
- r6 43 Mca Data Warehousing and Mining Set1uploaded bySrinivasa Rao G
- r6 48 Mca Mobile Computing Set1uploaded bySrinivasa Rao G
- r6 33 Mca Unix Networks Programming Set1uploaded bySrinivasa Rao G
- r5 304 Mba Enterprise Resource Planninguploaded bySrinivasa Rao G
- r5 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G
- r6 47 Mca Distributed Operating Systems Set1uploaded bySrinivasa Rao G
- Nr-35-Mca-Design and Analysis of Algorithmuploaded bySrinivasa Rao G
- Or 32 Mcacomputer Communication Networksuploaded bySrinivasa Rao G
- r5 410 Mba Management of Change Set1uploaded bySrinivasa Rao G
- Nr 302 Mba Cost and Management Accounting Set1uploaded bySrinivasa Rao G
- Nr 31 Mca Database Management Systemsuploaded bySrinivasa Rao G
- Or 34 Mca Management Information Systemsuploaded bySrinivasa Rao G
- r5 408 Mba Decision Support Systems Set1uploaded bySrinivasa Rao G
- Nr 305 Mba Retailing Management Set1uploaded bySrinivasa Rao G

Read Free for 30 Days

Cancel anytime.

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading