View in EDS PDF Full Text

A Guide to Design and Analysis of Algorithms

Saved in:
Bibliographic Details
Title: A Guide to Design and Analysis of Algorithms
Description: As there can be more than one algorithm for the same problem, designing and analyzing an algorithm becomes important in order to make it as efficient and robust as possible. This book will serve as a guide to design and analysis of computer algorithms. Chapter One provides an overview of different algorithm design techniques and the various applications of such techniques. Chapter Two reviews the divide and conquer strategy and the algorithm types that employ it. Chapter Three explores greedy algorithms and some problems that can be solved with this approach. Chapter Four discusses in depth the dynamic programming approach. Chapter Five provides a solution to the N-Queens problem utilizing a backtracking approach. Chapter Six elucidates the reader to branch and bound techniques and provides three solutions to problems implementing them. Part II of this book begins with Chapter Seven, where two different approaches to the analysis of algorithms are discussed. Chapter Eight reviews randomized algorithms through an empirical lens. Chapter Nine discusses Master Theorem and the many kinds of problems this Theorem can solve. Chapter Ten, the final chapter, provides notes on the empirical complexity analysis of algorithms.
Authors: Soubhik Chakraborty
Resource Type: eBook.
Subjects: Computer algorithms
Categories: COMPUTERS / Computer Science
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 3419736
RelevancyScore: 1110
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1109.74133300781
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$3419736$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$3419736$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Guide to Design and Analysis of Algorithms
– Name: Abstract
  Label: Description
  Group: Ab
  Data: As there can be more than one algorithm for the same problem, designing and analyzing an algorithm becomes important in order to make it as efficient and robust as possible. This book will serve as a guide to design and analysis of computer algorithms. Chapter One provides an overview of different algorithm design techniques and the various applications of such techniques. Chapter Two reviews the divide and conquer strategy and the algorithm types that employ it. Chapter Three explores greedy algorithms and some problems that can be solved with this approach. Chapter Four discusses in depth the dynamic programming approach. Chapter Five provides a solution to the N-Queens problem utilizing a backtracking approach. Chapter Six elucidates the reader to branch and bound techniques and provides three solutions to problems implementing them. Part II of this book begins with Chapter Seven, where two different approaches to the analysis of algorithms are discussed. Chapter Eight reviews randomized algorithms through an empirical lens. Chapter Nine discusses Master Theorem and the many kinds of problems this Theorem can solve. Chapter Ten, the final chapter, provides notes on the empirical complexity analysis of algorithms.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Soubhik+Chakraborty%22">Soubhik Chakraborty</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+algorithms%22">Computer algorithms</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22COMPUTERS+%2F+Computer+Science%22">COMPUTERS / Computer Science</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=3419736
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 005.13
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Computer algorithms
        Type: general
    Titles:
      – TitleFull: A Guide to Design and Analysis of Algorithms
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Soubhik Chakraborty
      – PersonEntity:
          Name:
            NameFull: Soubhik Chakraborty
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2022
            – D: 20
              M: 04
              Type: profile
              Y: 2023
          Identifiers:
            – Type: isbn-print
              Value: 9798886973860
            – Type: isbn-electronic
              Value: 9798886974300
          Titles:
            – TitleFull: A Guide to Design and Analysis of Algorithms
              Type: main
ResultId 1