1. CS1005 Become familiar with the software life cycle. Be able to design algorithms to solve problems, using the top-down design method. Demonstrate the ability to implement algorithms in C++. Be able to write appropriate program documentation, and to adhere to a documentation standard. Gain experience with Unix

2. Homework Get the textbook Know how to log on/off WPI system Learn how to use an editor Read chapters 0 and 1 Look at website for this course Put all due dates in your planner

4. Main memory Volatile (lost when computer turned off) Limited in size (costly) Provides fast transfer (CPU – memory, memory – CPU) Only data in main memory can be processed by the CPU

5. Secondary memory Data permanent until you change it Unlimited size Portable Slow transfer rate compared to main memory

6. Central Processing Unit Brings info (data and instructions) from secondary memory to main memory Processes (transforms) data Stores results in secondary or main memory

8. Instruction Set Arithmetic operations Comparisons Transfer of control (jumps) Transfer of info from one place to another I/O operations

9. Register R1Register R2 Add the contents of R1 to R2 and Leave the result in R1 Opcode = 10111011 Data = 0001 0010 Each instruction is 2 bytes in length. The first byte is the opcode, the second byte contains data which varies according to the opcode

10. Assembly Language Is different for each type of computer Requires that the programmer think like a computer Is tedious and detailed Very cryptic

11. A = B + C 10110101 01000001 10110110 01000010 10111011 00010010 10111101 01000000 LOAD R1, (B) LOAD R2, (C) ADD R1, R2 STORE (A), R1 A contains 0 B contains 2 C contains 3 0 1 3 2 4 5 6 7 64 65 66 R1 R2 Program Counter (PC) Instruction Register (IR) 00000000 00000010 00000011

12. C++ How To Program H.M Deitel