Edexcel IAL IT - Unit 3 - CPA, IOT & GANTT CHART - Last Minute Revision

Added: 2026-05-27

[00:00:03][music] So in this question they mention if we look here this is basically they already give you a diagram architectures right how the park car entrance looks like basically they have the rider beam equipment entrance barrier right then they have the number of plate reader ticket mach car park entrance So here we can see that a company operates several car park in a city. Car park attendants collect parking fees at the entrance to each okay to each car park. The company wants to replace this manual system with an automatic one. So each car park will have a computer to control the system.

[00:00:58]Tanya, we are working on uh June 2020 unit 3 paper.

[00:01:04]The entry system will consist of an entrance barrier that can be raised to allow a car in. So this is the barrier.

[00:01:13]Okay. Then they mention a number plate barrier that record the car car's registration. So number plate, this is the one that can record the car registration number. a ticket machine that issues a ticket with the time of entry and the car registration. So a ticket machine that issues a ticket. So this is the ticket machine, right? So you can able to get a ticket machine when you are done with the payment. A rather beam that detect when the car has cleared the entrance barrier, right? So then it will again close the barrier.

[00:01:49]So after that if we look into this particular question we can say we can see that the entry process is when a car stop at the barrier its registration number is read and the information is sent to the computer. So where they sending it to the computer right the computer sends a registration number and current time to the ticket. So from the computer side we're getting this information to the ticket machine. The ticket machine prints a ticket and pushes it out of a slot. So what does it mean by this? The ticket machine print a ticket and push it out of a slot. When the driver takes the ticket, the barrier rises. So that means when the driver will take the ticket, the barrier will rise. Once the curve passes through the router beam, the barrier fails. So when the curve passes through the router beam, the barrier will fail.

[00:02:43]Uh just give me one.

[00:03:13]Okay. So once the car passes through the router beam the barrier fails. Now what you can see from this description that um the barrier registration number is read and information is sent to the computer.

[00:03:29]So which one is the divide that reading number plate reader is it? So we can uh write here number plate [clears throat] reader.

[00:03:49]So where it goes? It goes to the computer. Basically computer send the registration number and current time to the ticket machine. So we also have ticket mashing.

[00:04:10]So this one is also done. The ticket machine prints a ticket and pushes it out of a slot. When the driver takes the ticket, the barrier rises. So we also have a barrier. Is it?

[00:04:26]So you can add entrance barrier to the more meaningful one.

[00:04:36]Once the car passes the rudder beam, the router beam the barrier for. So that means the router beam is the one that can able to detect is the car pass or not. Right? Then it will inform that information to the computer.

[00:04:52]And uh in the question they didn't mention any type of symbol for any type of devices. So at the middle we can draw a computer.

[00:05:02]So from here the data is going as it the computer is giving the information to the ticket machine. The entrance barrier is it giving or is it taken?

[00:05:13]Once the driver takes the ticket the barrier rises. So which means when the driver take the ticket so ticket machine is also informing it right and the computer pass the information to the entrance barrier is it?

[00:05:27]>> Yes m >> uh pr can't able to hear you >> uh can you hear me now? Then what will happen when it comes to the router beam?

[00:05:37]Which way we will um which which way we will add the arrow for the router beam.

[00:05:44]>> It will point towards the computer.

[00:05:46]>> Run to I think you Oh, okay. Okay. Just one minute. Sorry. Sorry. Yeah. Yes. No.

[00:05:52]Run.

[00:05:52]>> Yes. I think it'll point towards the computer.

[00:05:56]>> Points toward the computer. Yes. Other than anyone can guess how it will look like.

[00:06:05]points toward the okay. So then this is done. So create an information diagram to describe this process. So we already create a information diagram. So this is done. But we need to also add here right which information is passes right. So the car number plate is basically passes the car registration number.

[00:06:34]Right? Then when it comes to ticket machine, what the ticket machine will do? The ticket machine will pass the uh just one minute.

[00:06:57]Okay. Okay. So the ticket machine will pass it to the sorry the ticket machine what information the computer is passes to the ticket machine.

[00:07:09]the number plate reader like from the car registration number >> we can we can the the computer send registration number and current time to the tech ticket machine right so we will add >> registration number plus ticket infosit something like that okay then the ticket machine will give the give something to the ticket infosit And then the computer will pass.

[00:07:48]>> Computer is basically controlling the barrier. Is it?

[00:07:51]>> It will send a command to open the barrier.

[00:07:53]>> Yes. Correct.

[00:07:55]Command to control barrier. Maybe because you are uh controlling the barrier. You are opening and closing. Is it?

[00:08:03]>> Yes.

[00:08:07]and the router beam pass information if car is present. Okay. So I think we're done with this point now. Is it clear this part?

[00:08:26]>> Yes.

[00:08:28]>> Okay.

[00:08:30]Okay. Then now we can move to the next one. So I will share with this paper with you. Okay. So you can able to see uh how I answer the long question as well.

[00:08:44]Then we will move to okay so this this one so I think it will be better if we start with a new thing is a CPA diagram right so a publishing company wants to sell a box set of an author work this will be six books presented in a specially designed boxes okay so this is basically a short description which is mostly not needed then comes to she was told yesterday that the launch event will now be in 3 weeks time. This will be followed by book signing event around the country. Okay. Book signing event.

[00:09:24]Shihani has read that critical path analysis is a project tool that can make best time use of the time available. She has not used CPA before but has decided.

[00:09:34]Okay. So when you will start with the first one, the first one is uh startup project. Right. So when it comes to the start of project what do you think uh the start of project have any dependency because here we will write all the predecessor. Okay predecessor is basically the dependency anyone remember this one >> here.

