Fundamentals of algorithmics

By: Brassard, GillesContributor(s): Bratley, PaulMaterial type: TextTextPublication details: New Jersey : Prentice Hall, ©1996Description: xix, 524 p. : illustrationsISBN: 0133350681 ; 9780133350685 ; 013073487X ; 9780130734877Subject(s): Algorithms | Algorithms -- Problems, exercises, etcDDC 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.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Reference Books Reference Books Main Library
Reference 		Reference 005.1 BRA (Browse shelf(Opens below)) Available 003675
Total holds: 0

Included Index.

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

© University of Vavuniya

---