Biostatistics and Design of Experiments Prof. Mukesh Doble Department of Biotechnology Indian Institute of Technology, Madras

Size: px
Start display at page:

Download "Biostatistics and Design of Experiments Prof. Mukesh Doble Department of Biotechnology Indian Institute of Technology, Madras"

Transcription

1 Biostatistics and Design of Experiments Prof. Mukesh Doble Department of Biotechnology Indian Institute of Technology, Madras Lecture - 37 Other Designs/Second Order Designs Welcome to the course on Biostatistics and Design of Experiments. We have been talking about various types of designs, screening designs, various types of screening designs. One of them, the most important one is your factorial design. Then, we looked at the fractional factorial design, that means, doing a fraction of those factorials. Then, I talked about something called the confounding. Then, I also talked about the resolution. So, Resolution III designs are not generally liked. Resolution IV or above are always liked. And, if you say 2 4-1, that means, 4 is the number of factors, or parameters you are looking at, and this is a half of that. (Refer Slide Time: 00:54) So2 4 is 2 * 2 * 2 * 2 is 16; half of that will be 8 experiments. So, what do you do? 8 experiments is, so you put a new variable D, new factor D in, in place of ABC. So, you have a confounding of D and A B C. This is a Resolution IV design, because there are 4 terms and the design generator I is equal to A B C D, understand. So, that is how you go about doing that. So, Resolution IV design. This is liked. Resolution III design is not

2 liked. So, what do you do? 3 parameters or 3 factors; so 2 3, 8 experiments, you do not want to do 8 experiments. So, what do you do? So, it is half of 8 experiments. You are doing only 4 experiments. So, what do you do? You replace A B with C, that means, A B is confounded with C. So, the design generator is A B C; I = A B C and this is a Resolution III, because you have 3 parameter, and so on. So, you can, this tells you the, which terms are confounded, and then, it also tells you, allows you to make your resolution. This will be your Resolution IV and so on, number of runs. So, and, I also taught you how to do the calculations later, once you have the results also. Now, then, we went into something else, the Plackett-Burman designs. (Refer Slide Time: 02:29) These are also very good screening designs. We can screen large number of factors in the very minimal experiments. Ideally, if the factors are like 3, 7 and 11 and so on, because the design generator for Plackett-Burman designs are meant for 8 runs, 12 runs, 16 runs, 20 runs, 24. So, if we have one factor less than that, then Plackett-Burman design is very, very good; because, with less number of experiments, you can get very good idea about the main effect. So, you have the design generator here. I taught you how to build up these tables. The last row generally, I mean, last row is always -, -, -, and you push these signs up, and build up this. So, Plackett-Burman design is very good, if we have parameters like 3, 7, 11, 15 and so on. If the number of parameters is not that or slightly less, we can always call some of them as dummy

3 variables. Some of these columns can be called dummy variables. This is taken from this particular reference. (Refer Slide Time: 03:45) Then, we talked about Latin Square Design. This is also very important, useful type of design. Then, I showed you Latin Square for 3 parameters A, B, C, each operated at 3 levels. So, how do you represent that? - 1, 0 and 1. In a 2 level, we say - 1 and 1, for a 3 parameter we say - 1, 0, 1. And, here, you can see, you need to do 9 experiments. So, this will be one experiment; this will be one second experiment; this will be third experiment; 4, 5, 6, 7, 8, 9. So, it is very nice Latin Square Designs for a 3 variable problem. If it is a 2 variable problem, we can have a 2 by 2 Latin Square. We do not have to, 2 variable problem. We can go even 2 parameters, 2 levels, 2 variables, we can have 2 by 2 Latin Squares and so on, actually.

4 (Refer Slide Time: 04:44) Then, comes another design. This is also a screening design, that is called Taguchi designs. Traditional DOE s focus on how each level, or each factors, sorry, not each level, each factor affects the output, that is y. Y is your output, or the dependent variable. Suppose, I am doing a bio-process like a yield of a metabolite, or biomass, that is the output. Whereas in Taguchi design, he has looked at robust design, and he is more interested in the variation, the loss function. So, he is looking... Taguchi, there, has developed designs, looking at them as a possible robust design and also looking at the variations, rather than the averages. Whereas, in normal designs, like your factorial (Refer Time: 05:45) designs, or even your Plackett-Burman, we are looking at average output; we are more interested in that, actually.

5 (Refer Slide Time: 05:45). So, Taguchi design, you go, there is a design selector is there. This tells you number of parameters; this tells you number of levels. This table was taken from this particular reference. So, this tells you the number of levels; this tells you the number of parameters. So, if I have a 2 by 2, that means, 2 levels, 2 parameters. There is something called L 4 design. If I have that table L 4 is available here, table L 4 is available here, ok. (Refer Slide Time: 06:16).

6 This is called the table L 4. So, we can pick up the, as you can see, L 4 and 4 runs, we can pick up this. So, we can pick up column 1 and 2, for A and suppose I have 2 variables, so, I can do these two. If I have 3 parameters also, I can take up this. So, this will become like a confounding; do you understand? And so on. So, if you look at this table, there are tables available like L 9 table, L 18 table, L 27 table. They are meant for 3 levels and so on. L 16 table meant for 4 level, L 25 tables, 50 tables available for 5 levels. So, standard tables are available. We just pick up and then use it. So, let us look at this level 2. So, you have tables for L 4, L 8. So, we can do it for, suppose I have parameters 3 or 2, I can use the L 4 table. If I have parameters 4, or 5, or 6, or even 7, I can use the L 8 table, ok. And, if I have parameters 8, 9, 10, 11, I can use L 12 table and so on, actually. (Refer Slide Time: 07:42) So, if you look at the L 4 table, 2 levels, I can do a full factorial design. I can, (Refer Time: 07:50) if I maintain 2 factors, I can (Refer Time: 07:52) get a Resolution IV, or I can do, go up to 3 factors for screening. (Refer Time: 07:52)new slide

