Solve your IGNOU Doubts

Question:

Discuss the revival of political theory.

See Answer →

Question:

In a factory there are 6 jobs to be processed on two Machines A and B. The processing times are given in the table below. The jobs are first processed on Machine A and then on Machine B. Find the optimal job sequence and the minimum elapsed time.

Job:	$J_1$	$J_2$	$J_3$	$J_4$	$J_5$	$J_6$
Machine A:	1	3	8	5	6	3
Machine B:	5	6	3	2	2	10

See Answer →

Question:

) The following is the optimal table of a maximising LPP where $x_3,x_4\, and\, x_4$ are slack variables. Image ignouassignments-ignouacademy-com--p-ignou-37126

Suppose a new constant 8 2x1 + x2 ≤ is added to the LPP. Find the new optimal solution of the resulting LPP.

See Answer →

Question:

An oil engine manufacture purchase lubricants at the rate of Image ignouassignments-ignouacademy-com--p-ignou-80084 50 per unit from a vendor. The requirement of these lubricants is 1800 units per year. The cost of placing an order is 40 and inventory carrying cost per rupee per year is only 20 paise. Find the Economic Order Quantity (EOQ). Also find the cycle time.

See Answer →

Question:

A manager wants to the appoint 4 sales-persons to 4 different cities. If the expected profit when different persons are appointed to different cities is a given in the table below, find the assignment that will maximize the profit: Image ignouassignments-ignouacademy-com--p-ignou-77908

See Answer →

Question:

Customers come to a coffee shop at the average rate of 32 per day (8 hours a day) in Poisson pattern. The waiter employed to serve the customers has left the job. The owner of the shop wants to hire a new the job. The owner of the shop wants to hire a new waiter. Two applicants, Abdul and Raju, have applied for the post. The service times of Abdul and Raju are exponentially distributed with mean 12 minutes and 10 minutes, respectively. Abdul and Raju demand salaries of ₹ 135 and ₹ 165 per day, respectively. If no service is available, the average loss to the owner is ₹ 400 per day. Who among the two should be selected for the job?

See Answer →

Question:

A sugar manufacture has two production processes. In one hour, Process I makes 100 kg of Grade I (high quality) sugar and also produces 140 kg of Grade II sugar as a byproduct. Process II makes in one hour 60 kg of Grade I (high quality) sugar and also produces as a by-product 40 kg of Grade II sugar. The manufacture is confident that during the festival season all the sugar that is made can be sold. He has committed to selling at least 6000 kg of Grade I and 5600 kg of Grade II for the season. The revenue earned by selling one kilogram of Grade I sugar is ₹ 4 (irrespective of the process used) and the revenue earned by selling one kilogram of Grade II sugar is ₹ 2 (irrespective of the process used). Formulate the problem of maximizing the total revenue earned as an LPP. Solve the problem by graphical-method.

See Answer →

Question:

For a Queuing Model (M/M/1): (GD/∞/∞) with one server, if the service rate µ increases, the expected number of customers in the system decreases.

See Answer →

Question:

In the inventory model with finite replenishment rate, if the replenishment rate is equal to consumption rate, the holding cost is 0.

See Answer →

Question:

An assignment problem can be considered as a special case of transportation problem.

See Answer →

Question:

In an optimal solution $(x_{1}^{*}x_{2}^{*})$ of the LPP

$Max.$ $4x_1+3x_2$

s.t.

$x_1+x_2=2$

$x_1+x_2\geq 0$

$x_{1}^{*},x_{2}^{*}$ both cannot be positive.

See Answer →

Question:

Which of the following statements are true or false? Give a short proof or a counter example in support of your answers.

a) There is chance of occurrence of the premature convergence in Roulett-wheel selection shceme used in GA.

b) Gradient based optimization methods are used when the objective function is not smooth and one needs efficient local optimization.

c) The $\alpha -$ cut of a fuzzy set A in U is defined as A $\alpha _{0}=\left \{ x\epsilon \bigcup | \right.\mu _{A}(x)\leq \alpha _{0}\left. \right \}$

d) A single perception with preprocessing is neither an auto associative network nor a multiple layer neural network.

e) If W $(k_{0})=W(K_{0}+2),$ then perception is non-linear separable.

See Answer →

Question:

The optimal solution of any integer linear programming problem can be obtained by rounding off the optimal solution of its LP relaxation.

See Answer →

Question:

b) Consider the following single layer perception as shown in the following figure.

Image ignouassignments-ignouacademy-com--p-ignou-64246

and the activation function of each unit is defined as $\Phi (v)=\left \{ _{0, otherwise.}^{1, if v \geq 0} \right \}$

Calculate the output y of the unit for each of the following input patterns:

Patterns	$P_{1}$	$P_{2}$	$P_{3}$	$P_{4}$
$X_{1}$	1	0	1	1
$X_{2}$	0	1	0	1
$X_{3}$	0	1	1	1

Also, find the modified weights after one iteration.

See Answer →

Question:

Alice wants to use the Digital Signature algorithm for signing messages. She chooses p = 83, q = 41, g = 2 and a = 3. Alice wants to sign the message M = 20. She chooses the secret value k = 8. Explain the procedure that Alice will use for computing the signature. What information will she send Bob?

See Answer →

Question:

Alice wants to use the ElGamal digital signature scheme with public parameters p = 47, α = 2, secret value $\alpha =7$ and $\beta =34$ . She wants to sign the message M = 20 and send it to Bob. She chooses k = 5 as the secret value. Explain the procedure that Alice will use for computing the signature of the message. What information will she send Bob?

See Answer →

Question:

Solve the discrete logarithm problem $5^{x}\equiv 22$ (mod 47) using Baby-Step, Giant-Step algorithm.

See Answer →

Question:

i) Bob uses ElGamal cyrptosystem with parameters p = 47, g = 5 and the secret value
x = 3. What values will he make public?
ii) Alice wants to send Bob the message M = 15. She chooses k = 5. How will she compute
the cipher text? What information does she send to Bob?
iii) Explain how Bob will decrypt the message.

See Answer →

Question:

a) Consider the following travelling salesman problem involving 9 cities