Difference between revisions of "CSC103 Weekly Schedule 2013"
Line 164: | Line 164: | ||
** [[CSC103 Assembly Language Exercises| Exercises]] | ** [[CSC103 Assembly Language Exercises| Exercises]] | ||
** Solution to first problems from Lab 2 | ** Solution to first problems from Lab 2 | ||
− | ** | + | ---- |
+ | ---- | ||
+ | ---- | ||
+ | ---- | ||
+ | * '''Thursday''' | ||
+ | <br /><center>[[File:MountainDay.png|450px]]</center><br /> | ||
+ | ---- | ||
+ | * [[CSC103 Homework 3 2013 | Homework 3]] is available. Due <strike>10/3/13</strike> 10/8/13 @ 9:00 a.m. | ||
+ | |||
+ | || | ||
+ | | ||
+ | |||
+ | <!-- ================================================================== --> | ||
+ | |-valign="top" | ||
+ | |width="15%"| Week 5 <br /> 10/1 | ||
+ | |width="60%"| | ||
+ | * '''Tuesday''' | ||
** Going over the last problem of Lab 2 | ** Going over the last problem of Lab 2 | ||
+ | ** The Von Neumann bottleneck. | ||
+ | <center>[[File:MooresLawProcessorMemoryGap.png|450px]]</center> | ||
+ | <br /> | ||
+ | <center>[[File:FootballField.jpg|400px]]</center> | ||
+ | <br /> | ||
** Moore's Law, first introduced in 1965. The number of transistors in circuits doubles every 18 months. What it is, what it means, how it has been extended. | ** Moore's Law, first introduced in 1965. The number of transistors in circuits doubles every 18 months. What it is, what it means, how it has been extended. | ||
+ | ** Understanding Exponential Growth | ||
+ | <center>[[Image:riceOnChessboard.jpg|400px]]</center> | ||
+ | <br /> | ||
<center>[[Image:ExponentialGrowth.png|400px]]</center> | <center>[[Image:ExponentialGrowth.png|400px]]</center> | ||
<br /> | <br /> | ||
Line 178: | Line 202: | ||
** [http://www.forbes.com/sites/timworstall/2013/08/29/darpa-chief-and-intel-fellow-moores-law-is-ending-soon/ The end of Moore's Law] | ** [http://www.forbes.com/sites/timworstall/2013/08/29/darpa-chief-and-intel-fellow-moores-law-is-ending-soon/ The end of Moore's Law] | ||
** [http://www.theregister.co.uk/2013/09/26/stanford_boffins_build_carbon_nanotune_computer/ New processor made of Nanotubes], published 26 Sept. 2013 | ** [http://www.theregister.co.uk/2013/09/26/stanford_boffins_build_carbon_nanotune_computer/ New processor made of Nanotubes], published 26 Sept. 2013 | ||
− | |||
− | |||
<br /> | <br /> | ||
<center>[[File:MooresLawProcessorMemoryGap.gif]]</center> | <center>[[File:MooresLawProcessorMemoryGap.gif]]</center> | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
* '''Thursday''' | * '''Thursday''' | ||
Revision as of 17:59, 30 September 2013
--D. Thiebaut 10:23, 1 April 2013 (EDT)
Week | Topics | Reading |
Week 1 9/3 |
Antikythera mechanism, oldest computer
(start at 1min 47sec)
Harvard research: 1.8 zettabytes in 4 grams of DNA
|
|
Week 2 9/10 |
|
|
Week 3 9/17 |
|
Reading:
|
Week 4 9/24 |
|
|
Week 5 10/1 |
|
|
Week 6 10/8 |
|
|
Week 7 10/15 |
|
|