7 So, if I am interested in doing a screening type of work, I can go up to, take this table, and I can look at 3 variables. For example, this. This is the L 4 table; 4 runs. This is for factor A, factor B, factor C. So, if I put A, B, C, then, obviously it becomes a screening design. Whereas, if I put only A, B, I can do a very good, high resolution, full factor, it becomes a full factorial design. This is the table called L 4 table. So, I just blindly do this, take the, pick up the L 4 design for 2 level, and if it is 2 factors, I put A, B, ignore this; if it is 3 factors, I put A, B, C, and do the experiments accordingly.

8 (Refer Slide Time: 08:44) Let us look at L 8 design; that means, 8 runs. This number tells you how many runs, 4, 8, 9 and so on. (Refer Slide Time: 08:50) So, the 8 tells you the number of experiments. So, if you look at L 8 design, 2 levels, if I have 3 factors, it becomes full factorial, right? 2 raised to the power 3 is also full factorial. But, if I want to do a screening, I can go up to 7; it is almost like your Plackett- Burman, ok. If I want to get Resolution V, then, I stick to only 3 factors. So, let us look at L 8 design. This is how it looks like. So, either I can have less number of factors. I

9 can have only 3 factors, then, it becomes full factorial design, that means, A, B, C. So, this will become AB, this will become BC, this will become AC, this will become ABC. Or, I can have 7 factors, A, B, C, D, E, F. I am doing 8 experiments. It is like your Plackett- Burman design. Notice that even here, you will have the balancing, 4 -, 4 +. So, you should always have a balance and orthogonal type of behavior. So, if I want to do a full factorial design, so, I will, I can select this. I can select this, as I said, 2 3 is 8 experiment. So, I can select this, I can select this. Then, I do not select this, of course, because, this and this look same. So, I will select this, do you understand? That is why I select this column, this column, and this column. So, if it is a 3 factor, full factorial design. So, if I want to do screening up to 7, then, I can go right up to 7. I can have A, B, C, D, E, F, like that, now completely. So, I can keep increasing. So, 1, 2, 4, 7. So, I will not use 5, because, 4 and 5 look similar. So, I can use this, I can use this, I can use this, then, I can use this. So, like that, because some of 4 and 5, like that. Now they are all similar. So, L 4, L 8. So, we can, if I want to do a full factorial design, I select, I can do up to 3 factors. So, that will become a full factorial design, with their interactions, and then, if I want to look at 7 factors also, I can go; it will be almost like a Plackett. Then, you have the L 9 designs. L 9 designs are generally for 3 levels, - 1, 0, 1. If I have only 2 factors, so, it is 3 2, which is 3 * 3 is 9. So, full factorial I will get. But, I can go up to 4 factors as a screening design. So, I can go up to 4 factors, so 9 runs. So, as you can see, minuses, zeros, 1. So, this is at the highest level; this is at the lowest level; this is at the middle level. For example, temperature, if I am interested in looking at 30, 40, 50, + 1 means 50, - 1 means 30, 0 means 40. ph, if it is 3, 4, 5 I am looking at, so - 1 means 3; 5 + 1; 0 is 4; like that you know. So, if I want to do a full factorial design, what I do is, I will take 3 factors I can do; column 1, column 2 and column 4. Or, screening design, like that you can keep on doing. You can add many factors, actually. Then, you also have this L 12 design. So, as you can see, a L 12 design, 2 levels; so, we can use it as a screening design for 11 factors.

10 (Refer Slide Time: 13:12) So, I can put 11 factors here, A, B, C, D, E, like that. So, I will do 12 runs. This is almost like your Plackett-Burman design. It is a like Plackett-Burman design, ok. Only thing is, the columns and the rows are been permuted; so, they have interchanged the columns and the rows, actually, in some cases. Whereas, in Plackett-Burman design, if you see at the bottom, you will get always negatives, right. So, some difference is there. So, last line will always, 12 runs, you always get in negative. So, there is a permute, there is a switching over of some rows and columns, but, it is exactly like Plackett-Burman. So, 11 factors, I can use a Plackett-Burman design, and do a 12 experiment, or I can pick up this Taguchi table for L12. I have 11 factors, and I can do a screening design. So, I have both the options, actually, I can take Taguchi or I can take Plackett-Burman for 12 experiments. Then, you have a L So, just like L 4, L 8, L 9, L 12, you also have L 16 table.

11 (Refer Slide Time: 14:29) This is L 16 table. So, there are 16 runs. So, this indicates the number of runs. You have 16 runs here. So, I can do a full factorial; 2 raised to the power is a full factorial, right; 2 * 2 * 2 * 2, 4 times. So, full factorial. Full factorial will give you, sorry, full factorial of 4, I can go up to 5 factorial, and maintain Resolution V. If you want to do a screening design, I can go up to 15, just like your Plackett-Burman experiment, right, 15. And then, there are L 18 designs; that means, 18 experiments, 27 experiments and so on, actually. So, the advantage of the Taguchi designs are, there are tables available. We can use different tables for different if we have the depending upon the number of parameters, and numbers of levels you have. If the parameters are less in that, what is available in the table, we can ignore that. Then, one important point is, you need to crosscheck whether there is a balance and orthogonality taking place, because any design you take, we need to have that sort of conditions; that is very important. So, sometimes it will look like even Plackett-Burman design especially, when you are looking at L 12, and go screening for 11 factors. Then, of course, it is like a Plackett-Burman design. So, we have different types of tables, that is advantage of this type of a Taguchi method.

