Fundamentals of Computer Algorithms

Horowitz Ellis

Fundamentals of Computer Algorithms Ellis Horowitz - 2 nd Ed. - Chennai Universities Press 2008 - xx,773p. 23cm

1 INTRODUCTION 2 ELEMENTARY DATA STRUCTURES 3. DIVIDE AND CONQUER 4 THE GREEDY METHOD 5 DYNAMIC PROGRAMMING 6 BASIC TRAVERSAL AND SEARCH TECHNIQUES 7 BACKTRACKING 8 BRANCH AND BOUND 9 ALGEBRAIC PROBLEMS 10 LOWER BOUND THEORY
11 NP-HARD AND NP-COMPLETE PROBLEMS 12 APPROXIMATION ALGORITHMS 13 PRAM ALGORITHMS 14.MESH ALGORITHMS 15.HYPERCUBE ALGORITHMS

This is the of the programming language-independent text that helped establish computer algorithms as a discipline of computer science. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. This book is appropriate as a core text for upper-and graduate-level courses in algorithms.

9788173716126

004.421 / HOR
LIBRARY HOURS
Mon - Sat : 9:00 AM - 5.30 PM
Library will remain closed on public holidays
Contact Us

Librarian
Central Libray
Indian Institute of Information Technology Design and Manufacturing Kurnool
Andhra Pradesh - 518 007

Library Email ID: library@iiitk.ac.in

Copyright @ Central Library | IIITDM Kurnool

Powered by Koha