The Backtracking Method : Examples in Pascal and C++

Tiberiu Socaciu

ISBN 10: 3848441136 / ISBN 13: 9783848441136

Published by LAP Lambert Academic Publishing, 2012

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - One of the best known general techniques for developing of the algorithms is the Backtracking method. It seeks to eliminate the generation of all possibilities in order to get the result. The Backtracking method can be applied to those problems for which the solution can be represented as a vector whose elements take values in some finite sets and who meet certain internal conditions. In the Backtracking method, the vector elements are expressed one at a time, assigning a value to a component will be done only after values have been assigned to all its previous components, and no incompatibilities exist between these values. Classical problems solved by this method are: queens problem, Cartesian product generation, the generation of combinations, the 0-1 knapsack problem. The book is structured into 7 chapters and provides the solutions to a number of 19 classical problems by using versions of the backtracking algorithm. Most of the paragraphs are followed by a section with solved exercises and problems.

Seller Inventory # 9783848441136

Bibliographic Details

• Title: The Backtracking Method : Examples in Pascal and C++
• Publisher: LAP Lambert Academic Publishing
• Publication Date: 2012
• Language: English
• ISBN 10: 3848441136
• ISBN 13: 9783848441136
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 149H x 11D millimeters 220 millimeters width by 149 millimeters height by 11 millimeters depth
• Weight: 281 grams

About this title

Synopsis

One of the best known general techniques for developing of the algorithms is the Backtracking method. It seeks to eliminate the generation of all possibilities in order to get the result. The Backtracking method can be applied to those problems for which the solution can be represented as a vector whose elements take values in some finite sets and who meet certain internal conditions. In the Backtracking method, the vector elements are expressed one at a time, assigning a value to a component will be done only after values have been assigned to all its previous components, and no incompatibilities exist between these values. Classical problems solved by this method are: queens’ problem, Cartesian product generation, the generation of combinations, the 0-1 knapsack problem. The book is structured into 7 chapters and provides the solutions to a number of 19 classical problems by using versions of the backtracking algorithm. Most of the paragraphs are followed by a section with solved exercises and problems.

About the Author

Dr Socaciu and Dr Iancu are lecturers in computer science. Dr Pătruţ is associate professor in computer science. Their domains of research are procedural programming, data structures, and artificial intelligence. They published several papers and books on programming, algorithms, artificial intelligence, and interactive education.