CS 10051 Introduction to Computer Science
Fall 2008
Room MSB 121
Mondays and Wednesdays 5:30 PM - 6:45 PM
Room MSB 121
Mondays and Wednesdays 5:30 PM - 6:45 PM
|
| Week | Class | Date | Topic(s) | Readings/Problems |
| 1 | 1 | Aug. 25 | Overview and Syllabus. | Chapter 1 Lecture Notes |
| 1 | 2 | Aug. 27 | Informal, formal definitions of Algorithms, Addition Alg. and Questions regarding Syllabus. | Chapter 1: Problems 3 and 7 |
| 2 | 3 | Sept. 01 | Labor Day - No Class. | |
| 2 | 4 | Sept. 03 | Start Chapter 2: Pseudocode; Sequential, Conditional and Iterative Operations. | Chapter 2 Lecture Notes |
| 3 | 5 | Sept. 08 | Repeat loop and Multiplication Algorithm. | |
| 3 | 6 | Sept. 10 | Sequential Search Algorithm. | |
| 4 | 7 | Sept. 15 | Search the Largest/Smallest Integer (Algorithm). | Chapter 2: Problems 16 & 17 |
| 4 | 8 | Sept. 17 | Application of FindLargest Algorithm: Find the Median by removing largest values. | Chapter 2: Problem 14 |
| 5 | 9 | Sept. 22 | Pattern Matching Algorithm. | |
| 5 | 10 | Sept. 24 | Attributes of Algorithms, Analysis of Searching Algorithm; and Selection Sort and its analysis. | Chapter 3 Lecture Notes |
| 6 | 11 | Sept. 29 | Bubble sort and its analysis, Shuffle left algorithm, and Copy over algorithm | Problems 8, 9, 10 |
| 6 | 12 | Oct. 01 | Converging Pointers and Binary Search. | |
| 7 | 13 | Oct. 06 | Pattern Matching Analysis, Some special problems and Conclusion of "Level 1." | |
| 7 | 14 | Oct. 08 | Midterm I | |
| 8 | 15 | Oct. 13 | Binary Representation of Text and unsigned number, Binary-Decimal Conversion and binary addition. | Chapter 4 Lecture Notes; Chapter 4: Problems 1 and 7 |
| 8 | 16 | Oct. 15 | Representation of signed number, radix and binary complements | Chapter 4: Challenge Work- Prob 2 |
| 9 | 17 | Oct. 20 | Fractional Numbers, Binary representation of sound and (images ?) | Chapter 4: Problems 3, 4, 5, 8 |
| 9 | 18 | Oct. 22 | logical Connectives, Circuits, Gates, Sum-of-Product Algorithm | Chapter 4: Problems 17 and 18 |
| 10 | 19 | Oct. 27 | 1-bit Compare-for-equality circuit, N-bit CE (using AND gates and XNOR gates) | |
| 10 | 20 | Oct. 29 | Addition Circuit: 1-ADD and Complete n-bit Full Adder. | Chapter 4: Challenge Work- Prob 1. (Optional) |
| 11 | 21 | Nov. 03 | Multiplexor Circuit. | |
| 11 | 22 | Nov. 05 | Decoder Circuit and 2-Dimensional Organization of Decoder Circuits. | |
| 12 | 23 | Nov. 10 | Construction of Flip-flop (Optional), RAM and Computer Metrics. | |
| 12 | 24 | Nov. 12 | Memory hardware constructions, Memory registers: MAR, MDR | |
| 13 | 25 | Nov. 17 | Note on 2-dimensional memory. ALU hardware and introduction to Control Unit. | |
| 13 | 26 | Nov. 19 | Control Unit, 4 basic classes of Instrs., Machine Lang., Assembly language Structure. | Chapters 5 and 6: Lecture Notes |
| 14 | 27 | Nov. 24 | Assembly language examples and Translation to Machine Language. | |
| 14 | 28 | Nov. 26 | No Class | |
| 15 | 29 | Dec. 01 | Midterm II | |
| 15 | 30 | Dec. 03 | Returned Midterms. Lets learn from our mistakes: Last look at the course by reviewing Midterm I and II for Final Exam. | |
| 16 | 31 | Dec. 08 | Final |
Lecture Notes
Exams| Midterm I | Chapters 1, 2, and 3 | Wednesday, Oct. 8 |
| Midterm II | Chapter 4, 5, and 6 | Monday, Dec. 1 |
| Final | Chapters: 1, 2, 3, 4, 5, 6 | Monday, Dec. 8 5:45 PM - 8:00 PM |
Quizzes| Quiz 1 | Sept. 03 |
| Quiz 2 | Sept. 08 |
| Quiz 3 | Sept. 10 |
| Quiz 4 | Sept. 15 |
| Quiz 5 | Sept. 22 |
| Quiz 6 | Sept. 29 |
| Quiz 7 | Oct. 06 |
| Quiz 8 | Oct. 20 |
| Quiz 9 | Oct. 27 |
| Quiz 10 | Oct. 29 |
| Quiz 11 | Nov. 03 |
| Quiz 12 | Nov. 10 |
| Quiz 13 | Nov. 19 |
Grades
|
Lab |
Quiz |
Exams |
FINAL |
|||||||
|
I |
II |
Final |
||||||||
|
0123 |
29.91 |
41 |
110 |
115 |
108 |
A- |
||||
|
0789 |
29.38 |
40 |
71 |
69 |
55 |
C |
||||
|
1022 |
29.68 |
37 |
83 |
67 |
107 |
B- |
||||
|
1507 |
29.68 |
39 |
55 |
58 |
68 |
C- |
||||
|
2844 |
28.98 |
35 |
84 |
67 |
89 |
C+ |
||||
|
4218 |
30.00 |
57 |
110 |
125 |
117 |
A |
||||
|
4406 |
30.00 |
55 |
107 |
127 |
117 |
A |
||||
|
4444 |
27.16 |
28 |
79 |
60 |
65 |
C- |
||||
|
6970 |
29.82 |
43 |
74 |
85 |
101 |
B |
||||
|
6977 |
13.80 |
26 |
45 |
* |
* |
W |
||||
|
9206 |
28.73 |
22 |
52 |
48 |
51 |
D |
||||
|
9406 |
22.50 |
19 |
77 |
53 |
74 |
D |
||||
|
9778 |
25.94 |
10 |
44 |
41 |
46 |
F |
||||
|
9852 |
24.95 |
28 |
70 |
47 |
53 |
D |
||||
That's How I Curved your Grades
Your Rank in the Class
Quizzes
| Q1 | Q2 | Q3 | Q4 | Q5 | Q6 | Q7 | Q8 | Q9 | Q10 | Q11 | Q12 | Q13 | |
| 0123 | 1 | 2 | 3 | 2 | 10 | 3 | 8 | 3 | 2 | 0 | 0 | 2 | 5 |
| 0789 | 2 | 1 | 5 | 1 | 10 | 5 | 7 | 3 | 0 | 1 | 1 | 1 | 3 |
| 1022 | 3 | 2 | 3 | 3 | 5 | 5 | 7 | 4 | 0 | 2 | 1 | 0 | 2 |
| 1507 | 1 | 1 | 3 | 3 | 5 | 3 | 2 | 4 | 1 | 3 | 4 | 4 | 5 |
| 2844 | 4 | 1 | 4 | 4 | 0 | 3 | 3 | 3 | 2 | 0 | 3 | 3 | 5 |
| 4218 | 5 | 3 | 3 | 5 | 8 | 5 | 8 | 4 | 3 | 1 | 4 | 3 | 5 |
| 4406 | 5 | 0 | 6 | 4 | 10 | 5 | 7 | 4 | 1 | 2 | 3 | 3 | 5 |
| 4444 | 3 | 3 | 4 | 4 | 0 | 4 | 1 | 3 | 2 | 1 | 3 | 0 | 0 |
| 6970 | 2 | 1 | 4 | 4 | 10 | 5 | 2 | 2 | 2 | 1 | 3 | 3 | 4 |
| 6977 | 1 | 0 | 5 | 2 | 10 | 5 | 0 | 2 | 0 | 1 | 0 | 0 | 0 |
| 9206 | 1 | 2 | 1 | 4 | 0 | 5 | 1 | 3 | 0 | 1 | 0 | 0 | 4 |
| 9406 | 0 | 0 | 0 | 0 | 5 | 5 | 4 | 0 | 0 | 0 | 0 | 2 | 1 |
| 9778 | 0 | 1 | 1 | 1 | 0 | 0 | 3 | 3 | 0 | 1 | 0 | 0 | 0 |
| 9852 | 0 | 1 | 1 | 1 | 8 | 4 | 8 | 4 | 1 | 0 | 0 | 0 | 0 |
Attendance
|
Late Arrivals + Early Departures + ONTIME = PRESENTS % |
ABSENTS % | |
| 0123 | 0.00 + 0.00 + 93.10 = 93.10 | 06.90 |
| 0789 | 0.00 + 0.00 + 96.55 = 96.55 | 03.45 |
| 1022 | 0.00 + 3.45 + 86.21 = 89.66 | 10.34 |
| 1507 | 0.00 + 0.00 + 96.55 = 96.55 | 03.45 |
| 2844 | 3.45 + 0.00 + 79.31 = 82.76 | 17.24 |
| 4218 | 0.00 + 0.00 + 100.00 = 100.00 | 00.00 |
| 4406 | 0.00 + 0.00 + 96.55 = 96.55 | 03.45 |
| 4444 | 3.45 + 0.00 + 79.31 = 82.76 | 17.24 |
| 6970 | 0.00 + 0.00 + 93.10 = 93.10 | 06.90 |
| 6977 | 0.00 + 0.00 + 48.28 = 48.28 | 51.72 |
| 9206 | 3.45 + 6.90 + 68.97 = 79.31 | 20.69 |
| 9406 | 0.00 + 0.00 + 62.07 = 62.07 | 37.93 |
| 9778 | 3.45 + 0.00 + 82.76 = 86.21 | 13.79 |
| 9852 | 0.00 + 3.45 + 68.97 = 72.41 | 27.59 |
You can do it if you try!
If you wish to succeed in this course
Resources
