Manufacturing and Industrial Engineering [GATE (Graduate Aptitude Test in Engineering) Mechanical Engineering]: Questions 6 - 9 of 115

Access detailed explanations (illustrated with images and videos) to 314 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 250.00 -OR-

How to register? Already Subscribed?

Question 6

Manufacturing and Industrial Engineering
Production Planning

Appeared in Year: 2010

Question

MCQ▾

Vehicle manufacturing assembly line is an example of:

Choices

Choice (4)Response

a.

Fixed layout

b.

Product layout

c.

Process layout

d.

Manual layout

Question 7

Manufacturing and Industrial Engineering
Structure and Properties of Engineering Materials

Appeared in Year: 1993

Question

MCQ▾

In Ultrasonic Machining (USM) the material removal rate would

Choices

Choice (4)Response

a.

Increase and then decrease

b.

Decrease

c.

decrease and then increase

d.

Increase

Question 8

Manufacturing and Industrial Engineering
Structure and Properties of Engineering Materials

Appeared in Year: 2004

Question

Match List-Ⅰ List-Ⅱ▾

Typical machining operations are to be performed on hard-to-machine materials by using the processes listed below. Choose the best set of Operation-Process combinations

List-Ⅰ (Operation)List-Ⅱ (Process)
(A)

Debarring (internal surface)

(i)

Laser beam Machining

(B)

Die sinking

(ii)

Electric Discharge

(C)

Fine hole drilling in thin sheets

(iii)

Electrochemical Grinding

(D)

Tool sharpening

(iv)

Abrasive Flow Machining

Choices

Choice (4)Response
  • (A)
  • (B)
  • (C)
  • (D)

a.

  • (iv)
  • (ii)
  • (i)
  • (iii)

b.

  • (ii)
  • (i)
  • (iv)
  • (iii)

c.

  • (iii)
  • (ii)
  • (iv)
  • (i)

d.

  • (i)
  • (iii)
  • (iv)
  • (ii)

Question 9

Manufacturing and Industrial Engineering
Linear Programming

Appeared in Year: 2008

Question

MCQ▾

For the standard transportation linear program with m sources and n destinations and total supply equaling total demand , an optimal solution (lowest cost) with the smallest number of non zero Xij values (amounts from source i to destination j) is desired . The best upper bound for this number is

Choices

Choice (4)Response

a.

2 (m + n)

b.

mn

c.

m + n-1

d.

m + n

Developed by: