Difference between revisions of "CSC103 Weekly Schedule Spring 2012"

From dftwiki3
Jump to: navigation, search
(Weekly Schedule)
(Weekly Schedule)
Line 134: Line 134:
 
** [[CSC103 Assembly Program 1 | A first program]]
 
** [[CSC103 Assembly Program 1 | A first program]]
 
** [[CSC103 Assembly Program 2 | A second program]]
 
** [[CSC103 Assembly Program 2 | A second program]]
** Execution of an instruction ([[Media:ExecutionOfInstruction.pdf|pdf]])
+
** Execution of selected instructions ([[Media:CSC103InstructionsBeforeAfter.pdf|pdf]])
 +
----
 +
* [[CSC103 Homework 3 2012 | Homework #3]]
 +
||
 +
Reading:
 +
* [http://math.hws.edu/TMCM/java/labs/xComputerLab1.html A good description of the Computer simulator]
 +
* You will find Wikipedia's [http://en.wikipedia.org/wiki/Central_processing_unit description of the processor] interesting.  Concentrate mostly on the sections labeled '''Microprocessor''', '''Operation''', and '''Clock Rate'''.
 +
<!-- ================================================================== -->
 +
|- style="background:#eeeeff" valign="top"
 +
| Week 4 <br /> 2/20<br />
 +
||
 +
* '''Monday'''
 +
** Execution of selected instructions ([[Media:CSC103InstructionsBeforeAfter.pdf|pdf]])
 +
** Exercises
 
*** ''LOD-C 1''
 
*** ''LOD-C 1''
 
::::<font color="magenta">Exercise 1:</font> initialize the contents of several variables to 0
 
::::<font color="magenta">Exercise 1:</font> initialize the contents of several variables to 0
Line 154: Line 167:
 
** [[CSC231_Homework_9_Solution_2010| Example]] of a real assembly language program
 
** [[CSC231_Homework_9_Solution_2010| Example]] of a real assembly language program
 
** [http://www.pcguide.com/res/tablesASCII-c.html ASCII Table]: even characters are stored in computers as numbers!
 
** [http://www.pcguide.com/res/tablesASCII-c.html ASCII Table]: even characters are stored in computers as numbers!
** [[CSC231 Homework 9 Solution 2010 | Example of a real assembly language program]]
+
** [[CSC231 Homework 9 Solution 2010 | Example of a real assembly language program]][[CSC103 Assembly Language Exercises and Solutions|.]]
** [[CSC103 Assembly Language Exercises and Solutions|.]]
+
 
----
 
* [[CSC103 Homework 3 2012 | Homework #3]]
 
||
 
Reading:
 
* [http://math.hws.edu/TMCM/java/labs/xComputerLab1.html A good description of the Computer simulator]
 
* You will find Wikipedia's [http://en.wikipedia.org/wiki/Central_processing_unit description of the processor] interesting.  Concentrate mostly on the sections labeled '''Microprocessor''', '''Operation''', and '''Clock Rate'''.
 
<!-- ================================================================== -->
 
|- style="background:#eeeeff" valign="top"
 
| Week 4 <br /> 2/20<br />
 
||
 
* '''Monday'''
 
 
* '''Wednesday'''  
 
* '''Wednesday'''  
 
----
 
----

Revision as of 15:23, 16 February 2012

Wikis | Weekly Schedule | Main Page


Office Hours: M 1:10-3:00 p.m., W 4:00-6:00 p.m.

Weekly Schedule

Week Topics Reading
Week 1
1/30
  • Monday
    • Introduction to the class and the 1/2 semester
    • Organization of the class
    • a short movie to get the discussion started...
    • some examples of computers:


AbacusWolfram.png


DifferenceEngine.jpg


DifferenceEngineDetail.jpg


DNAComputer.png


(start at 1min 47sec)

    • Keywords:
      • code: Translating from one system of values to another system.
    • Electricity
    • The Binary System: a system where the only two numbers available are 0 and 1. Every operation that we can do in decimal, with 10 digits, we can also do in binary.
    • The Transistor: A switch controlled by electricity.
    • Two giants for computer science:
      • George Boole (1779-1848): logic expression = boolean expression. Logic: creating formulas where variables are combined by operators. The variables are boolean variables, the operators are logic operators. Any formula can be represented with a combination of just three operators: AND, OR, and NOT.
      • Claude Shannon (1916-2001): writes a Master's thesis at MIT in 1948, which states that any binary numerical computation can be performed using logic expressions and logic operators.


  • Wednesday
    • Review of the binary system
    • Exercises on binary (and other) systems and Logic
    • George Boole (1779-1848): logic expression = boolean expression. Logic: creating formulas where variables are combined by operators. The variables are boolean variables, the operators are logic operators. Any formula can be represented with a combination of just three operators: AND, OR, and NOT.
    • Claude Shannon (1916-2001): writes a Master's thesis at MIT in 1948, which states that any binary numerical computation can be performed using logic expressions and logic operators.

Week 2
2/6
  • Monday
    • we stopped last week at Shannon's Master's Thesis (MIT).
    • building a 2-bit adder with logic gates.
    • Two-bit adder (verify the equations with this exercise
    • Logic Gates
    • Data sheet for the AND gate.
    • Data sheet for the NOT gate.
    • Data sheet for the OR gate.
    • Logic Design
    • Simulator
    • Lab #1



  • Wednesday

    • Schematics from NASA
    • Exercise on Logic Design: a review of the process of going from a description of the function to a circuit.
    • Identifying various parts inside a computer. We want to be able to recognize:
      • The processor
      • The Crystal
      • The Random Access Memory (RAM)
      • The power supply
      • The mother board
      • The hard disk
      • The optical disk (DVD/CD player/burner)
      • The Wiring
      • Various Ports
    • Creating a wiki page on the ClassWiki system (owned by the Smith CS Department)
      • headers
      • paragraphs
      • boxes
      • lists (numbered or not)
      • images
      • links to other wiki pages in classwiki
      • links to Web pages
    • Warning: Two wikis!

DFTwiki.png

ClassWiki.png


Reading:

Week 3
2/13
    • Disassembling a PC:

Reading:

Week 4
2/20
  • Monday
    • Execution of selected instructions (pdf)
    • Exercises
      • 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/STO-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
      • JMZ
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
  • Wednesday

Week 5
2/27
  • Monday
  • Wednesday

Week 6
3/5
  • Monday
  • Wednesday

Week 7
3/12


Take Home Exam Week


Week 7
3/19


Spring Break