Normal view MARC view ISBD view

Fundamentals of algorithmics

By: Brassard, GillesContributor(s): Bratley, PaulMaterial type: Text

TextPublication details: New Delhi: Prentice-Hall, 1999Description: xix, 524 pages : illustrationsISBN: 9788120311312 ; 8120311310 Subject(s): AlgorithmsDDC classification: 511.8

Contents:

Preliminaries -- Elementary algorthmics -- Asymptotic notation -- Analysis of algorthms -- Some data structures -- Greedy algorithms -- Divide-and-conquer -- Dynamic programming -- Exploring graphs -- Probabilistic algorithms -- Parallel algorithms -- Computational complexity -- Heuristic and approximate algorithms.

Summary: This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )
Comments ( 0 )
Images

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
Reference Books	Main Library Reference	Reference	511.8 BRA (Browse shelf(Opens below))	Available		005506

Total holds: 0

Browsing Main Library shelves, Shelving location: Reference, Collection: Reference Close shelf browser (Hides shelf browser)

Previous			No cover image available					Next
Previous	511.64 HAR Combinatorics and graph theory	511.64 KRI Combinatorics: Theory and Applications	511.8 ALG Algorithms in Bioinformatics	511.8 BRA Fundamentals of algorithmics	511.8 KAP Mathematical Modelling	511.8 KAP Mathematical Modelling	511.8 KRI Numerical Algorithms: Computations in Science and Engineering	Next

Preliminaries --
Elementary algorthmics --
Asymptotic notation --
Analysis of algorthms --
Some data structures --
Greedy algorithms --
Divide-and-conquer --
Dynamic programming --
Exploring graphs --
Probabilistic algorithms --
Parallel algorithms --
Computational complexity --
Heuristic and approximate algorithms.

This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer