Introduction to Programming

Computer Science

• algorithms
  • fast vs simple
  • fast vs comprehensive
  • Parameterization
  • Examples: sorting, searching, checkers/chess and RepeatMasker
• abstractions
  "creating the right model for a problem and devising the appropriate mechanizable techniques to solve it." (Aho and Ullman) Examples of models include:
  • formal logic
  • directed graphs
  • trees
  • lists
  • sets
• mathematical foundations
• data structures
  "the programming-language constructs used to represent data models"
• reasoning about correctness
• complexity analysis
• implementation techniques