CHN-302: Engineering Analysis and Process Modeling

Assignment 3
Weightage: 6%+ Optional Bonus Querstion (max. 1% CWS) Deadline: Feb 20, 2019, Midnight

Instructions:

4. Assignments need to be submitted individually, instances of plagiarism (copying assignment from others or allowing others to
copy your assignment will be strongly peanlized.
5. Scans/photographs of handwritten assignments should be merged in a single pdf file and emailed to ch401.iitr@gmail.com
(Not to any other email ID of instructor)
6. Hard copies of assignments or typed copies of assignments should not be submitted
7. All questions are of equal weightage

1. For the following two graphs

a. Compute 𝑹, 𝑹𝟐 , 𝑹𝟑 ,…….
b. List all one-step, 2-step, 3-step, …. paths
c. Compute the reachability matrix
d. List all subgraphs
e. Find the directed cycle(s) (cyclical net(s)) in the graph using logical intersection of reachability matrix
f. Identify system interfaces (input and output)
g. Write the incidence matrix and augmented incidence matrix, after properly labelling the edges
h. Write the balance equation for any quantity in a matrix notation using the results of part (g)

2. Draw the graph corresponding to the following Boolean matrix. Label the edges of the graph properly and write the incidence
matrix corresponding to the graph.

0 1 0 1 1 0
1 0 1 1 0 1
0 0 0 1 0 0
0 1 0 1 0 0
0 0 0 0 0 1
1 0 0 0 0 0

3. Determine the decomposition scheme for following graphs (convert block flow diagrams to graphs):

4.
Six tanks of equal volume (V) are numbered 1,2,…6, and are connected to each other as represented by the following
Boolean matrix 𝐑.

Developed by Dr. Prateek Jha Spring 2019 Page 1/2

 0 1 0 0 1 0
1 0 0 0 0 0
0 1 0 0 0 0
0 0 0 0 1 0
1 0 0 0 0 0
0 0 1 1 0 0

At time t = 0, all tanks are empty. Water is started being released into one of the tanks from an external water tap at t = 0,
which is continued at the same flow rate until a water volume equal to the total volume of all tanks (6V) is released from the
tap. Water can move between the tanks using the connections represented in the above Boolean matrix. All flows from tanks
are from a small orifice at the bottom and all flows into the tank are from the open top.

Flows out of any tank is equally distributed to all output streams from that tank as long as the output stream(s) is(are) going to
a tank that is not completely full. In case any one or more of output streams go to a completely full tank, flow out of the tank
is equally distributed between remaining stream(s) going to tanks that are not completely full. In case all the output streams
from a tank go to completely full tanks, nothing flows out of the tank.

a) Compute 𝐑𝟐 , 𝐑𝟑 , 𝐑𝟒 , 𝐑𝟓 , 𝐑𝟔 .
b) Will all tanks be completely full after reasonably long time, independent of the choice of “feed tank” where water is
released from the tap? If yes, explain your answer. If not, determine (using graph theory) the possible choice(s) of “feed
tank” and other conditions (if any) to ensure all tanks are completely full after a reasonably long time.
c) For one choice of “feed tank”, develop equations for filled volume of each tank as a function of time. The resulting set of
equations must be mathematically consistent, i.e., number of independent equations should equal the number of
unknowns. Flow rate from the tap can be assumed to be given.
d) Write occurrence matrix and make a choice of admissible output set for the set of equations determined in c)

5. The augmented incidence matrix for a graph is the following. All the blank cells correspond to zero.

1 -1
1 -1 1 -1
1 -1 -1
1 -1 1
1 -1 1
1 -1 -1 -1
1 1 -1
-1 1 -1
1 -1
1 -1

a. Identify the system interfaces for this graph.

b. Write the Boolean matrix and draw the graph, with proper labeling of edges.
c. Assuming that there is a flow of single species in all the edges, write the balance equations for the steady state condition.

d. Make a choice of variables that should be specified in order to get the solution of equations derived in part c). For this
choice of specified variables, determine the priority order of solving equations using graph theory.
e. How will the results of parts a)-d) change if the direction of each of the edges in the graph is reversed? Justify your
answer.
f. Bonus Question (Optional)

Assume that instead of edges representing the flow of species, edges represent the distance between two vertices. Develop an
algorithm/pseudocode (list steps in plain English, not any programming language) to find the shortest distance between two
vertices. Assume that the travel is only possible in the directions of the edges. All the steps of the algorithm must be
completely specified and the algorithm should be efficient.

6. For the set of equations on the right side, a+b=7

c=a+d
(a) Write the occurrence matrix and make a choice of admissible output set. f = a/b
(b) Write the Boolean matrix for the graph. b−a=3
(c) Using graph theory, determine the order of solving equations. g ! = b! − a
(d) Solve the equations in the order determined in (c). This part will only be graded if ea = f !
part (c) is answered correctly. d = bc

Developed by Dr. Prateek Jha Spring 2019 Page 2/2