12 (Refer Slide Time: 16:02) This is a L 18 design. We have 18 experiments here. This is at 3 levels. We have - 1, 0 and + 1, 3 levels. So, the main advantage as I said is, there are designs, tables available. Taguchi has prepared and given it. So, we can use those tables directly, and whether it is a 2 factor, sorry, 2 levels, or it is a 3 level, there are tables available. He even has, as you can see here, 2 levels, 3 levels, 4 levels, 5 levels, there are tables. Generally, we will not go 4 levels and 5 levels. So, 2 levels, 3 levels, there are table available, depending upon the number of parameters. There are tables for L 32 also, that means 32 experiments you need to do. So, you just pick up those tables and make use of, for your design. So, we have covered lot of designs which can be used for screening, the full factorial, the fractional factorial, the Plackett-Burman design, the Latin Square design, the Taguchi design. So, all these are very good. Taguchi, of course, you can mix and match, and use it for full factorial or even fractional factorial. All these designs are at 2 levels, that means, you can get a linear relationship between, if temperature varies from 30 and 40, 30 to 40, I am measuring at 30, I am measuring at 40. ph, I am measuring at, say 3, and measuring at 4, the effect of ph; carbon concentration, measuring at 1 % and measuring at 2 %. So, I am measuring at two places; obviously, I can get linear relationship. So, if I am generating regression equation, I can get a linear relation. If I want to get a non-linear relation, ultimately, we are interested in optimization. So, in such situations, I need to have data at more than two points. Then only, I can get up, at

13 least a square term. Then only, I can get a quadratic term, which is non-linear. Then, I can find an optimum, maximum yield, for a minimum impurity and so on, actually. In a linear, it is always increasing or always decreasing, monotonically increasing, or monotonically decreasing. There is no optimum. So, initially, during screening design, we do all the experiments at 2 levels, whether it is 2 n, or 2 n-1, or whatever it is. So, we will have -1, + 1, as your coded experimental strategy. We cannot use the results we get to develop a second order type of model. We can use it to develop a linear model, not a quadratic model. So, screening designs are used for eliminating many parameters which are of no significance. And (Refer Time: 20:30) screening designs can be used to develop a linear relationship. But, if we are interested in developing nonlinear relationship, then, we need to go for second order model. So, when you start your design, you do not immediately jump into second order model; that is a very bad idea. What you do is, you do a screening design. You have 5 parameters, you do a screening design; come down to 2 parameters, and then, you do a second order design for those 2 parameters. Because, when you are doing second order design, you may require the results at 3 levels, - 1, 0, 1. So, the number of experiments also increases; because, if you have experiments at 3 levels, you will be able to get a quadratic relationship. So, always remember, when you start your design experiments, never go for second order model, second order designs; start with screening designs like fractional, fractional factorial, or Taguchi method, or Plackett-Burman, or even Latin Square. Eliminate many variables, and then, do a detailed design; and that is what we are going to talk about. These detailed designs are generally second order designs which can be used to generate non-linear relation like a quadratic relation.

14 (Refer Slide Time: 20:30) So, this second order designs are extremely useful in the later part. We can use those designs for optimization. I want to calculate, maximize, my biomass production. I want to calculate, maximize, my metabolite production. Then, we need to have a second order model, or a quadratic model. (Refer Slide Time: 20:49) So, there are some designs in second order also. One is called the Central Composite Design, 3k Factorial Design, Box-Behnken Design. So, these are some designs. Many softwares, commercial softwares, automatically will give this information. So, it is not a

15 big deal, and I will also tell you how to go about doing that. And, it is a very useful to do that, even using a paper and a pencil. There are other designs, Koshal design, Hybrid design; we will not talk about it. The main designs I will talk about is this central composite and Box-Behnken design. These designs are very useful and well used generally, and well accepted. So, the second order designs, of course, you have to have the data at 3 levels of the factors, minus 1, 0, 1; that means, temperature at 30, 40, 50. Whereas, when you are doing a screening design, if you are changing temperature, you may do at 30 and 40, or 30 and 50 only. Whereas, if you are doing a second order design, you will have at 3 levels; so, you will do a 30, 40, 50. Of course, you may ask the question, can I do a 3 power and raised factorial design? Also, yes, you can do that, but you do not do 3 power end designs during screening process. Never, never, never do that actually, because, the number of experiments increases. You do not know which factors to use, which are of no use. So, in during, after screening, you may eliminate some factors; then, what is the point in doing too many levels of unwanted factors. That is why, screenings, we generally do it at 2 levels, and later on, detailed design, we can do at minus 1, 0, 1. So, central composite designs developed by Box and Wilson. These are first order designs, with augmented with center points and star point. So, center point is right in the middle and star points are outside this first order design. First order designs are your factorial designs. 3 k Factorial Design, a fraction arrangement with k factors, each at 3 levels. Box-Behnken Design, this is also almost like central composite, but the corner points are not used; so, they use some other points. So, we look at each one of them.

16 (Refer Slide Time: 23:37) So, imagine, I have a factorial, 2 power 3, 8 experiments, right; 1, 2, 3, 4, 5, 6, 7 and inside 8. So, for a 2 3, it is like a cube; the parameter factor A, factor B, factor C, each one at - 1 and + 1 level; factor A, factor B, factor C, each one at - 1 and + 1 level. So, it is 2 3. So, it is like a cube. In a central composite design, so, in addition to this 8 places, full factorial, we do experiments at the central point, here; and, we also do experiments at 6 star points which are outside this cube. Do you understand? So, 8 experiments + 1, 9 experiment, and 6 star points. These are, there are 6 faces to the cube. So, there will be 6 star places which are outside the face; that means, outside. That means, it is beyond the + 1 level, or below the - 1 level; they are called the star points. So, totally, for 3 factors, you do 8 + 1, 9 + 6, 15 experiments. You will get, you are actually doing experiments at 5 levels, can you imagine? The (Refer Time: 25:14) same slide as above one below the - 1 level is one level; the - 1 is one level; the center point is one level 3; and then, again, + 1 is one level; and above the + 1, another star is another level, so 5 level, 1, 2, 3, 4, 5. So, each of these 3 variables, you are doing at 5 levels; fantastic, is it not? At 5 levels, but, you are doing only 15 experiments. So, we can fit non-linear equations, for effect of factor A on your, the output, effect of factor B on your output, effect of factor C on your output, just by doing only 15 experiments. That is the beauty of the CCDs. So, we cut down the number of experiments tremendously, but we get lot

