The Union Institute & University library works like a search engine. When entering a query, one can see several search methods, for example, in a specific database or information from dissertations. There is a search by Google Scholar or magazines and videos. This number of search options is provided to ensure that the searcher finds his treasure among all the information offered by the library. When searching for information, the library relies on the initial request; that is, if one enters “a treasure hunt,” then all the results with the given phrase will come out.
On the articles page, it is possible to sort search results by more specific queries. Sorting by type of work, year of issue, discipline, language, publisher, and other possible clarifications. When entering treasure hunting, the first three articles shown by the library are “Pebble guided optimal treasure hunt in anonymous graphs” (Gorain et al., 2022), “Advice complexity of treasure hunt in geometric terrains” (Pelc & Yadav, 2021), and “Treasure Hunt” (Treasure Hunt, 2021). This summary says that the information in each article is different, the first two articles are mathematical journals with explanations of various terms and theories, and the last book is related to marriage and family life.
It should be emphasized that when receiving results, the search engine returned the results correctly on request, as well as the most up-to-date information of the second decade of the twenty-first century. In general, I can say that the online library of the university works well and stably. The system correctly perceives requests and provides all kinds of tools for filtering the results. Performing this task, I learned to use the information search service, which allowed me to find the necessary answers to educational tasks quickly.
References
Gorain, B., Mondal, K., Nayak, H., & Pandit, S. (2022). Pebble guided optimal treasure hunt in anonymous graphs. Theoretical Computer Science. Web.
Pelc, A., & Yadav, R. N. (2021). Advice complexity of treasure hunt in geometric terrains. Information and Computation, 281. Web.
Treasure Hunt. (2021). Children’s Bookwatch.