[00:10:09]Okay. So then this one don't have any dependency. So we will write zero here.

[00:10:14]Then comes to number two write promotional material can start after start of meeting. So which means we can able to start this one but we have to complete this one first. Is it? So this is one now clear this part three produce artwork for boxes box book covers and promotional material. This one is also startup meeting is it? It's one select book signing venue. This one is also startup. So this produces boxes. Six must have artwork.

[00:10:51]So what do you think? Which one will be the dependency here? Anyone?

[00:10:56]Anyone can guess produce boxes must have artwork. Right?

[00:11:07]So where we >> number three >> artwork is it?

[00:11:11]>> So >> yes >> task three there basically produces the artwork. So after they complete the artwork then we can able to start the five right must have artwork.

[00:11:19]>> Yes.

[00:11:19]>> So that's why we can say it's three right. Then comes to print promotional material must have artwork and written promotional material. So what does it mean by this? See promotional material is it and the artwork. So produce artwork for boxes is doing in task three and also they need promotional matter written promotional material which is written in task two and three right. So two three is dependent print the books must have artwork. So what does it mean by this? Print the books must have artwork. So again must have artwork. This is the artwork is it?

[00:12:01]So we will add three. Then packaging and distribution need books and boxes.

[00:12:10]So anyone can guess which one will be the dependency here need books and boxes is it? So task eight. So where we are added the book this is the boxes. This is the books right? They're producing the boxes here.

[00:12:28]They're printing the books. So need books and boxes. So they already mentioned you need this so that you can able to start working on packaging and distribution. So we can say that five and six seven sorry then hold launch event. So they're holding a launch event because they need books boxes and promotional material. So it should be 5 6 and 7 hold signing hold book signing event start day after launch event. So right when they will launch the event after that this one will be started is it? So start online now is it clear what I just did now everyone?

[00:13:10]>> Yes.

[00:13:11]>> Okay. Then when it comes to CPA diagram we will have start and end is it? We will have a start and end and thing. I also write some notes here. Okay. So I just I just copy the Yeah. Yeah. Yeah.

[00:13:27]Who raised the hand?

[00:13:31]Shouldn't be nine be dependent on 8 and seven.

[00:13:35]Okay. Nine depend on eight and seven.

[00:13:39]Okay. They mention need books boxes and promotional material. Right. Number nine. So I added seven is it print the books the boxes which is 8 and six promotional material yes I already added six as well see but packaging and distribution uh they didn't mention here right when it comes to the needs when when they mention about needs right you needs these things so that we work. They're holding the launch event because they need this thing. [snorts] So packaging and distribution is already dependent on this is it five and seven.

[00:14:28]>> Basically the la the launch event can happen while package and distribution is happening at the same time. Right?

[00:14:35]>> Yes. Yes. Correct. Because see the packaging and distribution is also dependent on the books and boxes is it?

[00:14:41]So when you will draw the diagram you will able to identify that there is a dependent dependency right. So this one is already dependent on this two and this one is dependent because they mention books, they mention boxes, they mention promotional material this three.

[00:14:58]So that's why I added 5, six, seven. The easiest way if you added eight and six, what about the books? Then they mention about the books as well.

[00:15:11]So you already mentioned about the boxes and sorry you mentioned about you said eight and six right? Eight is packaging and distribution and six is print promotional material. Pre print promotional material is okay but what about the book and boxes they already mentioned.

[00:15:38]So we when we will get need okay or any of the any of the word like must have or you can start see can start after standard meeting so that one is basically depend provide you a clue about dependency so they in in this in this notes they didn't mention about package and distribution so that's why I didn't add a but when you will draw the CPA diagram it will be more clear. Okay. See then somehow we identify the dependency then we will create because when it comes to CPA diagram I think you all know okay just write these notes because I remove all the Thanks.

[00:16:48]So we will write this one again today.

[00:16:59]So when you come to CPA diagram we have start and end right. So here I will add at first I will add start start then for uh for the CPA diagram they uses node okay so basically the node they consider node as a different name so you won't get confused basically for the duration so that's why we we think that okay this is considered as a first node which is a this one is b okay this one is c E, E, F, J, H, I, or J. If you guys only, if you wanted to add 1 2 3 4 5 6 7 8 like this, this is also applicable. Right?

[00:17:55]So, what I add here, I will add A, is it? So, A, what is the name of the task for A?

[00:18:04]This is task one, right?

[00:18:09]You can hear me, is it?

[00:18:11]>> Yes, boss.

[00:18:16]>> Okay. So, if this is if this is um task one, what will be the duration for task one?

[00:18:24]You know what? The duration is one, is it? So, we will add here one. Duration is one. Now, what does it mean? What does it mean by this?

[00:18:39]This boxes right in this boxes. If we if I if I go down this boxes, this one is called earliest time like as soon as possible you can able to complete the task. This one is called latest time. That means I already mentioned that each and every task when it comes to a project type of task right they will take more than like suppose if a task you need to complete maybe 2 to three days they will ask they will basically set up for for 5 days for that particular task. So somehow if some issues or something happen they still have 2 days left is it? So that one is called the latest time. So if you do the late still you can able to complete within the timeline any is it clear everyone?

[00:19:31]>> Yes please.

[00:19:33]>> So the first one is the earliest right.

[00:19:35]So when you will go from when you will go from left to right left to right we will only fill up the earliest. Okay. Then when we will complete the whole diagram we will return from right to left. That time we will consider about the latest. So earliest this one is one is it?

[00:19:59]Okay done. Then comes to B. So node B which is task two write promotional material depend on task one. So from where we will start?

