Isbn: 9789352301225 - design and analysis of algorithms, (1 resultados)

Soft cover. Condición: New. 1st Edition. Contents: 1. Introduction. 2. Searching and traversal techniques. 3. Divide and conquer. 4. The greedy method. 5. Dynamic programming. 6. Backtracking. 7. Branch and bound. 8. NP-Hard and NPComplete problems. 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. Chapter wise Review Questions & Object questions are provided. Prepared as per JNTU-R13 Regulation Syllabus.…