The IIT Madras BS Industry 4.0 (Industry 4.0) Quiz 2 paper sat on 16 Mar 2025, in the January 2025 term, set 1: 18 questions for 24 marks in 120 minutes. Every question is below with its answer. Take it as a timed mock test to be marked, or read it through first.
THIS IS QUESTION PAPER FOR THE SUBJECT "DEGREE LEVEL : INDUSTRY 4.0 (COMPUTER BASED EXAM)" ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT? CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECTS TO BE WRITTEN. (IF IT IS NOT THE CORRECT SUBJECT, PLS CHECK THE SECTION AT THE TOP FOR THE SUBJECTS REGISTERED BY YOU)
YES
NO
Correct answer
YES
1: (b), (2): (c), (3): (a)
1: (c) , (2) : (b), (3) : (a)
1: (a) , (2) : (b), (3) : (c)
Correct answer
1: (b), (2): (c), (3): (a)
Which of the following models corresponds to the Exponential Smoothing forecasting model?
Correct answer
a.1 : b.2, a.2:b.3, a.3:b.3
a.1 : b.4, a.2:b.3, a.3:b.3
a.1 : b.4, a.2:b.1, a.3:b.3
Correct answer
a.1 : b.4, a.2:b.1, a.3:b.3
Which of the following is not a part of the 7 principles of IoT:
Big Analog Data
Quality Control
Constant connection
Real time
Spectrum of insights
Correct answer
Quality Control
Select the cost(s) from the following list which contribute(s) to the shortage cost:
Loss of customer goodwill
Loss due to customer return
Cost of losing a customer
Loss of profit associated with not delivering the product
Correct answers
Loss of customer goodwill
Cost of losing a customer
Loss of profit associated with not delivering the product
What are the two primary tasks of time series forecasting?
Identifying pattern
Identify variables of interest
Discovering relationships amongst variables of interest
Correct answers
Identifying pattern
Discovering relationships amongst variables of interest
A written answer, not marked automatically.
Slipline Co. requires 1500 units of plastic ribbon per month. Each plastic ribbon costs Rs. 27 in the market. Placing an order costs Rs. 150 to Slipline Co. and the inventory carrying charges work out to 20% of the unit ribbon cost per year. Based on the above data, answer the given subquestions.
What should be the order quantity which minimizes the total cost to Slipline Co.
A written answer, not marked automatically.
Slipline Co. requires 1500 units of plastic ribbon per month. Each plastic ribbon costs Rs. 27 in the market. Placing an order costs Rs. 150 to Slipline Co. and the inventory carrying charges work out to 20% of the unit ribbon cost per year. Based on the above data, answer the given subquestions.
What is the number of orders per year?
A written answer, not marked automatically.
Ramu puts up a stall for Diwali Light (Diya) every year. He builds a Diya at a cost of Rs. 1 and earns Rs.2 by selling each Diya. Any Diya not sold by Diwali will be discounted to 50 Paisa. From his experience, Ramu knows that the demand is Uniformly Distributed within [800, 1000] units. Then answer the given subquestions.
What is the Critical Ratio? [Round the answer to two decimal places]
A written answer, not marked automatically.
Ramu puts up a stall for Diwali Light (Diya) every year. He builds a Diya at a cost of Rs. 1 and earns Rs.2 by selling each Diya. Any Diya not sold by Diwali will be discounted to 50 Paisa. From his experience, Ramu knows that the demand is Uniformly Distributed within [800, 1000] units. Then answer the given subquestions.
What is the optimal order quantity that minimizes Ramu’s total cost?
A written answer, not marked automatically.
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1.
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1. You need to apply dynamic programming (backward recursion) to identify the shortest route. Answer the given sub-questions:
What does the state variable represent?
The city Ramu should visit next in a stage
The beginning city in every stages
Distance covered upto a given stage
Correct answer
The beginning city in every stages
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1.
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1. You need to apply dynamic programming (backward recursion) to identify the shortest route. Answer the given sub-questions:
What does the action set represents?
The city Ramu should visit next in a stage
The beginning city in every stages
Distance covered upto a given stage
Correct answer
The city Ramu should visit next in a stage
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1.
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1. You need to apply dynamic programming (backward recursion) to identify the shortest route. Answer the given sub-questions:
What is the objective function value in Stage-2?
A written answer, not marked automatically.
Slipline Co. requires 1500 units of plastic ribbon per month. Each plastic ribbon costs Rs. 27 in the market. Placing an order costs Rs. 150 to Slipline Co. and the inventory carrying charges work out to 20% of the unit ribbon cost per year. Based on the above data, answer the given subquestions.
A written answer, not marked automatically.
Ramu puts up a stall for Diwali Light (Diya) every year. He builds a Diya at a cost of Rs. 1 and earns Rs.2 by selling each Diya. Any Diya not sold by Diwali will be discounted to 50 Paisa. From his experience, Ramu knows that the demand is Uniformly Distributed within [800, 1000] units. Then answer the given subquestions.
A written answer, not marked automatically.
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1.
Govind needs to visit City-7. Currently he is stationed at City-1. He has a few alternative routes denoted by the arrows (arcs). There are other cities viz. 2, 3, 4, 5, 6 which falls on various routes between City-1 and City-7. The weights on the arcs represents the distances between respective nodes. However, there is no connection between City-2 and City-6. This scenario is represented in Fig-1. You need to apply dynamic programming (backward recursion) to identify the shortest route. Answer the given sub-questions:
A written answer, not marked automatically.