[00:20:12]We will start from somewhere here. Is it task B?

[00:20:19]What is the So this is task two right and the duration seven duration seven. Now if I draw this one so what will be the total time earliest time?

[00:20:43]>> Eight.

[00:20:44]>> Eight. How I can get the eight? 1 >> 1 go 7 >> + 1 + 7 this way you can also think from the start 1 + 7 so we are getting it 8 right done then a b is done then we will move to the next one so this done this done three which is task c right how many days it took 10 days remember so now because task c is also dependent on one is it so we will draw the task six from here.

[00:21:16]See is it this one is task three 10 days and we will add the what will the time it will take 10 + 1 is it?

[00:21:33]So this one should be 11 then right? So we are done with a B and C. So if we are done with number three then we'll move to four. So when we in in the line number four select book signing venue is again task four is also depend on one.

[00:21:51]So the node I provide which is D. So here we can add D. Okay D is task four and the duration it's five, right?

[00:22:15]Now what will be the earliest time for dusty? Anyone can help me.

[00:22:21]Five + one. So which is six. Right? So we are done with this node. See we are done with the node. Remember this this is the this is first node structure.

[00:22:31]This is secondary structure. Okay. We call it when it comes to node we call this the first. This the second.

[00:22:39]So we're done with four. Then for the five six duration depend on three five which is E right okay so E depend on three three is basically C so E will start from C everyone get the point right C I'm now at the five right five is basically the node E and this one is depend on three so three is node C so from C we will start D so now I will create Eight.

[00:23:22]This one task four. This is task five.

[00:23:24]So if I do any mistake just uh remember me okay that I did a mistake here. So what will be the duration for E? Six. Is it six?

[00:23:36]And we will draw the what will the duration for E then 1 + 10 + 6 which is 17 right?

[00:23:48]17 done.

[00:23:55]Okay. So if we are done with the 17 [snorts] then task five is okay then we will move to we are done with this six.

[00:24:04]Six is F node which is depend on two and three. So when it comes to two and three 2 and three so which means P and C E and C both dependent to F. Okay. F is dependent both B and C. So how we will design this one? Anyone can help me. F is dependent on both B and C.

[00:24:28]>> We will draw the line from the one which is most important.

[00:24:34]uh most important or uh not most important we will identify which one is completed late basically because remember when we are drawing the CPA diagram we cannot do like this if this is we cannot connect with two things this is not possible and you have must have to add the arrow okay so only one task can only one arrow is possible. So when it comes to CPA diagram only one arrow this is possible but this is not possible. Okay wrong this one right clear.

[00:25:19]So what we will do regarding this two we will identify which one is finishing late because if you look here 8 number B right the task two is already finished within 8 days but still we have to wait for task C is it because it takes 11 days to complete so from where I will uh start task E sorry F obviously from C is it because this is the late date everyone clear Yes.

[00:25:48]>> So that's why I connect C directly sorry F directly from C.

[00:25:55]That's the reason because this is a late it is it takes more time to finish. So obviously I need to wait for C to complete right then I can immediately start F but I cannot start after B. I have to wait for the C. So that means F is directly dependent with C. But you cannot make any of the node blank. So we need to add a imaginary line for that.

[00:26:20]What does it mean by blank like when you are drawing the node? Okay, you cannot make it like this. So this two will somehow end here. But you cannot make it leave like it. You must have to connect this one to any other of the node by using imaginary line.

[00:26:41]So you have to identify which one uh which of the task or which of the node is dependent on this then you have to connect it. Okay. If you make it blank then you you won't get the mark. This is another tricks remember. Then when it comes to number B we need to add a imaginary line is it but imaginary line is not applicable for calculation purposes. Remember imaginary line is not applicable for calculation purposes. So what will be the earliest time for if then?

[00:27:18]So now you can think that okay we can also take 1 7 and this because this one don't have any duration is it P2F but when it comes to the F if duration is 2 days so we can add here this is basically task 5 4 5 this is task six duration is 2. So what will the value of the f 1 + 6 which is 16 + 2 which is 13 right? So what we did we take this we we didn't consider the imaginary line as a calculation purpose everyone >> I had a question >> uh how do we know which uh node the imaginary line goes to because you know it could have gone to E instead of F.

[00:28:07]>> Okay. why it will uh goes to E instead of F.

[00:28:11]>> Well, I don't understand why it went to F in the first place.

[00:28:14]>> Yeah. Yeah. Because see, I already added uh things right if E is not dependent on B. E is dependent on C is it? So, we do not connect E to C. But if you look here, if is dependent on two and three, is it? 2 and three is B and C, right?

[00:28:32]So, because I have now two, I have to decide which one I will add to directly connect to the F. Oh yes.

[00:28:39]>> Understand? Then I identify okay this is the this takes more time. So obviously after I complete B I need to wait for C is it? So when I will complete C then I can start F. So that's why I directly connect C and F and I take a imaginary line and connect to F.

[00:28:54]>> Yes.

[00:28:56]>> Yeah this part. Okay. So we are done with E F. Then this one is also done.

[00:29:02]Seven. Print the book also depend on three. So this is G. G is depend on three. Three is basically three is basically C. So we will C and G. Is it? So from C we will again draw G. So from C.

[00:29:23]Okay. From C we will again draw G.

[00:29:28]So the task is six. This is task seven.

[00:29:33]Task seven. And the duration is six, right? Duration is six. And what will be the earliest time? Anyone can guess?

[00:29:46]>> 17.

