Algorithms

Covering the essential concepts of the computer science area of algorithms, this 6-page guide is part 1 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 2 guide for a highly valuable and complete reference at an amazing price.
6 page guide includes:

• Defining Computer Algorithms
  • Formalization
• Programming Types
  • Algorithm Fundamentals
  • Algorithm Representation
  • Algorithm Language & Syntax
  • Process State
  • Logical State
  • Process Communication
• Algorithm Classification
  • Design Paradigms
  • Process Type
• Design Paradigms 
  • Brute Force
  • Iterative
  • Recursive/Recursion Types
  • Divide & Conquer
  • Enumeration, Search & Sort
  • Backtracking
  • Graph
  • Branch & Bound
  • Greedy Method
  • Heuristic Methods
  • Randomized
  • Genetic (Evolutionary Computation)
  • Geometric