| CSC 215 | Syllabus | Course Description | Grades |
|
Schedule of Events - assignment test |
||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|
| Jan 11 | 12 | 13 | 14 | 15![]() |
||
| binaryoptional more info on binary | 18![]() |
19![]() |
20 | 21![]() |
22 | |
| 25 | 26![]() |
27 | 28 | 29 | ||
| characters | Feb 1![]() |
2 | 3 | 4 | 5 | |
| boolean expressions and propositions | 8 | 9 | 10 | 11![]() |
12 | |
| 15 | 16![]() |
17 | 18 | 19 | ||
| 22 | 23![]() |
24 | 25 | 26 | ||
| a little tiny computer | Mar 1 | 2 | 3 | 4 | 5 | |
8![]() |
9![]() |
10![]() |
11![]() |
12![]() |
||
| 15 | 16
![]() |
17 | 18
![]() |
19 | ||
22![]() |
23 | 24 | 25 | 26 | ||
| Turing machines | 29 | 30 | 31 | Apr 1 | 2![]() |
|
5![]() |
6 | 7 | 8 | 9 | ||
| 12 | 13 | 14 | 15 | 16 | ||
| 19 | 20 | 12 | 22 | 23 | ||
| uncomputablility proof von Neumannn computer architecture |
26 | 27 | 28 | 29![]() |
30 | |
| May 3 | 4![]() |
5 | 6 | 7 | ||
| Schedule of Topics | ||
![]() |
![]() |
![]() |
| Jan 11 | dital vs. analog, number bases | class communications, base conversion |
| Jan 18 | internal representation of data | base 2 computations |
| Jan 25 | internal representation of data, boolean | characters sets |
| Feb 1 | truth tables and expressions | evaluation and simplification of expressions |
| Feb 8 | digital circuits | evaluating circuit results |
| Feb 15 | circuit design | converting between circuits, truth tables, and expressions |
| Feb 22 | machine language and computer architecture | evaluating machine language programs |
| Mar 1 | ||
| Mar 15 | ||
| Mar 22 | ||
| Mar 30 | ||
| Apr 5 | ||
| Apr 12 | ||
| Apr 19 | ||
| Apr 26 | ||
| May 3 | Final | Final |