[00:29:47]>> 17. Yes. How? 1 >> uh 11 + 6 >> 6 17. Okay. So, we are done with number G. Number H. H is depend on five and seven. So, see each time when I'm getting the dependency, I'm I'm marking here, right? So it will be easier for me to understand. So if is depend on five and seven. So five.

[00:30:14]So this is basically eight. Five and seven. Eight is depend on five.

[00:30:19]This is E. Is it five and seven? So E and G is now responsible for F.

[00:30:32]So E N G see E N G is responsible for H is it?

[00:30:46]So I need to now the thing is that now the trick is both have the same date to finish.

[00:30:52]Now what I will do which one I will think as the latest because both have the same ending time which is >> you can take either one.

[00:31:02]>> I can take either one. Okay.

[00:31:05]>> I can take either E or I can take either G. Right. But now I will look into there's another tricks that I will go through which is which is nearer. Which node is nearer compared to H.

[00:31:18]E or G?

[00:31:22]G >> G so that's why I will take the nearer nodes now okay >> so then what we identify the third the third point which is we will take this one is we take the most uh time it took right connected to the f then this time we identify they have the both same time so we take the nearer node so the nearer node for h is g that's why we take the nearer node so I connect it from here. But I will also connect E to H. But that one should be the dummy line. Is it right? Now what will be the duration?

[00:32:04]This one is task eight. The duration for H is three.

[00:32:12]Three.

[00:32:19]So here what we did for this and this we did take nearest node of H and for C and B right so we can add maybe different color [clears throat] for C and Three take longest time.

[00:33:03]Task eight. Then anyone can help me.

[00:33:06]What will be the earliest time for each?

[00:33:08]Then >> 20.

[00:33:12]>> 20. How? So 1 + 10 11 6 17 yes 20 right okay so we are done with age when we're done with eight then we have other two which is I and J I is depend on five 6 and 7 so now I will again design I is depend on five six and seven. So right. So E FG E F G both is dependent with I as well for I as well. So maybe we can start the node for the eye somewhere here and now which one I I will take to connect because I won't take E FG both is dependent to I is it but I cannot take F because this one is less time but I have to decide from E and G anyone which one I will take for I both have the same but which one is the nearest node.

[00:34:30]>> Could you show the task name? Okay. Task name.

[00:34:36]Task name is eight.

[00:34:39]For I. Okay. So for I the task name is 9.

[00:34:46]But we take the G. Why we take G?

[00:34:48]Because G is the nearest one. That's why.

[00:34:51]Then we also have to write the inary line. So this is also depend.

[00:34:58]This is also dependent.

[00:35:02]Okay.

[00:35:05]Now is it clear?

[00:35:10]Clear. Right. So the task duration for 9 is 1 days.

[00:35:17]If it is one, then what will be the value? Earliest value 10 + 1 11 + 1 16 1 18 is it? Then comes to the last one which is age. That one is depend on nine.

[00:35:39]Nine means I.

[00:35:42]This is depend on I start after day launch event. So now because after that there is no point. So we will add here end.

[00:36:11]So which one I will add I or H because it can start from here but due to the end we can see that H is taking more time compared to I is it?

[00:36:25]So if we added from I to end if you take I to N because from the description because when it comes to the description right from the description we can guess basically. So Jad this is the point you can remember. See we add here nine right but after I draw the CPA diagram I find out that each is taking more time to finish is it if I connect I to end then my end time will be less if I take I to end so I to end what is the the 14 days right? Okay. So suppose if I take I to N to 14. So 18 + 14 what will be the correct answer then?

[00:37:14]It's 32. But if I take H2 end it will take 34.

[00:37:23]So when it comes to the end part we will always decide we will always decide the longest one.

[00:37:31]So that means basically this is a wrong is it this 10 is basically depend on eight is it sorry eight >> yes m >> right otherwise if I can also connect it with 14 but my end point was not clear it will take less than 2 days right then it won't be correct so that means during the time when I guess that was wrong is it because the time should be more so that's why I compare with the two node This is 20 + 14 34. This is 18 + 14 32.

[00:38:06]So I will take the longest one when it comes to end. Then [snorts] so which one I will take?

[00:38:17]I will take from H because this way I basically get the longest time. So here I will add 34 and this one will be the imaginary line. Now clear this part.

[00:38:33]This is task 10. Right?

[00:38:39]>> No any question.

[00:38:42]>> No miss.

[00:38:46]>> Okay. Now so we are done with the earliest. Right. Now we will look into the C. If you look into the diagram you can able to see D don't have any imaginary line. So what I can do regarding D didn't have any connection. What was the D? D is basically select book signing venue and hold book signing venue. Is it signing event? Signing event. So when we have a node which is left behind we just connect it to the end or what do you think D select book signing venue. So where I will connect T then with which one >> we can connect it to J.

[00:39:43]>> I can connect it to J.

[00:39:46]Okay.

[00:39:51]Okay. If I connect it to J is D, right? Okay.

[00:40:01]So, start day after launch event. Hold book signing venue. So, they are holding the signing venue. They're starting after the launch event, right? Okay.

[00:40:11]Then we can also think that so this one is basically book signing venue is it?

[00:40:23]And if we look here where the books started where the book started book started from here is it also?

[00:40:41]>> Yes ma'am.

[00:40:42]>> So whole book signing event. Okay. This is signing venue is also depend and the books is also started from here. So these books is also dependent. Is it this is also dependent? Is it?

[00:40:57]>> Oh yes.

[00:40:57]>> Box and a boxes. So which one came earlier? This one or this one?

[00:41:08]Both are dependent is it? And we can also see that age is also connected to the end.

[00:41:15]>> Yes.

[00:41:16]>> So how I what I will do now? We're going to client B to H.

