CSCI 170 (GOLDWEBER)
Spring 08: 3/3/08 Study Guide #1 All web pages associated with the course.
All readings distributed in class.

• Definitions (Know them and know why they are important):
  • Abstraction
  • Computer and computing agent
  • Computer Science (Algorithmics)
  • Algorithm
  • Natural language, formal language, pseudocode
  • Preconditions and Postconditions
• Dissecting and Creating Algorithms:
  • Attributes of Algorithms: Correctness, Ease of understanding, Elegance, Efficiency
  • Algorithm Building Blocks: Assignment (and variables), Selection, Iteration, Input/Output, Arithmetic, Relational Expressions (Turing Completeness)
  • Finding flaws in poorly written algorithms.
  • Creating algorithms (for Karel)
• Circuits and Hardware:
  • Positional nuymber systems: e.g. binary
  • Data representations: unsigned integers, sign-magnitude, two's complement, characters, colors, etc.
  • Boolean logic and Truth Tables
  • Bi-stable electrical devices and Transistors
  • Basic gates, circuits, and the Sum of Products circuit construction algorithm.
  • The Von Neumann model of a computer: the basic components (CPU, RAM, Bus, etc.)
  • The fetch-decode-execute cycle
  • Non-volatile storage: disk, CD, etc.
• Karel J. Robot
  • Understand Karel J. Robot's basic operation.
  • Inheritance: creating a new class based on an existing class.
  • "Top-down" program design.

---

File translated from T_EX by T_TH, version 3.74.
On 3 Mar 2008, 22:16.