| Month/Day | Weekday | Topic | Reading, Assignments and Deadlines | Class Slides | |
| 1 |
Sept 1 | T |
Introduction to Computer Science: Definition of Algorithm |
Read Chapter 1 and 2. First Assignment Deadline: e-mail your assignment by 10:59 a.m. by Sept 3. |
Ch 1 |
| 2 | Sept 3 | R | Introduction to Computer
Science: Definition of Computer Science.
Introduction to Algorithm Design: Pseudocode |
There are a few symbols missing in Ch.2 of the new edition. Here is an Errata Corrige (latin for "correct the errors") for you. Please add the missing symbols in your Chapter. | Ch 2 |
|
1L |
Sept 4 |
F |
Lab 1 |
Deadline for all the Labs: Each Lab Worksheet must be returned in class by the end of the lab session. |
|
| 3 |
Sept 8 | T |
Algorithm Design: More algorithms in Pseudocode with Sequential Operations, Conditional and Iterative Operations, Sequential Search |
Read ahead Chapter 3. For R Sept 10 Read on your own the algorithm "Find the Maximum" and "Pattern Matching". Use the notes online. We discuss the algorithms on T Sept 15 |
|
| 4 |
Sept 10 | R |
NO CLASS - Professor at a CONFERENCE Study on your own the Algorithm Design: Find the maximum, Pattern
Matching Algorithm. We will review them in next class. |
|
|
| 2L | Sept 11 | F |
Lab 2 |
||
| 5 |
Sept 15 | T |
Review Find the maximum, Pattern Matching Algorithm. The efficiency of the algorithms: Sorting |
Ch 3 |
|
| 6 |
Sept 17 | R |
Professor Sick - No class | ||
|
3L |
Sept 18 |
F |
Lab 3 |
||
| 7 |
Sept 22 | T |
Data Cleanup Algorithm and Complexity |
Read ahead Chapter 4. |
|
| 8 |
Sept 24 | R |
Review and Practice - Algorithm Design | ||
|
4L |
Sept 25 |
F |
Lab 4 |
||
| 9 |
Sept 29 | T |
Exam 1 (Ch 1-3) | ||
|
10 |
Oct 1 |
R |
Binary Numbers, Algorithms for Base Conversion |
Assignment 2.docx |
Ch 4 |
|
5L |
Oct 2 |
F |
Lab 5 |
||
| 11 |
Oct 6 | T |
Signed Magnitude, Two's complement, Text and Image representation | ||
| 12 |
Oct 8 | R |
Review and Practice: Base Conversion and Data Representation |
||
|
6L |
Oct 9 |
F |
Lab 6 |
||
| 13 |
Oct 13 | T |
Boolean Logic - Gates - Truth Tables | ||
| 14 |
Oct 15 | R |
CE, Adder, Control Circuits | ||
|
7L |
Oct 16 |
F |
Lab 7 |
||
| 15 |
Oct 20 | T |
Review and Practice – Base Conversion | ||
| 16 |
Oct 22 | R |
Review and Practice – Boolean Logic and Circuits |
Ch 5 |
|
|
8L |
Oct 23 |
F |
Lab 8 |
||
| 17 |
Oct 27 | T |
Exam 2 (Ch. 4) | ||
| 18 |
Oct 29 | R |
Computer Systems Organization: Memory |
Read ahead
Chapter 5 |
|
|
9L |
Oct 30 |
F |
Lab 9 |
||
| 19 |
Nov 3 | T |
Computer Systems Organization: Control Unit |
|
Ch 6 |
| 20 |
Nov 5 | R |
Computer Architecture |
Read ahead Chapter 6. |
|
|
10L |
Nov 6 |
F |
Lab 10 |
||
| 21 |
Nov 10 | T |
System Software and Virtual Machine: Machine Language | |
|
| 22 |
Nov 12 | R |
Assembly |
||
|
11L |
Nov 13 |
F |
Lab 11 |
||
| 23 |
Nov 17 |
T |
Review and Practice – Review and Practice – Memory, CU and Architecture | Assignment 3.doc due by Dec 1, before class. |
|
| 24 |
Nov 19 | R |
Review and Practice (cont.) ATTENTION: Exam 3 has been moved to Tuesday Nov 23 |
||
| 25 |
Nov 23 | T |
Exam 3 |
Read ahead
Chapter 8. |
|
|
12L |
Nov 20 |
F |
Lab 12 |
||
| Nov 25-29 | Thanksgiving Recess | ||||
| 26 |
Dec 1 | T |
High Level Language Programming | Ch 8 | |
| 27 |
Dec 3 | R |
High Level Language Programming | ||
|
13L |
Dec 4 |
F |
Lab 13 |
||
| 28 | Dec 8 | T | High Level Language Programming | ||
| 29 |
Dec 10 | R |
Review and Practice | ||
|
14L |
Dec 11 | F |
Lab 14 |
||
| 30 |
Dec 15 |
T |
10:30 am - 12:30pm - room MH 212 Final Exam (comprehensive) |
Remember.....this page is
constantly under construction....so check it often!!!