[00:41:24]>> Anyone any any like Fahim or Jar or Tanya? Can you guess what I get to here?

[00:41:41]Any idea?

[00:41:44]No.

[00:41:52]Because the pranto which one is said which is both is dependent is it this and this I and J. So D H and J both is dependent on because they have the book select book signing venue is it need books and boxes book. Then comes to this is also dependent on I as well is it because both this also needed for the I started [snorts] from here. So which one came which one came which one which node is nearer to the D is H is it and H is also connected to J right the end see I is not connected to J directly is it but H is connected to J. So we will take the nearer to H. So nearer to D. So the nearer to D is H. So that's why we will take from here to H. H is also connected with the end.

[00:43:02]Okay. So you cannot sign the book. You cannot um you must have to select the book signing venue is it then you can able to produces the book boxes and the books is it print the books but you need a book signing venue. So on that basis we can think that okay book and boxes can also a part of a dependency we can think.

[00:43:31]So we are done with the earliest time.

[00:43:33]Now if we when it comes to the latest time now we will started to go backward is it left to right left to right sorry right to left right is it yeah it should be right to left so we will go right to left [clears throat] for the latest. So whatever will be end this one will be the end nothing to calculate. So what will be the value of this? 34 minus okay 34 minus 14 we will get 20 for this one there is uh nothing connected it's a imaginary line so imaginary line that means no calculation 18 number G 20 is a direct line right >> yes >> this is connected to this. So see now we have 20 and we have 80. So which one will take now for G?

[00:44:44]>> No, we should take 20.

[00:44:46]>> Why? Because when you will go from left to right, we will take the maximum value, right? So the maximum is 20. So we will 18. So when when we went to from like when we did left to right what we take we take the minimum or the maximum >> we take the maximum uh time uh days like the time taking days right okay and this one you also we are also taking the maximum days as well >> yes but it's actually the same for both the nodes in this case.

[00:45:35]>> Yeah. Then when it comes to this two and this two, which one we will take? 18 because uh Oh, sorry. This is Oh, sorry, sorry, sorry. No, see this is is connected to only this line. Is it H?

[00:45:49]Oh, sorry. H and I both is connected.

[00:45:52]Yes. So, if both is connected, that means we have two earliest which is 20 and we also have 18. Okay.

[00:46:01]So if no see if I minus 20 - 3 I get 17 18 - 3 I - 1 I also get 17 is it?

[00:46:10]>> So here I don't need to decide. Okay then if I look into F see if you don't have any connection is it so how I will decide? So which one is connected to F the imaginary line. So we will take this one earliest to this one latest when we have don't any connection with the next node. Okay.

[00:46:41]Could you explain that point again?

[00:46:44]Yeah.

[00:46:55]Take earliest to as latest.

[00:46:59]See this if don't have any direct correction is it the imaginary line. So when it comes to imaginary line we cannot do the calculation that I've already mentioned right but I need to came up with the end time the latest time. So I will take this earliest time to this latest time I cannot do the calculation so that's why I take this one to here.

[00:47:27]>> Okay.

[00:47:29]>> Then when it comes to E also don't have any direct connection but now E have two imaginary line. So which one I will take? Sorry, this one will be the minimum value not the maximum and this one will be the maximum value.

[00:47:55]Now for E is connected to two imaginary which is H and I right. I cannot do the calculation. So which one I will take 20 or 18 as end point.

[00:48:10]Minimum value minimum time is it 20 and 18. So we will take 18 here.

[00:48:20]Remember the last time when we did this two the C we take C and B we take the maximum value which is 11. But this time maximum value to connect to the F right.

[00:48:33]But this time when we go from right to left we take the minimum value as a lettuce. That's the difference. Then if we look into number six which is D. So what do you think? What will be the latest time for D now?

[00:48:50]>> 20.

[00:48:51]>> 20. And what will be the latest time for C? C is connected to three.

[00:48:58]11 >> 13 17 17.

[00:49:03]>> So we will take 13 is it?

[00:49:06]>> All right. Yes. 13.

[00:49:08]>> Yes. Then this one B is connected to F.

[00:49:11]So >> 13.

[00:49:16]>> 13.

[00:49:20]>> B is connected to F. So it should be 13.

[00:49:23]And this one should be one. Is it? But uh I think C should be 11 though.

[00:49:29]>> Oh. Oh yeah. Yeah. Yeah. Because uh this is a direct right? I did a mistake.

[00:49:32]Yeah. This is a direct.

[00:49:34]>> Yeah. Direct that means I have to do the calculation. So 13 minus 2 it should but out of this we will take the minimum value right. And then I have to do the calculations. So it should be 11. But for B is a imaginary line. So I didn't do any calculation. So now clear about the CPA. So remember this one left to right is minimum right sorry left to right is maximum right to left is minimum and when it comes to the imaginary line we will take the next node earliest time as their latest time and when it comes to end what we did notice here which is we will always try to connect the end one with the maximum node but during the time when I was doing the precedence identification that time I think that okay whole book signing event obviously depend on the this but after I draw it I identify that no this is not depend on I it's because this is take more time to complete so we will connect to mode to end so if you look here this three right so which one take more time C so All the next node is connected to C because C is the in this particular tree C is the node which take more time to complete. So every other node the next next three node is connected to this one is it then we can identify out of this tree this one is 17 this one is 17 but this is the nearer compared to EF G is the nearer. So all the node follow through G is it then comes to end. So n end n end n end n end n end n end n end n end n end n end n I I was identify that okay the precedence is nine then I identify the no age take more time. So which one will end at the last I will connect the end with that so that I can get a greatest or greatest uh number which is 34. If I get 32 then it should be wrong. Okay the greatest value you have to get when it comes to this.

