Elementary Approach To Design And Analysis Of Algorithms, An

Name: Elementary Approach To Design And Analysis Of Algorithms, An
Author: Lekh Rej Vermani

Auteur: Lekh Rej Vermani

Taal: Engels

Afbeeldingen

Artikel vergelijken

Vergelijk met andere artikelen

Bekijk nu

Auteur: Lekh Rej Vermani Shalini Vermani

Engels
Hardcover
9781786346759
13 juni 2019
536 pagina's

Alle productspecificaties

Samenvatting

'The book under review is an interesting elaboration that fills the gaps in libraries for concisely written and student-friendly books about essentials in computer science ... I recommend this book for anyone who would like to study algorithms, learn a lot about computer science or simply would like to deepen their knowledge ... The book is written in very simple English and can be understood even by those with limited knowledge of the English language. It should be emphasized that, despite the fact that the book consists of many examples, mathematical formulas and theorems, it is very hard to find any mistakes, errors or typos.'zbMATHIn computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks.As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing 'output' and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.This book introduces a set of concepts in solving problems computationally such as Growth of Functions; Backtracking; Divide and Conquer; Greedy Algorithms; Dynamic Programming; Elementary Graph Algorithms; Minimal Spanning Tree; Single-Source Shortest Paths; All Pairs Shortest Paths; Flow Networks; Polynomial Multiplication, to ways of solving NP-Complete Problems, supported with comprehensive, and detailed problems and solutions, making it an ideal resource to those studying computer science, computer engineering and information technology.

Productspecificaties

Inhoud

Taal: en
Bindwijze: Hardcover
Oorspronkelijke releasedatum: 13 juni 2019
Aantal pagina's: 536
Illustraties: Nee

Betrokkenen

Hoofdauteur: Lekh Rej Vermani
Tweede Auteur: Shalini Vermani
Hoofduitgeverij: World Scientific Europe Ltd

Overige kenmerken

Extra groot lettertype: Nee
Studieboek: Nee
Verpakking breedte: 152 mm
Verpakking hoogte: 29 mm
Verpakking lengte: 230 mm
Verpakkingsgewicht: 425 g

EAN

EAN: 9781786346759

Je vindt dit artikel in

Categorieën: Computers & Informatica

Databases

Boeken
Taal: Engels
Beschikbaarheid: Leverbaar
Boek, ebook of luisterboek?: Boek
Studieboek of algemeen: Studieboeken

Reviews

Nog geen reviews

Hoe controleren en plaatsen wij reviews? Hoe controleren en plaatsen wij reviews?

Negatief, positief, neutraal: we zetten een review altijd online. We controleren wel eerst of ’ie voldoet aan onze reviewvoorwaarden en niet nep is. We controleren ook of ’ie is geschreven door iemand die het artikel heeft gekocht via bol.com en zetten dit er dan bij. De controles gebeuren automatisch, al kijken er soms mensen mee. Bol.com betaalt niet voor reviews. Als een reviewer door een andere partij is vergoed, staat dit in de review zelf.