Adobe PDF (3.69 MB)
HTML έκδοσηZIP (74.19 MB)
Download
Table of Contents - Adobe PDF (84.62 kB)
Brochure
Download
User comments
Title Details:
Design and Analysis of Algorithms
Authors: Tsichlas, Konstantinos
Gounaris, Anastasios
Manolopoulos, Ioannis
Reviewer: Sioutas, Spyridon
Subject: MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY
MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY > FUNDAMENTAL DATA STRUCTURES AND ALGORITHMS
Keywords:
Asymptotic Notation
Recursions
Generating Functions
Greedy Algorithms
Dynamic Programming
Backtracking
Branch and bound
Searching Algorithms
Sorting Algorithms
Amortized Analysis
Competitive Analysis
Approximation Algorithms
Randomized Algorithms
Graph Algorithms
String Algorithms
Description:
Abstract:
The subject of Algorithms and Data Structures is extremely rich, and many relevant and extremely valuable books have been written in both International and Greek literature. This book is an attempt to collectively capture the material and an experience gathered after many years of research and teaching subjects related to Algorithms and Data Structures, and Graph Theory. The purpose of this synthetic effort is the homogenized recording of a didactic approach that wants to focus particularly on the part of Algorithm Analysis, as it is presented in the corresponding classic books and articles, but also in combination with the analysis of classic Data Structures. The common denominator of the examined objects is an ultimately mechanistic methodology with the aim of solving each specific problem through as many alternative techniques as possible, which are compared and evaluated. This book will be a valuable help for the student trying to understand the concept of Algorithms since it will give a different look at these topics. The book provides a comprehensive exploration of algorithms, beginning with an introduction that sets the stage for understanding their importance in computing. The background section delves into mathematical foundations essential for algorithm analysis. Fundamental algorithms cover basic concepts and classic problems while algorithmic techniques, such as divide-and-conquer and dynamic programming, are discussed in detail. The book then explores search algorithms and sorting algorithms, offering efficient methods for data organization and retrieval. Amortized and competitive analysis are introduced as different modes of evaluating algorithm performance. Complexity theory is explained to categorize problems based on their computational difficulty. Basic graph algorithms provide solutions for network-related problems, while string algorithms address text processing. The book concludes with a look at randomized algorithms, highlighting probabilistic approaches to problem-solving.
Technical Editors: Karydis, Ioannis
Type: Undergraduate textbook
Creation Date: 2015
Item Details:
ISBN 978-960-603-465-7
License: http://creativecommons.org/licenses/by-nc-nd/3.0/gr
DOI http://dx.doi.org/10.57713/kallipos-613
Handle http://hdl.handle.net/11419/4005
Bibliographic Reference: Tsichlas, K., Gounaris, A., & Manolopoulos, I. (2015). Design and Analysis of Algorithms [Undergraduate textbook]. Kallipos, Open Academic Editions. https://dx.doi.org/10.57713/kallipos-613
Language: Greek
Consists of:
1. Introduction
2. Theoretical Background
3. Generating Functions
4. Fundamental Algorithms
5. Low-Level Algorithms
6. Algorithmic Techniques
7. Search Algorithms
8. Sorting Algorithms
9. Amortized and Competitive Analysis
10. Elements of Complexity Theory
11. Graph Algorithms
12. String Algorithms
13. Randomized Algorithms
Number of pages 434
Publication Origin: Kallipos, Open Academic Editions
User comments
There are no published comments available!