Difference between revisions of "CSC103 Weekly Schedule Fall 2012"
(→Weekly Schedule) |
(→Weekly Schedule) |
||
Line 48: | Line 48: | ||
** Two giants for computer science: | ** Two giants for computer science: | ||
*** <font color="magenta">George Boole</font> (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'''. | *** <font color="magenta">George Boole</font> (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'''. | ||
− | + | ||
<br /> | <br /> | ||
---- | ---- | ||
Line 69: | Line 69: | ||
::{|style="border-collapse: separate; border-spacing: 0; border-width: 1px; border-style: solid; border-color: #000; padding: 0" | ::{|style="border-collapse: separate; border-spacing: 0; border-width: 1px; border-style: solid; border-color: #000; padding: 0" | ||
|- | |- | ||
− | !style="border-style: solid; border-width: 0 1px 1px 0"| World 1 (Logic) | + | !style="border-style: solid; border-width: 0 1px 1px 0"| World 1<br /> (Logic) |
− | !style="border-style: solid; border-width: 0 1px 1px 0"| World 2 (Technology) | + | !style="border-style: solid; border-width: 0 1px 1px 0"| World 2 <br />(Technology) |
− | !style="border-style: solid; border-width: 0 1px 1px 0"| World 3 (Math) | + | !style="border-style: solid; border-width: 0 1px 1px 0"| World 3 <br /> (Math) |
|- | |- | ||
− | | style="border-style: solid; border-width: 0 1px 0 0"| George Boole<br/> | + | | style="border-style: solid; border-width: 0 1px 0 0"| '''George Boole''' (1779-1848)<br/> |
Expressions that can be '''True''' or '''False'''<br /> | Expressions that can be '''True''' or '''False'''<br /> | ||
Operators to combine expressions<br /> | Operators to combine expressions<br /> | ||
Line 92: | Line 92: | ||
** Adding in base 2 | ** Adding in base 2 | ||
** [[CSC103 Exercises on Binary System and Boolean Logic | Exercises]] | ** [[CSC103 Exercises on Binary System and Boolean Logic | Exercises]] | ||
− | + | ** <font color="magenta">Claude Shannon</font> (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. | |
* '''Thursday''' | * '''Thursday''' | ||
---- | ---- |
Revision as of 07:55, 11 September 2012
--D. Thiebaut 12:05, 21 August 2012 (EDT)
Office Hours: Tu-Th: 2:00-4:00 p.m. and by appointment.
Weekly Schedule
Week | Topics | Reading | ||||||
Week 1 9/6 |
Antikythera mechanism, oldest computer
(start at 1min 47sec)
Harvard research: 1.8 zettabytes in 4 grams of DNA
|
| ||||||
Week 2 9/11 |
|
| ||||||
Week 3 9/18 |
|
| ||||||
Week 4 9/25 |
|
| ||||||
Week 5 10/2 |
|
| ||||||
Week 6 10/9 |
|
| ||||||
Week 7 10/16 |
|
| ||||||
Week 8 10/23 |
|
|