Syllabus

C251
Foundations of Digital Computing

I201 Mathematical Foundations of Informatics

Date

Notes & Readings

Aug
24

Preface
1.1-1.3

26

1.4-1.7

28

Sep
2

2.1-2.2

4

11

14

18

21

3.1-3.2

30

Chapter 1-3, 4.1

Test 1
Solutions

9

14

19

26

28

Review

Nov
2

Chapters 5-8

Test 2
Solutions

30

Discrete Mathematics and its Applications 6e by Kenneth H. Rosen, The McGraw-Hill Companies. ISBN 0072880082

Boolean algebra and propositional logic. Set algebra, including mappings and relations. Elements of graph theory and statistical analysis. Application of all topics to computer programming.

1. Submit homework via the Oncourse Drop Box tool on or before the due date and time.
2. Your submission must be a Word document, unless otherwise stated in the assignment. When graded, comments will be inserted and the updated document returned back to you via the Drop Box tool on Oncourse.
3. Intricate diagrams can be drawn by hand, and then scanned in; or you can use a electronic drawing package.
4. Your submission must be your own work.  It is o.k. to work with others in the class to figure out how to solve the problems encountered while doing the homework. However, the homework problems must be done by you, not someone else.
5. Solutions will be posted after the due date, obviously, there is no credit for late homework.
6. The text has answers to the odd numbered questions that are often very similar to the homework question assigned.

1. Generally available through Oncourse over the Internet from Friday 17:00 to Friday 17:00.
2. Starting date is listed in syllabus.
3. Open book/notes, but work on your own.

Learning requires a partnership between the instructor, authors, researchers and students; therefore students are encouraged to use any and all resources available to solve homework problems and complete programming assignments. However, students must:

1. clearly cite any contributing source; a text, another student, the Internet, etc.
2. create their own solutions

For example, students may work in groups to solve homework problems provided each student creates their own (not copies) solutions  and clearly lists all group members or other sources such as authors of texts or on the Internet. Likewise, software that performs assigned functionality may not be directly used but the source code may be consulted provided it is subsequently cited. Changing the spelling of algorithm identifiers does not constitute creating an original solution. It is absolutely essential to note that failure to cite any contributing source will be considered cheating regardless of the reason for the omission. Likewise, verbatim duplication of any source, whether from another student, a text, etc. will always be considered plagiarism.

Violation of any aspect of this policy will result in a failing grade for the course.

Disclaimer: