Difference between revisions of "CSC103 Schedule 2011"

From dftwiki3
Jump to: navigation, search
(→‎Weekly Schedule)
(→‎Weekly Schedule)
Line 121: Line 121:
 
| Week 4 <br /> 2/14
 
| Week 4 <br /> 2/14
 
||  
 
||  
−
* '''Monday'''/'''Wednesday'''
+
* '''Monday'''
−
<font color="lightgray">
+
** assembly language
−
* [http://www.pcguide.com/res/tablesASCII-c.html ASCII Table]: even characters are stored in computers as numbers!
+
*** Computer  [http://maven.smith.edu/~thiebaut/classes/103/applets.htm Simulator]
−
* assembly language
+
***[http://math.hws.edu/TMCM/java/labs/xComputerLab1.html A good introduction] to the xComputer Applet.
−
** Computer  [http://maven.smith.edu/~thiebaut/classes/103/applets.htm Simulator]
+
***[[CSC103_Basic_Instructions | Basic processor instructions]]
−
**[http://math.hws.edu/TMCM/java/labs/xComputerLab1.html A good introduction] to the xComputer Applet.
+
***[[CSC103_Assembly_Program_1 | A first program]]
−
**[[CSC103_Basic_Instructions | Basic processor instructions]]
+
***[[CSC103_Assembly_Program_2 | A second program]]
−
**[[CSC103_Assembly_Program_1 | A first program]]
+
* '''Wednesday'''
−
**[[CSC103_Assembly_Program_2 | A second program]]
+
** Exercises
−
</font>
+
** [http://www.pcguide.com/res/tablesASCII-c.html ASCII Table]: even characters are stored in computers as numbers!
 +
 
 
----
 
----
 
* <font color="lightgray>[[CSC103 2011 Lab 3| Lab #3]]</font>
 
* <font color="lightgray>[[CSC103 2011 Lab 3| Lab #3]]</font>

Revision as of 10:59, 15 February 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
  • 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
Calvin snow.jpg
    • Snow Day!
  • Read Chapters 2 and 3
Week 3
2/7
Monday
CSC103PcDemolitionLab.jpg
Processor die.jpg
CSC103 Conversation.jpg
Wednesday
  • Review of WikiMedia editing
  • Review of demolition lab












Please watch the following videos before the lab on 2/7!

Week 4
2/14
Week 5
2/21
  • Monday

  • javascript

  • Wednesday: Rally Day
  • Read Chapters 6 and 7
Week 6
2/28
  • Monday/Wednesday
Week 7
3/7
  • Monday/Wednesday

  • The singularity
  • Moore's Law
Week 8
3/14
DancingCalving.gif

 

Wiki pages

Click here to access the class Wiki pages.

Additional Resources







Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC103_Schedule_2011&oldid=10399"