Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 12 published solutions
Question 161 MSQ · 3.0 marks
Which of the following is/are True?
6406532878593.
K-means algorithm requires the initial centroids to be chosen randomly.
6406532878594.
K-means algorithm may not find the globally optimal solution.
6406532878595.
The complexity of the K-means algorithm is polynomial with respect to the
number of data points and clusters.
6406532878596.
K-means algorithm can be used for clustering data points in higher-
dimensional spaces.
**Industry 4.0**
**Section Id :** 64065361115
**Section Number :** 9
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 8
**Number of Questions to be attempted :** 8
**Section Marks :** 20
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Section Maximum Duration :** 0
**Section Minimum Duration :** 0
**Section Time In :** Minutes
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
In a EOQ calculation, the estimated and actual parameter values are given in Table 1. What is the
error in the EOQ calulation {error= (Qestimated - Qactual)/ Qactual }. (round your answer to two
decimal without the percentage sign e,g, enter 10.12 if your answer is 10.12 %, enter -10.12 if your
answer is -10.12%)
A published solution is not available for this question yet.
Suppose you need to accept reservation for a flight. There is total 100 seats in the aircraft. You
have two classes of passengers - economy and business. One economy seat gets you 2,500 Rs of
revenue while a business seat gets 7,500 Rs. From your experience, you know the demand for
business travellers follows a uniform distribution in [10,20]. Then answer the given subquestions:
What is the Booking limit?
A published solution is not available for this question yet.
Suppose you need to accept reservation for a flight. There is total 100 seats in the aircraft. You
have two classes of passengers - economy and business. One economy seat gets you 2,500 Rs of
revenue while a business seat gets 7,500 Rs. From your experience, you know the demand for
business travellers follows a uniform distribution in [10,20]. Then answer the given subquestions:
What is the protection level?
A published solution is not available for this question yet.
Ramu need 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 subquestions:
What does the state variable represent?
6406532878606.
The city Ramu should visit next in a stage
6406532878607.
Distance covered upto a given stage
6406532878608.
The beginning city in every stages
A published solution is not available for this question yet.
Ramu need 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 subquestions:
What does the action set represents?
6406532878609.
The city Ramu should visit next in a stage
6406532878610.
The beginning city in every stages
6406532878611.
Distance covered upto a given stage
A published solution is not available for this question yet.
Ramu need 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 subquestions:
What is the objective function value in Stage-2?
A published solution is not available for this question yet.
Ramu need 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 subquestions:
What is the optimal route?
6406532878613.
1 -> 4 -> 6-> 7
6406532878614.
1 -> 3 -> 5 -> 7
6406532878615.
1 -> 4 -> 5 -> 7
6406532878616.
1 -> 3 -> 6-> 7
A published solution is not available for this question yet.
Select the assumptions for single period newsvendor model.
6406532878629.
Products are separable
6406532878630.
Demand is deterministic
6406532878631.
Inventory decision or deliveries are made before the demand is realized
6406532878632.
Overstocking and Understocking costs are linear to the quantities
**Mathematical Thinking**
**Section Id :** 64065361116
**Section Number :** 10
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 3
**Number of Questions to be attempted :** 3
**Section Marks :** 30
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
A published solution is not available for this question yet.
