Difference between revisions of "CSC103 Schedule 2011"

From dftwiki3
Jump to: navigation, search
(→‎Weekly Schedule)
(→‎Weekly Schedule)
Line 49: Line 49:
 
** <font color="magenta">Logic Gates</font>: NOT, AND, OR
 
** <font color="magenta">Logic Gates</font>: NOT, AND, OR
 
** Truth tables and verification of rules of addition
 
** Truth tables and verification of rules of addition
 +
----
 
----
 
----
 
* [[CSC103 2011 Homework 1 | Homework #1 ]]
 
* [[CSC103 2011 Homework 1 | Homework #1 ]]
Line 69: Line 70:
 
[[Image:Calvin snow.jpg|right]]
 
[[Image:Calvin snow.jpg|right]]
 
** Snow Day!
 
** Snow Day!
 +
----
 
----
 
----
 
* [[CSC103_Lab_1_2011        | Lab #1]]
 
* [[CSC103_Lab_1_2011        | Lab #1]]
Line 105: Line 107:
 
<br />
 
<br />
  
 +
----
 
----
 
----
 
* [[CSC103 2011 Homework 2 | Homework #2 ]]
 
* [[CSC103 2011 Homework 2 | Homework #2 ]]
Line 188: Line 191:
  
 
<br />
 
<br />
 +
----
 
----
 
----
 
* [[CSC103 Lab 4 2011 | Lab #4]] (first part)
 
* [[CSC103 Lab 4 2011 | Lab #4]] (first part)
Line 207: Line 211:
 
** Exercises
 
** Exercises
  
−
*  
+
----
 +
----
 +
* [[CSC103 2011 Homework 4 | Homework #4 ]] <font color="magenta">&lt;=== will due Monday March 7</font>
 
||  
 
||  
−
* [[CSC103 2011 Take-Home Final Exam| Take-Home Final Exam]]
+
* [[CSC103 2011 Take-Home Final Exam| Take-Home Final Exam]] <font color="magenta">&lt;=== will due Friday March 11</font>
 
<!-- ================================================================== -->
 
<!-- ================================================================== -->
 
|- style="background:#ffffff" valign="top"
 
|- style="background:#ffffff" valign="top"

Revision as of 08:40, 28 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
CSC103PCDemolitionMovie.png
CSC103ExecutionOfAnInstruction.png
    • 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/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
Week 5
2/21
  • Monday
    • Our JavaScript editor: http://htmledit.squarefree.com/
    • Elements of a Web page: the <html>, <body>, and <h1> tags
    • Creating a Web page and loading it up in a browser
    • HTML links: <a href="http://www.smith.edu">Smith College</a>
    • javascript
      • printing strings
      • comments
      • variables
      • displaying the contents of variables
      • concatenating strings and variables
      • computing with variables
      • loops
    • First part of Lab #4 on Javascript: creating a javascript program, and running it.
  • Wednesday: Rally Day


RallyDay2011.png


  • Lab #4 (first part)
  • NO HOMEWORK this week
  • Read Chapters 6 and 7
Week 6
2/28
  • Monday
    • Javascript
    • Lab #4: Do Sections 1.3, and 2. Do all the subsections of Section 2.
  • Wednesday
    • Exercises
Week 7
3/7
  • Monday
    • Limits of what computers can and cannot do
  • Wednesday
    • Class discussion: 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=10633"