17 of information using this type of approach; that is the main advantage. Now, how do you decide on the star points? These star points are outside the, the cube, outside the face of the cube; so you will have 6 faces for a cube. So, obviously, there are 6 star points. Do you understand? So, there are 8, for the factorial, there is 1 central points, 9, 6 stars, that is above + 1, below - 1, above + 1, below - 1, above + 1, below - 1. So, there are 6 experiments. So, , 15 points, each, that means, you are doing each variable at 5 levels. So, you get very good idea about the effect of each parameter, or factor, on your output, and, you can develop very good non-linear relationship. It is even better than your 3 n design, because in 3 n, you are doing only at 3 levels, but the number of experiments maybe very high. Imagine, if I want to do a 3 factor A, B, C at 3 levels, a factorial, it becomes 3 3, which is 3 * 3 * 3, that is 27 experiments. Whereas, with 15 experiments, with CCD, I can get lot of information also. That is the main advantage of the CCD. So, I do the full factorial inside; that means, I can get some, quite a lot of idea about my interactions also. Then, I do these extra star points and central point. So, I am doing each variable at 5 levels also. So, it is much superior to 3 3 type of designs, do you understand? So, it is really good. (Refer Slide Time: 28:06) The other one is the Box-Behnken design. So, instead of doing at these corners, it does it at these center places of these edges; center of the edge, you know. So, this is what this

18 picture is about, actually. So, you do the same thing, you do at the center of this cube, but you also do experiments at the center of these edges, rather than corner of these cube. Of course, if the factors are 3 to 7, only it exists. So, it is not the corners it is doing, it is doing at these edges, center of these edges actually, that is called the Box-Behnken Design. (Refer Slide Time: 28:49) So, if we have a, say a 2 parameter, that is like your square, that is like your square and if you are doing a CCD, the 4 points in the square, that is, the 2 2, the center point and if the star point is at the edges, so, these are the 4; these are called the star points. So, when you are doing high, medium, low, medium is your 0, 0; so, this is the design. But, if you can extend this little bit, little bit, little bit, little bit; if the region of interest is more, so, that way, little bit, little bit, you are ending up doing 5 level type of experiments. Whereas, if you are keeping your star points right on the edges, you are doing only 3 level experiments, for each of these parameter, or variable, or factor; it will be high, medium, low only. So, if you extend it beyond, then you are doing at 5 level.

19 (Refer Slide Time: 30:09) Do not forget that; see, this is what it is. So, if you are extending it beyond those, those points, so, you are doing at 5 levels. Each variable is changed from, this is level 1, level 2, level 3, level 4, level 5; so, each variable is changed. So, here we can say, the star point, if you call it α, if your α is 1, those points lie right on these; whereas, if α > 1, they are beyond this square. So, it is exploring beyond this square; that is what it is all about, actually, here, in this type of design. This is for a 2 (Refer Time: 30:47) 2 2, that means, if you have 2 parameters, ok. (Refer Slide Time: 30:50)

20 How do we calculate this, what is the optimum distance for this? The generally, the formula is square root of 2 is the optimum distance. So, if this is 1, then, this will be 1.414, because square root of 2 is That is how you select, and then, you go beyond that, actually, that is how you select, and so, we have 15 points, sorry, if we have a 2 2, we have 4 points here. Central point is 5, and then, we have a, another 4 points. So, that means, you have, how many experiments? 1, 2, 3, 4, 5, 6, 7, 8, 9 experiments, for a 2 by 2, at 3 level, it is nine experiments. So, if you have a 2 parameter, if I am doing a factorial, 3 level, I can do 3 2 which is 9 experiments, but you are doing only at 3 levels. Whereas, here, we are doing, when I use a CCD, central composite design, I am looking at each variable at 5 levels; 1 level, 2 level, 3 level, 4 level, sorry, 3 level, 4 level, 5 level; each variable is being looked at, at 5 level. So, a CCD for 2 factor, the number of experiments is same as a number of experiments for a factorial design of 3 2. But, each variable in CCD you are looking at 5 levels. Whereas, each variable in full factorial 3 2, you are looking at only 2 levels, sorry, 3 levels. So, that is the difference. So, CCD will be much better than your 3 2 type of designs. So, we will continue more about these second order designs in the next class. Thank you very much. Key words - 2 k Fractional Designs, Plackett-Burman designs, Latin Square Design, Taguchi design, L4 Design, L8 Design, L9 Design, L12 Design, L16 Design, L18 Design, Second Order DOE Designs, 3k Factorial Designs

(Refer Slide Time: 00:51)

(Refer Slide Time: 00:51) Programming, Data Structures and Algorithms Prof. Shankar Balachandran Department of Computer Science and Engineering Indian Institute Technology, Madras Module 10 E Lecture 24 Content Example: factorial

More information

Module 10A Lecture - 20 What is a function? Why use functions Example: power (base, n)

Module 10A Lecture - 20 What is a function? Why use functions Example: power (base, n) Programming, Data Structures and Algorithms Prof. Shankar Balachandran Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 10A Lecture - 20 What is a function?

More information

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology, Madras. Lecture No.

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology, Madras. Lecture No. Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture No. # 13 Transportation Problem, Methods for Initial Basic Feasible

More information

Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras

Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras Artificial Intelligence Prof. Deepak Khemani Department of Computer Science and Engineering Indian Institute of Technology, Madras (Refer Slide Time: 00:17) Lecture No - 10 Hill Climbing So, we were looking

More information

There are many other applications like constructing the expression tree from the postorder expression. I leave you with an idea as how to do it.

There are many other applications like constructing the expression tree from the postorder expression. I leave you with an idea as how to do it. Programming, Data Structures and Algorithms Prof. Hema Murthy Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 49 Module 09 Other applications: expression tree

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,

More information

