Estimating wildlife population size is fundamental for wildlife management and conservation.
However, making monitoring of population size less resource demanding while still keeping …

The goal of testing is to gain confidence in a physical computer based system by means of
executing it. More than one third of typical project resources are spent on testing embedded …

Nowadays, the red-black tree is probably the most used balanced data structure. It searches,
inserts and deletes keys in O log (n) time and it is highly recommended for applications with …

When dealing with large amounts of data, various sorting algorithms will be tested and
searched for which algorithm is the most efficient. Many factors determine the level of …

Substring search is a basic operation in all text processing applications. Among many
algorithms for this purpose, there are three that are very common, namely Knuth-Morris …

Addition is an essential operation in all cryptographic algorithms. Higher levels of security
require larger key sizes and this becomes a limiting factor in GF (p) using large integers …

Tree data structure works great in representing computations unambiguously. In this study,
the researchers enhanced the existing insert algorithm in B* Tree by introducing an …

The optimisation of data structures and algorithms regarding their time and space
requirements has always been a crucial part in the work of a computer scientist. In 1974 …

ВИПУСКНА РОБОТА Page 1 МІНІСТЕРСТВО ОСВІТИ І НАУКИ УКРАЇНИ СУМСЬКИЙ
ДЕРЖАВНИЙ УНІВЕРСИТЕТ ЦЕНТР ЗАОЧНОЇ, ДИСТАНЦІЙНОЇ ТА ВЕЧІРНЬОЇ ФОРМ …