- We will send in 10–14 business days.
/images/books/13602783/9789352301331.jpg)
- Author: Venugopal Temberveni
- Publisher: BS Publications
- ISBN-10: 9352301331
- ISBN-13: 9789352301331
- Format: 15.6 x 23.4 x 1.8 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
This well-organized and thoroughly revised text independent of programming language provides the design techniques of algorithms in a simple and straightforward manner. It describes the complete design, development and analysis of various algorithms along with their pseudo-codes in order to have an understanding of their applications.
The book begins with a description of the fundamental concepts and basic design techniques of algorithms. Gradually, it introduces more complex and advanced topics such as dynamic programming, backtracking, branch & bound and Non-deterministic algorithms
Salient Features:
- Gives a thorough analysis of the fundamental and advanced concepts of algorithms.
- Provides many solved examples to enhance students ability to grasp the concepts discussed.
- Supplies well-graded exercises to test students understanding of the subject.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 21d.01:45:53
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Venugopal Temberveni
- Publisher: BS Publications
- ISBN-10: 9352301331
- ISBN-13: 9789352301331
- Format: 15.6 x 23.4 x 1.8 cm, hardcover
- Language: English English
This well-organized and thoroughly revised text independent of programming language provides the design techniques of algorithms in a simple and straightforward manner. It describes the complete design, development and analysis of various algorithms along with their pseudo-codes in order to have an understanding of their applications.
The book begins with a description of the fundamental concepts and basic design techniques of algorithms. Gradually, it introduces more complex and advanced topics such as dynamic programming, backtracking, branch & bound and Non-deterministic algorithms
Salient Features:
- Gives a thorough analysis of the fundamental and advanced concepts of algorithms.
- Provides many solved examples to enhance students ability to grasp the concepts discussed.
- Supplies well-graded exercises to test students understanding of the subject.
Reviews