[00:51:48]After that when it comes to D we identify that D we can directly connect with H as well directly connect with N but before the I end is basically I before the I H also dependent on G D right and H is nearer so we connect H because H is also directed so we can say we can think that D is dependent on H is dependent on N so both are connected Any question?

[00:52:24]>> No.

[00:52:25]>> No.

[00:52:29]>> Yeah. Okay. So, we are done with this.

[00:52:32]So, I think uh Jubar tell me which which year it is.

[00:52:40]Oh, now it's came.

[00:52:43]Uh question June 2024 question six.

[00:52:46]Okay.

[00:52:48]So maybe we take the book.

[00:52:54]This one is it. This is June 2024.

[00:52:58]Question number six.

[00:53:15]Okay.

[00:53:23]So this this diagram is basically a combination of precedence table and a CPA diagram.

[00:53:33]Okay.

[00:53:35]So when it comes to the first question they mention that the makers of a range of wearable IoT device are demonstrating their product at a trade show. On the opposite page are a partially completed precedence table for f setting up the equipment. A partially completed activity on R network diagram present representing the precedence table.

[00:53:59]Complete the precedence table by adding the value of a precedence activity of F.

[00:54:04]So we have to write the activity of F.

[00:54:08]This one we have to calculate is it complete the activity on arc network diagram by add. So we have to came up with three arrow. one dummy arrow. They already mentioned four missing value of the early and late events time. So we have to came up with the three arrow, right? They mention three arrow.

[00:54:31]Uh then they mention one dummy arrow. So somewhere there will be one dummy arrow like this one one dummy arrow. Then comes to adding four missing values for the early and the late event. Okay, four missing values. Okay. So if we look into the first task which is unpack and set out variable duration is one but what we can see which is there is no dependence is it so predecessor is null here then number B n show tablet are working with trade show Wi-Fi is it tablet working with trade show Wi-Fi duration is 5 days but the predecessor is again null right then when it comes to this one ensure variable are working with trade show Wi-Fi what does it mean by this the wearable this is the variable is it wearable are working with trade show Wi-Fi so they are already ensuring at task A and B is it ensure sorry ensure tablet are working so here they work with the tablet but this one is ensure wear variable are working with trade show Wi-Fi variable unpack and set out variable so that's why they added a jub is it clear until this okay then accept online terms and condition for trade so Wi-Fi users so Wi-Fi is it they started to work with the Wi-Fi IP P accept online terms. How you will accept Wi-Fi terms and condition? You need some devices to accept, right? Enable tablet or working with trade wi-fi. So you already make sure that the tablet is working with the Wi-Fi. So when your tablet is working, that means you are already accepting the rules and regulation. Is it? So accept online terms and condition for trade show Wi-Fi uses. So how you will accept?

[00:56:55]Obviously you need tablet to accept, is it? So that's why they added B.

[00:57:01]Do I is it clear?

[00:57:04]Anyone have any question?

[00:57:08]>> Test variable statistics are updated on tablet. See variable and the tablet. So updated on tablet. You need a tablet. So the B is the one which will make sure the tablet is working. Is it test variable statistics? You need a wearable statistics are updated on tablet. So you are connecting your wearable are working with trade show Wi-Fi is it? So if it is working then you it will provide the information to the tablet. So that's why B and C is dependent. E is dependent on B and C. Clear?

[00:57:46]>> Yes.

[00:57:49]>> Then number F. Test historical graph matches on tablet and variable. Which one is dependent?

[00:58:01]So how you will identify the graph on tablet and variable?

[00:58:09]Anyone can guess test historical graph matches on tablet and wearable.

[00:58:16]But this one is your your test variable statistics are updated on tablet. But when you are thinking about the dependency you have to thinking from the top.

[00:58:29]So test variable statistics. So here they are testing the variable statistics are actually updated on the tablet or not. Right? And number F test historical graph matches on tablet and wearable. So this one is basically mostly on tablet they're testing and historical graph whatever the variable is uh passing is it matched with the tablet or not anyone Mhm.

[00:59:18]>> See again this one is variable statistics. I think you guys mix up with the statistics and that historical graph right you think that okay statistics is basically the historical graph is it if if this one is variable statistics are updated on tablet right they're testing is the variable working perfectly or not is it if it is working perfectly then it is updated on the tablet that's why B and C is dependent why Because they already ensure on B and C that all the device is working perfectly. Right? If it is working perfectly then you can able to test the variable statistics is it test history. Now they are testing the same thing. See they are testing not the statistics. Now they're testing the graph which is matches on tablet and variable. So this one is also depend on B and C. The same is it they're testing but do for doing the testing you must need to make sure the tablet and variable is working with the Wi-Fi. Is it >> yes? So they they try to confuse the student uh with this because statistics so most of the thing student think okay statistics updated on the tablet then they they're considered that okay this is the statistics is it so they they think that okay all the variable statistics is updated on the tablet or not then they identify okay historical graph is matches with this or not.

[01:00:55]So variable statistics they maybe they mean like um are updated on tablet which is statistics can uh depend on so many things is it there's a number there's a graph so many thing is it updated on the tablet or not then the test historical graph historical graph means the past data is it the historical graph is matches on tablet and variable so by use variable is basically you have to wear and then maybe you have to walk or something. Is it like that?

[01:01:30]So it will take all the data to the tablet maybe wearable. Yeah. So yeah maybe similar like that is it dimension where I devices. Okay.

[01:01:45]Okay. What's your name?

