Академический Документы
Профессиональный Документы
Культура Документы
1
IV B.Tech I Semester Regular Examinations, November 2007
COMPUTER AIDED ANALYSIS AND DESIGN
(Civil Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. Describe some common editing features available in Computer Aided Design sys-
tem. [16]
4. Generate the stiffness matrix for the frame shown in Figure 4. Axial deformations
in the members may be neglected. EI is constant for all the members. [16]
Figure 4
5. Analyse the pin jointed truss shown in figure 5 by the stiffness method. [16]
Figure 5
6. Explain fundamental concepts in Finite difference method and explain how it can
solve complicated engineering problems. [16]
1 of 2
Code No: RR410101 Set No. 1
7. (a) Show that any linear programming problem can be put in the Standard form.
(b) Consider, the problem of maximizing f = 2x1 -x2 +5x3 subject to the con-
straints.
x1 - 2x2 + x3 ≤ 8
3x1 - 2x2 ≥ -18
2x1 + x2 - 2x3 ≤ 4
x3 ≥ 0
State this linear programming problem in Standard form. [8+8]
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 Regular Examinations, November 2007
COMPUTER AIDED ANALYSIS AND 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]
3. List out various transformations used in Computer Aided Design graphics. [16]
4. Generate the stiffness matrix of the structure shown in Figure 4 using the coor-
dinates indicated. Use this matrix to compute u1 and u2 for the loads shown in
figure 4. [16]
Figure 4
Figure 4
5. Analyse the pin jointed truss shown in figure 5 by the stiffness method. [16]
1 of 2
Code No: RR410101 Set No. 2
Figure 5
6. Derive expressions for first order, second order, third order and fourth order differ-
entiation expressions using concepts of finite difference method. [16]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR410101 Set No. 3
IV B.Tech I Semester Regular Examinations, November 2007
COMPUTER AIDED ANALYSIS AND DESIGN
(Civil Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
1. Describe some common editing features available in Computer Aided Design sys-
tem. [16]
2. Explain features of workstation used for Computer Aided Design. [16]
3. Write about the following in three dimensional transformation:
(a) Rotation
(b) Translation
(c) Scaling. [6+5+5]
4. Find the stiffness coefficients of the frame shown in Figure 4. Axial deformations
in the members may be neglected. EI is constant for all the members. [16]
Figure 4
5. Analyse the pin jointed truss shown in figure 5 by the stiffness method. [16]
Figure 5
6. Explain the effect of boundary conditions and their influence on the deflected shape
of the beam. [16]
1 of 2
Code No: RR410101 Set No. 3
7. Maximize F = x1 +2x2 +x3 subject to
2x1 +x2 -x3 ≤ 2, -2x1 +x2 -5x3 ≥ -6
4x1 +x2 +x3 ≤ 6, xi ≥ 0, i = 1,2,3. [16]
⋆⋆⋆⋆⋆
2 of 2
Code No: RR410101 Set No. 4
IV B.Tech I Semester Regular Examinations, November 2007
COMPUTER AIDED ANALYSIS AND DESIGN
(Civil Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
⋆⋆⋆⋆⋆
4. Analyse the bent shown in Figure 4 by stiffness method and draw the BMD. EI for
all the members are same. [16]
Figure 4
5. Analyse the pin jointed truss shown in figure 5 by the stiffness method. [16]
Figure 5
1 of 2
Code No: RR410101 Set No. 4
6. (a) Explain pivotal distance and its significance. Explain with suitable examples
its influence on the final solution.
(b) Derive general expression for second order difference terms with unequal spaced
pivotal points. [6+10]
7. Find the maximum and minimum value of the objective function z = 4x+5y.
Subject to 2x+y ≤6, x+2y ≤ 5,
x-2y ≤ 2 -x+y ≤2, x+y ≥1 and x, y ≥ 0. [16]
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