menu
{ "item_title" : "Algorithms 2", "item_author" : [" Babak Ahmadi "], "item_description" : "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 & OptimizationAsymptotic Notation (Big-O Notation)Asymptotic Notation TypesComplexity Types (AKA Function Orders & Growth Rates)Complexity Classes (P & NP)Lower Bound TheoryCases vs. BoundsAnalysis of LoopsRecurrencesMethods for Solving RecurrencesAmortized AnalysisSearch & SortStabilityComparison SortingNon-Comparison SortingSort AlgorithmsCommon Search AlgorithmsString Searching (AKA Pattern Matching)Process/Implementation TypesDeterministic vs. NondeterministicLinear Programming (LP)Dynamic Programming (DP)", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/1/42/324/563/1423245636_b.jpg", "price_data" : { "retail_price" : "7.95", "online_price" : "7.95", "our_price" : "7.95", "club_price" : "7.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithms 2|Babak Ahmadi

Algorithms 2 : A Quickstudy Laminated Reference Guide

local_shippingShip to Me
On Order. Usually ships in 2-4 weeks
FREE Shipping for Club Members help

Overview

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)

Details

  • ISBN-13: 9781423245636
  • ISBN-10: 1423245636
  • Publisher: Quickstudy Reference Guides
  • Publish Date: November 2020
  • Dimensions: 11 x 8.3 x 0.1 inches
  • Shipping Weight: 0.35 pounds
  • Page Count: 6

Related Categories

You May Also Like...

    1

BAM Customer Reviews