[01:02:00]Okay. So, basically we can think that uh a variable devices maybe a devices which pass some of the data by using the Wi-Fi through the to the tablet. Okay. And they match that all the previous graph is matches with the latest one or not.

[01:02:15]So that's why test test. So that's why it's a B and C both both way they ensure that tablet and wearable are working with trade show Wi-Fi right if it is working with the tra trade show Wi-Fi then you can able to test both variable statistics and the graph matches right otherwise they cannot pass the data now is it clear?

[01:02:41]>> Yes.

[01:02:43]So this way they think okay then comes to this one.

[01:02:48]So 0 1 2 3 4. Okay. So zero zero means what? Zero means no dependency. Right?

[01:02:56]So B don't have any dependency. That's why start from here. A also don't have any dependency. So we can also start A from there. Is it? This is the one. So they mentioned three arrow. I already added one arrow. I need to identify two other arrow. So and then uh four missing values. So this one is a right they added B5. See B5. So I added A1. Now here B5 A1. Okay. Then this one is A. This one is C. C is connect. C is dependent on A. C is dependent on A. It's correct. Right?

[01:03:36]Then we can see that D is dependent on B. So B is here. So where I will add the D will go from here is it right? Because B this is the B node. So we can go from here is it and C.

[01:03:57]So E is dependent on both B and C. C this is B node and this is C node. So both are connected to here. So here from here we can go with the E. Is it because see each >> is depend on B and C. So this node and this node this is considered as a B consider as a C. So both of the node is connected here. So we can directly connect E to here and the E timeline is three. Jir is it clear Jir?

[01:04:31]Okay. Then we also identify that T is connected with B. So B is the node.

[01:04:39]So here we can if it is like this then maybe we can connect it with five is it? So this one should be D. Then the timeline is two D2.

[01:05:03]Okay. Then we have this two. So we are done with three arrow. One arrow, two arrow, three arrow. Then we have we have to add one dummy arrow. Dummy arrow is basically the imaginary arrow that I mentioned. So we cannot make the node like this. Right? So we have to came up with the end point. Is it? We have to came up with the end point. So before coming to the end point because I I I'm not sure where I have to add this way or this way. So for considering this what I will do I will first calculate. So this is one one okay 1 and four. What will be the earliest time then? 1 and four it's five is it? So maybe we can add five here. So 1 + 4 + 3 5 + 3 it's eight here. Why I add Yeah, 8 then 10 then because they added 11. This is the largest. So that's why this one I can thinking that okay this is the earliest. So I added the earliest here.

[01:06:04]Now 8 - 3 it should be five. So that means it takes more time to complete. So I can add the imaginary line to this.

[01:06:19]See I already complete the three arrows.

[01:06:21]So there's one dummy arrow. That's why I ended like this. Did you get the point?

[01:06:24]How I find out this this one everyone?

[01:06:28]>> Yes.

[01:06:29]>> Okay. So, you're done. Four missing values. Four missing values. 1 2 3 >> missing value of the one in the box.

[01:06:43]>> Yeah. One in the four missing. Yes. So one [clears throat] two this things we have to identify see this is also connected to this two.

[01:07:06]Which one I will take?

[01:07:10]Everyone help me. Uh >> five. So yeah three. M >> not three. It's five. Why three? I have 11 and five. Is it take the minimum value?

[01:07:23]>> I was talking about task number three.

[01:07:25]Yeah, five.

[01:07:26]>> So, we will take five. Five. Okay. So, you're done.

[01:07:34]>> Miss, do we need to label the middle arrow?

[01:07:38]>> This one? No, no, no. This one we don't need to. We don't need >> this is already given.

[01:07:45]four missing values. So 1 2 3 four 1 2 3 Oh, okay. So they they're basically 1 2 3 4. Yes, they they mention this four m missing value. Yeah, this one they consider as a value 1 2 3 4 and this is the arrow 1 2 3 and there is a one down. Yeah. So you're done with this. Okay, then next >> a gant chart would be nice.

[01:08:19]>> Which which which year?

[01:08:21]>> I don't have any year in particular.

[01:08:23]Just uh solving anyone anyone else.

[01:08:28]>> Okay. Okay. We can Okay. So this question is about the research center is developing an application for new interactive screen in the dolphin exhibit. The application will have this resources and audio commentary based on a text script. Image displayed on the screen. The image project manager has drawn up this task list for developing the application.

[01:09:21]Okay. So when it comes to Gan chart what we did what was the two things that we identify which is when it comes to our first task they don't have any dependency is it first task don't have any dependency so they already mentioned completed by 5 July and 5 July 1 all teams member right application design handover so remember sometimes gun chart when it comes to the notes right they will not give you the exact dependency. So you have to identify the dependency based on the scenario as well.

[01:09:58]Right? So nodes yeah like if you look here needs that means it's dependent must dependent. Right? But that doesn't mean the note whatever the note is given to you is all are dependent. Sometimes you also have to identify based on the scenario. This is a little bit difficult that's why.

[01:10:20]So when it comes to the first one we can identify that application design handover meeting right text script for commentary.

[01:10:34]So for this one completed by five. So which means it will start by five and the completed by five. And if you look here this gunshot don't have any constraint but most of the other gun they added a constraint. Constraint is basically the dependency but this one don't have any is it? So they already fill up the first one for us which is number five and also the second one they already completed. So when it comes the second one write text script for commentary 7 July and there's no notes is it so they started it from 6 to 7. So this one is also done and this one is dependent to this right. I would represent the previous task is dependent to this task. So write text script for commentary is it?

