Library Logo
Bengali Keyboard
Local cover image
Local cover image
Amazon cover image
Image from Amazon.com

Introduction to algorithms / Thomas H. Cormen ... [et al.].

Contributor(s): Material type: TextTextSeries: MIT electrical engineering and computer science seriesPublication details: Cambridge, Mass. New York : MIT Press, c2001.Edition: 2nd edDescription: xxi, 1178 p. illus., charts; 21 cmISBN:
  • 0262032937 (hc. : alk. paper)
Other title:
  • Algorithms
Subject(s): DDC classification:
  • 005.1 22 In889
LOC classification:
  • QA76.6 .I5858 2001
Online resources:
Contents:
This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a "pseudocode" designed to be readable by anyone who has done a little programming. The book contains over 260 figrues illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms. The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals. -- Preface
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Copy number Status Date due Barcode Item holds
Book Book Green University Library General Stacks CSE 005.1 In889 (Browse shelf(Opens below)) 1 Not For Laon 3020019544
Total holds: 0

Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.

Includes bibliographical references (p. [1127]-1130) and index.

This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a "pseudocode" designed to be readable by anyone who has done a little programming. The book contains over 260 figrues illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms. The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals. -- Preface

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image


Last Updated Oct 16, 2019.
Copyright © Green University Library
Green University of Bangladesh
University Home | Library Home

Powered by Koha