 So first thing, let's talk about some most popular academic databases that could be helpful for your research needs and also projects assignments. So these are the some of the top academic databases that I recommend. So the first one is the engineering village. So it's from the Elsevier, which covers the the main areas in the ICT, which is also information, communications and technology, and then the engineering, computer science, the physics and robotics areas. And also, next one is the IEEE Explore. So it stands for the Institute of Electrical and Electronics Engineers Explore Digital Library. So this database mainly covers the areas of electrical engineering and computer science. The third one is the ACM Digital Library. So ACM stands for Association for Computing Machinery. So it's a database mainly about the computer science. And the next one is the Web of Science, Academic Database, which covers the science, social science, arts and humanities subject areas. And the next one is Science Direct, which covers the science, technology and medicine fields. And next one is the Scopus. So it's a major citation abstract databases. And it mainly covers the social sciences, medicine and technology fields. And the final one is called the Procrast. So this database is interdisciplinary, which means that it covers lots of different subject disciplines ranging from the engineering to social sciences. Okay. So next, let's talk about the Boolean Operators. And one of my Boolean Operators are important is this are the how the academic databases function in the back end. So the academic databases use these Boolean Operators to connect the search keywords together in order to make sure the resulting records reflect these keywords based on the Boolean Operators. So this Boolean Operator is called is end. So the end Boolean Operator adds additional search terms to inform the academic database that all search terms exist together in the results. In another word that any additional keywords must also coexist with the existing keywords. The Boolean Operators narrows the search results. So the example here you can see is data and cybersecurity, which means that both data and cybersecurity keywords must appear in the search results. And the next Boolean Operator is OR. The OR Boolean Operator adds additional search keywords to inform the database that any of the search terms can exist in the results. So which means that either or both of the key terms needs to show up in the resulting documents. So the OR keywords or Boolean Operators broadens the search results by adding additional search terms for the example here you can see is machine or human. Which means that either machine or human or both can appear in the resulting documents. So the next one is NOT. So the NOT as the this word indicates that it includes terms from the search. So this is helpful when you don't want certain keywords to appear and then you can just use the NOT operator to exclude that certain keywords from appearing in the search results. It narrows the search results. The example here you can see here is animal NOT cat, which means that the academic database will only search the animal and excluding the cat from the search results. And a final point to note is that the search order here. So the search order here is NOT and then end and finally all, which means that the NOT is always executed first by the academic databases, and then the end and finally all. So that's the search order for this three Boolean operators. So the next slide shows a visual diagram of how these three Boolean operators work. So for example, you can see here the end. You can see the peanut butter and jelly. The only the central the overlapping area is great. So using and this search would only retrieve the results with both peanut butter and jelly, which is the great out areas. So using or you can see all of the areas, including peanut butter and jelly are great. So you can see using or this search would retrieve results with peanut butter with jelly and with both and finally will not. So using not you can see only the peanut butter that doesn't have the overlapping area are great. So using not this search would only retrieve results with peanut butter and exclude those with jelly or peanut butter with jelly. So this visual diagram can give you a more clear sense of how this three Boolean operators work in the academic databases. So next, let's talk about some effective search strategies that you might find helpful for your as you start searching in the academic databases. So the first step is always to start with the research question. A concrete or another, like a very detailed research question. So the example here I give is how could artificial intelligence be used to prevent drug shortages in Africa. So after you have come up with a research question. The next step is to pull out the most important keywords from the research question. So the example here you can see the most important keywords are artificial intelligence drug shortage and Africa. And the next, after you have figured out the most important keywords. You can also find additional narrow keywords and a broader keywords to help with your search. So the narrow keywords are helpful when you're getting too many search results, which means that you might want to like narrow down your search a little bit more. So the example here you can find the artificial intelligence can be narrowed down to the machine learning. And a broader keywords are helpful when you're getting too few search results. In other words, you'll only get a several few keyword a few search results. So that's the time when you might want to expand your searches and a broader keywords can be helpful in this case. So the example here you can see the drug shortage can be broadened to be the healthcare challenges and more broad keywords. And remember that as you are searching through the academic databases. Remember to collect additional terms as you search, because you will encounter some more relevant keywords. So you look through the detailed page of the certain documents that can help for for your future searches.