[01:11:26]Then we will move to this two is done for us is it select image to be used in application. So in this question you you can think about you are creating a website. Okay. So you are creating a website. So application design handover meetings what does it mean? Maybe you sit with the all the team and the team will assign you a design of a of a website. So this way you have to write okay then write text script for commentary maybe for content and all you need some text right so all the script they're writing within 7 July.

[01:12:01]Then the third one is you have to select all the image that you will use in this particular application. So provide text script text to image library. So basically for when it comes to task three I didn't get any dependency right they said that provide text script to image librarian is it? So this one you have to provide but they didn't mention need is it? So select image to be used in application it will end at 11 July. So what will be the start date anyone?

[01:12:40]So they provide text script to text sorry script text to image library is it? So based on the text maybe select all the images. So we can add after 7.

[01:12:54]So it will end at 11.

[01:12:58]They didn't add any need or mass. So we don't need any dependency here.

[01:13:04]Then this is the >> yes >> if they mention anywhere start immediately then what does that mean?

[01:13:14]>> That means start immediately is mostly means like you have to start at the same time >> on the same day.

[01:13:21]>> Yeah.

[01:13:24]>> Okay. Miss >> record commentary using text script.

[01:13:30]Need text script. See, so record commentary recording studio book for 11th and 12. They already mentioned. So we will um add 11 and 12 and they al also mentioned need text script to record commentary using text script.

[01:13:52]So for doing the recording you need the text script. So that's why task two is dependent to four.

[01:14:08]So task two will end here. It will start here. Right? So I think we can end it like this. Now Panther, is it clear?

[01:14:20]>> Yes.

[01:14:22]>> So four is done. Then we will move to number five. Create prototype application. What does it mean by prototype application?

[01:14:31]Prototype can can use boxes for images.

[01:14:33]Is it no commentary is required needs 5 days but can start 2 days early.

[01:14:41]What does it mean by early and overrun?

[01:14:44]Early means we will early 2 days is it?

[01:14:46]So if it is completed at 12 and needs 2 days early. So what does it mean by 2 days early? So task five can complete it at 12 is it at 12 it will complete need five days.

[01:15:04]So 1 2 3 4 5. Did you get how I can get the five days? I come from backward.

[01:15:10]Okay. And 2 days early.

[01:15:14]Okay. Done. Is there any dependency for five?

[01:15:18]>> Yes.

[01:15:19]>> If it was 2 days late, would it still be in brackets?

[01:15:23]>> Yes. Yes. Yes. 2 days early. Overrun early. You must have to add the bracket.

[01:15:29]>> Because >> now create prototype application. Is there any dependency?

[01:15:39]Prototype can use boxes. What does it mean by prototype? Anyone can tell me what does it mean by prototype?

[01:15:46]>> It's like like a it's like a demo of the product.

[01:15:51]>> Yeah. Can you create a prototype of application without the design?

[01:15:55]No, >> no. See this is the tricks here. You need the design to create the prototype.

[01:16:01]But they didn't mention anything. You have to get idea from here.

[01:16:06]So that's why five is dependent on one application application.

[01:16:15]We cannot create a prototype without the design, right? We must need a design. So the design is hand over on one then we can create a application prototype. So that's why this is dependent to this.

[01:16:30]Then we'll move to number six. Put image and commentary into prototype. So must start into prototype. Right? So you must have to create the prototype then you can put the image and commentary. Is it right? Am I correct or not? You need prototype. To put image and commentary you need image. Is it so that you can put that images to the prototype you need commentary as well so that you can able to add it in the prototype. So 3 4 5 both as dependent.

[01:17:05]Did you get the point?

[01:17:07]>> Yes.

[01:17:08]>> So this way we have to think okay image commentary and prototype. So that means we cannot add image and comment prototype without the prototype. So we're creating the prototype here. Now for the image and commentary I need image. So I am selecting the image on task three commentary I'm working with the commentary in task four. So that's why 3 4 5 both are dependent must start on 13th July and end on 15th July. So 13 [clears throat] and 15. Okay both are dependent. So we will mistake I think the different color is better.

[01:17:46]1 2 3 4 5 is it okay.

[01:17:50]>> [clears throat] >> 3 4 5 hour early or overrun. We'll always create the cross boxes remember.

[01:18:02]Okay. So we are done with this. Then comes to the next one which is test application using interactive screen may overrun by one day 17th July. Test application. How you how you will do the testing when you have the complete prototype is it?

[01:18:21]>> Yes ma'am.

[01:18:22]>> So we are done with the prototype 16. So 17 17 it will finish but overrun by one day and I need a prototype then I can able to test. So we're done with this.

[01:18:39]So miss are there any other symbols that are used in gam charts? No overrun dependency arrow and a constraint. If we needed to add a constraint then we will add a constraint.

[01:18:54]That's it.

[01:18:58]So how you will get a mark here?

[01:19:02]When you add the correct start and end date you will get one mark.

[01:19:09]when you came up with the dependency like 3 4.

[01:19:22]Okay. For the dependency and the the early see early and over early and overrun you get one mark in total six mark. Then the dependency for for identifying maybe how many dependency Okay. So basically how they're giving you the mark for task three. If you came up with the correct start and end date, you will get one mark. Okay. For task three.

[01:19:56]Then when it comes to task four, if you came up with the again the task four, five and six, if you came up with the start and direct uh like correctly start and end time, you will get one mark.

[01:20:14]You will get one mark again. One mark, one mark and the and the third mark you will get which is for the direct dependency you will get another mark for dependency and overrun and the early you will get another mark. So 1 2 3 4 5 6 in total they will give you the six mark.

[01:20:35]Now any other question? Anyone have any other issue? Any other diagram?