Return to previous page

Algorithms are known as the key building blocks of computer programs. Algorithms give us the most ideal preference for finishing a task. One of the most important aspects of an algorithm is how fast it is. Meanwhile, the exact speed of an algorithm relies on where the algorithm is run, and the exact details of its implementation, computer scientists normally disuse about the runtime relative to the size of the input. Data structures and algorithms are patterns for solving problems. All computers depend on basic data structures and algorithms, therefore understanding them better makes you understand the computer better.

This book provides a comprehensive introduction to the nitty-gritty of this interdisciplinary research area, highlighting its solicitations in computer-aided circuit design. The differential evolution (DE) algorithm is a popular and efficient evolutionary algorithm that can be used for single objective real-parameter optimization. Its performance is greatly affected by its parameters. Generally, parameter control strategies involve determining the most suitable value for the current state; there is only a little research on parameter combination and parameter distribution which is also useful for improving algorithm performance. It is therefore important to study parameter control strategies for DE algorithms. The first chapter of this book proposes an idea to use parameter region division and parameter strategy combination to flexibly adjust the parameter distribution. Next, the book explores maximum as well as optimal matchings with a strong focus on algorithmic approaches to determining these matchings. The use of mobile knowledge services as a method of communication came into existence through the introduction of third-generation (3G) Technology, it’s expected that this technology can still increase opportunities for improved revenues and modify new services & tariff generation. This book thus postulates an innovative way of abating this activity which has led to a huge loss of revenue in the sector. The approach is a theoretical method in solving the industry-related problem. It narrowed down the problem of the current algorithm to improper algorithm order and thereby proposing an appropriate model to reducing the menace.

Further, this book proposes comprehensive treatment on – task assignment of the improved contract net protocol under a multi-agent system; an improved genetic algorithm for emergency decision making under resource constraints based on prospect theory; high-precision combined tidal forecasting model computation of compact distributions of discrete elements; solving multi-criteria decision aiding problems using spreadsheets; heterogeneous distributed big data clustering on sparse grids. It is a very popular issue regarding the minimum cost spanning tree which is of great practical and economical significance to solve it in a concise and accelerated way. In this book, the basic ideas of the Kruskal algorithm were discussed and then presented a new improved algorithm―two branch Kruskal algorithm, which is improved to choose a middle value.

The book closes with a study on linking and cutting spanning trees that consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. This practical book will help you understand and review some of the most important concepts and interpretations of data structures and algorithms.


There are no reviews yet.

Be the first to review “Algorithms And Data Structures”

Your email address will not be published. Required fields are marked