CSC103 Schedule 2011

--D. Thiebaut 08:44, 7 January 2011 (EST)

---

Back to Main Page for CSC103

Prof

Dominique Thiébaut email Dept. Computer Science Ford Hall, 356. Telephone: 3854 Office Hours: M:4-5, T3-4, W3-4, and my appointment

Weekly Schedule

Week	Topics	Reading
Week 1 1/24	Monday: Introduction to the semester Overview Binary System The Transistor Wednesday Quick review George Boole (1779-1848) Logic, logic expression = boolean expression Any complicated logic expression can be expressed with only 3 operators: AND, OR, and NOT Shannon (1916-2001), in 1948 writes a Master's thesis at MIT: Any binary numerical computation can be performed using logic expressions, and logic operators Verify that we can add in binary. Therefore we should be able to add using AND, OR, and NOT. This creates a need for electrical circuits that implement the 3 boolean operators Logic Gates: NOT, AND, OR Truth tables and verification of rules of addition Homework #1	Read Chapter 1 of the textbook. Skip Section 1.3 and up.
Week 2 1/31	Monday Two-bit adder (verify the equations with this exercise Logic Gates Data sheet for the AND gate. Logic Design Simulator Lab #1 Part 1 only, (and a copy of the simulator courtesy of Debbie S. and her lab partner) Wednesday Snow Day! Lab #1	Read Chapters 2 and 3
Week 3 2/7	Monday PC Lab: "Take apart a PC" Photos of the event on Facebook Wednesday Review of WikiMedia editing Review of demolition lab What did we learn? Wiki report of the lab A game of numbers WolframAlpha: How long is 3,000,000,000 seconds? Homework #2 Lab #2	Please watch the following videos before the lab on 2/7! Video on PC Video on Hard Drive Video on CDRom Animation on CDRom Concentrate on Sections 3.2 and 3.4 in the book.
Week 4 2/14	Monday assembly language Computer Simulator A good introduction to the xComputer Applet. Basic processor instructions A first program A second program Wednesday Execution of an instruction (pdf) LOD-C 1 Exercise 1: initialize the contents of several variables to 0 LOD 10 Exercise 2: increment a counter Exercise 3: compute sum of 3 variables LOD-I 10 Exercise 4: create an index and use it to sum up the same 3 variables Loops (infinite loop) JMP instruction and labels Exercise 5: create an infinite loop (incrementing a variable, for example) Exercise 6: create an infinite loop that clears the memory starting at 10 Exercise 7: why does the program of Exercise 6 stop? Controlled Loops JMP-Z Exercise 8: write a loop that loops 10 times (use a counter) Exercise 9: write a loop that stores 55 in the memory locations between 15 and 30 Example of a real assembly language program ASCII Table: even characters are stored in computers as numbers! Lab #3 Homework #3	Concentrate on Sections 3.2 and 3.4 in the textbook. Read the introduction to the xComputer Applet. Start reading the papers on the Singularity which we will discuss the last day of class: Signs of the Singularity by Vernor Vinge. Can Machine Be Conscious?, Christof Koch and Giulio Tononi.
Week 5 2/21	Monday javascript Wednesday: Rally Day	Read Chapters 6 and 7
Week 6 2/28	Monday/Wednesday	Take-Home Final Exam
Week 7 3/7	Monday/Wednesday The singularity Moore's Law
Week 8 3/14

Wiki pages

Click here to access the class Wiki pages.

Additional Resources

• IEEE Special Issue on Singularity
• Stock pictures
• Javascript Resources
  • Tutorials and examples of Javascript code. Type in the code and see its effect directly on the same page.