RU CS 208 - Supplemental Course Materials

Unformatted text preview:

1 School for Professional Studies Undergraduate Program CS208 COMPUTER SCIENCE FUNDAMENTALS Supplemental Course Materials2 Table of Contents Suggested 8-week Schedule ............................................3 Chapter 1: NUMBERING SYSTEMS AND DATA REPRESENTATION Section I: Binary Numbers and Codes.......................................................................................... 5 Section II: Binary Operations..................................................................................................... 13 Section III: Octal Notation ......................................................................................................... 19 Section IV: Hexadecimal Notation ............................................................................................. 26 Section V: Signed Numbers........................................................................................................ 34 Section VI: Floating-Point Numbers........................................................................................... 41 Chapter 2: BASIC COMPUTER ARCHITECTURE AND SOFTWARE Section I: A Simple Computer Model......................................................................................... 49 Section II: A Model Assembly Language Instruction Set .......................................................... 52 Chapter 3: THE SYSTEM DEVELOPMENT LIFE CYCLE (SDLC)................................. 63 Chapter 4: PROGRAM DEVELOPMENT Section I: Program Design Tools................................................................................................ 72 Section II: Software Overview ................................................................................................... 79 Section III: Introduction to the C++ Language .......................................................................... 81 Section IV: C++ Decisions ......................................................................................................... 89 Chapter 5: AN INTRODUCTION TO UNIX Section I: A Brief History of UNIX............................................................................................ 96 Section II: UNIX Basics ............................................................................................................. 97 Section III: Creating UNIX Subdirectories............................................................................... 100 Section IV: Selected UNIX Commands..................................................................................... 102 Chapter 6: COMPUTER ETHICS Section I: Computer Abuse and Computer Crime.................................................................... 106 Section II: Privacy Issues.......................................................................................................... 112 Section III: Computers in Society ............................................................................................. 115 Section IV: Codes of Conduct ................................................................................................... 1173 Suggested 8-week Schedule Week Student Module Learning Topics (LT) Reading Assignments ICS = Invitation to Computer Science SCM = Supplemental Course Materials Graded assignments/ Test Schedule 1 LT 1: Course Introduction LT 2: Processing Hardware LT 3: Number Systems LT 4: Codes for Data Representation (ASCII and Binary, Octal, & Hex Numbers) LT 5: Operations on Binary Numbers ICS: Ch 1 (all), Ch 4 (Sec 4.1 – 4.4.2, 4.3.1), and Ch 5 (all) SCM: Ch 1, Sec I-IV First Night Assignment (Problem Solving Essay) due 2 LT 6: Signed Numbers LT 7: Floating Point Numbers LT 9: Programming (Problem Solving & Program Design) SCM: Ch 1, Sec V-VI ICS: Sec 6.1- 6.2.2, Sec 4.4 - 4.5 and Ch 2 (all) Homework #1 3 LT 9: Programming (Languages) LT 10: HLL Introduction (& intro to CS Lab) ICS: Sec 9.1 – 9.3.2 ICS: Sec 8.1 – 8.5.2 SCM: Ch 4, Sec I-III Homework #2 4 LT 10: HLL Introduction (continued) Midterm Exam ICS: Sec 8.5.3 – 8.6.2 SCM: Ch 4, Sec IV Homework #3 Midterm Exam 5 LT 8: System Software LT 11: Assembly Language Concepts ICS: Ch 6 SCM: Chap 2, all Homework #4 6 LT 14: Communication/Networks Including the Internet and the WWW ICS: Ch 7 Homework #5 7 LT 12: IS Analysis and Design LT 13: Files and Databases (&E-Commerce) SCM: Ch 3 ICS: Sec 8.10 – 8.10.3 ICS: Sec 13.1 – 13.3.3 Homework #6 8 LT 15: Ethics, Privacy, and Security Final Exam ICS: Sec 13.4 – 13.5 ICS: Ch 15 SCM: Ch 6 Final Exam4 CHAPTER ONE NUMBERING SYSTEMS AND DATA REPRESENTATION5 Section I: Binary Numbers and Codes Computer languages allow the programmer to write programs to be carried out by the computer. Machine language is the most fundamental of the languages. A sample set of machine language instructions may look like this: 1010111010110111 1110001110100011 0001010100111010 0111000101101110 0101010101110001 Programs are stored in the computer's memory as small electric charges. You can think of each storage location as having a charge (on) or not having a charge (off) just as a light switch turns a light bulb on or off. These on and off states are frequently written as 1 or 0. Since there are only two possible values for each location, each 1 and 0 is known as a binary digit or bit. For convenience and speed, the computer's central processing unit (CPU) processes bits in groups; many computers use groups of 8 bits although 16 and 32 bit groups are not uncommon. Each 8-bit group is known as a byte. Since machine language is the language of the computer, some knowledge of the binary numbering system and the use of binary codes for data representation is essential for an understanding of how the computer stores data and processes programming instructions. As indicated above, each location or circuit can have two states, on or off. These states can be used to represent data as follows: no may be represented by off yes may be represented by on. As the number of circuits is expanded the number of states representing data is also expanded. For example, two circuits provides four states in the following manner: off-off off-on on-off on-on These four states can then be used to represent common items of data such as the four seasons: Winter off-off Summer on-off Spring off-on Fall on-on In terms of storing the data in the computer's memory, two bits could be used as


View Full Document

RU CS 208 - Supplemental Course Materials

Download Supplemental Course Materials
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Supplemental Course Materials and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Supplemental Course Materials 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?