Syllabus

C251
Foundations of Digital Computing

I201 Mathematical Foundations of Informatics

Modified

 

Date

Notes & Readings

Homework
Due
Quiz Start
Use Windows
Internet Explorer
Test Date

Jan
11

Preface
1.1-1.3
Activity

     

13

1.4-1.7
Activity

  1 (1.1 - 1.3)
Use Internet Explorer
 
20 Finish Chapter 1 1
Solutions
   

25

2.1-2.2
Activity

Text copy on
Library Reserve
Quiz 1 due 12:00
2 (1.5 - 1.7)
 
27 2.3-2.4
Activity
2
Solutions
   
Feb
1
4.1
Activity
Best career choice
  3 (2.1 - 2.4, 4.1)
Quiz 2 due 12:00
 

3

3.1
Activity

3
Solutions
   
8 3.2, 3.3,3.4
Activity
  4 (3.1 - 3.4)
Quiz 3 due 12:00
 
10 Review 4
Solutions
   
15 Snow - Campus closed      

17

Chapter 1-3, 4.1

   

Test 1
Solutions

22 5.1-5.2, 5.3, 5.4
Activity
  Start 5 (5.1 - 5.4)   
24 6.1-6.2
Activity
  Quiz 4 due 12:00   
27   5
Solutions
Due 24:00
   

Mar
1

6.3-6.4
Activity
  Start 6 (6.1 - 6.4)  

3

Poker
7.1-7.2
Activity
  Quiz 5 due 12:00
 
 
6   6
Solutions
Due 24:00
   
8 8.1-8.2
Activity
  Quiz 6 due 12:00
Start 7 (7.1, 7.2, 8.1) 
 

10

3.8
8.3-8.4
Activity
7
Solutions
Start 8 (8.2 - 8.4)  
11 Li Liu
INFO Candidate
LF-111 11-12A
     
12 Kimmer
INFO Candidate
LF-111 10-11A
     

15

Finish Chapter 8
 

8
Solutions
Due 24:00
Quiz 7 due 12:00
 
 

17

Chapters 5-8

  Quiz 8 due 12:00
 

Test 2
Solutions

29 9.1-9.3
Activity
     
31 9.4-9.6
Activity
  Start 9 (9.1 - 9.6)  
Apr
5
10.1-10.2
Activity
9
Solutions
   
7 10.3-10.4
Activity
  Quiz 9 due 12:00
10 (10.1 - 10.4)
 
12 11.1-11.2
Activity
10
Solutions
   
14 11.3
Activity
  Quiz 10 due 12:00
11 (11.1 - 11.3)
 

19

12.1-12.2
Activity
11
Solutions
   
21 12.3-12.4
Activity
  Quiz 11 due 12:00 
12 (12.1 - 12.4)
 
26 Review 12
Solutions

 

 
28
1:15P
Chapters 9-12   Quiz 12 due 12:00 Test 3
 

 

Instructor: Raymond F. Wisman
Office: LF122
MW 3:00-5:00P and by appointment
Lab: LF105 or LF111
See: www.ius.edu/rwisman/lab for current schedule.
Class:           PS014, MW 1-2:50P
Phone: 941-2465
Email:
Text:

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

Course: C251 Foundations of Digital Computing (4 cr.) P: C201/I210 or 200-level mathematics course. Recommended M119 or M215.
I201 Mathematical Foundations of Informatics  (4 cr.) P: C201/I210

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.

Goals: See C251 Course Goals
Grade Scale:
A+ 97% - 100%    A  93% - 96%        A-  90% - 92%                        
B+ 87% -  89%     B  83% - 86%        B-  80% - 82%
C+ 77% -  79%     C  73% - 76%        C-  70% - 72%
D+ 67% -  69%     D  63% - 66%        D-  60% - 62%
F      0% -  59%
Note that C is the minimum grade
accepted for Natural Science degrees
Course          
Evaluation:   
Class 10%
Homework 10%  (drop lowest)                   Homework due on assigned date.
Quiz 20%            (drop lowest)
Test 60%
Class:
  1. Each class meeting will normally include problem solving activities over the topic just covered in lecture.
  2. Activities are completed by groups of two students (or three when odd number of students) and receive a common score.
Homework:
  1. The homework assignments cover those areas that you need to know and practice.
  2. The instructor will select representative questions from each assignment to grade, not all questions will be graded.
  3. Submit homework on paper at the beginning of class or via the Oncourse Drop Box tool on or before the due date and time.
  4. An Oncourse 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.
    • Intricate diagrams can be drawn by hand, and then scanned in; or you can use a electronic drawing package.
  5. Your submission must be your own work.  It is OK 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.
  6. Solutions will be posted after the due date, obviously, there is no credit for late homework.
  7. The text has answers to the odd numbered questions that are often very similar to the homework question assigned.
Quizzes:
  1. Available through Oncourse over the Internet.
  2. Starting date is listed in syllabus.
  3. Open book/notes, but work on your own.
Ethics: All work is subject to the Indiana University Code of Student Ethics.

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:

Although every effort has been made to make the above listing complete and accurate, the instructor reserves the right to make changes on assignment due dates, test & quiz dates; the quantity of assignments, quizzes and tests; and the point totals.  The grading scale will remain the same.