Book – Computer Science Distilled, Learn the Art of Solving Computational Problems

  1. Objectives:
    1. Stimulate interest in CS
  2. Contents
    1. Basics
      1. Ideas
      2. Logic
        1. Logic gates -> transistors -> CPUs
      3. Counting
        1. Multiplying
        2. Permutations (factorial)
        3. Combination
        4. Sums
      4. Probability
        1. Counting outcomes
        2. Independent events
        3. Mutually Exclusive Events
        4. Complementary Events – cover all possible events – 100%
          1. Advanced probabilities – look for more tools (eg. Googling) when tackling complex problems
    2. Complexity
      1. Method – a list of unambiguous instructions to achieive goal;
      2. Algorithmsa finite series of operations contained in method;
      3. Time complexity T(n) – or running cost
        1. to analyze when designing a system that handle very large inputs;
      4. Counting Time
        1. Understanding growth – dominant term;
        2. Big notation; aviod exponential and factorial time algorithms unless NP-complete problem;
      5. Space Complexity – calculate working space needed;
    3. Strategy
    4. Data
    5. Algorithms
    6. Databases
    7. Computers
    8. Programming
  3. References:
    1. Zebra Puzzles: https://code.energy/solving-zebra-puzzle/
      1. rules / clues to boolean statements
      2. logic (esp XOR operator)
      3. Truth table
      4. assumption and examine
    2. http://bigocheatsheet.com/
Advertisements
Book – Computer Science Distilled, Learn the Art of Solving Computational Problems

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s