1 / 12

CS1005

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.

rowells
Télécharger la présentation

CS1005

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  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

  3. 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

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

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

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

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

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

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

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

More Related