1 00:00:00,370 --> 00:00:01,430 Biton sits. 2 00:00:01,830 --> 00:00:04,380 So that is another data type available in Biton. 3 00:00:05,680 --> 00:00:13,330 In Biton is Asset is an unordered collection of unique items, no duplicate elements are allowed inset 4 00:00:13,690 --> 00:00:17,920 and must be immutable weapons, which cannot be chanced. 5 00:00:18,430 --> 00:00:20,980 So Hoeber, the SEC itself is mutable. 6 00:00:21,160 --> 00:00:24,370 We can add or remove items from it. 7 00:00:24,850 --> 00:00:32,200 So now we have defined what is a set and in Python we usually include the set within Karlee process 8 00:00:32,350 --> 00:00:32,730 has set. 9 00:00:32,800 --> 00:00:36,730 Members must be unordered and they'll be. 10 00:00:36,760 --> 00:00:39,520 Each and every item will be unique in values. 11 00:00:40,060 --> 00:00:46,690 So safes can be used to perform the mathematical set operations like your union intersection, semantic 12 00:00:47,140 --> 00:00:48,750 difference and so on. 13 00:00:51,240 --> 00:00:54,150 So here we are different, discussing what is a said union. 14 00:00:54,750 --> 00:00:57,120 So let us suppose is said, Visa said. 15 00:00:57,210 --> 00:01:00,320 And if we do the said union, that is a union B.. 16 00:01:00,510 --> 00:01:05,340 So these are the elements of selecting DePrince, where selecting all elements either belonging to A 17 00:01:05,460 --> 00:01:06,630 or B or both. 18 00:01:07,200 --> 00:01:08,960 We're going for the set intersection. 19 00:01:09,450 --> 00:01:14,310 So if you take the intersection between the set A and B, then all those elements will be belonging, 20 00:01:14,580 --> 00:01:17,220 which are common between A and B sets. 21 00:01:18,660 --> 00:01:21,630 Here you is actually standing for the universal set. 22 00:01:23,450 --> 00:01:25,700 Next one is a set, operations continue. 23 00:01:25,760 --> 00:01:32,780 That is a sad difference if you do A minus B, if you do A minus B, then you're the with those elements, 24 00:01:32,900 --> 00:01:40,330 which will be in A, not in B, but if you do the set set symmetric difference in that guess. 25 00:01:40,730 --> 00:01:47,840 If you go for a set semantic difference, B, then those elements and B will be selected which are B 26 00:01:47,900 --> 00:01:51,140 either in A or B not in common. 27 00:01:53,320 --> 00:01:56,470 So here we're it been done by on set methods. 28 00:01:56,890 --> 00:02:05,750 So, Ed, so we can add or an element to set clear, remove all elements from a set, copy returns, 29 00:02:05,750 --> 00:02:07,930 a shell, a copy of acid. 30 00:02:08,470 --> 00:02:14,170 Next one is a difference written the difference of two or more sets as a new set. 31 00:02:14,470 --> 00:02:15,700 They're going for the difference. 32 00:02:15,870 --> 00:02:17,450 Bit discard. 33 00:02:17,750 --> 00:02:19,600 Remove an element from the set. 34 00:02:19,840 --> 00:02:21,040 If it is a member. 35 00:02:21,340 --> 00:02:22,030 Do nothing. 36 00:02:22,040 --> 00:02:29,230 If the element is not belonging to the set, not the member of the set intersection intersection a bit 37 00:02:29,860 --> 00:02:32,050 is disjoined return true. 38 00:02:32,080 --> 00:02:37,960 If two sets have a null intersection is subset return two. 39 00:02:38,110 --> 00:02:41,290 If Energous set contains this particular set. 40 00:02:43,150 --> 00:02:45,250 We're having this is superset. 41 00:02:45,580 --> 00:02:46,840 We are having this pop. 42 00:02:47,110 --> 00:02:48,490 That is the pop method. 43 00:02:48,600 --> 00:02:52,600 That is a remove and return, an arbitrary set element. 44 00:02:52,930 --> 00:02:55,390 It is clear if the set is empty. 45 00:02:55,570 --> 00:03:01,090 So in the scene, you see all the methods we have discussed with the respective shot discussions. 46 00:03:02,490 --> 00:03:07,590 OK, next one is all return to if all elements of the set are true. 47 00:03:07,800 --> 00:03:13,410 So these are the list of guitars which are Biton building functions, Witchey, which are applicable 48 00:03:13,410 --> 00:03:14,290 with set also. 49 00:03:14,610 --> 00:03:18,840 So any return true if any element of the set is true. 50 00:03:19,070 --> 00:03:21,720 A new Monett return, an inanimate object. 51 00:03:22,200 --> 00:03:27,580 It contains the index and the value of all the items of the set as a pair. 52 00:03:27,810 --> 00:03:28,420 So index. 53 00:03:28,440 --> 00:03:30,120 That is a position number and the value. 54 00:03:30,300 --> 00:03:31,480 So that can fall appear. 55 00:03:31,770 --> 00:03:32,790 And that'll be printed. 56 00:03:33,060 --> 00:03:34,110 That will be the output here. 57 00:03:34,380 --> 00:03:36,010 So now we are going for this line. 58 00:03:36,270 --> 00:03:37,500 That is the return, the length. 59 00:03:37,560 --> 00:03:39,480 That is a number of elements in the set. 60 00:03:39,690 --> 00:03:41,370 So these are the other methods that there. 61 00:03:41,700 --> 00:03:45,930 These are the python building functions which can be applied on the set. 62 00:03:46,050 --> 00:03:46,520 Day-To-Day. 63 00:03:46,950 --> 00:03:52,410 So I think for the better clarity, let us go for one practical demonstration to show you that how this 64 00:03:52,410 --> 00:03:54,660 might parts can be applied on the set. 65 00:03:54,810 --> 00:03:57,600 And before that, obviously, we should we should show you that. 66 00:03:57,600 --> 00:03:58,730 What did the what is the set? 67 00:03:58,770 --> 00:03:59,610 How to define it? 68 00:03:59,940 --> 00:04:04,350 And what are the different basic operations which you can carry out on a set? 69 00:04:04,560 --> 00:04:10,650 So here is the demonstration for you is set is an unordered collection of items. 70 00:04:10,710 --> 00:04:13,950 That means within the items, within the members of the set. 71 00:04:14,160 --> 00:04:16,320 That is no ordering the elements. 72 00:04:16,530 --> 00:04:20,700 The items can be in an audit and every element must be unique. 73 00:04:20,790 --> 00:04:25,020 No duplicate elements will be allowed in a set and must be imitable. 74 00:04:25,040 --> 00:04:28,350 That means those elements cannot be updated, cannot be changed. 75 00:04:28,860 --> 00:04:31,170 However, the set itself is mutable. 76 00:04:31,200 --> 00:04:33,300 That means we can add audry move. 77 00:04:33,420 --> 00:04:41,070 Items from asset sets can be used for two parts from the mathematical set operations like about union 78 00:04:41,400 --> 00:04:43,980 intersection, symmetric difference, etc.. 79 00:04:44,580 --> 00:04:50,220 So let us discuss how to create one set here to define one set of integers. 80 00:04:50,630 --> 00:04:51,450 It gets upset. 81 00:04:51,510 --> 00:04:56,620 The elements will be separated by commas and the whole set will be enclosed within Culebras. 82 00:04:57,000 --> 00:05:02,730 So if I predict you can find that the state has been formed, if SCIP may have different type of data, 83 00:05:02,790 --> 00:05:05,970 that means elements will be form mixed together types. 84 00:05:06,240 --> 00:05:12,000 So here we are having this hundred and one of the type of integer level is of the type of string. 85 00:05:12,300 --> 00:05:14,060 And here you are having one couple. 86 00:05:14,130 --> 00:05:16,650 The couple can be also asset element. 87 00:05:17,010 --> 00:05:20,700 So he can find that the respective mindset, too, has got printed. 88 00:05:21,300 --> 00:05:22,960 If we vilely defining one set. 89 00:05:22,980 --> 00:05:26,820 If I put some duplicate Palouse, then those duplicate values will be eliminated. 90 00:05:26,910 --> 00:05:29,940 Only the unique values will be there in the set item. 91 00:05:30,000 --> 00:05:30,390 Italy. 92 00:05:31,390 --> 00:05:34,660 Now, in this case, is it cannot happen, mutable items. 93 00:05:34,900 --> 00:05:40,030 Here you can find that we are defining one set or at least is as one of the elements. 94 00:05:40,060 --> 00:05:45,130 But list is containing mutable items, so this particular set cannot be formed. 95 00:05:45,190 --> 00:05:46,960 So if I go on printing. 96 00:05:48,230 --> 00:05:53,030 If I tried to form a view, I could define one set here, then type it, it is coming. 97 00:05:53,270 --> 00:05:57,110 And on cashable type list is their respective error message. 98 00:05:57,500 --> 00:06:03,770 So you can find that creation of a set from the list as one of the elements is not possible. 99 00:06:04,430 --> 00:06:05,990 So we can make a set. 100 00:06:07,070 --> 00:06:10,610 But we can make a set from a list using the method set. 101 00:06:10,970 --> 00:06:12,360 So here we are having one list. 102 00:06:12,820 --> 00:06:18,380 You are doing one method set here and then we're going to get one set accordingly. 103 00:06:19,070 --> 00:06:26,630 I know if I want to make one list from this set, the set will be inkless within the culebras us. 104 00:06:26,780 --> 00:06:28,760 And here we're using the method list. 105 00:06:29,060 --> 00:06:33,830 And then we can get a list from this set here so we can find that we have got one list here. 106 00:06:34,310 --> 00:06:37,040 And here you can find the type of the mildest one. 107 00:06:37,100 --> 00:06:38,280 So it had the class type. 108 00:06:38,300 --> 00:06:38,990 Is the list here. 109 00:06:40,520 --> 00:06:42,860 Next, we're going for operations on a set. 110 00:06:43,010 --> 00:06:45,860 So on a set, we can perform multiple different operations. 111 00:06:45,920 --> 00:06:47,520 So let me go one by one. 112 00:06:49,140 --> 00:06:54,270 So at first, we're defining this particular set here, having the value element, 32, 44, 66 and 113 00:06:54,270 --> 00:06:54,730 55. 114 00:06:55,080 --> 00:06:58,230 You can see this set of values that there might be in the different order. 115 00:06:58,890 --> 00:07:03,030 So now the set members cannot be accessed using index. 116 00:07:03,040 --> 00:07:04,260 So zero is the index. 117 00:07:04,290 --> 00:07:10,110 So if I want to access the mindset one zero if I want to access this one, it will be coming. 118 00:07:10,500 --> 00:07:17,000 And that type of the name of the ADA is type ID and set object does not support indexing is the ADA 119 00:07:17,010 --> 00:07:17,580 message. 120 00:07:18,570 --> 00:07:20,160 So that means I cannot do this one. 121 00:07:20,820 --> 00:07:22,590 That means indexing is not allowed. 122 00:07:22,680 --> 00:07:25,050 Not getting supported on a set. 123 00:07:26,440 --> 00:07:26,650 OK. 124 00:07:27,190 --> 00:07:34,240 Next one is that so if we go for adding one single item so we can use the method and so in that case, 125 00:07:34,260 --> 00:07:37,450 77 will be added as one of the elements. 126 00:07:37,840 --> 00:07:42,990 But if I want to add multiple items, then you can go for the method update on here. 127 00:07:43,000 --> 00:07:47,140 The multiple items are to be enclosed within squared records. 128 00:07:47,170 --> 00:07:48,580 That means it is a list. 129 00:07:48,940 --> 00:07:53,440 So list of items can be can be passed as input argument to the method. 130 00:07:53,560 --> 00:07:54,640 That is our object. 131 00:07:54,940 --> 00:08:01,240 In that case, you can find that 88 at 19 and 22, the three values have got added to the set. 132 00:08:01,930 --> 00:08:05,840 Now you see, we can go for the object in that case of object. 133 00:08:06,400 --> 00:08:07,750 We can add a list. 134 00:08:07,810 --> 00:08:09,000 We can add a set. 135 00:08:09,370 --> 00:08:11,970 So here to see a hundred three hundred, four hundred five. 136 00:08:12,070 --> 00:08:15,010 They are nothing but a set and hundred and hundred two. 137 00:08:15,040 --> 00:08:16,330 They're nothing but a list. 138 00:08:16,630 --> 00:08:22,810 So looking at the brackets enclosed you can easily find and then you can find that this particular mindset 139 00:08:22,870 --> 00:08:26,050 one is having those values included an added. 140 00:08:28,690 --> 00:08:33,700 Now we are going for the remove and discard so you can find that in case of remove and discard. 141 00:08:34,000 --> 00:08:39,850 So initialised mindset, so ETWAS mindset, one has got this set of values and we have printed that 142 00:08:39,850 --> 00:08:39,970 one. 143 00:08:40,600 --> 00:08:45,730 Now we are going for the discard for that mean discard an element which is not present, but you can 144 00:08:45,730 --> 00:08:51,960 find that no Edward is coming, no error message is coming because the discard will handle that error 145 00:08:52,160 --> 00:08:53,260 at any institution. 146 00:08:53,620 --> 00:08:55,510 So my let's set one. 147 00:08:55,780 --> 00:08:59,650 If we go for my set one printing then I'm getting the same set of items. 148 00:08:59,920 --> 00:09:03,100 But if you use the instead of using the method discard. 149 00:09:03,100 --> 00:09:04,630 If you use the method remove. 150 00:09:05,050 --> 00:09:11,080 And if you pass of an element which is not there in the set, you'll be getting one error. 151 00:09:11,170 --> 00:09:12,940 So I'm just going to show you that one. 152 00:09:15,160 --> 00:09:17,260 So this is known as the name of it. 153 00:09:17,530 --> 00:09:20,620 So that is a name my set is not defined here. 154 00:09:20,650 --> 00:09:21,950 So let me go for this myself. 155 00:09:22,060 --> 00:09:22,690 One, I think. 156 00:09:23,760 --> 00:09:26,730 OK, so now if I go for this, I can find this one. 157 00:09:26,760 --> 00:09:27,730 That is a key here. 158 00:09:28,050 --> 00:09:31,180 So that B6 is not present in that respect. 159 00:09:31,180 --> 00:09:36,330 Dipset because you can find that six is not a prison yet, but 66 is present. 160 00:09:36,330 --> 00:09:38,730 So citizens can be deleted, can be removed. 161 00:09:39,060 --> 00:09:40,510 So it gets off in goes up. 162 00:09:40,520 --> 00:09:47,040 So one very big difference between this discard and this remove is that in case of discard if the element. 163 00:09:47,130 --> 00:09:50,220 What about we are passing as input argument is not present. 164 00:09:50,280 --> 00:09:51,770 It is not producing any error. 165 00:09:52,140 --> 00:09:54,540 But in case somebody move, it is producing a error. 166 00:09:54,750 --> 00:09:56,460 And the name of the ADA is skier. 167 00:10:00,810 --> 00:10:06,510 Now, if you go for that discord 44, if I want to bring this mindset one, in that case, I can find 168 00:10:06,510 --> 00:10:08,520 that this 44 has been deleted. 169 00:10:08,580 --> 00:10:15,900 If you go for this remove 55 and 55 is existing, the respective 55 will get deleted from the set. 170 00:10:18,680 --> 00:10:21,530 So now here we're going for the method that is the pop. 171 00:10:21,920 --> 00:10:24,100 And here we're having one set defined. 172 00:10:25,240 --> 00:10:31,000 And now we're going for this mind set, one dark pop method, and then we can find that category has 173 00:10:31,000 --> 00:10:33,670 been pop popped out, has been deleted. 174 00:10:33,820 --> 00:10:38,620 If you go for another time, pop metal, that 66 has been deleted here, this particular values can 175 00:10:38,620 --> 00:10:40,000 be selected randomly. 176 00:10:40,660 --> 00:10:41,830 So clear my set. 177 00:10:41,890 --> 00:10:43,690 In that case, the set will be existing. 178 00:10:43,740 --> 00:10:45,160 My set one will be existing. 179 00:10:45,190 --> 00:10:47,770 But it's all its elements will get cleared. 180 00:10:48,190 --> 00:10:50,770 So anybody I'm going to print my set one. 181 00:10:50,860 --> 00:10:55,180 After issuing this clear method, we can find that at the city's existing. 182 00:10:55,420 --> 00:10:56,970 But no elements out there. 183 00:11:01,040 --> 00:11:03,090 Let us go for different set operations. 184 00:11:03,310 --> 00:11:05,050 Sackfuls, we're going for this union. 185 00:11:05,560 --> 00:11:07,030 So we're having my set one. 186 00:11:07,030 --> 00:11:07,910 We're having mindset. 187 00:11:08,020 --> 00:11:09,910 We have printed those two sets. 188 00:11:10,180 --> 00:11:16,900 Now, this union can be done using the idea, using the operator filter or using this method DOT union. 189 00:11:17,440 --> 00:11:20,140 So my set one dark union mindset, too. 190 00:11:20,590 --> 00:11:26,080 So I have shown that in whatever the way in which we're doing that union, ultimately we're lending 191 00:11:26,080 --> 00:11:27,280 to the same result. 192 00:11:27,290 --> 00:11:32,020 That means union is taking place in gives our union the duplicate values, will be offering ones. 193 00:11:32,320 --> 00:11:35,530 So four and five, the other duplicate values between these two sets. 194 00:11:35,530 --> 00:11:36,950 My set one mindset too. 195 00:11:37,360 --> 00:11:43,300 But they will be all once because set will all is a coalition of unordered, distinct elements. 196 00:11:43,510 --> 00:11:47,250 So they'll be auctioning once, ultimately in the union after union. 197 00:11:47,860 --> 00:11:49,180 We're having this intersection. 198 00:11:50,200 --> 00:11:51,500 Next one is our intersection. 199 00:11:51,520 --> 00:11:56,080 You can find that mindset one and Mindset two at having the set of values it. 200 00:11:56,380 --> 00:12:01,900 And if you go for the intersection, then we are learning with this four and five only intersection 201 00:12:01,900 --> 00:12:08,470 can be done using the operator ampersand, all using my set one dot intersection mindset to. 202 00:12:09,820 --> 00:12:11,680 Next one, you are going for the set difference. 203 00:12:11,890 --> 00:12:14,650 So it gets upset difference that you can use the operator. 204 00:12:14,680 --> 00:12:15,670 That is a minus. 205 00:12:16,000 --> 00:12:21,610 Are you going to use the method that is in dissection so you can see that only the common elements will 206 00:12:21,610 --> 00:12:23,680 be coming out from the intersection? 207 00:12:23,890 --> 00:12:26,260 So this is another very important operations on set. 208 00:12:26,650 --> 00:12:31,740 So we are finding that four and five are the common elements in between the set mindset one and Mindset 209 00:12:31,750 --> 00:12:32,010 two. 210 00:12:32,230 --> 00:12:33,200 So they are coming out. 211 00:12:33,670 --> 00:12:35,200 We are going for the set difference. 212 00:12:35,500 --> 00:12:38,760 So here we are having this what this mindset one on my set, too. 213 00:12:39,220 --> 00:12:41,090 So the respective values are there. 214 00:12:41,380 --> 00:12:48,100 So now when you were going for this asset difference, then mindset one minus mindset to you will be 215 00:12:48,100 --> 00:12:54,130 landing with this one due to one, two, three, four and five will be will be discarded because four 216 00:12:54,130 --> 00:12:57,470 and five, the other common in my set one and mindset two. 217 00:12:57,880 --> 00:13:03,280 But if you go for my set to minus my set, one will be getting this one, that is the eight, nine, 218 00:13:03,280 --> 00:13:05,770 six, seven and four and five will not be there. 219 00:13:06,560 --> 00:13:11,620 Next will we can do the same, either using operator minus or using the method difference. 220 00:13:11,680 --> 00:13:14,080 So we'll be getting the results accordingly. 221 00:13:16,790 --> 00:13:21,170 Now we are going for the Semitic difference in terms of semantic difference, the common element in 222 00:13:21,170 --> 00:13:24,260 case of Semitic difference, that common elements will not be coming. 223 00:13:24,590 --> 00:13:26,870 So now how can we do for the Semitic difference? 224 00:13:26,870 --> 00:13:29,210 It'll be going for this upper carrot. 225 00:13:29,480 --> 00:13:31,160 So this is a symbol upper get it. 226 00:13:31,670 --> 00:13:32,940 So also known as hack. 227 00:13:33,380 --> 00:13:33,950 So I did. 228 00:13:33,960 --> 00:13:35,620 You can go for this operator. 229 00:13:35,650 --> 00:13:38,890 AIPA carrot are symmetric, underscore defiance. 230 00:13:38,960 --> 00:13:39,980 So that is another method. 231 00:13:40,520 --> 00:13:43,910 So here you can see that all the elements are there, are there. 232 00:13:44,120 --> 00:13:46,100 But only the common elements which are common. 233 00:13:46,130 --> 00:13:49,070 That is a four and five between mindset one and mindset two. 234 00:13:49,340 --> 00:13:55,280 They are not coming after doing the symmetric difference between my set one and my set two. 235 00:13:56,860 --> 00:13:58,800 Now we are going for this membership check. 236 00:13:59,260 --> 00:14:02,230 So now here we are having one assembly set is defined. 237 00:14:02,240 --> 00:14:06,270 That is the mindset one, two in my set, one that is quite obvious. 238 00:14:06,280 --> 00:14:08,530 True, because two is one of the elements. 239 00:14:08,530 --> 00:14:08,760 One. 240 00:14:08,890 --> 00:14:10,420 One of the members of this mindset. 241 00:14:10,420 --> 00:14:12,610 One outcome is to a true here. 242 00:14:12,910 --> 00:14:15,290 So six in my set, one six is not there. 243 00:14:15,310 --> 00:14:16,450 Outcome is false. 244 00:14:16,900 --> 00:14:18,780 Do not in mindset one. 245 00:14:18,850 --> 00:14:21,030 So that is produce and outcome false. 246 00:14:21,070 --> 00:14:21,930 Because two is that. 247 00:14:22,330 --> 00:14:22,900 And six. 248 00:14:22,930 --> 00:14:24,040 Not in my set. 249 00:14:24,040 --> 00:14:24,240 One. 250 00:14:24,340 --> 00:14:25,660 Its outcome is true here. 251 00:14:26,500 --> 00:14:29,580 Now we are going for this itr iterating through a set. 252 00:14:30,130 --> 00:14:33,580 So for later in set will come Brint later. 253 00:14:33,730 --> 00:14:36,250 So in this way you can find that for each any retaliation. 254 00:14:36,280 --> 00:14:38,830 We are picking up one of the characters from the string. 255 00:14:38,890 --> 00:14:39,310 Welcome. 256 00:14:39,580 --> 00:14:40,900 And that is getting printed. 257 00:14:42,800 --> 00:14:49,640 Now we are having some inbuilt functions with the set, so they are nothing but Len Max main shotted 258 00:14:50,190 --> 00:14:52,380 so lint will denote the number of elements. 259 00:14:52,440 --> 00:14:54,330 We can have six elements in mind set one. 260 00:14:55,080 --> 00:14:59,640 So lengthiest printing Len is printing six eight is bending the maximum element. 261 00:14:59,910 --> 00:15:03,840 Here it is, five minutes bending the minimum element of the set members. 262 00:15:04,170 --> 00:15:11,130 It is printing zero are the shortened my set one will print does set in the shortened form and outcome 263 00:15:11,130 --> 00:15:12,540 is of the type of list. 264 00:15:13,450 --> 00:15:20,100 But having this Flooz inset so python froze insect frozen set is a new class that has the characteristic 265 00:15:20,190 --> 00:15:24,000 of a set, but its elements cannot be changed once assigned. 266 00:15:24,420 --> 00:15:29,720 So while doubles are immutable, lists and frozen safes are imitable sets here. 267 00:15:29,970 --> 00:15:33,390 So we cannot do any kind of update and change on this for the insect. 268 00:15:33,840 --> 00:15:39,180 So we know that doubles are the imitable lists and fruit inserts are imitable sets here. 269 00:15:39,660 --> 00:15:42,150 So here you have defined two for the insect. 270 00:15:42,180 --> 00:15:48,470 That is the mindset one and my set to define them and then we are going to print them so the values 271 00:15:48,470 --> 00:15:49,150 up got printed. 272 00:15:49,260 --> 00:15:53,070 You can find that when I'm printing this mindset, when it is getting printed. 273 00:15:53,100 --> 00:15:56,390 As for the inset and here we are having the first brocades. 274 00:15:56,430 --> 00:15:59,820 Then within that we're having this Garley Bliss's, that is the settings there. 275 00:16:00,660 --> 00:16:03,570 And then we're going for this difference or dot difference. 276 00:16:03,600 --> 00:16:05,540 My set one dark difference mindset. 277 00:16:06,330 --> 00:16:11,480 We can get this one and two because one and two will be the elements which will be all joujou. 278 00:16:11,490 --> 00:16:16,380 Be there as outcome three unfold will be deleted because three and four are the common elements between 279 00:16:16,380 --> 00:16:18,120 this Mindset one and mindset two. 280 00:16:18,500 --> 00:16:19,710 We're gonna go for that union. 281 00:16:19,770 --> 00:16:21,300 We're getting this outcome like this. 282 00:16:21,540 --> 00:16:23,040 We're going for the intersection. 283 00:16:23,190 --> 00:16:25,500 Only the common elements are coming also to unfold. 284 00:16:25,800 --> 00:16:27,480 We can go for the Semitic difference. 285 00:16:27,480 --> 00:16:31,990 Only three and four will get discarded and risk elements will be there in the present set. 286 00:16:32,640 --> 00:16:36,240 But if I want to do some addition, if I do addition of a new element. 287 00:16:36,480 --> 00:16:41,760 So in that case, it case a frozen said it will produce either at this age that is known as the attribute 288 00:16:41,810 --> 00:16:42,070 error. 289 00:16:42,350 --> 00:16:45,070 Pruzan set object has no attribute add. 290 00:16:45,510 --> 00:16:49,940 So that's why this is the illustrative error we are facing because of rodent's. 291 00:16:49,950 --> 00:16:53,720 It is nothing but a musical version of a set here. 292 00:16:54,150 --> 00:16:59,580 So in this, our discussion, in our discussion, we have gone through different operations on sets. 293 00:16:59,670 --> 00:17:04,380 We have shown what are the different and it will the functions, how to define instead what can be done, 294 00:17:04,440 --> 00:17:05,370 what cannot be done. 295 00:17:05,700 --> 00:17:08,760 And we have discussed everything with some examples here. 296 00:17:09,270 --> 00:17:10,440 Thanks for watching this video.