(Refer Slide Time: 00:02:00)

(Refer Slide Time: 00:02:00) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts

More information

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras.

Fundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology Madras. Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology Madras Lecture No # 06 Simplex Algorithm Initialization and Iteration (Refer Slide

More information

(Refer Slide Time: 1:27)

(Refer Slide Time: 1:27) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 1 Introduction to Data Structures and Algorithms Welcome to data

More information

Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3

Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3 Engineering Mechanics Prof. Siva Kumar Department of Civil Engineering Indian Institute of Technology, Madras Statics - 4.3 In this case let s say delta B and delta C are the kinematically consistent displacements.

More information

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Week 02 Module 06 Lecture - 14 Merge Sort: Analysis

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Week 02 Module 06 Lecture - 14 Merge Sort: Analysis Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Week 02 Module 06 Lecture - 14 Merge Sort: Analysis So, we have seen how to use a divide and conquer strategy, we

More information

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 07 Special Value Testing Welcome to this session. So far we had looked

More information

We have already seen the transportation problem and the assignment problem. Let us take the transportation problem, first.

We have already seen the transportation problem and the assignment problem. Let us take the transportation problem, first. Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 19 Network Models In this lecture, we will discuss network models. (Refer

More information

D-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview

D-Optimal Designs. Chapter 888. Introduction. D-Optimal Design Overview Chapter 888 Introduction This procedure generates D-optimal designs for multi-factor experiments with both quantitative and qualitative factors. The factors can have a mixed number of levels. For example,

More information

Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore

Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore Combinatorics Prof. Dr. L. Sunil Chandran Department of Computer Science and Automation Indian Institute of Science, Bangalore Lecture - 5 Elementary concepts and basic counting principles So, welcome

More information

Design of Experiments

Design of Experiments Seite 1 von 1 Design of Experiments Module Overview In this module, you learn how to create design matrices, screen factors, and perform regression analysis and Monte Carlo simulation using Mathcad. Objectives

More information

(Refer Slide Time 3:31)

(Refer Slide Time 3:31) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 5 Logic Simplification In the last lecture we talked about logic functions

More information

Introduction to Cryptology Dr. Sugata Gangopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Roorkee

Introduction to Cryptology Dr. Sugata Gangopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Roorkee Introduction to Cryptology Dr. Sugata Gangopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Roorkee Lecture 09 Cryptanalysis and its variants, linear attack Welcome

More information

Programming and Data Structure

Programming and Data Structure Programming and Data Structure Dr. P.P.Chakraborty Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture # 09 Problem Decomposition by Recursion - II We will

More information

(Refer Slide Time 04:53)

(Refer Slide Time 04:53) Programming and Data Structure Dr.P.P.Chakraborty Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture 26 Algorithm Design -1 Having made a preliminary study

More information

Two-Level Designs. Chapter 881. Introduction. Experimental Design. Experimental Design Definitions. Alias. Blocking

Two-Level Designs. Chapter 881. Introduction. Experimental Design. Experimental Design Definitions. Alias. Blocking Chapter 881 Introduction This program generates a 2 k factorial design for up to seven factors. It allows the design to be blocked and replicated. The design rows may be output in standard or random order.

More information

CHAPTER 2 DESIGN DEFINITION

CHAPTER 2 DESIGN DEFINITION CHAPTER 2 DESIGN DEFINITION Wizard Option The Wizard is a powerful tool available in DOE Wisdom to help with the set-up and analysis of your Screening or Modeling experiment. The Wizard walks you through

More information

Lecture 05 I/O statements Printf, Scanf Simple statements, Compound statements

Lecture 05 I/O statements Printf, Scanf Simple statements, Compound statements Programming, Data Structures and Algorithms Prof. Shankar Balachandran Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 05 I/O statements Printf, Scanf Simple

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture - 35 Quadratic Programming In this lecture, we continue our discussion on

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 18 All-Integer Dual Algorithm We continue the discussion on the all integer

More information

(Refer Slide Time: 1:43)

(Refer Slide Time: 1:43) (Refer Slide Time: 1:43) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 27 Pattern Detector So, we talked about Moore

More information

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 24 Solid Modelling Welcome to the lectures on computer graphics. We have

More information

Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur

Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur Surveying Prof. Bharat Lohani Department of Civil Engineering Indian Institute of Technology, Kanpur Module - 6 Lecture - 2 Triangulation and Trilateration Welcome to this another lecture on basic surveying.

More information

(Refer Slide Time: 00:02:02)

(Refer Slide Time: 00:02:02) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 20 Clipping: Lines and Polygons Hello and welcome everybody to the lecture

More information

Switching Circuits and Logic Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Switching Circuits and Logic Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Switching Circuits and Logic Design Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture - 02 Octal and Hexadecimal Number Systems Welcome

More information

(Refer Slide Time: 00:01:30)

(Refer Slide Time: 00:01:30) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 32 Design using Programmable Logic Devices (Refer Slide Time: 00:01:30)

More information

Object-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur

Object-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur Object-Oriented Analysis and Design Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology-Kharagpur Lecture 06 Object-Oriented Analysis and Design Welcome

More information

Programming, Data Structures and Algorithms Prof. Hema A Murthy Department of Computer Science and Engineering Indian Institute of Technology, Madras

Programming, Data Structures and Algorithms Prof. Hema A Murthy Department of Computer Science and Engineering Indian Institute of Technology, Madras Programming, Data Structures and Algorithms Prof. Hema A Murthy Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 54 Assignment on Data Structures (Refer Slide

More information

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 05 Lecture - 24 Solving LPs with mixed type of constraints In the

More information

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering Digital Image Processing Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Image Enhancement Frequency Domain Processing

More information

Design and Analysis of Experiments Prof. Jhareswar Maiti Department of Industrial and Systems Engineering Indian Institute of Technology, Kharagpur

Design and Analysis of Experiments Prof. Jhareswar Maiti Department of Industrial and Systems Engineering Indian Institute of Technology, Kharagpur Design and Analysis of Experiments Prof. Jhareswar Maiti Department of Industrial and Systems Engineering Indian Institute of Technology, Kharagpur Lecture 59 Fractional Factorial Design using MINITAB

More information

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #19. Loops: Continue Statement Example

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #19. Loops: Continue Statement Example Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #19 Loops: Continue Statement Example Let us do a sample program using continue statements, I will introduce

More information

Programming, Data Structures and Algorithms Prof. Hema Murthy Department of Computer Science and Engineering Indian Institute Technology, Madras

Programming, Data Structures and Algorithms Prof. Hema Murthy Department of Computer Science and Engineering Indian Institute Technology, Madras Programming, Data Structures and Algorithms Prof. Hema Murthy Department of Computer Science and Engineering Indian Institute Technology, Madras Module 03 Lecture - 26 Example of computing time complexity

More information

Programming, Data Structures and Algorithms Prof. Hema Murthy Department of Computer Science and Engineering Indian Institute of Technology, Madras

Programming, Data Structures and Algorithms Prof. Hema Murthy Department of Computer Science and Engineering Indian Institute of Technology, Madras Programming, Data Structures and Algorithms Prof. Hema Murthy Department of Computer Science and Engineering Indian Institute of Technology, Madras Module 06 Lecture - 46 Stacks: Last in first out Operations:

More information

Modern Experimental Design

Modern Experimental Design Modern Experimental Design THOMAS P. RYAN Acworth, GA Modern Experimental Design Modern Experimental Design THOMAS P. RYAN Acworth, GA Copyright C 2007 by John Wiley & Sons, Inc. All rights reserved.

More information

Screening Design Selection

Screening Design Selection Screening Design Selection Summary... 1 Data Input... 2 Analysis Summary... 5 Power Curve... 7 Calculations... 7 Summary The STATGRAPHICS experimental design section can create a wide variety of designs

More information

Technical Arts 101 Prof. Anupam Saxena Department of Mechanical engineering Indian Institute of Technology, Kanpur. Lecture - 7 Think and Analyze

Technical Arts 101 Prof. Anupam Saxena Department of Mechanical engineering Indian Institute of Technology, Kanpur. Lecture - 7 Think and Analyze Technical Arts 101 Prof. Anupam Saxena Department of Mechanical engineering Indian Institute of Technology, Kanpur Lecture - 7 Think and Analyze Last time I asked you to come up with a single funniest

More information

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 11 Coding Strategies and Introduction to Huffman Coding The Fundamental

More information

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 17 Switch Statement (Refer Slide Time: 00:23) In

More information

(Refer Slide Time: 02:59)

(Refer Slide Time: 02:59) Numerical Methods and Programming P. B. Sunil Kumar Department of Physics Indian Institute of Technology, Madras Lecture - 7 Error propagation and stability Last class we discussed about the representation

More information

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #17. Loops: Break Statement

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #17. Loops: Break Statement Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #17 Loops: Break Statement (Refer Slide Time: 00:07) In this session we will see one more feature that is present

More information

(Refer Slide Time 00:01:09)

(Refer Slide Time 00:01:09) Computer Organization Part I Prof. S. Raman Department of Computer Science & Engineering Indian Institute of Technology Lecture 3 Introduction to System: Hardware In the previous lecture I said that I

More information

Fundamentals of Database Systems Prof. Arnab Bhattacharya Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Fundamentals of Database Systems Prof. Arnab Bhattacharya Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Fundamentals of Database Systems Prof. Arnab Bhattacharya Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture - 18 Database Indexing: Hashing We will start on

More information

(Refer Slide Time: 01:00)

(Refer Slide Time: 01:00) Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture minus 26 Heuristics for TSP In this lecture, we continue our discussion

More information

(Refer Slide Time: 0:19)

(Refer Slide Time: 0:19) Theory of Computation. Professor somenath Biswas. Department of Computer Science & Engineering. Indian Institute of Technology, Kanpur. Lecture-15. Decision Problems for Regular Languages. (Refer Slide

More information

Computer Architecture Prof. Smruthi Ranjan Sarangi Department of Computer Science and Engineering Indian Institute of Technology, Delhi

Computer Architecture Prof. Smruthi Ranjan Sarangi Department of Computer Science and Engineering Indian Institute of Technology, Delhi Computer Architecture Prof. Smruthi Ranjan Sarangi Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 32 The Memory Systems Part III Welcome back. (Refer Slide

More information

(Refer Slide Time: 01:12)

(Refer Slide Time: 01:12) Internet Technology Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture No #22 PERL Part II We continue with our discussion on the Perl

More information

2.1 Basics of Functions and Their Graphs

2.1 Basics of Functions and Their Graphs .1 Basics of Functions and Their Graphs Section.1 Notes Page 1 Domain: (input) all the x-values that make the equation defined Defined: There is no division by zero or square roots of negative numbers

More information

There are functions to handle strings, so we will see the notion of functions itself in little a detail later. (Refer Slide Time: 00:12)

There are functions to handle strings, so we will see the notion of functions itself in little a detail later. (Refer Slide Time: 00:12) Programming Data Structures, Algorithms Prof. Shankar Balachandran Department of Computer Science and Engineering Indian Institute of Technology, Madras Module - 13b Lecture - 19 Functions to handle strings;

More information

Catalan Numbers. Table 1: Balanced Parentheses

Catalan Numbers. Table 1: Balanced Parentheses Catalan Numbers Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 00 We begin with a set of problems that will be shown to be completely equivalent. The solution to each problem

More information

PROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between

PROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between MITOCW Lecture 10A [MUSIC PLAYING] PROFESSOR: Last time, we took a look at an explicit control evaluator for Lisp, and that bridged the gap between all these high-level languages like Lisp and the query

More information

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 37 Resolution Rules

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 37 Resolution Rules Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 37 Resolution Rules If some literals can be unified, the same algorithm should be able

More information

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 18 Switch Statement (Contd.) And Introduction to

More information

Week - 03 Lecture - 18 Recursion. For the last lecture of this week, we will look at recursive functions. (Refer Slide Time: 00:05)

Week - 03 Lecture - 18 Recursion. For the last lecture of this week, we will look at recursive functions. (Refer Slide Time: 00:05) Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 03 Lecture - 18 Recursion For the

More information

Week - 04 Lecture - 01 Merge Sort. (Refer Slide Time: 00:02)

Week - 04 Lecture - 01 Merge Sort. (Refer Slide Time: 00:02) Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 04 Lecture - 01 Merge Sort (Refer

More information

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14

Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14 Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 14 Scan Converting Lines, Circles and Ellipses Hello everybody, welcome again

More information

Database management system Prof. D. Janakiram Department of Computer Science and Engineering Indian Institute of Technology, Madras

Database management system Prof. D. Janakiram Department of Computer Science and Engineering Indian Institute of Technology, Madras Database management system Prof. D. Janakiram Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 25 Basic 2-phase & 3-phase Commit protocol In the last lecture,

More information

Lesson 14 Transcript: Triggers

Lesson 14 Transcript: Triggers Lesson 14 Transcript: Triggers Slide 1: Cover Welcome to Lesson 14 of DB2 on Campus Lecture Series. Today, we are going to talk about Triggers. My name is Raul Chong, and I'm the DB2 on Campus Program

More information

Week - 01 Lecture - 04 Downloading and installing Python

Week - 01 Lecture - 04 Downloading and installing Python Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 01 Lecture - 04 Downloading and

More information

(Refer Slide Time: 00:04:20)

(Refer Slide Time: 00:04:20) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 8 Three Dimensional Graphics Welcome back all of you to the lectures in Computer

More information

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #44. Multidimensional Array and pointers

Introduction to Programming in C Department of Computer Science and Engineering. Lecture No. #44. Multidimensional Array and pointers Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #44 Multidimensional Array and pointers In this video, we will look at the relation between Multi-dimensional

More information

Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore

Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore Compiler Design Prof. Y. N. Srikant Department of Computer Science and Automation Indian Institute of Science, Bangalore Module No. # 10 Lecture No. # 16 Machine-Independent Optimizations Welcome to the

More information

(Refer Slide Time 01:41 min)

(Refer Slide Time 01:41 min) Programming and Data Structure Dr. P.P.Chakraborty Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture # 03 C Programming - II We shall continue our study of

More information

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur. Lecture 13 Path Testing

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur. Lecture 13 Path Testing Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture 13 Path Testing Welcome to this session and we will discuss about path

More information

Database Management System Prof. D. Janakiram Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No.

Database Management System Prof. D. Janakiram Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No. Database Management System Prof. D. Janakiram Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No. # 20 Concurrency Control Part -1 Foundations for concurrency

More information

(Refer Slide Time: 00:03:51)

(Refer Slide Time: 00:03:51) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 17 Scan Converting Lines, Circles and Ellipses Hello and welcome everybody

More information

Deep Learning for Visual Computing Prof. Debdoot Sheet Department of Electrical Engineering Indian Institute of Technology, Kharagpur

Deep Learning for Visual Computing Prof. Debdoot Sheet Department of Electrical Engineering Indian Institute of Technology, Kharagpur Deep Learning for Visual Computing Prof. Debdoot Sheet Department of Electrical Engineering Indian Institute of Technology, Kharagpur Lecture - 05 Classification with Perceptron Model So, welcome to today

More information

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur

Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 15 Branching : IF ELSE Statement We are looking

More information

(Refer Slide Time: 02.06)

(Refer Slide Time: 02.06) Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 27 Depth First Search (DFS) Today we are going to be talking

More information

Surveying Prof. Bharat Lohani Indian Institute of Technology, Kanpur. Lecture - 1 Module - 6 Triangulation and Trilateration

Surveying Prof. Bharat Lohani Indian Institute of Technology, Kanpur. Lecture - 1 Module - 6 Triangulation and Trilateration Surveying Prof. Bharat Lohani Indian Institute of Technology, Kanpur Lecture - 1 Module - 6 Triangulation and Trilateration (Refer Slide Time: 00:21) Welcome to this another lecture on basic surveying.

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 28 Chinese Postman Problem In this lecture we study the Chinese postman

More information

STAT 311 (3 CREDITS) VARIANCE AND REGRESSION ANALYSIS ELECTIVE: ALL STUDENTS. CONTENT Introduction to Computer application of variance and regression

STAT 311 (3 CREDITS) VARIANCE AND REGRESSION ANALYSIS ELECTIVE: ALL STUDENTS. CONTENT Introduction to Computer application of variance and regression STAT 311 (3 CREDITS) VARIANCE AND REGRESSION ANALYSIS ELECTIVE: ALL STUDENTS. CONTENT Introduction to Computer application of variance and regression analysis. Analysis of Variance: one way classification,

More information

MITOCW watch?v=se4p7ivcune

MITOCW watch?v=se4p7ivcune MITOCW watch?v=se4p7ivcune The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free. To

More information

(Refer Slide Time: 0:32)

(Refer Slide Time: 0:32) Digital Image Processing. Professor P. K. Biswas. Department of Electronics and Electrical Communication Engineering. Indian Institute of Technology, Kharagpur. Lecture-57. Image Segmentation: Global Processing

More information

(Refer Slide Time: 00:02:24 min)

(Refer Slide Time: 00:02:24 min) CAD / CAM Prof. Dr. P. V. Madhusudhan Rao Department of Mechanical Engineering Indian Institute of Technology, Delhi Lecture No. # 9 Parametric Surfaces II So these days, we are discussing the subject

More information

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Module 07 Lecture - 38 Divide and Conquer: Closest Pair of Points We now look at another divide and conquer algorithm,

More information

(Refer Slide Time: 00:26)

(Refer Slide Time: 00:26) Programming, Data Structures and Algorithms Prof. Shankar Balachandran Department of Computer Science and Engineering Indian Institute Technology, Madras Module 07 Lecture 07 Contents Repetitive statements

More information

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module 03 Simplex Algorithm Lecture - 03 Tabular form (Minimization) In this

More information

An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s.

An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Using Monte Carlo to Estimate π using Buffon s Needle Problem An interesting related problem is Buffon s Needle which was first proposed in the mid-1700 s. Here s the problem (in a simplified form). Suppose

More information

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Module 02 Lecture - 45 Memoization

Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Module 02 Lecture - 45 Memoization Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Module 02 Lecture - 45 Memoization Let us continue our discussion of inductive definitions. (Refer Slide Time: 00:05)

More information

UNIT 8: SOLVING AND GRAPHING QUADRATICS. 8-1 Factoring to Solve Quadratic Equations. Solve each equation:

UNIT 8: SOLVING AND GRAPHING QUADRATICS. 8-1 Factoring to Solve Quadratic Equations. Solve each equation: UNIT 8: SOLVING AND GRAPHING QUADRATICS 8-1 Factoring to Solve Quadratic Equations Zero Product Property For all numbers a & b Solve each equation: If: ab 0, 1. (x + 3)(x 5) = 0 Then one of these is true:

More information

GAP CLOSING. Grade 9. Facilitator s Guide

GAP CLOSING. Grade 9. Facilitator s Guide GAP CLOSING Grade 9 Facilitator s Guide Topic 3 Integers Diagnostic...5 Administer the diagnostic...5 Using diagnostic results to personalize interventions solutions... 5 Using Intervention Materials...8

More information

Transcriber(s): Aboelnaga, Eman Verifier(s): Yedman, Madeline Date Transcribed: Fall 2010 Page: 1 of 9

Transcriber(s): Aboelnaga, Eman Verifier(s): Yedman, Madeline Date Transcribed: Fall 2010 Page: 1 of 9 Page: 1 of 9 0:00 1 R1 The color s not going to show a little bit, but okay. Okay. So, um, a plus b quantity cubed, you said, means Stephanie a plus b times a plus b times a plus b /R1 3 R1 Okay, so you

More information

Project 2: How Parentheses and the Order of Operations Impose Structure on Expressions

Project 2: How Parentheses and the Order of Operations Impose Structure on Expressions MAT 51 Wladis Project 2: How Parentheses and the Order of Operations Impose Structure on Expressions Parentheses show us how things should be grouped together. The sole purpose of parentheses in algebraic

More information

What is a Fraction? Fractions. One Way To Remember Numerator = North / 16. Example. What Fraction is Shaded? 9/16/16. Fraction = Part of a Whole

What is a Fraction? Fractions. One Way To Remember Numerator = North / 16. Example. What Fraction is Shaded? 9/16/16. Fraction = Part of a Whole // Fractions Pages What is a Fraction? Fraction Part of a Whole Top Number? Bottom Number? Page Numerator tells how many parts you have Denominator tells how many parts are in the whole Note: the fraction

More information

Fractional. Design of Experiments. Overview. Scenario

Fractional. Design of Experiments. Overview. Scenario Design of Experiments Overview We are going to learn about DOEs. Specifically, you ll learn what a DOE is, as well as, what a key concept known as Confounding is all about. Finally, you ll learn what the

More information

DECIMAL FRACTIONS. Thus, 0.25=25/100=1/4;2.008=2008/1000=251/125.

DECIMAL FRACTIONS. Thus, 0.25=25/100=1/4;2.008=2008/1000=251/125. DECIMAL FRACTIONS I. Decimal Fractions : Fractions in which denominators are powers of 10 are known as decimal fractions. Thus,1/10=1 tenth=.1;1/100=1 hundredth =.01; 99/100=99 hundreths=.99;7/1000=7 thousandths=.007,etc

More information

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 32 Multiple Server Queueing Models In this lecture, we continue our discussion

More information

Week - 01 Lecture - 03 Euclid's Algorithm for gcd. Let us continue with our running example of gcd to explore more issues involved with program.

Week - 01 Lecture - 03 Euclid's Algorithm for gcd. Let us continue with our running example of gcd to explore more issues involved with program. Programming, Data Structures and Algorithms in Python Prof. Madhavan Mukund Department of Computer Science and Engineering Indian Institute of Technology, Madras Week - 01 Lecture - 03 Euclid's Algorithm

More information

Name: -1 and and and and

Name: -1 and and and and Roots of Quadratic Equations Studio We ve discussed finding the vertex of a parabola. If we have a quadratic in the form y = a(x h) 2 + k, then the vertex is at the point (h,k), indeed the reason for writing

More information

GENERAL MATH FOR PASSING

GENERAL MATH FOR PASSING GENERAL MATH FOR PASSING Your math and problem solving skills will be a key element in achieving a passing score on your exam. It will be necessary to brush up on your math and problem solving skills.

More information

MA 1128: Lecture 02 1/22/2018

MA 1128: Lecture 02 1/22/2018 MA 1128: Lecture 02 1/22/2018 Exponents Scientific Notation 1 Exponents Exponents are used to indicate how many copies of a number are to be multiplied together. For example, I like to deal with the signs

More information

MITOCW watch?v=4dj1oguwtem

MITOCW watch?v=4dj1oguwtem MITOCW watch?v=4dj1oguwtem PROFESSOR: So it's time to examine uncountable sets. And that's what we're going to do in this segment. So Cantor's question was, are all sets the same size? And he gives a definitive

More information

(Refer Slide Time 5:19)

(Refer Slide Time 5:19) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 7 Logic Minimization using Karnaugh Maps In the last lecture we introduced

More information

MITOCW ocw f99-lec07_300k

MITOCW ocw f99-lec07_300k MITOCW ocw-18.06-f99-lec07_300k OK, here's linear algebra lecture seven. I've been talking about vector spaces and specially the null space of a matrix and the column space of a matrix. What's in those

More information