BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Algorithms 2: A Quickstudy Laminated Reference Guide

Algorithms 2: A Quickstudy Laminated Reference Guide

Algorithms 2: A Quickstudy Laminated Reference Guide
Stock photo: cover may vary

Algorithms 2: A Quickstudy Laminated Reference Guide Paperback - 2020

by Ahmadi, Babak

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$34.74
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

  • Title Algorithms 2: A Quickstudy Laminated Reference Guide
  • Author Ahmadi, Babak
  • Binding Paperback
  • Condition Used - Good
  • Pages 6
  • Volumes 1
  • Language ENG
  • Publisher Quickstudy Reference Guides
  • Publication date 2020-11-01
  • Bookseller's Inventory # 1423245636.G
  • ISBN 9781423245636 / 1423245636
  • Weight 0.35 lbs (0.16 kg)
  • Dimensions 11 x 8.3 x 0.1 in (27.94 x 21.08 x 0.25 cm)
  • Category Computers - Languages / Programming
  • Quantity available 1

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Algorithms 2: A Quickstudy Laminated Reference Guide

From the publisher

Covering the essential concepts of the computer science area of algorithms, this 6 page laminated guide is part 2 of 2 guides that also serves as a reference for designing and analyzing algorithms. Guaranteed to boost grades in required algorithms courses this reference tool can continue to offer support well beyond a course. While all computing requires the use of algorithms, mastery of algorithms can lead to a career in the fastest growing field in computer science with one of the highest paid salaries. Widely published author and instructor Babak Ahmadi has masterfully covered a large amount of information in only 6 pages, streamlined with more facts per page than any publication. To get the full breadth of coverage please also purchase the Algorithms guide for a highly valuable and complete reference at an amazing price.
6 page laminated reference guide includes:
  • Analysis & Optimization
  • Asymptotic Notation (Big-O Notation)
    • Asymptotic Notation Types
  • Complexity Types (AKA Function Orders & Growth Rates)
    • Complexity Classes (P & NP)
  • Lower Bound Theory
    • Cases vs. Bounds
  • Analysis of Loops
  • Recurrences
  • Methods for Solving Recurrences
  • Amortized Analysis
  • Search & Sort
    • Stability
    • Comparison Sorting
    • Non-Comparison Sorting
    • Sort Algorithms
    • Common Search Algorithms
    • String Searching (AKA Pattern Matching)
  • Process/Implementation Types
    • Deterministic vs. Nondeterministic
    • Linear Programming (LP)
    • Dynamic Programming (DP)
tracking-